Partitioning real-time tasks among heterogeneous multiprocessors

Sanjoy K. Baruah

doi:10.1109/icpp.2004.1327956

Partitioning real-time tasks among heterogeneous multiprocessors

Sanjoy K. Baruah

Department of Computer Science & Engineering

Research output: Contribution to journal › Conference article › peer-review

62 Scopus citations

Abstract

Given a collection of tasks that comprise the software for a real-time system, and a collection of available processing units of different kinds upon which to execute them, the heterogeneous multiprocessor partitioning problem is concerned with determining whether the given tasks can be partitioned among the available processing units in such a manner that all timing constraints are met. It is known that this problem is intractable; efficient implementations of sufficient (albeit not necessary) partitioning algorithms are presented here, and proved correct.

Original language	English
Pages (from-to)	467-474
Number of pages	8
Journal	Proceedings of the International Conference on Parallel Processing
DOIs	https://doi.org/10.1109/icpp.2004.1327956
State	Published - 2004
Event	Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004 - Montreal, Que, Canada Duration: Aug 15 2004 → Aug 18 2004

Access to Document

10.1109/icpp.2004.1327956

Cite this

@article{b5030667e1ca4ffabb992ea366db5caf,

title = "Partitioning real-time tasks among heterogeneous multiprocessors",

abstract = "Given a collection of tasks that comprise the software for a real-time system, and a collection of available processing units of different kinds upon which to execute them, the heterogeneous multiprocessor partitioning problem is concerned with determining whether the given tasks can be partitioned among the available processing units in such a manner that all timing constraints are met. It is known that this problem is intractable; efficient implementations of sufficient (albeit not necessary) partitioning algorithms are presented here, and proved correct.",

author = "Baruah, \{Sanjoy K.\}",

year = "2004",

doi = "10.1109/icpp.2004.1327956",

language = "English",

pages = "467--474",

journal = "Proceedings of the International Conference on Parallel Processing",

issn = "0190-3918",

note = "Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004 ; Conference date: 15-08-2004 Through 18-08-2004",

}

TY - JOUR

T1 - Partitioning real-time tasks among heterogeneous multiprocessors

AU - Baruah, Sanjoy K.

PY - 2004

Y1 - 2004

N2 - Given a collection of tasks that comprise the software for a real-time system, and a collection of available processing units of different kinds upon which to execute them, the heterogeneous multiprocessor partitioning problem is concerned with determining whether the given tasks can be partitioned among the available processing units in such a manner that all timing constraints are met. It is known that this problem is intractable; efficient implementations of sufficient (albeit not necessary) partitioning algorithms are presented here, and proved correct.

AB - Given a collection of tasks that comprise the software for a real-time system, and a collection of available processing units of different kinds upon which to execute them, the heterogeneous multiprocessor partitioning problem is concerned with determining whether the given tasks can be partitioned among the available processing units in such a manner that all timing constraints are met. It is known that this problem is intractable; efficient implementations of sufficient (albeit not necessary) partitioning algorithms are presented here, and proved correct.

UR - https://www.scopus.com/pages/publications/10044294927

U2 - 10.1109/icpp.2004.1327956

DO - 10.1109/icpp.2004.1327956

M3 - Conference article

AN - SCOPUS:10044294927

SN - 0190-3918

SP - 467

EP - 474

JO - Proceedings of the International Conference on Parallel Processing

JF - Proceedings of the International Conference on Parallel Processing

T2 - Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004

Y2 - 15 August 2004 through 18 August 2004

ER -

Partitioning real-time tasks among heterogeneous multiprocessors

Abstract

Access to Document

Other files and links

Fingerprint

Cite this