Dynamic Scheduling of Real-Time Tasks, by Assignment

Authors:
Babak Hamidzadeh;Yacine Atif
Affiliations:
-;-
Venue:
IEEE Concurrency
Year:
1998

Citing 9
Cited 3

Scheduling Tasks with Resource Requirements in Hard Real-Time Systems

IEEE Transactions on Software Engineering
Preemptive scheduling under time and resource constraints

IEEE Transactions on Computers - Special Issue on Real-Time Systems
Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints

Journal of Systems and Software
Scheduling N jobs on one machine with insert-idle-time constraints

IEA/AIE '89 Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
To Schedule or to Execute: Decision Support and PerformanceImplications

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

Computer
Resource Reclaiming in Multiprocessor Real-Time Systems

IEEE Transactions on Parallel and Distributed Systems
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT

FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT

Static Analysis and Dynamic Steering of Time-Dependent Systems

IEEE Transactions on Software Engineering
Scheduling of a meta-task with QoS requirements in heterogeneous computing systems

Journal of Parallel and Distributed Computing
Performance evaluation of deadline-based and laxity-based scheduling algorithms in real-time multiprocessor environments

ISTASC'06 Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequencing and assignment are two important issues we need to address when scheduling real-time tasks on a multiprocessor architecture. Different problem represen-tations can schedule such tasks, each emphasizing either a sequencing or assignment task. A sequence-oriented representation satisfies problem constraints by emphasizing the search for an appropriate tasks order, while an as-signment- oriented representation emphasizes the search for an appropriate assignment of tasks. The authors introduce the RT-SADS algorithm, which uses an assignment-oriented representation to dynamically schedule tasks on the processors of a NUMA architecture. The proposed technique automatically controls and allocates the scheduling time to minimize the scheduling overhead and deadline violation of real-time tasks. The authors compare RT-SADS' performance with another dynamic algorithm that uses a sequence-oriented repre-sentation. The results show interesting performance trade-offs among the candidate algorithms.