An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform

Authors:
Ştefan Andrei;Albert M. K. Cheng;Gheorghe Grigoraş;Vlad Rădulescu
Affiliations:
Department of Computer Science, Lamar University, Beaumont, TX, USA;Computer Science Department, University of Houston, Houston, TX, USA;Department of Computer Science, Cuza University of Iaşi, Iaşi, Romania;Department of Computer Science, Cuza University of Iaşi, Iaşi, Romania
Venue:
International Journal of Grid and Utility Computing
Year:
2012

Citing 12
Cited 0

Scheduling multiprocessor tasks on three dedicated processors

Information Processing Letters
Complexity of scheduling multiprocessor tasks with prespecified processor allocations

Discrete Applied Mathematics
An approximation algorithm for scheduling on three dedicated machines

Discrete Applied Mathematics
Non-Preemptive Real-Time Scheduling of Multimedia Tasks

Real-Time Systems
Implications of Classical Scheduling Results for Real-Time Systems

Computer
Scheduling Independent Multiprocessor Tasks

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Real-Time Systems: Scheduling, Analysis, and Verification

Real-Time Systems: Scheduling, Analysis, and Verification
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT

FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors

Real-Time Systems
Optimal rate-based scheduling on multiprocessors

Journal of Computer and System Sciences
New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms

RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
An Efficient Scheduling Algorithm for the Multiprocessor Platform

SYNASC '10 Proceedings of the 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a task set T, determining the number of processors leading to a feasible schedule for T is an important problem in the real-time embedded systems community. For periodic and independent task sets, the utilisation rate represents a lower bound on the number of processors. Estimation on the lower bound of the number of processors for a single-instance task set was recently presented by Andrei et al. The contribution of this paper is twofold. First, given a single-instance, non-preemptive and independent task set, we improve the lower bound on the number of processors described by Andrei et al., such that there exist no feasible schedules on a multiprocessor platform with fewer processors than this new lower bound. Second, we provide an improved efficient algorithm that finds a feasible schedule of a single-instance non-preemptive and independent task set on a multiprocessor platform, compared to the one from Andrei et al.'s, accompanied by a correctness and complexity result.