Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of...

Full description

Bibliographic Details
Main Author: Andersson, Björn (author)
Other Authors: Raravi, Gurulingesh (author)
Format: article
Language:eng
Published: 2015
Subjects:
Algorithms
Performance
Theory
Cutting planes
Heterogeneous multiprocessors
Linear programming
Real-time scheduling
Online Access:http://hdl.handle.net/10400.22/5414
Country:Portugal
Oai:oai:recipp.ipp.pt:10400.22/5414

Internet

http://hdl.handle.net/10400.22/5414

Similar Items