Provably good multiprocessor scheduling with resource sharing

  • Authors:
  • Björn Andersson;Arvind Easwaran

  • Affiliations:
  • CISTER/IPP-HURRAY, Polytechnic Institute of Porto, Porto, Portugal;CISTER/IPP-HURRAY, Polytechnic Institute of Porto, Porto, Portugal

  • Venue:
  • Real-Time Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.