A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

Author： Bonifaci Vincenzo   Marchetti-Spaccamela Alberto   Stiller Sebastian  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 1034-1049

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

An Optimal Multiprocessor Real-Time Scheduling Algorithm

By Khemka A.   Shyamasundar R.K.  

Journal of Parallel and Distributed Computing, Vol. 43, Iss. 1, 1997-05 ,pp. : 37-45

Academic Press

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

Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

By López J. M.   Díaz J. L.   García D. F.  

Real-Time Systems, Vol. 28, Iss. 1, 2004-10 ,pp. : 39-68

Springer Publishing Company

Access to resources Recommend Favorite

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

By Funk Shelby  

Real-Time Systems, Vol. 47, Iss. 5, 2011-09 ,pp. : 389-429

Springer Publishing Company

Access to resources Recommend Favorite

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