A combinatorial treatment of balancing networks

Journal of the ACM

Volumn 43, Issue 5, 1996, Pages 794-839

  Busch, Costas ^a,c   Mavronicolas, Marios ^b  

^a BROWN UNIVERSITY   (United States)

^b UNIVERSITY OF CYPRUS   (Cyprus)

^c Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; DATA STRUCTURES; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; SORTING;

BALANCING NETWORKS; BALANCING PROBLEMS; COUNTING NETWORKS; SMOOTHING NETWORKS; SORTING NETWORKS; TRANSFER PARAMETERS; ZERO ONE PRINCIPLE;

COMPUTER NETWORKS;

EID: 0030230653     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/234752.234754     Document Type: Article

References (39)

1. AGARWAL, A., AND CHERIAN, M. 1989. Adaptive backoff synchronization techniques. In Proceedings of the 16th Annual ACM-IEEE International Symposium on Computer Architecture. ACM, New York, pp. 396-406.
2. AHARONSON, E., AND ATTIYA, H. 1995. Counting networks with arbitrary fan-out. Dist. Comput. 8, 163-169.
3. AIELLO, W., VENKATESAN, R., AND YUNG, M. 1994. Coins, weights and contention in balancing networks. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 193-205.
4. AIGNER, M. 1979. Combinatorial Theory. Springer-Verlag, New York.
5. ASPNES, J., HERLIHY, M., AND SHAVIT, N. 1994. Counting networks. J. ACM, 41, 5 (Sept.), 1020-1048.
6. BARAK, A., AND SHILOH, A. 1985. A distributed load balancing policy for a multicomputer. Soft. Practice Exp. 15, 9 (Sept.), 901-913.
7. BATCHER, K. E. 1968. Sorting networks and their applications. In Proceedings of AFIPS Spring Joint Computer Conference, pp. 307-314.
8. BRIT, H., MORAN, S., AND TAUBENFELD, G. 1995. Public data structures: Counters as a special case. In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems (Jan.). pp. 98-119.
9. BRUALDI, R. A., AND RYSER, H. J. 1991. Combinatorial matrix theory. In Encyclopedia of Mathematics and Its Applications, vol. 21. Cambridge University Press, Cambridge, Mass.
10. BUSCH, C., HARDAVELLAS, N., AND MAVRONICOLAS, M. 1994. Contention in counting networks. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, p. 404.
11. BUSCH, C., AND MAVRONICOLAS, M. 1994. A combinatorial treatment of balancing networks. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 206-215.
12. BUSCH, C., AND MAVRONICOLAS, M. 1995. Proving correctness for balancing networks. In DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 22 ("Parallel Processing of Discrete Optimization Problems," P. M. Pardalos, K. G. Ramakrishnan and M. G. C. Resende, eds.). American Mathematical Society, Providence, R.I., pp. 1-32.
13. BUSCH, C., AND MAVRONICOLAS, M. 1995. Impossibility results for threshold networks. Tech. Rep. FORTH-ICS/TR-137. Institute of Computer Science, Foundation for Research and Technology-Hellas, Hellas, Greece.
14. BUSCH, C., AND MAVRONICOLAS, M. 1996. Comparator versus balancer merging networks. In preparation.
15. CORMEN, T., LEISERSON, C., AND RIVEST, R. 1990. Introduction to Algorithms. McGraw-Hill, and MIT Press.
16. DOWD, M., PERL, Y., RUDOLPH, L., AND SAKS, M. 1989. The periodic balanced sorting network. J. ACM 36, 4 (Oct.) 738-757.
17. DWORK, C., HERLIHY, M., AND WAARTS, O. 1993. Contention in shared memory algorithms. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 174-183.
18. ELLIS, C. S., AND OLSON, T. J. 1988. Algorithms for parallel memory allocation. J. Para. Prog. 17, 4 (Aug.), 303-345.
19. FELTEN, E. W., LAMARCA, A., AND LADNER, R. 1993. Building counting networks from larger balancers. Tech. Rep. 93-04-09. Dept. Comput. Sci. Eng., Univ. Washington.
20. FREUDENTHAL, E., AND GOTTLIEB, A. 1991. Process coordination with fetch-and-increment. In Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Operating Systems.
21. GARLAND, S. J., AND GUTTAG, J. V. 1991. A guide to LP, the larch prover. Tech. Rep. #82. DEC Systems Research Center.
22. GOTTLIEB, A., LUBACHEVSKY, B. D., AND RUDOLPH, L. 1983. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Trans. Prog. Lang. Syst. 5, 2 (Apr.)., 164-189.
23. HARDAVELLAS, N., KARAKOS, D., AND MAVRONICOLAS, M., 1993. Notes on sorting and counting networks. In Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG-93). (Lausanne, Switzerland, Sept.). A. Schiper, ed. Lecture Notes in Computer Science, vol. 725. Springer-Verlag, New York, pp. 234-248.
24. HENSGEN, D., FINKEL, R., AND MANBER, U. 1988. Two algorithms for barrier synchronization. Int. J. Para. Prog. 17, 1, 1-17.
25. HERLIHY, M., LIM, B.-C., AND SHAVIT, N. 1992. Low contention load balancing on large-scale multiprocessors. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, (San Diego, Calif., June 29-July 1). ACM, New York, pp. 219-227.
26. HERLIHY, M., SHAVIT, N., AND WAARTS, O. 1991. Low contention linearizable counting networks. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 526-535.
27. KLUGERMAN, M. 1994. Small-depth counting networks and related topics. Ph.D. dissertation. Department of Mathematics, Massachusetts Institute of Technology, September 1994.
28. KLUGERMAN, M., AND PLAXTON, C. G. 1992. Small-depth counting networks. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 417-428.
29. KNUTH, D. 1973. The Art of Computer Programming. Vol. 3 (Sorting and Searching). Addison-Wesley, Reading, Mass.
30. KRUSKAL, C. P., RUDOLPH, L., AND SNIR, M. 1986. Efficient synchronization on multiprocessors with shared memory. In Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, pp. 218-228.
31. LORYS, K., KUTYLOWSKI, M., OESTERDIEKHOFF, B., AND WANKA, R. 1994. Fast and feasible periodic sorting networks of constant depth. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 369-380.
32. MELLOR-CRUMMEY, J. M., AND SCOTT, M. L. 1990. Algorithms for scalable synchronization on shared memory multiprocessors. Tech. Rep. 342. Dept. Comput. Sci., Univ. Rochester, Rochester, N.Y.
33. MORAN, S., AND TAUBENFELD, G. 1993. A lower bound on wait-free counting. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (Ithaca, N.Y., Aug. 15-18). ACM, New York, pp. 251-259.
34. NI, L. M., XU, C. W., AND GENDREAU, T. B. 1985. A distributed drafting algorithm for load balancing. IEEE Trans. Softw. Eng., SE-11, 10 (Oct.).
35. PARBERRY, I. 1990. Single-exception sorting networks and the computational complexity of optimal sorting network verification. Math. Syst. Theory 23, 81-93.
36. PELEG, D., AND UPFAL, E. 1989. The token distribution problem. SIAM J. Comput. 18, 229-241.
37. RUDOLPH, L., SLIVKIN-ALLALOVF, M., AND UPFAL, E. 1991. A simple load balancing scheme for task allocation in parallel machines. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (Hilton Head, S.C., July 21-24). ACM, New York, pp. 237-245.
38. STONE, H. S. 1984. Database applications of the fetch-and-add instruction. IEEE Trans. Comput. C-33, 1 (July), 604-612.
39. WANG, Y.-T., AND MORRIS, R. J. 1985. Load sharing in distributed systems. IEEE Trans. Comput. C-34, 3 (Mar.).