Non-Clairvoyant Scheduling for Minimizing Mean Slowdown

Author： Bansal Nikhil Dhamdhere Kedar Könemann Jochen Sinha Amitabh

ISSN： 0178-4617

Source： Algorithmica, Vol.40, Iss.4, 2004-09, pp. : 305-318

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

Related content

Non‐clairvoyant reduction algorithms for heterogeneous platforms

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 6, 2015-04 ,pp. : 1612-1624

John Wiley & Sons Inc

Access to resources Recommend Favorite

An Analysis of Totally Clairvoyant Scheduling

By Subramani K.

Journal of Scheduling, Vol. 8, Iss. 2, 2005-04 ,pp. : 113-133

Springer Publishing Company

Access to resources Recommend Favorite

Erratum: An Analysis of Totally Clairvoyant Scheduling

By Subramani K.

Journal of Scheduling, Vol. 8, Iss. 6, 2005-12 ,pp. : 551-552

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing Makespan in Batch Machine Scheduling

By Poon Chung Keung Zhang Pixing

Algorithmica, Vol. 39, Iss. 2, 2004-02 ,pp. : 155-174

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing migrations in fair multiprocessor scheduling of persistent tasks

By Kimbrel Tracy Schieber Baruch Sviridenko Maxim

Journal of Scheduling, Vol. 9, Iss. 4, 2006-08 ,pp. : 365-379

Springer Publishing Company

Access to resources Recommend Favorite