Provably Good Multiprocessor Scheduling with Resource Sharing
Ref: HURRAY-TR-100901 Publication Date: Oct 2010
Provably Good Multiprocessor Scheduling with Resource Sharing
Ref: HURRAY-TR-100901 Publication Date: Oct 2010Abstract:
We present a 12(1+3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources.
Björn Andersson
Arvind EaswaranDocument:
View
DownloadPublished in Real-Time Systems Journal, Springer US, Volume 64, Issue 2, pp 153-156.
DOI:10.1007/s11241-010-9105-6.
WOS ID: 000281902000001.
Record Date: 9, Sep, 2010
Short links for this page: www.cister.isep.pt/docs/10_1007_s11241_010_9105_6_ www.cister.isep.pt/docs/000281902000001_ www.cister.isep.pt/docs/hurray_tr_100901 www.cister.isep.pt/docs/574