Provably good multiprocessor scheduling with resource sharing

Andersson, Björn; Easwaran, Arvind

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

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ART_BjornAndersson_2010_CISTER.pdf		308.14 KB	Adobe PDF	Download

Send Feedback

Authors

Andersson, Björn

Easwaran, Arvind

Abstract(s)

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.

Keywords

Multiprocessor scheduling with resource sharing Competitive ratio for multiprocessor resource sharing

URI

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

Publisher

Springer

DOI

10.1007/s11241-010-9105-6

Collections

ISEP – CISTER – Artigos

Altmetrics

Full item page

Provably good multiprocessor scheduling with resource sharing

Authors

Advisor(s)

Abstract(s)

Description

Keywords

URI

Pedagogical Context

Citation

Research Projects

Organizational Units

Journal Issue

Publisher

DOI

Collections

CC License

Altmetrics