Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing...

Full description

Bibliographic Details
Main Author: Raravi, Gurulingesh (author)
Other Authors: Andersson, Björn (author), Nélis, Vincent (author), Bletsas, Konstantinos (author)
Format: article
Language:eng
Published: 2015
Subjects:
Heterogeneous multiprocessors
Real-time scheduling
Resource augmentation bound
Online Access:http://hdl.handle.net/10400.22/5405
Country:Portugal
Oai:oai:recipp.ipp.pt:10400.22/5405

Internet

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

Similar Items