Scalable Resource Allocation for Multi-Processor QoS Optimization
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Rate-Monotonic Scheduling on Uniform Multiprocessors
IEEE Transactions on Computers
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
An EDF schedulability test for periodic tasks on reconfigurable hardware devices
Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
A fuzzy algorithm for scheduling periodic tasks on multiprocessor soft real-time systems
MS'06 Proceedings of the 17th IASTED international conference on Modelling and simulation
Adapting Pfair scheduling for symmetric multiprocessors
Journal of Embedded Computing - Cache exploitation in embedded systems
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%
Proceedings of the 2008 ACM symposium on Applied computing
ISTASC'06 Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation
A dual-priority real-time multiprocessor system on FPGA for automotive applications
Proceedings of the conference on Design, automation and test in Europe
Deadline Monotonic Scheduling on Uniform Multiprocessors
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
System level performance analysis for real-time automotive multicore and network architectures
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An optimal solution for the heterogeneous multiprocessor single-level voltage-setup problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Supporting execution on multiprocessor platforms
ACM SIGAda Ada Letters
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Real-time scheduling using regularity criteria and a geometrical approach
International Journal of Critical Computer-Based Systems
Polyhedra-Based approach for incremental validation of real-time systems
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Dispatching domains for multiprocessor platforms and their representation in ada
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Partially non-preemptive dual priority multiprocessor scheduling
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Integrating PFairness within a model based scheduling tool
VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
Multi-core fixed priority DVS scheduling
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Mathematical formalisms for performance evaluation of networks-on-chip
ACM Computing Surveys (CSUR)
Support for multiprocessor platforms
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor. By allowing a task to resume on another processor than the task was preempted on, some task sets can be scheduled where the partitioned method fails. We address fixed-priority preemptive scheduling of periodically arriving tasks on m equally powerful processors. We compare the performance of the best algorithms of the partitioned and non-partitioned method, from two different aspects. First, an average-case comparison, using an idealized architecture, shows that, if a system has a small number of processors, then the non-partitioned method offers higher performance than the partitioned method. Second, an average-case comparison, using a realistic architecture, shows that, for several combinations of preemption and migration costs, the non-partitioned method offers higher performance.