Abstract
Taskscheduling on Heterogeneous Distributed Computing Systems (HeDCSs) with the purpose of efficiency and reduction of execution time is of paramount importance. In this paper a novel task scheduling algorithm, called Resource-Aware Clustering (RAC) for Directed Acyclic Graphs (DAGs) is proposed. The objective of this algorithm is to keep the relative load balancing and efficiency increase between processors with different processor capabilities. To aim this fact, RAC by giving a dynamic score function to each task, performs task clustering and allocation according to processing capability of cooperative processors. In execution phase, Modified Bottom-Level (MBL) quantity of each task with a complexity of O(v+e) would be calculated and applied for tasks priority identification. Comparing simulation results of RAC algorithm with famous scheduling approaches such as MCP, MD and DSC shows that RAC substantially increases efficiency while in most cases reduces completion time.
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
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. Annual Discrete Mathematics 5, 287–326 (1979)
Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance- Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions Parallel and Distributed Systems 13(3), 260–274 (2002)
Davidovic, T., Crainic, T.G.: Benchmark-Problem Instances for Static Scheduling of Task Graphs with Communication Delays on Homogeneous Multiprocessor Systems. C.R.T.’s Publications (2004)
Adam, T.L., Chandy, K.M., Dicksoni, J.R.: A Comparison of List Schedules for Parallel Processing Systems. Communications of the ACM, 685–690 (1974)
Wu, M.Y., Gajski, D.D.: Hypertool: a Programming Aid for Message-Passing Systems. IEEE Transactions on Parallel and Distributed Systems 1(3), 330–343 (1990)
Yang, T., Gerasoulis, A.: DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Transactions on Parallel and Distributed Systems 5(9), 951–967 (1994)
Boeres, C., Viterbo Filho, J., Rebello, E.F.: A Cluster-Based Strategy for Scheduling Task on Heterogeneous Processors. In: Proceedings of 16th Symposium on Computer Architecture and High Performance Computing, SBAC-PAD (2004)
Haupt, R.L., Haupt, S.E.: Parallel genetic algorithms. John Wiley & Sons, Chichester (2004)
Ahmad, I., Kwok, Y.K.: On Exploiting Task Duplication in Parallel Program Scheduling. IEEE Transactions on Parallel and Distributed Systems 9, 872–892 (1998)
Bajaj, R., Agrawal, D.P.: Improving Scheduling of Tasks in a Heterogeneous Environment. IEEE Transactions on Parallel and Distributed Systems 15, 107–118 (2004)
Hwang, R., Gen, M., Katayama, H.: A Comparison of Multiprocessor Task Scheduling Algorithms with Communication Costs. Computers & Operations Research 35, 976–993 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jedari, B., Dehghan, M. (2009). Efficient DAG Scheduling with Resource-Aware Clustering for Heterogeneous Systems. In: Lee, R., Hu, G., Miao, H. (eds) Computer and Information Science 2009. Studies in Computational Intelligence, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01209-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-01209-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01208-2
Online ISBN: 978-3-642-01209-9
eBook Packages: EngineeringEngineering (R0)