Micah Adler
- 1.M. Adler, A.L. Rosenberg, R.K. Sitaraman, and W. Unger (1998), "Scheduling time-constrained communication in linear networks", l Oth A CM Symposium on Parallel Algorithms and Architectures 269-278. Google Scholar
Digital Library
- 2.M. Andrews, A. Fernandez, M. Harchol-Balter, F.T. Leighton, L. Zhang (1997): General dynamic routing with per-packet delay guarantees of O(distance + 1/session rate). 38th IEEE Syrup. on Foundations of Computer Science. Google ScholarDigital Library
- 3.M. Andrews and L. Zhang (1999): Packet routing with arbitrary end-to-end delay requirements. 31st A CM Syrup. on Theory of Computing. Google ScholarDigital Library
- 4.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. Cornp. ~5, 714-729. Google ScholarDigital Library
- 5.R. Games, A. Kevsky, P. Krupp, L. Monk (1995): Realtime communications scheduling for massively parallel processors. Real-Time Technology and Applications Syrnp., 76-85. Google ScholarDigital Library
- 6.S.J. Golestani (1991): Congestion-free communication in high-speed packet networks. IEEE Trans. Communications 39, 1802-1812.Google ScholarCross Ref
- 7.V. Guruswami, S. Khanna, B. Shepherd, R. Rajaraman and M. Yannakakis (1999). Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. To appear in 31st ACM Syrup. on Theory of Computing. Google ScholarDigital Library
- 8.J. H&stad. Clique is hard to approximate within n1-e (1996). 37th IEEE Syrup. on Foundations of Computer Science, 627-636. Google ScholarDigital Library
- 9.J.H. Kim and A.A. Chien (1996): Rotating Combined Queuing (RCQ): Bandwidth and latency guarantees in low-cost, high-performance networks. 23rd Intl. Syrup. on Computer Architecture, 226-236. Google ScholarDigital Library
- 10.C. Lam, H. Jiang, V.C. Hamacher (1995): Design and analysis of hierarchical ring networks for shared-memory multiprocessors. Intl. Conf. on Parallel Processing, I:46-50. Google ScholarDigital Library
- 11.F.T. Leighton (1992): Methods for message routing in parallel machines (invited survey). 2~th A CM Syrnp. on Theory of Computing. Google ScholarDigital Library
- 12.F.T. Leighton (1992): Introduction to Parallel Algorithms and Architectures: Arrays ~ Trees , Hypercubes. Morgan Kaufmann, San Mateo, CA. Google ScholarDigital Library
- 13.J. Liebeherr (1995): Multimedia networks: issues and challenges. IEEE Computer 28 (4) 68-69. Google ScholarDigital Library
- 14.J.-P. Li and M.W. Mutka (1994): Priority based realtime communication for large scale wormhole networks. Intl. Parallel Proc. Syrup., 433-438. Google ScholarDigital Library
- 15.K.-S. Lui and S. Zaks (1998): Scheduling in synchronous networks and the greedy algorithm. Theoretical Comp. Sci. Google ScholarDigital Library
- 16.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
- 17.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 i, 344-357. Google ScholarDigital Library
- 18.A.K. Parekh and R.G. Gallager (1994): A generalized processor sharing approach to flow control in integrated services networks: the multiple-node case. IEEE/ACM Trans. Networking 2, 137-150. Google ScholarDigital Library
- 19.h. eietracaprina and F.P. Preparata (1995): Bufferless packet routing in high-speed networks. Typescript, Brown Univ.Google Scholar
- 20.J. Rexford, J. Hall, K.G. Shin. (1996): ~A router architecture for real-time point-to-point networks. 23rd Intl. Syrnp. Computer Architecture. Google ScholarDigital Library
- 21.A. Saha (1995): Simulator for real-time parallel processing architectures. IEEE Ann. Simulation Syrup., 74-83. Google ScholarDigital Library
- 22.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
- 23.L. Zhang (1990): Virtual clock: A new traffic control algorithm for packet switching networks. A CM SIGCOMM, 19-29. Google ScholarDigital Library
- 24.W. Zhao, J.A. Stankovic, K. Ramamritham (1990)- A window protocol for transmission of time-constrained messages. {EEE Trans. Computers 39, 1186-1203. Google ScholarDigital Library
Index Terms
- Time-constrained scheduling of weighted packets on trees and meshes
Recommendations
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in traditional packet routing problems) as well as a release time and a ...
Preemptive Weighted Completion Time Scheduling of Parallel Jobs
We present a new algorithm for the preemptive offline scheduling of independent jobs on a system consisting of m identical machines. The jobs can be parallel; that is, they may need the concurrent availability of several machines for their execution. To ...
Job scheduling to minimize the weighted waiting time variance of jobs
This study considers the job scheduling problem of minimizing the weighted waiting time variance (WWTV) of jobs. It is an extension of WTV minimization problems in which we schedule a batch of n jobs, for servicing on a single resource, in such a way ...
Comments