A comparative study of online scheduling algorithms for networks of workstations

Author： Arndt Olaf   Freisleben Bernd   Kielmann Thilo   Thilo Frank  

Publisher： Springer Publishing Company

ISSN： 1386-7857

Source： Cluster Computing, Vol.3, Iss.2, 2000-09, pp. : 95-112

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

Parallel Application Scheduling on Networks of Workstations

By Anastasiadis S.V.   Sevcik K.C.  

Journal of Parallel and Distributed Computing, Vol. 43, Iss. 2, 1997-06 ,pp. : 109-124

Academic Press

Access to resources Recommend Favorite

A Comparative Study of Cost Effective Multiplexing Approaches for Online Permutation Embedding and Scheduling in Optical Networks

By Qiao C.   Mei Y.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 1, 2001-01 ,pp. : 1-17

Academic Press

Access to resources Recommend Favorite

Efficient scheduling of MPI applications on networks of workstations

By Dantas M.A.R.   Zaluska E.J.  

Future Generation Computer Systems, Vol. 13, Iss. 6, 1998-05 ,pp. : 489-499

Elsevier

Access to resources Recommend Favorite

Metaheuristic Algorithms for Detect Communities in Social Networks: A Comparative Analysis Study

By  

International Journal of Rough Sets and Data Analysis (IJRSDA), Vol. 5, Iss. 2, 2018-04 ,pp. : 25-45

IGI Global_journal

Access to resources Recommend Favorite

Semi-Online Algorithms for Parallel Machine Scheduling Problems

By Dósa G.   He Y.  

Computing, Vol. 72, Iss. 3-4, 2004-06 ,pp. : 355-363

Springer Publishing Company

Access to resources Recommend Favorite