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

Author： Fisher Nathan Goossens Joël Baruah Sanjoy

ISSN： 0922-6443

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

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

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

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

A Technique for Adaptive Scheduling of Soft Real-Time Tasks

By Beccari G. Caselli S. Zanichelli F.

Real-Time Systems, Vol. 30, Iss. 3, 2005-07 ,pp. : 187-215

Springer Publishing Company

Access to resources Recommend Favorite

Improved real‐time scheduling of periodic tasks on multiprocessors

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 9, 2015-06 ,pp. : 2291-2309

John Wiley & Sons Inc

Access to resources Recommend Favorite