Resource availability-aware advance reservation for parallel jobs with deadlines
Authors: 
Bo Li, Yijian Pei, Hao Wu, Bin ShenAuthors Info & Claims
Bo Li, Yijian Pei, Hao Wu, Bin ShenAuthors Info & ClaimsPages 798 - 819
Abstract
Advance reservation is important to guarantee the quality of services of jobs by allowing exclusive access to resources over a defined time interval on resources. It is a challenge for the scheduler to organize available resources efficiently and to allocate them for parallel advance reservation jobs with deadline constraint appropriately. This paper provides a slot-based data structure to organize available resources of multiprocessor systems in a way that enables efficient search and update operations and formulates a suite of scheduling policies to allocate resources for dynamically arriving advance reservation requests. The performance of the scheduling algorithms were investigated by simulations with different job sizes and durations, system loads, and scheduling flexibilities. Simulation results show that job sizes and durations, system load and the flexibility of scheduling will impact the performance metrics of all the scheduling algorithms, and the $$\textit{PE}\; \textit{Worst Fit}$$ PE WorstFit algorithm becomes the best algorithm for the scheduler with the highest acceptance rate of advance reservation requests, and the jobs with the $$\textit{First Fit}$$ FirstFit algorithm experience the lowest average slowdown. The data structure and scheduling policies can be used to organize and allocate resources for parallel advance reservation jobs with deadline constraint in large-scale computing systems.
References
[1]
Foster I, 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
[2]
Buyya R, Abramson D, Giddy J (2000) Nimrod/g: An architecture for a resource management and scheduling system in a global computational grid. In: Proceedings of the 4th international conference/exhibition on high performance computing in theAsia-Pacific, Region, pp 283---290
[3]
Al-Ali R, Rana O, Walker D, Jha S, Sohail S (2002) G-qosm: Grid service discovery using qos properties. Comput Inf 21(4):363---382
[4]
Jackson D, Snell Q, Clement M (2001) Core algorithms of the maui scheduler. In: Job scheduling strategies for parallel processing. Springer, Berlin, pp 87---102
[5]
Platform computing corporation. http://www.platform.com
[6]
Bode B, Halstead D, Kendall R, Lei Z, Jackson D (2000) The portable batch scheduler and the maui scheduler on linux clusters. In: Proceedings of the 4th annual Linux showcase and conference, pp 1---9
[7]
Castillo C, Rouskas G, Harfoush K Online algorithms for advance resource reservations. J Parallel Distrib Comput.
[8]
Nurmi D, Wolski R, Brevik J (2009) Probabilistic reservation services for large-scale batch-scheduled systems. IEEE Syst J 3(1):6---24
[9]
Aida K, Casanova H (2009) Scheduling mixed-parallel applications with advance reservations. Cluster Comput 12(2):205---220
[10]
Castillo C, Rouskas G, Harfoush K (2009) Resource co-allocation for large-scale distributed environments. In: Proceedings of the 18th ACM international symposium on High performance distributed computing, pp 131---140
[11]
Lee Y, Zomaya A (2010) Rescheduling for reliable job completion with the support of clouds. Future Gener Comput Syst 26(8):1192---1199
[12]
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, pp 1---8
[13]
Li B, Zhao D (2007) Performance impact of advance reservations from the grid on backfill algorithms. In: Sixth international conference on IEEE grid and cooperative computing, 2007. GCC 2007, pp 456---461
[14]
Snell Q, Clement M, Jackson D, Gregory C (2000) The performance impact of advance reservation meta-scheduling. In: Job Scheduling strategies for parallel processing. Springer, Berlin, pp 137---153
[15]
Naiksatam S, Figueira S (2007) Elastic reservations for efficient bandwidth utilization in LambdaGrids. Future Gener Comput Syst 23(1):1---22
[16]
Margo M, Yoshimoto K, Kovatch P, Andrews P (2008) Impact of reservations on production job scheduling. In: Job scheduling strategies for parallel processing, pp 116---131
[17]
Burchard L (2005) Analysis of data structures for admission control of advance reservation requests. IEEE Trans Knowl Data Eng 17(3):413---424
[18]
Xiong Q, Wu C, Xing J, Wu L, Zhang H (2005) A linked-list data structure for advance reservation admission control. Netw Mobile Comput, pp 901---910
[19]
Wang T, Chen J (2002) Bandwidth tree-a data structure for routing in networks with advanced reservations. In: 21st IEEE international performance, computing, and communications conference, pp 37---44
[20]
Nie W, Panahi M, Lin K (2010) A flexible schedule reservation scheme for real-time service-oriented architecture. In: 12th IEEE international conference on commerce and enterprise computing, pp 1---8
[21]
Brown R (1988) Calendar queues: a fast o (1) priority queue implementation for the simulation event set problem. Commun ACM 31(10):1220---1227
[22]
Sulistio A, Cibej U, Prasad S, Buyya R (2009) Garq: an efficient scheduling data structure for advance reservations of grid resources. Int J Parallel Emerg Distrib Syst 24(1):1---19
[23]
Netto M, Bubendorfer K, Buyya R (2007) Sla-based advance reservations with flexible and adaptive time qos parameters. Serv Oriented Comput ICSOC 2010:119---131
[24]
Balakrishnan P, Somasundaram T (2010) SLA enabled CARE resource broker. Future Gener Comput Syst 27(3):265---279
[25]
Xu J, Qiao C, Li J, Xu G (2004) Efficient burst scheduling algorithms in optical burst-switched networks using geometric techniques. IEEE J Sel Areas Commun 22(9):1796---1811
[26]
Castillo C, Rouskas G, Harfoush K (2007) On the design of online scheduling algorithms for advance reservations and qos in grids. In: IEEE international parallel and distributed processing symposium, IPDPS 2007, pp 1---10
[27]
Pinedo M (2008) Scheduling: theory, algorithms, and systems, Springer, Berlin
[28]
Kunrath L, Westphall C, Koch F (2008) Towards advance reservation in large-scale grids. In: Third international conference on systems, pp 247---252
[29]
Bo L, Dongfeng Z, Bin S (2006) Simulating platform for grid computing with reservations. J Syst Simul 18(z2):373---376
[30]
Feitelson D Parallel workloads archive. http://www.cs.huji.ac.il/labs/parallel/workload
[31]
Lublin U, Feitelson D (2003) The workload on parallel supercomputers: modeling the characteristics of rigid jobs. J Parallel Distrib Comput 63(11):1105---1122
[32]
SimJava. http://www.dcs.ed.ac.uk/home/hase/simjava/
[33]
Heine F, Hovestadt M, Kao O, Streit A (2005) On the impact of reservations from the grid on planning-based resource management. Comput Sci ICCS, pp 155---162
[34]
Bo L, Enwei Z, Hao W, Yijian P, Bin S (2012) Fragment aware scheduling for advance reservations in multiprocessor systems. In: International conference on cyber-enabled distributed computing and knowledge discovery, CyberC 2012, pp 278---285
[35]
Kurowski K, Oleksiak A, Piatek W, Weglarzet J (2011) Hierarchical scheduling strategies for parallel tasks and advance reservations in grids. J Sched, pp 1---20
[36]
Tomás L, Östberg PO, Caminero B, Carrin C, Elmroth E (2011) An adaptable in-advance and fairshare meta-scheduling architecture to improve grid QoS. In: Proceedings of the 2011 IEEE/ACM 12th international conference on grid, computing, pp 220---221
[37]
Adabi S, Movaghar A, Rahmani AM (2013) Bi-level fuzzy based advanced reservation of Cloud workflow applications on distributed Grid resources. J Supercomput.
- Resource availability-aware advance reservation for parallel jobs with deadlines
Recommendations
Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
We present a polynomial time algorithm for constructing an optimal schedule, if a feasible schedule exists, for tthe following multimachine scheduling problem. There are n unit-time jobs, with arbitrary release times and deadlines, and m identical ...
Preemptive Hadoop Jobs Scheduling under a Deadline
SKG '12: Proceedings of the 2012 Eighth International Conference on Semantics, Knowledge and GridsMapReduce has become the dominant programming model in a cloud-based data processing environment, such as Hadoop. First In First Out (FIFO) is the default job scheduling policy of Hadoop, but it cannot guarantee that the job will be completed by a ...
Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor*This work is supported in part by Brain Korea 21 project and in part by ICT.
Multiprocessor architecture becomes common on real-time systems as the workload of real-time systems increases. Recently new deadline-based (EDF-based) multiprocessor scheduling algorithms are devised, and comparative studies on the performance of these ...
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 2014 Springer Science+Business Media New York.
Publisher
Kluwer Academic Publishers
United States
Publication History
Published: 01 May 2014
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in