Abstract
Most heuristics for scheduling address asynchronous communication DAG, but they are not suitable for the synchronous ones. The proposed PRGSC algorithm avoids the deadlock that is caused by the synchronous communication, but also it can alleviate impact of synchronous communicating delay. Simulation shows that the PRGSC algorithm has better performance than the CASC algorithm which deals with the same type of problems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kwok, Y.K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys 31(4), 406–471 (1999)
Gerasoulis, A., Yang, T.: A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors. J. Parallel and Distributed Computing 16(4), 276–291 (1992)
Kadamuddi, D., Tsai, J.: Clustering Algorithm for Parallelizing Software System in Multiprocessors. IEEE Transactions on Software Engineering 26, 340–361 (2000)
Arafeh, B.R.: A Task Duplication Scheme for Resolving Deadlocks in Clustered DAGs. Parallel Computing 29, 795–820 (2003)
Kwok, Y.K., Ahmad, I.: Benchmarking and Comparison of the Task Graph Scheduling Algorithms. J. Parallel and Distributed Computing 59(3), 381–422 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Zhao, M., Zhang, T. (2005). A Heuristic for Scheduling Parallel Programs with Synchronous Communication Model in the Network Computing Environments. In: Jin, H., Reed, D., Jiang, W. (eds) Network and Parallel Computing. NPC 2005. Lecture Notes in Computer Science, vol 3779. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11577188_38
Download citation
DOI: https://doi.org/10.1007/11577188_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29810-6
Online ISBN: 978-3-540-32246-7
eBook Packages: Computer ScienceComputer Science (R0)