Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
Scheduling periodic-time - critical jobs on single processor and multiprocessor computing systems.
Scheduling periodic-time - critical jobs on single processor and multiprocessor computing systems.
A Multiframe Model for Real-Time Tasks
IEEE Transactions on Software Engineering
Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution
IEEE Transactions on Parallel and Distributed Systems
Period-Based Load Partitioning and Assignment for Large Real-Time Applications
IEEE Transactions on Computers
Fast performance prediction for periodic task systems
CODES '00 Proceedings of the eighth international workshop on Hardware/software codesign
Real-Time Processing in Client-Server Databases
IEEE Transactions on Computers
Efficient performance estimation for general real-time task systems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling
Real-Time Systems
An Improved Rate-Monotonic Admission Control and Its Applications
IEEE Transactions on Computers
Optimal Scheduling of Aperiodic Jobs on Cluster
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
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
Efficient Online Schedulability Tests for Real-Time Systems
IEEE Transactions on Software Engineering
Enhanced Utilization Bounds for QoS Management
IEEE Transactions on Computers
On-line scheduling of scalable real-time tasks on multiprocessor systems
Journal of Parallel and Distributed Computing
Fault-tolerant scheduling for real-time embedded control systems
Journal of Computer Science and Technology
Minimum and Maximum Utilization Bounds for Multiprocessor Rate Monotonic Scheduling
IEEE Transactions on Parallel and Distributed Systems
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Measuring the Performance of Schedulability Tests
Real-Time Systems
Virtual multiprocessor: an analyzable, high-performance architecture for real-time computing
Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems
A Technique for Adaptive Scheduling of Soft Real-Time Tasks
Real-Time Systems
Online resource management in a multiprocessor with a network-on-chip
Proceedings of the 2007 ACM symposium on Applied computing
Rate monotonic schedulability tests using period-dependent conditions
Real-Time Systems
Push-assisted migration of real-time tasks in multi-core processors
Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Research of the real-time performance of operating system
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Constant-time admission control for deadline monotonic tasks
Proceedings of the Conference on Design, Automation and Test in Europe
R&D challenges and emerging solutions for multicore deployment/configuration optimization
Proceedings of the FSE/SDP workshop on Future of software engineering research
Static-priority periodic scheduling on muitiprocessors
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Comments on "Generalized rate monotonic schedulability bounds using relative period ratios"
Information Processing Letters
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
ScatterD: Spatial deployment optimization with hybrid heuristic/evolutionary algorithms
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Non-preemptive scheduling to maximize the minimum global inter-completion time
Automatica (Journal of IFAC)
Static task partitioning for locked caches in multi-core real-time systems
Proceedings of the 2012 international conference on Compilers, architectures and synthesis for embedded systems
PDPA: period driven task and cache partitioning algorithm for multi-core systems
Proceedings of the 20th International Conference on Real-Time and Network Systems
Lowest priority first based feasibility analysis of real-time systems
Journal of Parallel and Distributed Computing
Software and Systems Modeling (SoSyM)
Scheduling analysis from architectural models of embedded multi-processor systems
ACM SIGBED Review - Special Issue on the 3rd Embedded Operating System Workshop (EWiLi 2013)
| Hi-index | 15.00 |
Optimal scheduling of real-time tasks on multiprocessor systems is known to be computationally intractable for large task sets. Any practical scheduling algorithm for assigning real-time tasks to a multiprocessor system presents a trade-off between its computational complexity and its performance. In this study, new schedulability conditions are presented for homogeneous multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm. The conditions are used to develop new strategies for assigning real-time tasks to processors. The performance of the new strategies is shown to be significantly better than suggested by the existing literature. Under the realistic assumption that the load of each real-time task is small compared to the processing speed of each processor, it is shown that the processors can be almost fully utilized.