Article

Free access

Scheduling time-constrained communication in linear networks

Authors:

Micah Adler,

Ramesh K. Sitaraman,

Arnold L. Rosenberg,

Walter UngerAuthors Info & Claims

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

Pages 269 - 278

https://doi.org/10.1145/277651.277693

Published: 01 June 1998 Publication History

PDF eReader

References

[1]

A. Acampora and S. Shah (1992): Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. IEEE Trans. Commun. 40, 1082-1090.

Crossref

Google Scholar

[2]

M. Andrews, B. Awerbuch, A. Fernandez, J. Kleinberg, F.T. Leighton, Z. Liu (1996): Universal stability results for greedy contentionresolution protocols. 37th 1EEE Symp. on Foundations e#f Computer Science.

Digital Library

Google Scholar

[3]

M. Andrews, A, Fernandez, M, Harchol-Balter, E T. Leighton, L. Zhang (1997): General dynamic routing with per-packet delay guarantees of O(distance + l/session rate). 38th IEEE Symp, on Foundations of Computer Science.

Digital Library

Google Scholar

[4]

!. Ben-Aroya, T. Eilam, A. Schuster (1995): Greedy hot-potato routing on the two-dimensional mesh. Distr. Computing 9, 3-19.

Digital Library

Google Scholar

[5]

S.N. Bhatt, G. Bilardi, G. Pucci, A.G. Ranade, A,L. Rosenberg, E.J. Schwabe (1996): On bufferless routing of variable-length messages in leveled networks. IEEE Trans. Comp. 45, 714-729.

Digital Library

Google Scholar

[6]

A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, D.P. Williamson (1996): Adversarial queuing theory. 28th ACM Syrup. on Theory of Computing.

Digital Library

Google Scholar

[7]

A.Z. Broder, A.M. Frieze, E. Upfal (1996): A general approach to dynamic packet routing with bounded buffers. 37th IEEE Symp. on Foundations of Computer Science, 390-399.

Digital Library

Google Scholar

[8]

A.Z. Broder and E. Upfal (1996): Dynamic deflection routing on networks. 28th ACM Symp. on Theory of Computing, 348-355.

Digital Library

Google Scholar

[9]

R. Cypher, E Meyer auf tier Heide, C. Scheideler, B. Vocking (1996): Universal algorithms for store-and-forward and wormhole routing. 28th ACM Symp. on Theory of Computing.

Digital Library

Google Scholar

[10]

U. Feige and P. Raghavan (1992): Exact analysis of hot-potato routing. 33rd IEEE Symp. on Foundations of Computer Science, 553-562.

Digital Library

Google Scholar

[11]

P. Fizzano, D. Karger, C. Stein, J. Wein (1994): Job scheduling in rings. 6th ACM Symp. on Parallel Algorithms and Architectures, 210- 219.

Digital Library

Google Scholar

[12]

M. Flammini and C. Scheideler (1997): Simple, efficient routing schemes for all-optical networks. 9th ACM Symp. on Parallel Algorithms and Architectures, 170-179.

Digital Library

Google Scholar

[13]

R. Games, A. Kevsky, P. Krupp, L. Monk (1995): Real-time communications scheduling for massively parallel processors. Real-Time Technology and Applications Syrup., 76-85.

Digital Library

Google Scholar

[14]

M.R. Garey and D.S. Johnson (1979): Computers and Intractability. W.H. Freeman and Co., San Francisco.

Google Scholar

[15]

S.J. Golestani (1991): Congestion-free communication in high-speed packet networks. IEEE Trans. Communications 39, 1802-1812.

Crossref

Google Scholar

[16]

M.C. Golumbic (1980): Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.

Google Scholar

[17]

M. Harchol-Balter and D. Wolfe (1995): Bounding delays in packetrouting networks. 27th ACM Symp. on Theory of Computing, 248-257.

Digital Library

Google Scholar

[18]

S. Hinrichs, C. Kosak, D.R. O'Hallaron, T.M. Stricker, R. Take (1994): An architecture for optimal all-to-all personalized communication. 6th ACM Syrup. on Parallel Algorithms and Architectures, 310-319.

Crossref

Google Scholar

[19]

S.L. Johnsson and C.-T. Ho (1989): Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comp. 38, 1249-1268.

Digital Library

Google Scholar

[20]

C. Kaklamanis, D. Krizanc, S.B. Rao (1993): Hot-potato routing on processor arrays. 5th ACM Syrup. on Parallel Algorithms and Architectures, 273- 282.

Digital Library

Google Scholar

[21]

J.H. Kim and A.A. Chien (1996): Rotating Combined Queuing (RCQ): Bandwidth and latency guarantees in low-cost, highperformance networks. 23rd Intl. Syrup. on Computer Architecture, 226-236.

Digital Library

Google Scholar

[22]

C. Lain, H. Jiang, V.C. Hamacher (1995): Design and analysis of hierarchical ring networks for shared-memory multiprocessors. Intl. Conf on Parallel Processing, 1:46-50,

Google Scholar

[23]

ET. Leighton (1992): Methods for message routing in parallel machines (invited survey). 24th ACM Symp. on Theory of Computing.

Digital Library

Google Scholar

[24]

F.T. Leighton ( 1992): Introduction to Parallel Algorithms and Architectures: Arrays ~ Trees ~ Hypercubes. Morgan Kaufmann, San Mateo, CA.

Digital Library

Google Scholar

[25]

ET. Leighton, B.M. Maggs, A.G. Ranade, S.B. Rao (1994): Randomized routing and sorting on fixed-connection networks. J. Algorithms 17, 157-205.

Digital Library

Google Scholar

[26]

ET. Leighton, E Makedon, I. Tollis (1989): A 2N - 2 step algorithm for routing in an N x N mesh. 1st ACM Syrup. on Parallel Algorithms and Architectures, 328-335.

Crossref

Google Scholar

[27]

J. Liebeherr (1995): Multimedia networks: issues and challenges. IEEE Computer 28 (4) 68-69.

Digital Library

Google Scholar

[28]

J.-P. Li and M.W. Mutka (1994): Priority based real-time communication for large scale wormhole networks. Intl. Parallel Proc. Syrup., 433-438.

Digital Library

Google Scholar

[29]

C.L. Liu and J.W. Layland (1973): Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 20, 46-61.

Digital Library

Google Scholar

[30]

K.-S. Lui and S. Zaks (1998): Scheduling in synchronous networks and the greedy algorithm. Theoretical Comp. Sci.

Digital Library

Google Scholar

[31]

B.M. Maggs and R.K. Sitaraman (1992): Simple algorithms for routing on butterfly networks with bounded queues. 24th ACM Syrup. on Theory of Computing, 150-161.

Digital Library

Google Scholar

[32]

E Meyer auf der Heide and B. Vocking (1995): A packet routing protocol for arbitrary networks. Symp. on Theoretical Aspects of Computer Sci.

Google Scholar

[33]

M.W. Mutka (1994): Using rate monotonic scheduling technology for real-time communications in a wormhole network. Wkshp. on Parallel and Distr. Real-Time Computing Systs. and Applications.

Google Scholar

[34]

R. Ostrovsky and Y. Rabani (1997): Universal (congestion + dilation + log1 +, N) local control packet switching algorithms. 29th ACM Syrup. on Theory of Computing.

Digital Library

Google Scholar

[35]

A.K. Parekh and R.G. Gallager (1993): A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Networking 1,344-357.

Digital Library

Google Scholar

[36]

A.K. Parekh and R.G. Galtager (1994): A generalized processor sharing approach to flow control in integrated services networks: the multiple-node case. IEEE/ACM Trans. Networking 2, 137-150.

Digital Library

Google Scholar

[37]

A. Pietracaprina and EP. Preparata (1995): Bufferless packet routing in high-speed networks. Typescript, Brown Univ.

Google Scholar

[38]

Y. Rabani and E. Tardos (1996): Distributed packet switching in arbitrary networks. 28th A CM Symp. on Theory of Computing.

Digital Library

Google Scholar

[39]

P. Raghavan and E. Upfal (1994): Efficient routing in all-optical networks. 26th ACM Symp. on Theory of Computing.

Digital Library

Google Scholar

[40]

A.G. Ranade (1991): How to emulate shared memory. J. Comp. Syst. Scis. 42, 307-326.

Digital Library

Google Scholar

[41]

J. Rexford, J. Hall, K.G. Shin. (1996): A router architecture for realtime point-to-point networks. 23rd Intl. Symp. Computer Architecture.

Digital Library

Google Scholar

[42]

A. Saha (1995): Simulator for real-time parallel processing architectures. IEEE Ann. Simulation Syrup., 74-83.

Digital Library

Google Scholar

[43]

G.D. Stamoulis and J.N. Tsitsiklis (1991): The efficiency of greedy routing in hypercubes and butterflies. 3rd ACM Symp. on Parallel Algorithms and Architectures, 248-259.

Digital Library

Google Scholar

[44]

T.H. Szymanski (1990): An analysis of hot-potato routing in a fiberoptic packet-switched hypercube. IEEE INFOCOM 918-926.

Google Scholar

[45]

L.G. Valiant (1982): A scheme for fast parallel communication. SIAM J. Comput. 11,350-361.

Digital Library

Google Scholar

[46]

L.R. Welch and K. Toda (1994): Architectural support for real-time systems: issues and trade-offs. Intl. Wkshp. on Real-Time Computing Systs. and Applications.

Google Scholar

[47]

L. Zhang (1990): Virtual clock: A new traffic control algorithm for packet switching networks. ACM SIGCOMM, 19-29.

Digital Library

Google Scholar

[48]

W. Zhao, J.A. Stankovic, K. Ramamritham (1990): A window protocol for transmission of time-constrained messages. IEEE Trans. Computers 39, 1186-1203.

Digital Library

Google Scholar

Cited By

View all

Passchyn WSpieksma F(2019)Scheduling parallel batching machines in a sequenceJournal of Scheduling10.1007/s10951-018-0560-622:3(335-357)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s10951-018-0560-6
Warsi SJindal VKumar SKoli DBagchi ARibeiro V(2016)Joint scheduling and routing using space---time graphs for TDM wireless mesh networksWireless Networks10.1007/s11276-015-1102-122:7(2355-2367)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1007/s11276-015-1102-1
Zhang XLiang WYu HFeng X(2015)Optimal convergecast scheduling for hierarchical wireless industrial systems: performance bounds and two‐stage algorithmsIET Communications10.1049/iet-com.2013.07669:1(88-100)Online publication date: Jan-2015
https://doi.org/10.1049/iet-com.2013.0766
Show More Cited By

Index Terms

Scheduling time-constrained communication in linear networks
1. Mathematics of computing
  1. Mathematical analysis
    1. Mathematical optimization
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization

Recommendations

Scheduling time-constrained instructions on pipelined processors

In this work we investigate the problem of scheduling instructions on idealized microprocessors with multiple pipelines, in the presence of precedence constraints, release-times, deadlines, and latency constraints. A latency of l_ij specifies that there ...
Approximation schemes for constrained scheduling problems
SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Several constrained scheduling problems are considered. The first polynomial approximation schemes for the problem of minimizing maximum completion time in a two-machine flow shop with release dates and for the problem of minimizing maximum lateness for ...
Scheduling jobs under decreasing linear deterioration

This paper considers the scheduling problems under decreasing linear deterioration. Deterioration of a job means that its processing time is a function of its execution start time. Optimal algorithms are presented respectively for single machine ...

Comments

Information & Contributors

Information

Published In

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

June 1998

312 pages

ISBN:0897919890

DOI:10.1145/277651

Chairmen:
Gary Miller
Carnegie Mellon Univ., Pittsburgh, PA
,
Phillip B. Gibbons
Bell Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA/PODC98

Sponsor:

SPAA/PODC98: 10th Annual ACM Symposium on Parallel Algorithms and Architectures/Symposium on Principles of Distributed Computing

June 28 - July 2, 1998

Puerto Vallarta, Mexico

Acceptance Rates

SPAA '98 Paper Acceptance Rate 30 of 84 submissions, 36%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
376
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)6

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Passchyn WSpieksma F(2019)Scheduling parallel batching machines in a sequenceJournal of Scheduling10.1007/s10951-018-0560-622:3(335-357)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s10951-018-0560-6
Warsi SJindal VKumar SKoli DBagchi ARibeiro V(2016)Joint scheduling and routing using space---time graphs for TDM wireless mesh networksWireless Networks10.1007/s11276-015-1102-122:7(2355-2367)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1007/s11276-015-1102-1
Zhang XLiang WYu HFeng X(2015)Optimal convergecast scheduling for hierarchical wireless industrial systems: performance bounds and two‐stage algorithmsIET Communications10.1049/iet-com.2013.07669:1(88-100)Online publication date: Jan-2015
https://doi.org/10.1049/iet-com.2013.0766
Khader OWillig A(2013)An energy consumption analysis of the Wireless HART TDMA protocolComputer Communications10.1016/j.comcom.2012.12.00836:7(804-816)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1016/j.comcom.2012.12.008
Kowalski DNussbaum ESegal MMilyeykovsky V(2013)Scheduling problems in transportation networks of line topologyOptimization Letters10.1007/s11590-013-0613-x8:2(777-799)Online publication date: 13-Feb-2013
https://doi.org/10.1007/s11590-013-0613-x
Kao MChen JRutter IWagner D(2012)Competitive Design and Analysis for Machine-Minimizing Job Scheduling ProblemAlgorithms and Computation10.1007/978-3-642-35261-4_11(75-84)Online publication date: 2012
https://doi.org/10.1007/978-3-642-35261-4_11
Kowalski DNutov ZSegal M(2012)Scheduling of vehicles in transportation networksProceedings of the 4th international conference on Communication Technologies for Vehicles10.1007/978-3-642-29667-3_11(124-136)Online publication date: 25-Apr-2012
https://dl.acm.org/doi/10.1007/978-3-642-29667-3_11
Peis BWiese A(2011)Universal packet routing with arbitrary bandwidths and transit timesProceedings of the 15th international conference on Integer programming and combinatoral optimization10.5555/2018158.2018187(362-375)Online publication date: 15-Jun-2011
https://dl.acm.org/doi/10.5555/2018158.2018187
Peis BWiese A(2011)Universal Packet Routing with Arbitrary Bandwidths and Transit TimesInteger Programming and Combinatoral Optimization10.1007/978-3-642-20807-2_29(362-375)Online publication date: 2011
https://doi.org/10.1007/978-3-642-20807-2_29
Zhang HOsterlind FSoldati PVoigt TJohansson M(2010)Rapid Convergecast on Commodity Hardware: Performance Limits and Optimal Policies2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)10.1109/SECON.2010.5508233(1-9)Online publication date: Jul-2010
https://doi.org/10.1109/SECON.2010.5508233
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Scheduling time-constrained instructions on pipelined processors

Approximation schemes for constrained scheduling problems

Scheduling jobs under decreasing linear deterioration