An adaptive locality-conscious process scheduler for embedded systems

Guilin Chen, Guangyu Chen, Ozcan Ozturk, Mahmut Kandemir

Research output: Contribution to journalConference article

3 Citations (Scopus)

Abstract

A critical component of a real-time operating system (RTOS) is its process scheduler. While the prior research on process scheduling focuses mostly on meeting hard/soft deadlines, preemption and priory assignment related issues, problems arise from existence of cache memories are largely ignored. Focusing on data accesses and a cache based embedded system, this paper proposes an adaptive locality-conscious process scheduling algorithm. The main goal of the proposed algorithm is to exploit (reuse) the contents of the on-chip cache memory to the highest extent possible. The algorithm tries to achieve its goal by determining the order in which the processes get scheduled such that the successively-executing processes share a large number of data elements. We implemented our scheduler within a customized simulation platform and simulated it using a set of benchmark codes. Our experimental results reveal that the proposed scheduling algorithm is very successful in practice, and reduces process completion times significantly for both rate-monotonic scheduling (RMS) and earliest-deadline-first scheduling (EDF). We also explain how process code transformations can be used for increasing the savings achieved by the locality-conscious scheduler, and show how the proposed approach operates with a base scheduler such as RMS and EDF.

Original languageEnglish (US)
Pages (from-to)354-364
Number of pages11
JournalProceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS
StatePublished - Sep 26 2005
Event11th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2005 - San Francisco, CA, United States
Duration: Mar 7 2005Mar 10 2005

Fingerprint

Embedded systems
Scheduling
Cache memory
Scheduling algorithms

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

@article{09e90a5068b548559861eaaa3f2e0c1c,
title = "An adaptive locality-conscious process scheduler for embedded systems",
abstract = "A critical component of a real-time operating system (RTOS) is its process scheduler. While the prior research on process scheduling focuses mostly on meeting hard/soft deadlines, preemption and priory assignment related issues, problems arise from existence of cache memories are largely ignored. Focusing on data accesses and a cache based embedded system, this paper proposes an adaptive locality-conscious process scheduling algorithm. The main goal of the proposed algorithm is to exploit (reuse) the contents of the on-chip cache memory to the highest extent possible. The algorithm tries to achieve its goal by determining the order in which the processes get scheduled such that the successively-executing processes share a large number of data elements. We implemented our scheduler within a customized simulation platform and simulated it using a set of benchmark codes. Our experimental results reveal that the proposed scheduling algorithm is very successful in practice, and reduces process completion times significantly for both rate-monotonic scheduling (RMS) and earliest-deadline-first scheduling (EDF). We also explain how process code transformations can be used for increasing the savings achieved by the locality-conscious scheduler, and show how the proposed approach operates with a base scheduler such as RMS and EDF.",
author = "Guilin Chen and Guangyu Chen and Ozcan Ozturk and Mahmut Kandemir",
year = "2005",
month = "9",
day = "26",
language = "English (US)",
pages = "354--364",
journal = "Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS",
issn = "1545-3421",

}

An adaptive locality-conscious process scheduler for embedded systems. / Chen, Guilin; Chen, Guangyu; Ozturk, Ozcan; Kandemir, Mahmut.

In: Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS, 26.09.2005, p. 354-364.

Research output: Contribution to journalConference article

TY - JOUR

T1 - An adaptive locality-conscious process scheduler for embedded systems

AU - Chen, Guilin

AU - Chen, Guangyu

AU - Ozturk, Ozcan

AU - Kandemir, Mahmut

PY - 2005/9/26

Y1 - 2005/9/26

N2 - A critical component of a real-time operating system (RTOS) is its process scheduler. While the prior research on process scheduling focuses mostly on meeting hard/soft deadlines, preemption and priory assignment related issues, problems arise from existence of cache memories are largely ignored. Focusing on data accesses and a cache based embedded system, this paper proposes an adaptive locality-conscious process scheduling algorithm. The main goal of the proposed algorithm is to exploit (reuse) the contents of the on-chip cache memory to the highest extent possible. The algorithm tries to achieve its goal by determining the order in which the processes get scheduled such that the successively-executing processes share a large number of data elements. We implemented our scheduler within a customized simulation platform and simulated it using a set of benchmark codes. Our experimental results reveal that the proposed scheduling algorithm is very successful in practice, and reduces process completion times significantly for both rate-monotonic scheduling (RMS) and earliest-deadline-first scheduling (EDF). We also explain how process code transformations can be used for increasing the savings achieved by the locality-conscious scheduler, and show how the proposed approach operates with a base scheduler such as RMS and EDF.

AB - A critical component of a real-time operating system (RTOS) is its process scheduler. While the prior research on process scheduling focuses mostly on meeting hard/soft deadlines, preemption and priory assignment related issues, problems arise from existence of cache memories are largely ignored. Focusing on data accesses and a cache based embedded system, this paper proposes an adaptive locality-conscious process scheduling algorithm. The main goal of the proposed algorithm is to exploit (reuse) the contents of the on-chip cache memory to the highest extent possible. The algorithm tries to achieve its goal by determining the order in which the processes get scheduled such that the successively-executing processes share a large number of data elements. We implemented our scheduler within a customized simulation platform and simulated it using a set of benchmark codes. Our experimental results reveal that the proposed scheduling algorithm is very successful in practice, and reduces process completion times significantly for both rate-monotonic scheduling (RMS) and earliest-deadline-first scheduling (EDF). We also explain how process code transformations can be used for increasing the savings achieved by the locality-conscious scheduler, and show how the proposed approach operates with a base scheduler such as RMS and EDF.

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

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

M3 - Conference article

AN - SCOPUS:24944525945

SP - 354

EP - 364

JO - Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS

JF - Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS

SN - 1545-3421

ER -