The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks

Author： Angelelli E.   Nagy Á.B.   Speranza M.G.   Tuza Zs.  

Publisher： Springer Publishing Company

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.7, Iss.6, 2004-11, pp. : 421-428

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

On-line scheduling of scalable real-time tasks on multiprocessor systems

By Lee W.Y.   Hong S.J.   Kim J.  

Journal of Parallel and Distributed Computing, Vol. 63, Iss. 12, 2003-12 ,pp. : 1315-1324

Elsevier

Access to resources Recommend Favorite

Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

By Fisher Nathan   Goossens Joël   Baruah Sanjoy  

Real-Time Systems, Vol. 45, Iss. 1-2, 2010-06 ,pp. : 26-71

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

An evolutionary approach to multiprocessor scheduling of dependent tasks

By Nossal R.  

Future Generation Computer Systems, Vol. 14, Iss. 5, 1998-12 ,pp. : 383-392

Elsevier

Access to resources Recommend Favorite

On-Line Algorithms for the Dynamic Traveling Repair Problem: Special Issue on Scheduling

By Irani Sandy   Lu Xiangwen   Regan Amelia  

Journal of Scheduling, Vol. 7, Iss. 3, 2004-05 ,pp. : 243-258

Springer Publishing Company

Access to resources Recommend Favorite