Scheduling loosely connected task graphs

Author： Ranade A.G.  

Publisher： Elsevier

ISSN： 0022-0000

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

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

A new strategy for multiprocessor scheduling of cyclic task graphs

By Sandnes Frode E.   Sinnen Oliver  

International Journal of High Performance Computing and Networking, Vol. 3, Iss. 1, 2005-09 ,pp. : 62-71

Inderscience Publishers

Access to resources Recommend Favorite

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

By Alkaya Ali   Topcuoglu Haluk  

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

Springer Publishing Company

Access to resources Recommend Favorite

Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip

By Lombardi Michele   Milano Michela   Ruggiero Martino   Benini Luca  

Journal of Scheduling, Vol. 13, Iss. 4, 2010-08 ,pp. : 315-345

Springer Publishing Company

Access to resources Recommend Favorite

A COMPARISON OF LIST SCHEDULING HEURISTICS FOR COMMUNICATION INTENSIVE TASK GRAPHS

By Macey Benjamin S.   Zomaya Albert Y.  

Cybernetics and Systems, Vol. 28, Iss. 7, 1997-10 ,pp. : 535-546

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm

By Kwok Y-K.   Ahmad I.  

Journal of Parallel and Distributed Computing, Vol. 47, Iss. 1, 1997-11 ,pp. : 58-77

Academic Press

Access to resources Recommend Favorite