Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
Stack-based scheduling for realtime processes
Real-Time Systems
An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Allocating fixed-priority periodic tasks on multiprocessor systems
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling
Real-Time Systems
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
New Results on Fixed Priority Aperiodic Servers
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
An Efficient RMS Admission Control and its Application to Multiprocessor Scheduling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Algorithms
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
The partitioned dynamic-priority scheduling of sporadic task systems
Real-Time Systems
Portioned EDF-based scheduling on multiprocessors
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Real-time synchronization on distributed architecture with Ada-2005
Proceedings of the 2008 ACM annual international conference on SIGAda annual international conference
Deadline Monotonic Scheduling on Uniform Multiprocessors
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Overview of Multicore Requirements towards Real-Time Communication
SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Efficiently migrating real-time systems to multi-cores
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Provably good multiprocessor scheduling with resource sharing
Real-Time Systems
Partitioning real-time systems on multiprocessors with shared resources
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Sharing resources among independently-developed systems on multi-cores
ACM SIGBED Review
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Real-time task scheduling on heterogeneous two-processor systems
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Real-time scheduling with resource sharing on uniform multiprocessors
Proceedings of the 20th International Conference on Real-Time and Network Systems
Proceedings of the 20th International Conference on Real-Time and Network Systems
A semi-partitioned approach for parallel real-time scheduling
Proceedings of the 20th International Conference on Real-Time and Network Systems
Partitioned EDF scheduling on a few types of unrelated multiprocessors
Real-Time Systems
Partitioned scheduling of multimode multiprocessor real-time systems with temporal isolation
Proceedings of the 21st International conference on Real-Time Networks and Systems
Partitioned EDF scheduling: a closer look
Real-Time Systems
| Hi-index | 0.00 |
The utilization bound for earliest deadline first (EDF) scheduling is extended from uniprocessors to homogeneous multiprocessor systems with partitioning strategies. First results are provided for a basic task model, which includes periodic and independent tasks with deadlines equal to periods. Since the multiprocessor utilization bounds depend on the allocation algorithm, different allocation algorithms have been considered, ranging from simple heuristics to optimal allocation algorithms. As multiprocessor utilization bounds for EDF scheduling depend strongly on task sizes, all these bounds have been obtained as a function of a parameter which takes task sizes into account. Theoretically, the utilization bounds for multiprocessor EDF scheduling can be considered a partial solution to the bin-packing problem, which is known to be NP-complete. The basic task model is extended to include resource sharing, release jitter, deadlines less than periods, aperiodic tasks, non-preemptive sections, context switches, and mode changes.