Partitioned Aperiodic Scheduling on Multiprocessors

Andersson, Bj\uf6rn
Abdelzaher, T.
Jonsson, Jan

Open link

Publication date

January 2003

DOI

10.1109/IPDPS.2003.1213083

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Abstract

This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0.31. No algorithm for tasks without migration capabilities can have a capacity bound greater than 0.50

Extracted data

We use cookies to provide a better user experience.

Data Protection

Partitioned Aperiodic Scheduling on Multiprocessors

Abstract

Extracted data

Partitioned Aperiodic Scheduling on Multiprocessors

Abstract

Extracted data

Related items

Related items