Dynamic scheduling of real-time tasks, by assignment

Babak Hamidzadeh; Yacine Atif

doi:10.1109/4434.736402

Dynamic scheduling of real-time tasks, by assignment

Babak Hamidzadeh, Yacine Atif

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

7 Citations (Scopus)

Abstract

To dynamically schedule realtime tasks on a NUMA architecture, the RT-SADS algorithm emphasizes appropriate processor assignment rather than task sequencing. It minimizes scheduling overhead and task deadline violations by directly controlling scheduling time and coordinating it with task execution.

Original language	English
Pages (from-to)	14-25
Number of pages	12
Journal	IEEE Concurrency
Volume	6
Issue number	4
DOIs	https://doi.org/10.1109/4434.736402
Publication status	Published - Oct 1998
Externally published	Yes

ASJC Scopus subject areas

General Engineering

Access to Document

10.1109/4434.736402

Cite this

@article{f0f90342929944cdb4c19bf2cc9d24a8,

title = "Dynamic scheduling of real-time tasks, by assignment",

abstract = "To dynamically schedule realtime tasks on a NUMA architecture, the RT-SADS algorithm emphasizes appropriate processor assignment rather than task sequencing. It minimizes scheduling overhead and task deadline violations by directly controlling scheduling time and coordinating it with task execution.",

author = "Babak Hamidzadeh and Yacine Atif",

year = "1998",

month = oct,

doi = "10.1109/4434.736402",

language = "English",

volume = "6",

pages = "14--25",

journal = "IEEE Concurrency",

issn = "1092-3063",

publisher = "IEEE Computer Society",

number = "4",

}

TY - JOUR

T1 - Dynamic scheduling of real-time tasks, by assignment

AU - Hamidzadeh, Babak

AU - Atif, Yacine

PY - 1998/10

Y1 - 1998/10

N2 - To dynamically schedule realtime tasks on a NUMA architecture, the RT-SADS algorithm emphasizes appropriate processor assignment rather than task sequencing. It minimizes scheduling overhead and task deadline violations by directly controlling scheduling time and coordinating it with task execution.

AB - To dynamically schedule realtime tasks on a NUMA architecture, the RT-SADS algorithm emphasizes appropriate processor assignment rather than task sequencing. It minimizes scheduling overhead and task deadline violations by directly controlling scheduling time and coordinating it with task execution.

UR - https://www.scopus.com/pages/publications/0032179737

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

U2 - 10.1109/4434.736402

DO - 10.1109/4434.736402

M3 - Article

AN - SCOPUS:0032179737

SN - 1092-3063

VL - 6

SP - 14

EP - 25

JO - IEEE Concurrency

JF - IEEE Concurrency

IS - 4

ER -

Dynamic scheduling of real-time tasks, by assignment

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this