Scheduling algorithms for dynamic message streams with distance constraints in TDMA protocol

Authors:
Libin Dong;Rami Melhem;Daniel Mossé
Affiliations:
Department of Computer Science, University of Pittsburgh, Pittsburgh, PA;Department of Computer Science, University of Pittsburgh, Pittsburgh, PA;Department of Computer Science, University of Pittsburgh, Pittsburgh, PA
Venue:
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Year:
2000

Citing 9
Cited 2

General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction

IEEE Transactions on Computers
Software architecture for hard real-time applications: cyclic executives vs. fixed priority executives

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Distance-Constrained Scheduling and Its Applications to Real-Time Systems

IEEE Transactions on Computers
Pinwheel Scheduling for Fault-Tolerant Broadcast Disks in Real-time Database Systems

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Time Slot Allocation for Real-Time Messages with Negotiable Distance Constrains

RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
Schedulability comparisons among periodic and distance-constrained real-time schedulers

RTCSA '97 Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications
Robust aperiodic scheduling under dynamic priority systems

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
An optimal pinwheel scheduler using the single-number reduction technique

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium

Message-Streams Oriented Hybrid Slot Allocation Protocol for Tactical Data Link System

CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Delay-Jitter aware slot assignment for Real-Time applications in wireless multimedia ad hoc sensor networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many real-time communication applications, predictable and guaranteed timeliness is one of the critical components of the quality of service (QoS) requirements. In this paper, we propose a new real-time message model with both rate requirements and distance constraints. Two algorithms are presented to schedule dynamic real-time message streams in a TDMA frame based on different scheduling policies by making greedy choices or optimization choices. The performance of the two algorithms is evaluated and compared in terms of time complexity, acceptance ratio and scheduling jitter via simulation.