Skip to main content
Conference ProceedingsOPEN ACCESS

A heuristic for scheduling parallel programs with synchronous communication model in the network computing environments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3779 LNCS 270-273
DOI: 10.1007/11577188_38
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Zhao, M., & Zhang, T. (2005). A heuristic for scheduling parallel programs with synchronous communication model in the network computing environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3779 LNCS, pp. 270–273). https://doi.org/10.1007/11577188_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free