HomeResearch TopicsApplication DriveProjectsPublicationsPeoplePhD StudiesNewsEvents & CfPInfo & Contacts
CiTechCiWorkCISTER DSSjoin us!Enjoy Porto!
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                       
Login
HomePublicationsTechnical ReportA 12*(1+R/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of R

sequentially-reusable shared resources
Ref: HURRAY-TR-100201       Publication Date: 3, Feb, 2010

A 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources

Ref: HURRAY-TR-100201       Publication Date: 3, Feb, 2010

Abstract:
We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources.

Authors:
Björn Andersson
,
Arvind Easwaran


Document:
View
PDF Download
PDF




Record Date: 3, Feb, 2010
Short links for this page: www.cister-labs.pt/docs/hurray_tr_100201 www.cister-labs.pt/docs/539
Previous Technical ReportNext Technical Report