A COMPARISON OF LIST SCHEDULING HEURISTICS FOR COMMUNICATION INTENSIVE TASK GRAPHS

Author： Macey Benjamin S.   Zomaya Albert Y.  

Publisher： Taylor & Francis Ltd

ISSN： 1087-6553

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

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

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

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

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

By Musitelli Antoine  

Journal of Scheduling, Vol. 14, Iss. 1, 2011-02 ,pp. : 89-101

Springer Publishing Company

Access to resources Recommend Favorite

Heuristics for Scheduling Data Requests Using Collective Communications in a Distributed Communication Network

By Theys M.D.   Siegel H.J.   Chong E.K.P.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 9, 2001-09 ,pp. : 1337-1366

Academic Press

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