IEEE Transactions on Parallel and Distributed Systems
Scheduling of real-time messages in optical broadcast-and-select networks
IEEE/ACM Transactions on Networking (TON)
QoS provisioning and tracking fluid policies in input queueing switches
IEEE/ACM Transactions on Networking (TON)
Approximating fluid schedules in crossbar packet-switches and Banyan networks
IEEE/ACM Transactions on Networking (TON)
Dynamic, capability-driven scheduling of DAG-based real-time jobs in heterogeneous clusters
International Journal of High Performance Computing and Networking
| Hi-index | 0.00 |
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing elements communicate via a multistage interconnection network, and that the system is synchronous. When two or more packets are simultaneously sent over the same input port, or received through the same output port, the packets undergo a collision and are damaged, needing to be retransmitted later. This causes a performance degradation in terms of both throughput and delay. So, collisions must be avoided. The special type of traffic to be scheduled by Earliest Due Date is a periodic hard-real time one, and the objective is to schedule all the packets within their individual due dates. We establish that EDD is always able to produce a schedule meeting this objective, whenever the so called link utilization is no more than 1/2, showing that this worst case performance bound is tight. Such a bound can be effectively used as a feasibility test before actually running the algorithm.