Parallel I/O scheduling using randomized, distributed edge coloring algorithms

Journal of Parallel and Distributed Computing

Volumn 63, Issue 6, 2003, Pages 611-618

  Durand, Dannie ^a,b   Jain, Ravi ^a,c   Tseytlin, David ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c DOCOMO USA LABS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038383271     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-7315(03)00015-7     Document Type: Article

References (20)

1. R.J. Anderson, G.L. Miller, Optical communication for pointer-based algorithms, Technical Report, CRI-88-14, Computer Science Department, University of Southern California, 1988.
2. T.E. Anderson, S. Owicki, J.B. Saxe, C.P. Thacker, High-speed switch scheduling for local-area networks, ACM Trans. Comput. Systems 11 (4) (1993) 319-352.
3. C. Berge, Graphs, North Holland, Amsterdam, 1985.
4. D.P. Dubhashi, D.A. Grable, A. Panconesi, Near-optimal distributed edge coloring via the nibble method, Theoretical Computer Science 203 (2) (1998) 225-251.
5. D. Dubhashi, A. Panconesi, Near-optimal distributed edge coloring, in: P. Spirakis (Ed.), Algorithms: Third Annual European Symposium, September 1995, Lecture Notes in Computer Science, Springer, Berlin, 1995, pp. 448-459.
6. D. Durand, R. Jain, D. Tseytlin, Distributed scheduling algorithms to improve the performance of parallel data transfers, in: R. Jain, J. Werth, J.C. Brown (Eds.), Input/Output in Parallel and Distributed Computer Systems, Kluwer Academic Publishers, Dordrecht, 1996, pp. 245-268.
7. M. Durand, R. Jain, D. Tseytlin, Applying randomized edge coloring algorithms to distributed communication: an experimental study, in: Symposium on Parallel Algorithms and Architectures, Santa Barbara, CA, July 1995, pp. 264-274.
8. M. Geréb-Graus, T. Tsantilas, Efficient optical communication in parallel computers, in: Symposium on Parallel Algorithms and Architectures, San Diego, CA, 1992, pp. 41-48.
9. L.A. Goldberg, M. Jerrum, T. Leighton, S. Rao, A doubly logarithmic communications algorithm for the completely connected optical communication parallel computer, in: Symposium on Parallel Algorithms and Architectures, Velen, Germany, 1993, pp. 300-310.
10. L.A. Goldberg, M. Jerrum, P.D. MacKenzie, An ω(√log log n) bound for routing in optical networks, in: Symposium on Parallel Algorithms and Architectures, Cape May, NJ, 1994, pp. 147-156.
11. D.A. Grable, A. Panconesi, Nearly optimal distributed edge colouring in O(log log n) rounds, Symposium on Discrete Algorithms, New Orleans, LA, May 1997, pp. 278-285.
12. R. Jain, Scheduling data transfers in parallel computers and communications systems, Technical Report TR-93-03, University of Texas at Austin, Department of Computer Science, February 1993.
13. R. Jain, K. Somalwar, J. Werth, J. Browne, Scheduling parallel I/O operations in multiple bus systems, J. Parallel Distribut. Comput. 16 (1992) 352-362.
14. R. Jain, K. Somalwar, J. Werth, J. Browne, Heuristics for scheduling parallel I/O operations, IEEE Trans. Parallel Distribut. Systems 8 (3) (1997) 310-320.
15. R. Jain, J. Werth, J.C. Browne, I/O in Parallel and Distributed Computer Systems, Kluwer Academic Publishers, Dordrecht, 1996.
16. M. Luby, Removing randomness in parallel computation without a processor penalty, in: Proceedings of the IEEE Symposium on Foundations of Computer Science, 1988, pp. 162-173.
17. P.D. MacKenzie, C.G. Plaxton, R. Rajaraman, On contention resolution protocols and associated probabilistic phenomena, in: Proceedings of the ACM Symposium on the Theory of Computation, Vol. 26, 1994, pp. 153-162.
18. A. Panconesi, A. Srinivasan, Fast randomized algorithms for distributed edge coloring, in: Proceedings of the 1992 ACM Symposium on Parallel and Distributed Computing, August 1992, pp. 251-262.
19. A. Panconesi, A. Srinivasan, Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds, SIAM J. Comput. 26 (2) (1997) 350-368.
20. L.G. Valliant, General purpose parallel architectures, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, p. 967 (Chapter 18).