Partitioned scheduling of implicit-deadline sporadic task systems under multiple resource constraints

Bipasa Chattopadhyay; Sanjoy Baruah

doi:10.1109/RTCSA.2012.27

Partitioned scheduling of implicit-deadline sporadic task systems under multiple resource constraints

Bipasa Chattopadhyay
, Sanjoy Baruah

Department of Computer Science & Engineering

Research output: Contribution to conference › Paper › peer-review

1 Scopus citations

Abstract

On many multiprocessor platforms each individual processor may have limited amounts of several different kinds of resources such as computing capacity, local memory, and network bandwidth. In order to partition tasks effectively upon such platforms the partitioning algorithm should be cognizant of all the resource constraints. We present and evaluate an algorithm for partitioning a collection of implicit-deadline sporadic tasks upon a multiprocessor platform in a manner that is cognizant of multiple such resource constraints.

Original language	English
Pages	144-153
Number of pages	10
DOIs	https://doi.org/10.1109/RTCSA.2012.27
State	Published - 2012
Event	18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012 - Seoul, Korea, Republic of Duration: Aug 19 2012 → Aug 22 2012

Conference

Conference	18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012
Country/Territory	Korea, Republic of
City	Seoul
Period	08/19/12 → 08/22/12

Access to Document

10.1109/RTCSA.2012.27

Cite this

@conference{8aac880c47834ffdbfc2bfe93ad61c91,

title = "Partitioned scheduling of implicit-deadline sporadic task systems under multiple resource constraints",

abstract = "On many multiprocessor platforms each individual processor may have limited amounts of several different kinds of resources such as computing capacity, local memory, and network bandwidth. In order to partition tasks effectively upon such platforms the partitioning algorithm should be cognizant of all the resource constraints. We present and evaluate an algorithm for partitioning a collection of implicit-deadline sporadic tasks upon a multiprocessor platform in a manner that is cognizant of multiple such resource constraints.",

author = "Bipasa Chattopadhyay and Sanjoy Baruah",

year = "2012",

doi = "10.1109/RTCSA.2012.27",

language = "English",

pages = "144--153",

note = "18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012 ; Conference date: 19-08-2012 Through 22-08-2012",

}

Partitioned scheduling of implicit-deadline sporadic task systems under multiple resource constraints. / Chattopadhyay, Bipasa; Baruah, Sanjoy.
2012. 144-153 Paper presented at 18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012, Seoul, Korea, Republic of.

Research output: Contribution to conference › Paper › peer-review

TY - CONF

T1 - Partitioned scheduling of implicit-deadline sporadic task systems under multiple resource constraints

AU - Chattopadhyay, Bipasa

AU - Baruah, Sanjoy

PY - 2012

Y1 - 2012

N2 - On many multiprocessor platforms each individual processor may have limited amounts of several different kinds of resources such as computing capacity, local memory, and network bandwidth. In order to partition tasks effectively upon such platforms the partitioning algorithm should be cognizant of all the resource constraints. We present and evaluate an algorithm for partitioning a collection of implicit-deadline sporadic tasks upon a multiprocessor platform in a manner that is cognizant of multiple such resource constraints.

AB - On many multiprocessor platforms each individual processor may have limited amounts of several different kinds of resources such as computing capacity, local memory, and network bandwidth. In order to partition tasks effectively upon such platforms the partitioning algorithm should be cognizant of all the resource constraints. We present and evaluate an algorithm for partitioning a collection of implicit-deadline sporadic tasks upon a multiprocessor platform in a manner that is cognizant of multiple such resource constraints.

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

U2 - 10.1109/RTCSA.2012.27

DO - 10.1109/RTCSA.2012.27

M3 - Paper

AN - SCOPUS:84869049166

SP - 144

EP - 153

T2 - 18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012

Y2 - 19 August 2012 through 22 August 2012

ER -

Partitioned scheduling of implicit-deadline sporadic task systems under multiple resource constraints

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this