Provably good multiprocessor scheduling with resource sharing

Björn Andersson; Arvind Easwaran

doi:10.1007/s11241-010-9105-6

Provably good multiprocessor scheduling with resource sharing

Björn Andersson, Arvind Easwaran^*

^*Corresponding author for this work

Institute of Engineering of Porto

Research output: Contribution to journal › Article › peer-review

14 Citations (Scopus)

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.

Original language	English
Pages (from-to)	153-159
Number of pages	7
Journal	Real-Time Systems
Volume	46
Issue number	2
DOIs	https://doi.org/10.1007/s11241-010-9105-6
Publication status	Published - Oct 2010
Externally published	Yes

ASJC Scopus Subject Areas

Control and Systems Engineering
Modelling and Simulation
Computer Science Applications
Computer Networks and Communications
Control and Optimization
Electrical and Electronic Engineering

Keywords

Competitive ratio for multiprocessor resource sharing
Multiprocessor scheduling with resource sharing

Access to Document

10.1007/s11241-010-9105-6

Cite this

@article{319797c204754222b727248bdf5226c2,

title = "Provably good multiprocessor scheduling with resource sharing",

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.",

keywords = "Competitive ratio for multiprocessor resource sharing, Multiprocessor scheduling with resource sharing",

author = "Bj{\"o}rn Andersson and Arvind Easwaran",

year = "2010",

month = oct,

doi = "10.1007/s11241-010-9105-6",

language = "English",

volume = "46",

pages = "153--159",

journal = "Real-Time Systems",

issn = "0922-6443",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - Provably good multiprocessor scheduling with resource sharing

AU - Andersson, Björn

AU - Easwaran, Arvind

PY - 2010/10

Y1 - 2010/10

N2 - 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.

AB - 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.

KW - Competitive ratio for multiprocessor resource sharing

KW - Multiprocessor scheduling with resource sharing

UR - http://www.scopus.com/inward/record.url?scp=78049530086&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049530086&partnerID=8YFLogxK

U2 - 10.1007/s11241-010-9105-6

DO - 10.1007/s11241-010-9105-6

M3 - Article

AN - SCOPUS:78049530086

SN - 0922-6443

VL - 46

SP - 153

EP - 159

JO - Real-Time Systems

JF - Real-Time Systems

IS - 2

ER -

Provably good multiprocessor scheduling with resource sharing

Abstract

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this