Dynamic Configuration for Distributed Systems
IEEE Transactions on Software Engineering
High-performance operating system primitives for robotics and real-time control systems
ACM Transactions on Computer Systems (TOCS)
CHAOS- kernel support for objects in the real-time domain
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Preemptive scheduling under time and resource constraints
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Scheduling algorithms for hard real-time systems: a brief survey
Tutorial: hard real-time systems
Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Calculating the maximum, execution time of real-time programs
Real-Time Systems
Dynamic adaptation of real-time software
ACM Transactions on Computer Systems (TOCS)
Experimental Evaluation of a Real-Time Scheduler for a Multiprocessor System
IEEE Transactions on Software Engineering
ACM SIGOPS Operating Systems Review
ACM Transactions on Computer Systems (TOCS)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Architecture of the space shuttle primary avionics software system
Communications of the ACM
Scheduling Dependent Tasks with Different Arrival Times to Meet Deadlines
Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
StarOS, a multiprocessor operating system for the support of task forces
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
ACM Transactions on Computer Systems (TOCS)
Scheduling of hard aperiodic tasks
LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
Object technologies and real-time scheduling
ACM SIGPLAN OOPS Messenger - Special issue: object-oriented real-time systems
Scheduling soft aperiodic tasks in adaptable fixed-priority systems
ACM SIGOPS Operating Systems Review
Temporal notions of synchronization and consistency in Beehive
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems
IEEE Transactions on Software Engineering
CPU reservations and time constraints: efficient, predictable scheduling of independent activities
Proceedings of the sixteenth ACM symposium on Operating systems principles
Analysis of Cache-Related Preemption Delay in Fixed-Priority Preemptive Scheduling
IEEE Transactions on Computers
To Schedule or to Execute: Decision Support and PerformanceImplications
Real-Time Systems
Bounding Cache-Related Preemption Delay for Real-Time Systems
IEEE Transactions on Software Engineering
DDSCHED: a distributed dynamic real-time scheduling algorithm
Progress in computer research
DDSCHED: a distributed dynamic real-time scheduling algorithm
Progress in computer research
A Scheduling Scheme for Controlling Allocation of CPU Resources for Mobile Programs
Autonomous Agents and Multi-Agent Systems
Scheduling of Real-Time Tasks with Complex Constraints
Performance Evaluation: Origins and Directions
Implementing a Flexible Scheduler in Ada
Ada Europe '01 Proceedings of the 6th Ade-Europe International Conference Leuven on Reliable Software Technologies
Evaluation of Process Scheduling Mechanism for a Web Server Based on Its Behavior while Executing
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
On Network CoProcessors for Scalable, Predictable Media Services
IEEE Transactions on Parallel and Distributed Systems
Enhanced Utilization Bounds for QoS Management
IEEE Transactions on Computers
Optimal Admission Control of Discrete Event Systems with Real-Time Constraints
Discrete Event Dynamic Systems
International Journal of Advanced Pervasive and Ubiquitous Computing
Online parallel scheduling of non-uniform tasks: trading failures for energy
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.01 |
The authors investigate the dynamic scheduling of tasks with well-defined timing constraints. They present a dynamic uniprocessor scheduling algorithm with an O(n log n) worst-case complexity. The preemptive scheduling performed by the algorithm is shown to be of higher efficiency than that of other known algorithms. Furthermore, tasks may be related by precedence constraints, and they may have arbitrary deadlines and start times (which need not equal their arrival times). An experimental evaluation of the algorithm compares its average case behavior to the worst case. An analytic model used for explanation of the experimental results is validated with actual system measurements. The dynamic scheduling algorithm is the basis of a real-time multiprocessor operating system kernel developed in conjunction with this research. Specifically, this algorithm is used at the lowest, threads-based layer of the kernel whenever threads are created.