NDLI: Real-time scheduling with resource sharing on heterogeneous multiprocessors

Please wait, while we are loading the content...

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Content Provider	Springer Nature Link
Author	Andersson, Björn Raravi, Gurulingesh
Copyright Year	2014
Abstract	Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m $_{ k }$ processors of type-k, where k∈{1,2,…,t}. The execution time of a task depends on the type of processor on which it executes. The set of shared resources is denoted by R. For each task τ $_{ i }$, there is a resource set R $_{ i }$⊆R such that for each job of τ $_{ i }$, during one phase of its execution, the job requests to hold the resource set R $_{ i }$ exclusively with the interpretation that (i) the job makes a single request to hold all the resources in the resource set R $_{ i }$ and (ii) at all times, when a job of τ $_{ i }$ holds R $_{ i }$, no other job holds any resource in R $_{ i }$. Each job of task τ $_{ i }$ may request the resource set R $_{ i }$ at most once during its execution. A job is allowed to migrate when it requests a resource set and when it releases the resource set but a job is not allowed to migrate at other times. Our goal is to design a scheduling algorithm for this problem and prove its performance.We propose an algorithm, LP-EE-vpr, which offers the guarantee that if an implicit-deadline sporadic task set is schedulable on a t-type heterogeneous multiprocessor platform by an optimal scheduling algorithm that allows a job to migrate only when it requests or releases a resource set, then our algorithm also meets the deadlines with the same restriction on job migration, if given processors $4 \times (1 + \operatorname{MAXP}\times \lceil \frac{\vert P\vert \times\operatorname{MAXP}}{\min \{m_{1}, m_{2}, \ldots, m_{t} \}} \rceil )$ times as fast. (Here $\operatorname{MAXP}$ and \|P\| are computed based on the resource sets that tasks request.) For the special case that each task requests at most one resource, the bound of LP-EE-vpr collapses to $4 \times (1 + \lceil \frac{\vert R\vert }{\min \{m_{1}, m_{2}, \ldots, m_{t} \}} \rceil )$ . To the best of our knowledge, LP-EE-vpr is the first algorithm with proven performance guarantee for real-time scheduling of sporadic tasks with resource sharing on t-type heterogeneous multiprocessors.
Starting Page	270
Ending Page	314
Page Count	45
File Format	PDF
ISSN	09226443
Journal	Real-Time Systems
Volume Number	50
Issue Number	2
e-ISSN	15731383
Language	English
Publisher	Springer US
Publisher Date	2014-01-16
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Heterogeneous multiprocessors Real-time scheduling Resource sharing Computer Systems Organization and Communication Networks Communications Engineering, Networks Special Purpose and Application-Based Systems Performance and Reliability Control, Robotics, Mechatronics
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Computer Networks and Communications Control and Systems Engineering Electrical and Electronic Engineering Computer Science Applications Modeling and Simulation

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Task assignment algorithms for two-type heterogeneous multiprocessors

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

Resource sharing among real-time components under multiprocessor clustered scheduling

Compositional multiprocessor scheduling: the GMPR interface

Generalized tardiness bounds for global multiprocessor scheduling

Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Analysis and implementation of the multiprocessor bandwidth inheritance protocol

Provably good multiprocessor scheduling with resource sharing

Global EDF scheduling for parallel real-time tasks

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Similar Documents

Task assignment algorithms for two-type heterogeneous multiprocessors

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

Resource sharing among real-time components under multiprocessor clustered scheduling

Compositional multiprocessor scheduling: the GMPR interface

Generalized tardiness bounds for global multiprocessor scheduling

Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Analysis and implementation of the multiprocessor bandwidth inheritance protocol

Provably good multiprocessor scheduling with resource sharing

Global EDF scheduling for parallel real-time tasks

Real-time scheduling with resource sharing on heterogeneous multiprocessors