A Real-Time Scheduling Algorithm for Tasks with Shared Resources on Multiprocessor Systems 


Vol. 17,  No. 6, pp. 259-264, Dec.  2010
10.3745/KIPSTA.2010.17.6.259


PDF
  Abstract

In case of scheduling tasks with shared resources in multiprocessor systems. Global Earliest Deadline First (GEDF) algorithm, equally applied Earliest Deadline First (EDF) which runs scheduling with deadline criterion, makes schedulability decline because GEDF typically does not have a specific process in order to handle tasks with shared resources. In this paper, we propose Earliest Deadline First with Partitioning (EDFP) for tasks with shared resources which partitions a task into two kinds of subtasks that include critical sections to access to shared resources, gives their own deadline respectively and manages them. As a result of simulations. EDFP shows better performance than GEDF for tasks with shared resources since system load goes up and the number of processor increases.

  Statistics
  Cite this article

[IEEE Style]

S. T. Lee, "A Real-Time Scheduling Algorithm for Tasks with Shared Resources on Multiprocessor Systems," The KIPS Transactions:PartA, vol. 17, no. 6, pp. 259-264, 2010. DOI: 10.3745/KIPSTA.2010.17.6.259.

[ACM Style]

Sang Tae Lee. 2010. A Real-Time Scheduling Algorithm for Tasks with Shared Resources on Multiprocessor Systems. The KIPS Transactions:PartA, 17, 6, (2010), 259-264. DOI: 10.3745/KIPSTA.2010.17.6.259.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals