Abstract
In this paper, we propose an efficient scheduling algorithm for problems in which tasks with precedence constraints and communication delays have to be scheduled on an heterogeneous distributed system with one fault hypothesis.Our algorithm combines the DSS_OPT algorithm and the eFRCD algorithm. To provide a fault-tolerant capability, we employ primary and backup copies. In this scheme, backup copies can overlap other backup copies, and backup copies are not established for tasks that have more than one primary copy. The result is a schedule in polynomial time that is optimal when there is no failure, and is a good resilient schedule in the case of one failure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.-Y. Colin, P. Chrétienne (1991). “Scheduling with Small Communication Delays and Task Duplication”, Operations Research, vol. 39, n o 4, 680–684, 1991.
M. Maheswaran and H. J. Siegel, “A Dynamic matching and scheduling algorithm for heterogeneous computing systems”, Proceedings of the 7th IEEE Heterogeneous Computing Workshop(HCW ’98), pp. 57–69, Orlando, Florida 1998.
M. Iverson, F. Özgüner, “Dynamic, Competitive Scheduling of Multible DAGs in a Distributes Heterogeneous Environment”, Proceedings of the 7th IEEE Heterogeneous Computing Workshop (HCW ’98), pp. 70 – 78, Orlando, Florida 1998.
H. Topcuoglu, S. Hariri, and M.-Y. Wu., “Task scheduling algorithms for heterogeneous processors”. In8 th Heterogeneous Computing Workshop (HCW’ 99), pages 3–14, April 1999.
J.-Y. Colin , M. Nakechbandi, P. Colin, F. Guinand, “Scheduling Tasks with communication Delays on Multi-Levels Clusters”, PDPTA’99 : Parallel and Distributed Techniques and Application, Las Vegas, U.S.A., June 1999.
A. H. Alhusaini, V. K. Prasanna, C.S. Raghavendra, “A Unified Resource Scheduling Framework for Heterogeneous, Computing Environments”, Proceedings of the 8th IEEE Heterogeneous Computing Workshop, Puerto Rico, 1999, pp.156- 166.
H. Chen, M. Maheswaran, “Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems”, Proceedings of the 11th IEEE Heterogeneous Computing Workshop, p. 88b-98b, Fort Lauderdale, 2002.
M. Nakechbandi, J.-Y. Colin , C. Delaruelle, “Bounding the makespan of best pre-scheduling of task graphs with fixed communication delays and random execution times on a virtual distributed system”, OPODIS02, Reims, December 2002.
Christoph Ruffner, Pedro José Marròn, Kurt Rothermel, “An Enhanced Application Model for Scheduling in Grid Environments”, TR-2003-01, University of Stuttgart, Institute of Parallel and Distributed Systems (IPVS), 2003.
P. Palmerini, “On performance of data mining: from algorithms to management systems for data exploration”, PhD. Thesis: TD-2004-2, Universit‘a Ca’Foscari di Venezia,2004.
Srikumar Venugopal, Rajkumar Buyya and Lyle Winton, “A Grid Task Broker for Scheduling Distributed Data-Oriented Applications on Global Grids”, Technical Report, GRIDS-TR-2004-1, Grid Computing and Distributed Systems Laboratory, University of Melbourne, Australia, February 2004.
M.J. Flynn, “Some computer organization and their e_ectiveness.”, IEEE Transations on Computer, pages 948-960, September 1972.
Yu-Kwong Kwok, and Ishfaq Ahmad, “Static scheduling algorithms for allocating directed task graphs to multiprocessors”, ACM Computing Surveys (CSUR), 31 (4): 406 - 471, 1999.
M.R. Garey and D.S. Johnson.,”Computers and Intractability, a Guide to the Theory of NP-CompletenessW. H. Freeman Company, San Francisco, 1979.
J.-Y. Colin , M. Nakechbandi, P. Colin,”A multi-valued DAG model and an optimal PERT-like Algorithm for the Distribution of Applications on Heterogeneous, Computing Systems", PDPTA’05, Las Vegas, Nevada, USA, June 27-30, 2005.
X. Qin and H. Jiang, “A Novel Fault-tolerant Scheduling Algorithm for Precedence Constrained Tasks in Real-Time Heterogeneous Systems” , Parallel Computing, vol. 32, no. 5-6, pp. 331-356, June 2006.
B. Randell, “System structure for software fault-tolerance”, IEEE Trans. Software Eng. 1(2) June 1975, 220-232.
L. Chen, A. Avizienis, “N-version programming: a fault tolerant approach to reliability of software operation”, Proceeding of the IEEE Fault-Tolerant Computing Symposium, 1978 pp. 3-9.
MR Garey, David S. Johnson: Two-Processor Scheduling with Start-Times and Deadlines. SIAM J. Comput. 6(3): 416-426 (1977).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this paper
Cite this paper
Nakechbandi, M., Colin, JY., Gashumba, J. (2007). An efficient fault-tolerant scheduling algorithm for precedence constrained tasks in heterogeneous distributed systems. In: Sobh, T. (eds) Innovations and Advanced Techniques in Computer and Information Sciences and Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6268-1_54
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6268-1_54
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6267-4
Online ISBN: 978-1-4020-6268-1
eBook Packages: EngineeringEngineering (R0)