Contention-Free Executions for Real-Time Multiprocessor Scheduling

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 278
  • Download : 2
A time slot is defined as contention-free if the number of jobs with remaining executions in the slot is no larger than the number of processors, or contending, otherwise. Then an important property holds that in any contention-free slot, all jobs with remaining executions are guaranteed to be scheduled as long as the scheduler is work-conserving. This article aims at improving schedulability by utilizing the contention-free slots. To achieve this, this article presents a policy (called CF policy) that moves some job executions from contending slots to contention-free ones. This policy can be employed by any work-conserving, preemptive scheduling algorithm, and we show that any algorithm extended with this policy dominates the original algorithm in terms of schedulability. We also present improved schedulability tests for algorithms that employ this policy, based on the observation that interference from jobs is reduced when their executions are postponed to contention-free slots. Simulation results demonstrate that the CF policy, incorporated into existing algorithms, significantly improves schedulability of those existing algorithms.
Publisher
ASSOC COMPUTING MACHINERY
Issue Date
2014-01
Language
English
Article Type
Article
Keywords

PERIODIC TASK SYSTEMS; SCHEDULABILITY ANALYSIS; ALGORITHMS; PLATFORMS; BOUNDS

Citation

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, v.13, no.sup.2

ISSN
1539-9087
DOI
10.1145/2494530
URI
http://hdl.handle.net/10203/190085
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0