Simultaneous multithreading: maximizing on-chip parallelism
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
The case for a single-chip multiprocessor
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Integrating Aperiodic and Recurrent Tasks on Fair-Scheduled Multiprocessors
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Energy-Aware Partitioning for Multiprocessor Real-Time Systems
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Executing Aperiodic Jobs in a Multiprocessor Constant-Bandwidth Server Implementation
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
An Analysis of EDF Schedulability on a Multiprocessor
IEEE Transactions on Parallel and Distributed Systems
Multiprocessor Scheduling with Few Preemptions
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Adapting Pfair scheduling for symmetric multiprocessors
Journal of Embedded Computing - Cache exploitation in embedded systems
Real-time static voltage scaling on multiprocessors
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
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
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
| Hi-index | 0.00 |
Optimal real-time scheduling algorithms for multiprocessors have some restrictions to realize the optimality. In this paper, we propose an optimal real-time scheduling algorithm called NNLF (No Nodal Laxity First), which relaxes the restrictions of the traditional algorithm LNREF [8]. NNLF with aperiodic servers is flexible as compared to LNREF with aperiodic servers and enhances the responsiveness of aperiodic services, while all periodic tasks meet their deadlines. Simulation results show that NNLF with aperiodic servers enhances the aperiodic responsiveness approximately 90% relative to the background servers.