Validating Resources in Least Commitment Scheduling Nazma Ferdous & Mark Giuliano Space Telescope Science Institute October 24, 2006.

Slides:



Advertisements
Similar presentations
An Optimized Cost/Performance PDS Design Using OptimizePI
Advertisements

Planning and Scheduling for Operational Astronomical Missions Mark Giuliano Space Telescope Science Institute.
Big Ideas in Cmput366. Search Blind Search State space representation Iterative deepening Heuristic Search A*, f(n)=g(n)+h(n), admissible heuristics Local.
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
A Backtracking Correction Heuristic for Graph Coloring Algorithms Sanjukta Bhowmick and Paul Hovland Argonne National Laboratory Funded by DOE.
Chandra User’s Committee Meeting (4/15/08) P. Slane (Chandra Mission Planning) Constraint Classifications and the Chandra Long-Term Schedule.
Planning with Resources at Multiple Levels of Abstraction Brad Clement, Tony Barrett, Gregg Rabideau Artificial Intelligence Group Jet Propulsion Laboratory.
Alternate Software Development Methodologies
ERCOT Analysis of 2005 Residential Annual Validation Using the Customer Survey Results ERCOT Load Profiling Presented to PWG - October 26, 2005.
Using UML, Patterns, and Java Object-Oriented Software Engineering Royce’s Methodology Chapter 16, Royce’ Methodology.
Commentary on Validating Resource Usage in Least Commitment Planning Authors: Nazma Ferdous and Mark Giuliano Commentary by Rob Sherwood October 2006.
IBM Software Group ® Recommending Materialized Views and Indexes with the IBM DB2 Design Advisor (Automating Physical Database Design) Jarek Gryz.
Planning under Uncertainty
The Experience Factory May 2004 Leonardo Vaccaro.
CPSC 322, Lecture 15Slide 1 Stochastic Local Search Computer Science cpsc322, Lecture 15 (Textbook Chpt 4.8) February, 6, 2009.
4 Feb 2004CS Constraint Satisfaction1 Constraint Satisfaction Problems Chapter 5 Section 1 – 3.
Iterative improvement algorithms Prof. Tuomas Sandholm Carnegie Mellon University Computer Science Department.
1 Chapter 5 Advanced Search. 2 Chapter 5 Contents l Constraint satisfaction problems l Heuristic repair l The eight queens problem l Combinatorial optimization.
Designing Networks with Little or No Buffers or Can Gulliver Survive in Lilliput? Yashar Ganjali High Performance Networking Group Stanford University.
SE 450 Software Processes & Product Metrics Reliability Engineering.
Using Search in Problem Solving
Preference Elicitation in Scheduling Problems Ulaş Bardak Ph.D. Thesis Proposal Committee Jaime Carbonell, Eugene Fink, Stephen Smith, Sven Koenig (University.
Constrained Pattern Assignment for Standard Cell Based Triple Patterning Lithography H. Tian, Y. Du, H. Zhang, Z. Xiao, M. D.F. Wong Department of ECE,
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Classical Exploration Methods for Design Space Exploration (multi-criteria.
Distributed Scheduling. What is Distributed Scheduling? Scheduling: –A resource allocation problem –Often very complex set of constraints –Tied directly.
Handouts Software Testing and Quality Assurance Theory and Practice Chapter 9 Functional Testing
Constraint Satisfaction Problems
Intrusion and Anomaly Detection in Network Traffic Streams: Checking and Machine Learning Approaches ONR MURI area: High Confidence Real-Time Misuse and.
Copyright R. Weber Search in Problem Solving Search in Problem Solving INFO 629 Dr. R. Weber.
Qualifications Update: Environmental Science Qualifications Update: Environmental Science.
Topic (1)Software Engineering (601321)1 Introduction Complex and large SW. SW crises Expensive HW. Custom SW. Batch execution.
At A Glance VOLT is a freeware, platform independent tool set that coordinates cross-mission observation planning and scheduling among one or more space.
A Scheduling Algorithm with Dynamic Priorities Status Presentation Matias Mora Klein UTFSM Computer Systems Research.
Committee on the Assessment of K-12 Science Proficiency Board on Testing and Assessment and Board on Science Education National Academy of Sciences.
Probabilistic Reasoning for Robust Plan Execution Steve Schaffer, Brad Clement, Steve Chien Artificial Intelligence.
Informed State Space Search Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
1 N -Queens via Relaxation Labeling Ilana Koreh ( ) Luba Rashkovsky ( )
Review of Software Process Models Review Class 1 Software Process Models CEN 4021 Class 2 – 01/12.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
Qualifications Update: Human Biology Qualifications Update: Human Biology.
FORS 8450 Advanced Forest Planning Lecture 5 Relatively Straightforward Stochastic Approach.
Cycle 15 LRP Construction and Characteristics July 21, 2006.
Computer Science CPSC 322 Lecture 6 Iterative Deepening and Search with Costs (Ch: 3.7.3, 3.5.3)
Principles of Intelligent Systems Constraint Satisfaction + Local Search Written by Dr John Thornton School of IT, Griffith University Gold Coast.
Software testing techniques Software testing techniques Statistical Testing Presentation on the seminar Kaunas University of Technology.
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
A local search algorithm with repair procedure for the Roadef 2010 challenge Lauri Ahlroth, André Schumacher, Henri Tokola
CHAPTER 5 SECTION 1 – 3 4 Feb 2004 CS Constraint Satisfaction 1 Constraint Satisfaction Problems.
ADASS the Planning and Scheduling Perspective Roadmap: - How planning and scheduling fits in at ADASS - ADASS planning and scheduling posters and presentations.
Smart Home Technologies
It’s Time to Build! SCH06 Stephen Rando. Agenda Schedule build process Room management Validating Running/analyzing the build Running/analyzing the load.
Week 7 Utility Data Analysis. Essential Elements Identify sources for obtaining utility data: paper form, electronically or from the internet Review utility.
Heuristics for Efficient SAT Solving As implemented in GRASP, Chaff and GSAT.
APT Visit Planner Review Chris O’Dea. The Gallant Crew v Chris O’Dea - Project Scientist v Jesse Doggett - Software Engineer/Coordinator v Tricia Royle.
AUTOMATED COURSE AND EXAMINATION TIMETABLING Dr. S. Kanmani Professor and Head Department of Information Technology Pondicherry Engineering College Puducherry.
1 Appendix C 1. Min-Conflict Hill Climbing 2. Min-Conflict Random Walk.
Installation and Commisioning SE view point Romuald Duperrier ESS SE manager.
Unit 6 Application Design.
Fast Subsequence Matching in Time-Series Databases.
Object-Oriented Analysis & Design
Software Project Management
ISP and Egress Path Selection for Multihomed Networks
Computer Science cpsc322, Lecture 14
COMI Friday 9:00 – 1:50 Room 2108.
Debrief Case Study Setting
Managing Inter-domain Traffic in the Presence of BitTorrent File-Sharing Srinivasan Seetharaman and Mostafa Ammar School of Computer Science Objective:
Iterative Deepening CPSC 322 – Search 6 Textbook § 3.7.3
Capstone Team Project title
University of Debrecen Mongolian University of Life Sciences
CS137: Electronic Design Automation
Presentation transcript:

Validating Resources in Least Commitment Scheduling Nazma Ferdous & Mark Giuliano Space Telescope Science Institute October 24, 2006

Outline HST Observation Scheduling Process Resource Model Resource Model Limitations Plan Validation Tool Operational Results Summary & Future Directions

Outline HST Observation Scheduling Process Resource Model Resource Model Limitations Plan Validation Tool Operational Results Summary & Future Directions

HST Observation Scheduling Two Phased Approach Uncertainty in HST orbit. Big problem size (~ 2400 observations per year). Better long term HST usage. Year-based Long Range Planning (Assigns 8 week long window for start time) Week-based Short Term Scheduling (Assigns start time)

1. Calculating Constraint Window Observation constraint windows are calculated from all physical and other constraints, which denotes the timeline of when the observation can be scheduled. 2. Generating Plan Window (PW) Using least commitment scheduler SPIKE, observations are assigned plan windows, which are the preferred window for scheduling. 3. Computing Resource Consumption Long Range Planning (LRP) Feb MarAprJunJulAugSepNov 0 1 Feb MarAprJunJulAugSepNov 0 1 Plan Window

Outline HST Observation Scheduling Process Resource Model Resource Model Limitations Plan Validation Tool Operational Results Summary & Future Directions

SPIKE Resources Total orbits per day (15 per day) South Atlantic Anomaly (SAA) related resources –SAA free orbits per day (6-7 per day) –SAA impacted orbits per day (8-9 per day) Sun Target

SPIKE Resource Model Equally distributes the total resource required by an observation over the range of the PW. Depicts general probability of resource contention/under usage. O1O1 O2O2 O3O3 Day Plan Windows 2 Total Orbits Consumed Available O1O1 O2O2 O3O3 Duration State Day Over-subscribed 3 Leveled-subscribed 2,4,5 Under-subscribed 1,6,7

Outline HST Observation Scheduling Process Resource Model Resource Model LimitationsResource Model Limitations Plan Validation Tool Operational Results Summary & Future Directions

Resource Model Limitations Creates false positives. No oversubscribed days. Yet, no feasible schedule exists ! O1O1 O2O2 O3O3 Day Plan Windows O4O4 Duration O1O1 O2O2 O3O3 O4O4 2 Total Orbits Consumed Available

Resource Model Limitation (cont.) Create false negatives. Day 3 and 4 are oversubscribed. Yet, a schedule can be generated ! O1O1 O2O2 O3O3 Day Plan Windows O1O1 O2O2 O3O3 Duration Total Orbits Consumed Available

Initial Resource Profile Data from 2006 observation cycle Total Observations: 2389 Total Orbits Required: 3776 Total Orbits Oversubscription: 1029

Plan Window Generation ++ Short Term Scheduling LRP Plan Window Generation

Outline HST Observation Scheduling Process Resource Model Resource Model Limitations Plan Validation Tool Operational Results Summary & Future Directions

Short Term Scheduling Plan Window Generation Plan Validation Tool LRP Short Term Scheduling LRP Plan Window Generation Plan Validation Tool Given a Long Range Plan, Treat the plan windows for as the constraint windows. Assign 1 day-long scheduling window to the observations, essentially committing all resources required for the observation to that day. Analyze the resulting resource profile.

Validation Tool Implementation Initial Guess -Scheduling windows are assigned w/o violating the resource limit if possible. If not, window with least resource contention is chosen. Repair -A systematic repair (e.g. utilizes iterative deepening concept) is used to flatten the resource profile, minimizing false alarm as much as possible.

Iterative Deepening (ID) Repair Start at iteration 1 and progressively increase the iteration by 1. At iteration i, for each conflicted observation, perform a depth- first search, looking for chain of moves of length i, to resolve the conflict. The algorithm stops when max iteration (user specified) is reached or no resource contention exists. Iteration Operation 1 Oversubscribed  Undersubscribed 2 Oversubscribed  Leveled subscribed  Undersubscribed 3 Oversubscribed  Leveled subscribed  Leveled subscribed  Undersubscribed n Oversubscribed  Leveled subscribed  Leveled subscribed … (n-2 moves) …  Undersubscribed

ID : An example Resource Limit: 2 observations are allowed per day U L O L U O L U O L L A F B C D E O : Over Subscribed Days L: Level Subscribed Days U: Under Subscribed Days Observations PW Conflicted? A * B * C D * E F AC BD F E

U L O L U O L U O L L ID : Iteration 1 Oversubscribed  Undersubscribed Observation Chain: Actions Performed: U L L L L O L U O L L A F B C D E A Move A from day 3 to day 5 AC BD F E A B D √ X X

ID: Iteration 2 Oversubscribed  Leveled subscribed  Undersubscribed Observation Chain: Actions Performed: U L L L L O U L O L L B U L L L L O L U O L L F B C D E A U L L L L L L L O L L C Move C from day 7 to day 8 to create room for B Move B from day 6 to day 7. AC BD F E B, D,E AX X C√

L L L L L L L L O U L D L L L L L L L L L L L L L L U L L L L O L L U L L L L L L L O L L B F D E ACFE ID : Iteration 3 Oversubscribed  Leveled subscribed  Leveled subscribed  Undersubscribed Observation Chain: Action Performed: Move F from day 4 to day 1 to create room for E Move E from day 10 to day 4 to create room for D Move D from day 9 to day 10. AC BD F E D,E,AX B C F X X √

Outline HST Observation Scheduling Process Resource Model Resource Model Limitations Plan Validation Tool Operational Results Summary & Future Directions

Validation Tool Resource Profile For Total Orbits per day Resource False positives identified: 5 False negatives identified : 90 Total oversubscription : 495 (compared to 1029)

Extending Algorithms for PW Generation New initial guess and iterative deepening repair algorithms were extended for plan window generation. Resulting long range plan is more resource balanced. Validation tool identified fewer false positive/negatives and oversubscription. Short Term Scheduling Plan Window Generation Plan Validation Tool LRP

New Resource Profile Data from 2006 observation cycle Total Observations: 2389 Total Orbits Required: 3776 Total Orbits Oversubscription: 558 (compared to 1029)

Validation Tool Resource Profile For Total Orbits per day Resource False positives identified: 2 (compared to 5) False negatives identified : 179 (compared to 90) Total oversubscription : 142 (compared to 558)

Outline HST Observation Scheduling Process Resource Model Resource Model Limitations Plan Validation Tool Operational Results Summary & Future Directions

Summary An automated resource verification system is implemented for the long range planning. Streamlined the long range planning process. Significantly reduced human cost and saved time. Long range plan is more resource balanced.

Future Directions While repairing resource conflicts, knowledge gained in one iteration can be used in subsequent iterations. Couple “PW Generation” and “Validation Tool” more tightly so that resources are validated as the plan windows are laid out.

Thanks

Limitations Swapping observations is not allowed. Demonstrates diminishing return as the iteration increases. Using appropriate heuristics and utilizing domain knowledge is important. O1O1 O2O2 O3O3 Day Plan Windows O1O1 O2O2 O3O3 Duration Total Orbits 3 2 Consumed Available