Skip to main content
Log in

Scheduling real-time divisible loads with advance reservations

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Providing QoS and performance guarantee to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, previous approaches have no support for advance reservations. However, with the emergence of Grid applications that require simultaneous access to multi-site resources, supporting advance reservations in a cluster has become increasingly important. In this paper we propose a new real-time divisible load scheduling algorithm that supports advance reservations in a cluster. The impact of advance reservations on system performance is systematically studied. Simulation results show that, with the proposed algorithm and appropriate advance reservations, the system performance could be maintained at the same level as the no reservation case. Thus, Our approach enforces the real-time agreement vis-a-vis addresses the under-utilization concerns.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Algorithm 1
Algorithm 2
Algorithm 3
Fig. 3
Fig. 4
Algorithm 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Algorithm 5
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  • Amin A, Ammar R, Dessouly AE (2004) Scheduling real time parallel structure on cluster computing with possible processor failures. In: Proc of 9th IEEE international symposium on computers and communications, July 2004, pp 62–67

    Google Scholar 

  • Ammar RA, Alhamdan A (2002) Scheduling real time parallel structure on cluster computing. In: Proc. of 7th IEEE international symposium on computers and communications, Taormina, Italy, July 2002, pp 69–74

    Google Scholar 

  • Anderson J, Srinivasan A (2000) Pfair scheduling: beyond periodic task systems. In: Proc. of the 7th international conference on real-time systems and applications, Cheju Island, South Korea, December 2000, pp 297–306

    Google Scholar 

  • ATLAS (AToroidal LHC Apparatus) experiment, CERN (European lab for particle physics) (2008) Atlas web page. http://atlas.ch/

  • Cao J, Zimmermann F (2004) Queue scheduling and advance reservations with cosy. In: Parallel and distributed processing symposium, April 2004, p 63a

    Google Scholar 

  • Cheng Y, Robertazzi T (1990) Distributed computation for a tree network with communication delays. IEEE Trans Aerosp Electron Syst 26(3):511–516

    Article  Google Scholar 

  • Chu H-H, Nahrstedt K (1999) CPU service classes for multimedia applications. In: ICMCS, vol 1, pp 296–301

    Google Scholar 

  • Chuprat S, Baruah S (2008) Scheduling divisible real-time loads on clusters with varying processor start times. In: 14th IEEE international conference on embedded and real-time computing systems and applications (RTCSA ’08), Aug 2008, pp 15–24

    Chapter  Google Scholar 

  • Chuprat S, Salleh S, Baruah S (2008) Evaluation of a linear programming approach towards scheduling divisible real-time loads. In: International symposium on information technology, Aug 2008, pp 1–8

    Chapter  Google Scholar 

  • Compact Muon Solenoid (CMS) experiment for the Large Hadron Collider at CERN (European lab for particle physics) (2008) Cms web page. http://cmsinfo.cern.ch/Welcome.html/

  • Cucinotta T, Konstanteli K, Varvarigou T (2009) Advance reservations for distributed real-time workflows with probabilistic service guarantees. In: IEEE international conference on service-oriented computing and applications (SOCA), December 2009

    Google Scholar 

  • Czajkowski K, Foster I, (2002) SNAP: a protocol for negotiating service level agreements and coordinating resource management in distributed systems. In: 8th workshop on job scheduling strategies for parallel processing, pp 153–183

    Chapter  Google Scholar 

  • Czajkowski K, Foster IT, Karonis NT, Kesselman C, Martin S, Smith W, Tuecke S (1998) A resource management architecture for metacomputing systems. In: IPPS/SPDP ’98: proceedings of the workshop on job scheduling strategies for parallel processing, London, UK. Springer, Berlin, pp 62–82

    Chapter  Google Scholar 

  • Degermark M, Kohler T, Pink S, Schelen O (1997) Advance reservations for predictive service in the internet. Multimed Syst 5(3):177–186

    Article  Google Scholar 

  • Dertouzos ML, Mok AK (1989) Multiprocessor online scheduling of hard-real-time tasks. IEEE Trans Softw Eng 15(12):1497–1506

    Article  Google Scholar 

  • Eltayeb M, Dogan A, Özgüner F (2004) A data scheduling algorithm for autonomous distributed real-time applications in grid computing. In: Proc. of 33rd international conference on parallel processing, Montreal, Canada, August 2004, pp 388–395

    Google Scholar 

  • Ferrari D, Gupta A, Ventre G (1997) Distributed advance reservation of real-time connections. Multimed Syst 5(3):187–198

    Article  Google Scholar 

  • Foster I, Kesselman C, Lee C, Lindell R, Nahrstedt K, Roy A (1999) A distributed resource management architecture that supports advance reservations and co-allocation. In: Proceedings of the international workshop on quality of service, pp 27–36

    Google Scholar 

  • Foster I, Roy A, Sander V (2000). A quality of service architecture that combines resource reservation and application adaptation. doi:10.1109/IWQOS.2000.847954

  • Foster IT, Fidler M, Roy A, Sander V, Winkler L (2004) End-to-end quality of service for high-end applications. Comput Commun 27(14):1375–1388

    Article  Google Scholar 

  • Funk S, Baruah S (2005) Task assignment on uniform heterogeneous multiprocessors. In: Proc of 17th Euromicro conference on real-time systems, July 2005, pp 219–226

    Google Scholar 

  • He L, Jarvis SA, Spooner DP, Chen X, Nudd GR (2004) Hybrid performance-oriented scheduling of moldable jobs with qos demands in multiclusters and grids. In: Proc. of the 3rd international conference on grid and cooperative computing, Wuhan, China, October 2004, pp 217–224

    Google Scholar 

  • Huang Z, Qiu Y (2005) A bidding strategy for advance resource reservation in sequential ascending auctions. In: Autonomous decentralized systems, 2005. ISADS, April 2005, pp 284–288

    Chapter  Google Scholar 

  • Isovic D, Fohler G (2000) Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints. In: Proc. of 21st IEEE real-time systems symposium, Orlando, FL, November 2000, pp 89–98

    Google Scholar 

  • Lee WY, Hong SJ, Kim J (2003) On-line scheduling of scalable real-time tasks on multiprocessor systems. J Parallel Distrib Comput 63(12):1315–1324

    Article  MATH  Google Scholar 

  • Lin X, Lu Y, Deogun J, Goddard S (2007a) Enhanced real-time divisible load scheduling with different processor available times. In: 14th international conference on high performance computing, December 2007

    Google Scholar 

  • Lin X, Lu Y, Deogun J, Goddard S (2007b) Real-time divisible load scheduling for cluster computing. In: 13th IEEE real-time and embedded technology and application symposium, Bellevue, WA, April 2007, pp 303–314

    Chapter  Google Scholar 

  • Lin X, Lu Y, Deogun J, Goddard S (2007c) Real-time divisible load scheduling with different processor available times. In: International conference on parallel processing, September 2007, p 20

    Google Scholar 

  • Liu C, Yang L, Foster I, Angulo D (2002) Design and evaluation of a resource selection framework for grid applications. In: Proceedings of the 11th IEEE symposium on high-performance distributed computing, July 2002

    Google Scholar 

  • MacLaren J (2003) Advance reservations: State of the art. http://www.fz-juelich.de/zam/RD/coop/ggf/graap/graap-wg.html

  • Mamat A, Lu Y, Deogun J, Goddard S (2008) Real-time divisible load scheduling with advance reservations. In: 20th Euromicro conference on real-time systems (ECRTS), July 2008

    Google Scholar 

  • Manimaran G, Murthy CSR (1998) An efficient dynamic scheduling algorithm for multiprocessor real-time systems. IEEE Trans Parallel Distrib Syst 9(3):312–319

    Article  Google Scholar 

  • Margo MW, Yoshimoto K, Kovatch P, Andrews P (2007) Impact of reservations on production job scheduling. In: 13th workshop on job scheduling strategies for parallel processing, June 2007

    Google Scholar 

  • Qin X, Jiang H (2001) Dynamic, reliability-driven scheduling of parallel real-time jobs in heterogeneous systems. In: Proc. of 30th international conference on parallel processing, Valencia, Spain, September 2001, pp 113–122

    Google Scholar 

  • Ramamritham K, Stankovic JA, Shiah P-F (1990) Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Trans Parallel Distrib Syst 1(2):184–194

    Article  Google Scholar 

  • Robertazzi TG (2003) Ten reasons to use divisible load theory. Computer 36(5):63–68

    Article  Google Scholar 

  • Siddiqui M, Villazón A, Fahringer T (2006) Grid allocation and reservation—grid capacity planning with negotiation-based advance reservation for optimized qos. In: SC ’06: Proceedings of the 2006 ACM/IEEE conference on supercomputing, New York, NY, USA. ACM, New York, p 103

    Chapter  Google Scholar 

  • Smith W, Foster I, Taylor V (2000) Scheduling with advanced reservations. In: 14th international parallel and distributed processing symposium (IPDPS), May 2000, pp 127–132

    Chapter  Google Scholar 

  • Sotomayor B, Keahey K, Foster I (2006) Overhead matters: a model for virtual resource management. In: VTDC ’06: Proceedings of the 2nd international workshop on virtualization technology in distributed computing, Washington, DC, USA. IEEE Comput Soc, Los Alamitos, p 5

    Chapter  Google Scholar 

  • Swanson D (2005) Personal communication. Director, UNL Research Computing Facility (RCF) and UNL CMS Tier-2 Site, August 2005

  • Veeravalli B, Ghose D, Robertazzi TG (2003) Divisible load theory: a new paradigm for load scheduling in distributed systems. Clust Comput 6(1):7–17

    Article  Google Scholar 

  • Wolf LC, Steinmetz R (1997) Concepts for resource reservation in advance. Multimed Tools Appl 4(3):255–278

    Article  Google Scholar 

  • Zhang L (2002) Scheduling algorithm for real-time applications in grid environment. In: Proc. of IEEE international conference on systems, man and cybernetics, Hammamet, Tunisia, October 2002, vol 5, p 6

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ying Lu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mamat, A., Lu, Y., Deogun, J. et al. Scheduling real-time divisible loads with advance reservations. Real-Time Syst 48, 264–293 (2012). https://doi.org/10.1007/s11241-011-9145-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-011-9145-6

Keywords

Navigation