Andersson, BjörnEaswaran, Arvind2014-02-122014-02-1220100922-64431573-1383http://hdl.handle.net/10400.22/3850We 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.engMultiprocessor scheduling with resource sharingCompetitive ratio for multiprocessor resource sharingjournal article10.1007/s11241-010-9105-6