On non-preemptive scheduling of recurring tasks using inserted idle times
Information and Computation
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Pfair Scheduling of Generalized Pinwheel Task Systems
IEEE Transactions on Computers
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
Pfair scheduling: beyond periodic task systems
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
Analyzing composability of applications on MPSoC platforms
Journal of Systems Architecture: the EUROMICRO Journal
Schedulability analysis of preemptive and nonpreemptive EDF on partial runtime-reconfigurable FPGAs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
SAFECOMP '08 Proceedings of the 27th international conference on Computer Safety, Reliability, and Security
Transition-aware real-time task scheduling for reconfigurable embedded systems
Proceedings of the Conference on Design, Automation and Test in Europe
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
Proceedings of the Conference on Design, Automation and Test in Europe
An MILP-based performance analysis technique for non-preemptive multitasking MPSoC
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Schedulability analysis of non-preemptive recurring real-time tasks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On best-effort utility accrual real-time scheduling on multiprocessors
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling
Journal of Systems Architecture: the EUROMICRO Journal
Design and implementation of a multi-core crypto-processor for software defined radios
ARC'11 Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications
Processing data streams with hard real-time constraints on heterogeneous systems
Proceedings of the international conference on Supercomputing
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
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
Scheduling processing of real-time data streams on heterogeneous multi-GPU systems
Proceedings of the 5th Annual International Systems and Storage Conference
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform
International Journal of Grid and Utility Computing
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The non-preemptive scheduling of periodic task systems upon processing platforms comprised of several identical processors is considered. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm.