A task scheduling algorithm for arbitrarily-connected processors with awareness of link contention

ISSN： 1386-7857

Source： Cluster Computing, Vol.9, Iss.4, 2006-10, pp. : 417-431

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors

By Kwok Yu-Kwong Ahmad Ishfaq

Cluster Computing, Vol. 3, Iss. 2, 2000-09 ,pp. : 113-124

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling loosely connected task graphs

By Ranade A.G.

Journal of Computer and System Sciences, Vol. 67, Iss. 1, 2003-08 ,pp. : 198-208

Elsevier

Access to resources Recommend Favorite

An efficient deterministic parallel algorithm for two processors precedence constraint scheduling

By Jung H. Serna M. Spirakis P.

Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. : 639-652

Elsevier

Access to resources Recommend Favorite

A Bipartite Genetic Algorithm for Multi-processor Task Scheduling

By Bonyadi Mohammad Ebrahimi Moghaddam Mohsen

International Journal of Parallel Programming, Vol. 37, Iss. 5, 2009-10 ,pp. : 462-487

Springer Publishing Company

Access to resources Recommend Favorite

The study of grid task scheduling based on AFSA algorithm

By Chen Ke Li San-Si

International Journal of Computer Applications in Technology, Vol. 44, Iss. 2, 2012-08 ,pp. : 145-151

Inderscience Publishers

Access to resources Recommend Favorite