Scheduling Time-Constrained Communication in Linear Networks

AbstractWe study the problem of centrally scheduling multiple messages in a linear network, when each message has both a release time and a deadline. We show that the problem of transmitting optimally many messages is NP-Hard, both when messages may be buffered in transit and when they may not be. For either case, we present efficient algorithms that produce approximately optimal schedules. In particular, our bufferless scheduling algorithm achieves throughput that is within a factor of 2 of optimal. We show that buffering can improve throughput in general by a logarithmic factor (but no more), but that in several significant special cases, such as when all messages can be released immediately, buffering can help by only a small constant factor. Finally, we show how to convert any of our centralized, offline bufferless schedules to a fully distributed online buffered schedule of equal throughput. Most of our results extend readily to ring-structured networks.

[1]  John N. Tsitsiklis,et al.  The efficiency of greedy routing in hypercubes and butterflies , 1991, SPAA '91.

[2]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[3]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[4]  Lixia Zhang,et al.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

[5]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[6]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[7]  David R. Karger,et al.  Job scheduling in rings , 1994, SPAA '94.

[8]  Clement W. H. Lam,et al.  Design and Analysis of Hierarchical Ring Networks for Shared-Memory Multiprocessors , 1995, ICPP.

[9]  Baruch Awerbuch,et al.  Universal stability results for greedy contention-resolution protocols , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[10]  Bruce M. Maggs,et al.  Randomized Routing and Sorting on Fixed-Connection Networks , 1994, J. Algorithms.

[11]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[12]  Matt W. Mutka,et al.  Priority based real-time communication for large scale wormhole networks , 1994, Proceedings of 8th International Parallel Processing Symposium.

[13]  Uriel Feige,et al.  Exact analysis of hot-potato routing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[14]  Arkady Kanevsky,et al.  Real-time communications scheduling for massively parallel processors , 1995, Proceedings Real-Time Technology and Applications Symposium.

[15]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[16]  Alan M. Frieze,et al.  A general approach to dynamic packet routing with bounded buffers , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[17]  Rajmohan Rajaraman,et al.  Time-Constrained Scheduling of Weighted Packets on Trees and Meshes , 2003, Algorithmica.

[18]  Arnold L. Rosenberg,et al.  Scheduling Time-Constrained Communication in Linear Networks , 1998, SPAA.

[19]  Satish Rao,et al.  Hot-potato routing on processor arrays , 1993, ACM Symposium on Parallelism in Algorithms and Architectures.

[20]  Friedhelm Meyer auf der Heide,et al.  Universal algorithms for store-and-forward and wormhole routing , 1996, STOC '96.

[21]  S. Jamaloddin Golestani,et al.  Congestion-free communication in high-speed packet networks , 1991, IEEE Trans. Commun..

[22]  Arnold L. Rosenberg,et al.  On Bufferless Routing of Variable Length Messages in Leveled Networks , 1996, IEEE Trans. Computers.

[23]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[24]  Arindam Saha.  A simulator for real-time parallel processing architectures , 1995, Proceedings of Simulation Symposium.

[25]  Friedhelm Meyer auf der Heide,et al.  A Packet Routing Protocol for Arbitrary Networks , 1995, STACS.

[26]  Bruce M. Maggs,et al.  Simple algorithms for routing on butterfly networks with bounded queues , 1992, STOC '92.

[27]  Christian Scheideler,et al.  Simple, efficient routing schemes for all-optical networks , 1997, SPAA '97.

[28]  Krithi Ramamritham,et al.  A Window Protocol for Transmission of Time-Constrained Messages , 1990, IEEE Trans. Computers.

[29]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[30]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[31]  J.H. Kim,et al.  Rotating Combined Queueing (RCQ): Bandwidth and Latency Guarantees in Low-Cost, High-Performance Networks , 1996, 23rd Annual International Symposium on Computer Architecture (ISCA'96).

[32]  J. Rexford,et al.  A Router Architecture for Real-Time Point-to-Point Networks , 1996, 23rd Annual International Symposium on Computer Architecture (ISCA'96).

[33]  Shmuel Zaks,et al.  Scheduling in Synchronous Networks and the Greedy Algorithm , 1999, Theor. Comput. Sci..

[34]  M. W. Mutka,et al.  Using rate monotonic scheduling technology for real-time communications in a wormhole network , 1994, Second Workshop on Parallel and Distributed Real-Time Systems.

[35]  Frank Thomson Leighton,et al.  Methods for message routing in parallel machines , 1992, STOC '92.

[36]  Anthony S. Acampora,et al.  Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing , 1992, IEEE Trans. Commun..

[37]  Mor Harchol-Balter,et al.  Bounding delays in packet-routing networks , 1995, STOC '95.

[38]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[39]  Ted H. Szymanski.  An analysis of 'hot-potato' routing in a fiber optic packet switched hypercube , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[40]  David R. O'Hallaron,et al.  An architecture for optimal all-to-all personalized communication , 1994, SPAA '94.

[41]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[42]  Anthony S. Acampora,et al.  Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[43]  Jörg Liebeherr.  Multimedia Networks: Issues and Challenges , 1995, Computer.

[44]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

[45]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[46]  Rafail Ostrovsky,et al.  Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.

[47]  Yuval Rabani,et al.  Distributed packet switching in arbitrary networks , 1996, STOC '96.

[48]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[49]  Lisa Zhang,et al.  General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[50]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.