IEEE/ACM Transactions on Networking (TON)
TCP/IP illustrated (vol. 2): the implementation
TCP/IP illustrated (vol. 2): the implementation
A hierarchial CPU scheduler for multimedia operating systems
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
CPU reservations and time constraints: efficient, predictable scheduling of independent activities
Proceedings of the sixteenth ACM symposium on Operating systems principles
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
A Rate-Based Execution Abstraction for Multimedia Computing
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Integrated Processors Scheduling for Multimedia
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Scalable Scheduling Support for Loss and Delay Constrained Media Streams
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Robust aperiodic scheduling under dynamic priority systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Proportional Share Scheduling of Operating System Services for Real-Time Applications
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Theory of Rate-Based Execution
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Real-Time Systems
Frame-Based Proportional Round-Robin
IEEE Transactions on Computers
Control-scheduling codesign of real-time systems: The control server approach
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Programmable temporal isolation in real-time and embedded execution environments
Proceedings of the Second Workshop on Isolation and Integration in Embedded Systems
Partition oriented frame based fair scheduler
Journal of Parallel and Distributed Computing
DIME: time-aware dynamic binary instrumentation using rate-based resource allocation
Proceedings of the Eleventh ACM International Conference on Embedded Software
Hi-index | 0.00 |
Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other correctness conditions are met. Static priority scheduling is easy to understand and support but it suffers from a number of significant shortcomings such as the complexity of simultaneously mapping timing and importance constraints onto priority values. Rate-based resource allocation schemes offer an attractive alternative to traditional static priority scheduling as they offer flexibility in specifying and managing timing and criticality constraints. This paper presents a taxonomy of rate-based resource allocation and summarizes the results of some recent experiments evaluating the real-time performance of three allocation schemes for a suite of intra-kernel and application-level scheduling problems encountered is supporting a multimedia workload on FreeBSD UNIX.