We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byClaire Payne
Modified over 2 years ago
© 2006 Open Grid Forum Advanced reservation/Scheduling Tomohiro Kudoh (AIST, Japan)
© 2006 Open Grid Forum 2 Types of request Designate request A request of specific physical resources Abstract request A request of resources with specified capabilities (attributes). Mapping to physical resources required.
© 2006 Open Grid Forum 3 Scheduling and provisioning Scheduling Allocating using right of resources to a request If the request is an abstract request, mapping between the request and physical resources is also determined Provisioning Activate allocated resources and make them usable by the requester. May be automatic / may be kicked by additional operation by the requester (signaling)
© 2006 Open Grid Forum 4 Types of scheduling (1) On-demand If the resources are available when a request is issued, the resources are allocated to the requester. If the request is an abstract request, mapping of physical resources is done. If the resources are not available, the request is simply denied. Usually, the requester can use the allocated resources as long as it wants. The end time of the provisioning is not determined at the time of provisioning.
© 2006 Open Grid Forum 5 Types of scheduling (2) Batch Widely used in computing systems such as supercomputing centers. Requests are queued in a queue, and the request at the head of the queue is scheduled when required resources become available If the request is an abstract request, mapping of physical resources is done at this moment. May have multiple prioritized queues.
© 2006 Open Grid Forum 6 Types of scheduling (3) Advance reservation (book ahead) A request is processed by a scheduler, and the scheduler finds a period when the requested resources are available for the requested duration The resources are reserved during the reservation period, and when the reservation period begins, the resources are allocated to the requester. A reservation database is maintained by the scheduler or resource managers, and referred and updated by the scheduler. Scheduling is done when a request is issued. In addition, re- scheduling may be done when availability of resources is changed.
© 2006 Open Grid Forum 7 Types of scheduling (3) Instant reservation If an advance reservation request requests immediate allocation of resources, the request is called instant reservation. Different from the pure on-demand the end time of a provisioning is determined at the time of scheduling.
© 2006 Open Grid Forum 8 Priority and preemption If requests have priorities, a request with lower priority may be preempted by a higher priority request Provision preemption To preempt resources which are being provisioned (and may be being used by the requester) to a lower priority request. Schedule preemption To preempt an already scheduled but not yet provisioned preceding lower priority request
© 2006 Open Grid Forum 9 Priority and preemption If provision preemption is supported, both on-demand and advance reservation requests can be used simultaneously. When the same resources are required, advance reservation requests with higher priority than existing (being provisioned) on-demand requests can be scheduled At the beginning of the reserved period of the advance reservation request, the resource is preempted (if the resource is still being used by the on-demand request) If schedule preemption is supported in an advance reservation system, re-scheduling may be done. After the re-scheduling, reserved period or other conditions of existing lower priority requests may be changed. A mechanism to let the clients of such existing requests know the change may be required.
© 2006 Open Grid Forum Summary 10 Timing of Scheduling (to request) Timing of Provisioning (to scheduling) End time of provisioning Maintained states (DB) Schedule preemption Provision preemption On-demandinstantaneous Not determined in advance Current state of resources Not applicable May be supported, required for co-use with reservation Instant reservation instantaneous Determined at the time of scheduling Current state of resources, Reservation database Not applicable May be supported Advance reservation Instantaneous/ when availability of resources changed scheduledDetermined at the time of scheduling Current state of resources, Reservation database May be supported BatchWhen a request comes to the top of the queue instantaneousNot determined in advance Current state of resources, Queue(s) of requests May be supported May be supported, required for co-use with reservation
© 2010 Open Grid Forum Choices in Reservation operation 1PC/2PC, timing Tomohiro Kudoh, AIST.
© 2004, D. J. Foreman 1 Scheduling & Dispatching.
File Concept A file is a named collection of related information that is recorded on secondary storage. A file has a define structure, which we must know.
Chapter 7: Deadlocks. The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance.
RMS and Scheduling for Future Generation Grids Ramin Yahyapour University Dortmund Leader CoreGRID Institute on Resource Management and Scheduling CoreGRID.
© 2006 Open Grid Forum Network Services Interface Introduction to NSI Guy Roberts.
Real Time Scheduling. Outline About real time systems Basic Scheduling Techniques Recent Work Future Work.
Lockheed Martin Aeronautics Company © 2001 Lockheed Martin Corporation F-16 Modular Mission Computer Application Software Achieving Cross-Platform Compatibility.
Chapter 5 Deadlocks. Contents What is deadlock? What is deadlock? Characterization Characterization Resource allocation graph Resource allocation graph.
TIMING AND FLOWCHART ASSIGNMENT COMMUNICATION OF ROFR.
Uniprocessor Scheduling Chapter 9 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Processes and Threads Chapter 3 and 4 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College,
Advanced Booking. Booking - Have the item available when the patron wants to use it -2 types of bookings: -Item Booking – Patron choses booking period,
Multiprocessing and NUMA. What we sort of assumed so far… Northbridge connects CPU and memory to rest of system – Memory controller implemented in Northbridge.
Copyright © 2013 Confirmit. All Rights Reserved. Confirmit Confidential. Confirmit Hub What’s New in Confirmit Felix – Ole Andresen Director,
NBAJOBS Process Timing and. Agenda Monthly Process and Timing Time Entry related to NBAJOBS EPAF Timing Contacting Central Banner Dates Examples.
Silberschatz, Galvin, and Gagne Applied Operating System Concepts Module 14: Network Structures Background Motivation Topology Network Types.
UK Condor Week NeSC – Scotland – Oct 2004 Condor Team Computer Sciences Department University of Wisconsin-Madison The Bologna.
Doc.: IEEE /402r0 Submission July 2001 Baruch Altman, CommPrize Inc.Slide 1 H²CF: Hiperlan2 Hybrid Coordination Function; Ideas on coexistence.
Lottery Method in BPAs Simultaneous Submission Windows and Potential Application to the Simultaneous Defender Matching Process NAESB Meeting 05/01/13.
©© 2013 SAP AG. All rights reserved. Scenario/Processes Service and Repair Scenario Overview Handling an Incoming Customer Inquiry Executing Services Creating.
Chapter 3 1 Process Description and Control Chapter 3.
802.1AF - directions define requirements to find and create connections in terms of Discovery - Authentication - Enable 1.Discover of what can be done.
Chapter 7: Deadlocks Adapted by Donghui Zhang from the original version by Silberschatz et al.
Linked Lists. Please Read These slides are provided for the use of students enrolled in James Durbanos Data Structures class (CISC 220). They are the.
Time Management in the High Level Architecture Roger McFarlane School of Computer Science McGill University Montréal, Québec CANADA 19 March 2003.
Operating Systems Theory - Threads1 Operating Systems Theory Threads IFE - Computer Science Alexi Akl.
CM20145 Transactions Dr Alwyn Barry Dr Joanna Bryson.
Database System Concepts, 6 th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Chapter 26: Advanced.
1 Chapter 11 Software Evolution This chapter is extracted from Sommerville’s slides. Text book chapter 21 1.
© 2016 SlidePlayer.com Inc. All rights reserved.