1 Phase 1 Problems ● Small size – 20 to 150 methods – 10 to 20 agents ● Problem Classes – One static + one dynamically arriving problem – Uncertainty in.

Slides:



Advertisements
Similar presentations
Part IV: Memory Management
Advertisements

Dynamic Programming Rahul Mohare Faculty Datta Meghe Institute of Management Studies.
Phillip Dickens, Department of Computer Science, University of Maine. In collaboration with Jeremy Logan, Postdoctoral Research Associate, ORNL. Improving.
CPE555A: Real-Time Embedded Systems
The System and Software Development Process Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
Chapter 10 Implementing Subprograms. Copyright © 2012 Addison- Wesley. All rights reserved. 1-2 Chapter 10 Topics The General Semantics of Calls and Returns.
Hierarchical mission control of automata with human supervision Prof. David A. Castañon Boston University.
A Genetic Algorithm for Workload Scheduling In Cloud Based e-Learning Octavian Morariu Cristina Morariu Theodor Borangiu University Politehnica Bucharest.
Planning under Uncertainty
Analyzing the tradeoffs between breakup and cloning in the context of organizational self-design By Sachin Kamboj.
© 2008 Pearson Prentice Hall, Experiencing MIS, David Kroenke
1 Multi-Agent Planning. 2 Tasks as Agents negotiating for resources Self-interested Selfish Agents Complexity of Negotiation Tasks Abstraction & Analysis.
1 of 14 1 Fault-Tolerant Embedded Systems: Scheduling and Optimization Viacheslav Izosimov, Petru Eles, Zebo Peng Embedded Systems Lab (ESLAB) Linköping.
Chapter 9: Subprogram Control
Holistic Scheduling and Analysis of Mixed Time/Event-Triggered Distributed Embedded System Traian Pop, Petru Eles, Zebo Peng EE249 Discussion Paper Review.
Landscape of Solution Approaches high dynamics optimized team behavior coordinated action independent jobs/goals Coordinating Executing Plans Self- Scheduling.
By Group: Ghassan Abdo Rayyashi Anas to’meh Supervised by Dr. Lo’ai Tawalbeh.
Project Time Management
Distributed Scheduling. What is Distributed Scheduling? Scheduling: –A resource allocation problem –Often very complex set of constraints –Tied directly.
Advanced Project Management Project Plan Templates
Juan Mendivelso.  Serial Algorithms: Suitable for running on an uniprocessor computer in which only one instruction executes at a time.  Parallel Algorithms:
The Five Secrets of Project Scheduling
Object-Oriented Analysis and Design Iterative Development and the Unified Process.
4 th European Project Management Conference, London, 6-7 June 2001 Resource Critical Path Approach to Project Schedule Management Vladimir Liberzon, PMP.
系統晶片設計 - 論文報告 指導老師:陳朝烈老師 學生: 陳宗廷 向崇羽 Monot, A.; Navet, N.; Bavoux, B.; Simonot-Lion, F.,” Multisource Software on Multicore Automotive.
1 Chapter 24 Developing Efficient Algorithms. 2 Executing Time Suppose two algorithms perform the same task such as search (linear search vs. binary search)
Computer Science 340 Software Design & Testing UML Sequence Diagrams.
MURI: Integrated Fusion, Performance Prediction, and Sensor Management for Automatic Target Exploitation 1 Dynamic Sensor Resource Management for ATE MURI.
ICOM Noack Scheduling For Distributed Systems Classification – degree of coupling Classification – granularity Local vs centralized scheduling Methods.
Super computers Parallel Processing By Lecturer: Aisha Dawood.
10 th December, 2013 Lab Meeting Papers Reviewed:.
The System and Software Development Process Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
Hard Real-Time Scheduling for Low- Energy Using Stochastic Data and DVS Processors Flavius Gruian Department of Computer Science, Lund University Box 118.
5 May CmpE 516 Fault Tolerant Scheduling in Multiprocessor Systems Betül Demiröz.
Controlling the Behavior of Swarm Systems Zachary Kurtz CMSC 601, 5/4/
Copyright , Dennis J. Frailey CSE7315 – Software Project Management CSE7315 M16 - Version 8.01 SMU CSE 7315 Planning and Managing a Software Project.
End-To-End Scheduling Angelo Corsaro & Venkita Subramonian Department of Computer Science Washington University Distributed Systems Seminar, Spring 2003.
NP-Complete Problems Algorithm : Design & Analysis [23]
1 Cooperative multi-agent systems In cooperative MAS agents strive to reach a common goal and increase the combined utility of their actions Limitations.
CSCI1600: Embedded and Real Time Software Lecture 33: Worst Case Execution Time Steven Reiss, Fall 2015.
The System and Software Development Process Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
Introduction to Embedded Systems Rabie A. Ramadan 5.
R. Ty Jones Director of Institutional Research Columbia Basin College PNAIRP Annual Conference Portland, Oregon November 7, 2012 R. Ty Jones Director of.
CSCI1600: Embedded and Real Time Software Lecture 23: Real Time Scheduling I Steven Reiss, Fall 2015.
1 Chapter 17 2 nd Part Making Complex Decisions --- Decision-theoretic Agent Design Xin Lu 11/04/2002.
Parallon Business Solutions Microsoft Project Server 2010 Project Server 2010 Inter-Project Dependencies.
Studying and Implementing Multi-processor based Real-time Scheduling Algorithms in Linux Musfiq Niaz Rahman
Large-Scale Record Linkage Support for Cloud Computing Platforms Yuan Xue, Bradley Malin, Elizabeth Durham EECS Department, Biomedical Informatics Department,
Synthetic Approaches to Data Linkage Mark Elliot, University of Manchester Jerry Reiter Duke University Cathie Marsh Centre.
Develop Schedule is the Process of analyzing activity sequences, durations, resource requirements, and schedule constraints to create the project schedule.
Develop Schedule is the Process of analyzing activity sequences, durations, resource requirements, and schedule constraints to create the project schedule.
BSBPMG503A Manage Project Time Manage Project Time Project Time Processes Part 2 Diploma of Project Management Qualification Code BSB51507 Unit Code.
Does the brain compute confidence estimates about decisions?
Project Management Planning and Scheduling. “Failing to plan is planning to fail” by J. Hinze, Construction Planning and Scheduling Planning: “what” is.
Back to Basics with Project, Part 1 Carl Chatfield, PMP February, 2007 Puget Sound MPA.
Embedded System Scheduling
Complexity Analysis (Part I)
QIVA High Performance Global Supply Chains
Modeling Big Data Execution speed limited by: Model complexity
ECE 720T5 Fall 2012 Cyber-Physical Systems
TÆMS-based Execution Architectures
Dynamic Graph Partitioning Algorithm
On Multi-Arm Manipulation Planning
Lecture 24: Process Scheduling Examples and for Real-time Systems
2018, Spring Pusan National University Ki-Joune Li
Real-Time Process Scheduling Concepts, Design and Implementations
Real-Time Process Scheduling Concepts, Design and Implementations
Complexity Analysis (Part I)
Complexity Analysis (Part I)
Presentation transcript:

1 Phase 1 Problems ● Small size – 20 to 150 methods – 10 to 20 agents ● Problem Classes – One static + one dynamically arriving problem – Uncertainty in duration/quality – Too much work to do (only class with more than 70 methods) – Non Local Effects (hard enables + soft facilitates) – Syncronization 1

2 Phase 2 ● Much more complex scenario generator – mix and match various problem classes, now called templates – better control of the assignment of agents to methods ● within a template & between problems – More dynamics (both new tasks & changes to old) – New NLEs (hinder, disable) – New QAFs (Sum-And, Exactly-One) ● Much larger problems – 10–100 agents – 725–10,000 methods 2

Experimental Environment ● Scenario Generator generates random scenarios. ● Each scenario contains one or more problems. ● Problems are independent, except that they may overlap in time. Agents can only do one thing at a time. ● Problems consist of Template Instances. ● Templates comprise tasks and methods. ● Methods are individual executable actions.

Experimental Environment ● Each problem, and some complex templates, are broken into a sequential set of time windows. ● Each window has an earliest start time and a deadline. ● We can independently control how tight these start time and deadlines are relative to method execution time and how much windows overlap with one another. ● Non-local effects (NLEs) also are limited to be from earlier windows to later windows.

5 Templates ● Simple – Static single-window problems from Phase 1 ● Syncronization – Single sinch point from Phase 1 ● Dynamic Simple – Dynamically arriving simple single-window ● NLE Chain – Multiple windows chained together with enables or facilitates – Recursive template for each window 5

6 Templates ● Multi-Synch – Multiple sych points under a single window ● Enables Tracks – Multiple “tracking” tasks, each with a series of linearly enabled subtasks ● Contingency – multiple “preparation” methods enable multiple “completion” methods. – A crucial task with multiple outcomes determines what “completion” method is actually needed at runtime 6

7 Templates ● Second Chance Dynamic – “preparation” task almost impossible, enables “completion” task. – an “easier” preparation task arrives, allowing an easier second chance at completion ● Circular Soft NLE – Soft NLEs (facilitates, hinders) are set up in cycles, creating a hard optimization problem 7

8 Simple Templates

9 Syncronization Template

10 Dynamic Template

11 NLE Chain Template

12 Multi-Synch Template

13 Enables Tracks Template

14 Contingency Template

15 Second Chance Template

16 Circular Soft NLE Template

17 Experimental Classes [Phase 2] ● General Mix ● Negative Interdependence ● Very Dynamic ● Circular Soft Interdependencies ● Tight Deadlines ● Uncertainty ● Contingency ● Big Interdependence ● 100 Agent Mix 17

18 General Mix ● Basic template mix for most problems ● 10–70 Agents ● 400–3000 Methods ● 1 fast fallback methods ● 2 redundant methods ● Template Mix – Simple[Sum] – Simple[SumAnd] – Dynamic – NLEChain 18 - Multi Synch - Enables Tracks - Contingency - CircularSoftNLE[facilitates]

19 General Mix, 10 Agents, Actual

20 General Mix, 10 Agents, Detail Circular Soft NLE Template Enables Tracks Template NLE Chain (start)

21 Negative Interdependence ● Simple Template with lots of hinders and disables 21

22 Very Dynamic ● Dynamic Template with changes to deadlines, release times, and quality/duration distributions 22 Random changes to: Release Times Deadlines Quality Distributions Duration Distributions

23 Circular Soft Interdependencies ● Circular facilitation creates hard optimization problem 23

24 Tight Deadlines ● Simple Templates with Sum and tight deadlines (must use alternative fallback or redundant methods) 24

25 Uncertainty ● Simple and Dynamic Templates; high uncertainty in duration/quality; 20% method failure Uncertainty make scheduling difficult

26 Contingency

27 Big Interdependence ● NLE Template Mix: NLE Chains, Enables Tracks, Circular Soft NLEs plus random NLEs

Agent Mix (actual) ● Similar to General Mix without Dynamic changes 28