A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)pro...

Full description

Bibliographic Details
Main Author: Raravi, Gurulingesh (author)
Other Authors: Andersson, Björn (author), Bletsas, Konstantinos (author)
Format: report
Language:eng
Published: 2014
Subjects:
Heterogeneous multiprocessor
Task migrations
Real-time scheduling
Online Access:http://hdl.handle.net/10400.22/3742
Country:Portugal
Oai:oai:recipp.ipp.pt:10400.22/3742

Internet

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

Similar Items