JOURNAL ARTICLE

Multiprocessor scheduling of periodic tasks in a hard real-time environment

Abstract

Preemptive scheduling a set of periodic tasks on multiprocessors is studied from the point of view of meeting their service requirements before given deadlines. Sufficient conditions permitting full utilization of the multiprocessor using the given scheduling algorithm are derived. Complexity of the scheduling algorithms including upper bounds on the number of preemptions are derived. Schemes (with little run-time cost) for on-line handling of tasks' arrival and exit are given.< >

Keywords:
Computer science Scheduling (production processes) Multiprocessor scheduling Multiprocessing Parallel computing Processor scheduling Dynamic priority scheduling Distributed computing Rate-monotonic scheduling Mathematical optimization Quality of service Mathematics Operating system Computer network Schedule

Metrics

8
Cited By
0.72
FWCI (Field Weighted Citation Impact)
8
Refs
0.72
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Real-Time Systems Scheduling
Physical Sciences →  Computer Science →  Hardware and Architecture
Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Distributed and Parallel Computing Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

© 2026 ScienceGate Book Chapters — All rights reserved.