Adnan Agbaria
- 1.M. Adler. New coding techniques for improved bandwidth utilization. In In proc. 37th IEEE Syrup. Foundations of Computer Science, pages 173-182, 1996. Google Scholar
Digital Library
- 2.M. Adler, J. Byers, and R. Karp. Parallel sorting with limited bandwidth. In In proc. 7th A CM Syrup. on Parallel Algprithms and Architectures, pages 129-136, 1995. Google ScholarDigital Library
- 3.M. Adler, P. B. Gibbons, Y. Matias, and V. Ramachandran. Modeling parallel bandwidth: local vs. global restriction, to appear in Algorithmica, special issue on coarse grained parallel algorithms, 1998.Google Scholar
- 4.Alok Aggarwal, Ashok K. Chandra, and Marc Snir. Communication complexity of PRAMs. Theoretical Comput. Sci., 71(1):3-28, Mar 1990. Google ScholarDigital Library
- 5.M. Ajtai, J. Koml6s, and E. Szemer6di. An O(n logs)sorting network. In Ann. Syrup. Theory of Computing, number 15, pages 1-9, Apr 1983. Also published in Combinatorica 3 (1983) pp. 1-19. Google ScholarDigital Library
- 6.S. G. Akl. The design and analysis of parallel algorithms. Prentice-Hall Int., 1989. Google ScholarDigital Library
- 7.R.J. Anderson and G.L. Miller. Optical communication for pointer based algorithms. Technical Report CRI 88-14, Comp. Sci. Dept., USC, 1988.Google Scholar
- 8.Y. Azar. Lower bounds for threshold and symmetric functions in parallel algorithms. SIAM J. Comput, 21(2):329-338, 1992. Google ScholarDigital Library
- 9.H. Bast and T. Hagerup. Fast parallel space allocation, estimation and integer sorting. Information and Computation, 123(1):72-110, November 1995. Google ScholarDigital Library
- 10.K. E. Batcher. Sorting networks and their applications. In AFIPS Spring Joint Comput. Conf., pages 307-314, 1968.Google ScholarDigital Library
- 11.P. Berthom6, T. Duboux, T. Hagerup, I. Newman, and A. Schuster. Self-simulation for the passive optical star model. In In proc. 3rd European Syrup. on Algorithms (ESA), volume 979, pages 369-380. Springer lecture notes in computer science, August 1995. Google ScholarDigital Library
- 12.M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. J. o} Computer and System Sciences, 7(4):448-461, 1973.Google Scholar
- 13.Richard Cole. Parallel merge sort. in Syrup. Foundations of Computer Science, number 27, pages 511-516, Oct 1986. Final version in SIAM J. Comput. 17(4), pp. 770-785, Aug 1988. Google ScholarDigital Library
- 14.T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT press, 1990. Google ScholarDigital Library
- 15.Artur Czumaj, Friedhelm Meyer auf der Heide, and Volker Stemann. Shared memory simulations with triplelogarithmic delay. In In proc. 3rd European Syrup. on Algorithms (ESA), pages 46-59, 1995. Google ScholarDigital Library
- 16.P. B. Gibbons, Y. Matias, and V. Ramachandran. The queue-read queue-write pram model: Accounting for contention in parallel algorithms. SIAM J. on Computing, (2):733-769, 1997. Google ScholarDigital Library
- 17.L.A. Goldberg, M. Jerrum, and P.D. MacKenzie. An 12(1%/~logn) Lower Bound for Routing in Optical Neworks. In Proc. A CM Syrup. on Parallel Alg's and Arch's, June 1994. Google ScholarDigital Library
- 18.S. Gotz. Algorithms in cgm, bsp, and bsp* models- a survey. CarIeton University, Ottawa, 1996.Google Scholar
- 19.E. Hao, P. D.MacKenzie, and Q. F.Stouk. Selection on the reconfigurable mesh. 4th Symposium on the Frontiers of Massively Parallel Computation.Google Scholar
- 20.J. Jaja. An introduction to parallel algorithms. 1992. Google ScholarDigital Library
- 21.R. M. Karp, M. Luby, and F. Meyer auf der Heide. Efficient pram simulation on a distributed memory machine. Annual A CM symposium on Theory of Computing, pages 318-326, 1992. Google ScholarDigital Library
- 22.D. Konig. Line systems and determinants. Math. Tdrmeszettud. l~rtes', o33:221-229, 1915. In Hungarian.Google Scholar
- 23.E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge university press, 1997. Google ScholarDigital Library
- 24.L. Lov~sz and M.D. Plummer. Matching theory. North Holland, Amsterdam, 1986. Google ScholarDigital Library
- 25.Y. Mansour, N. Nisan, and U. Vishkin. Trade-offs between communication throughput and parallel time. Proceeding o} the $6'th Annual A CM symposium on Theory of Computing, pages 372-381, 1994. Google ScholarDigital Library
- 26.J. M. Marberg and E. Gafni. Sorting in constant number of row and column phases on a mesh. J. Algorithmica, 3:561- 572, 1988.Google ScholarDigital Library
- 27.M.Li and Y.Yesha. Resource bounds for parallel computation of threshold and symmetric functions. J. Computer and System Sciences, 42:119-137, 1991. Google ScholarDigital Library
- 28.J. I. Munro and M. S. Paterson. Selection and sorting with limited storage. Theor. Comput. Sci., 12:315-323, 1980.Google ScholarCross Ref
- 29.N. Nisan, Y. Mansour, and U. Vishkin. Tradeoffs between communication throughput and parallel time. In Proc. Syrup. on Theory Of Computing, 1994. Google ScholarDigital Library
- 30.T.Leighton. introduction to parallel algorithms and architectures: Arrays. trees, hypercubes. Morgan Kaufman publishers, Inc., 1992. Google ScholarDigital Library
- 31.U.Vishkin and A.Wigderson. Trade-offs between depth and width in parallel computation. SIAM J. Computing, 14(2):303-314, 1985.Google ScholarCross Ref
- 32.Leslie G. Valiant. A bridging model for parallel computation. Comm. A CM, 33(8):103-111, Aug 1990. Google ScholarDigital Library
- 33.L.G. Valiant. A bridging model for parallel computation. Communication of the ACM, 33(8):103-111, 1990. Google ScholarDigital Library
- 34.Y.Ben-Asher and I.Newman. Decision trees with boolean threshold queries. Journal of Computer and System Sciences, 6(1):495-502, 1995. Google ScholarDigital Library
- 35.Y.Ben-Asher and I.Newman. Geometric approach for optimal routing on mesh with buses. Journal o~ Computer and System Sciences, 54 (3) :475-486~ 1997. Google ScholarDigital Library
- 36.Y.Shiloach and U.Vishkin. Finding the maximum, merging and sorting in a parallel computation model. Journal of Algorithms, 2:88-102, 1981.Google ScholarCross Ref
Index Terms
- Communication-processor tradeoffs in limited resources PRAM
Recommendations
PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms
The problem of dynamic processor allocation in PRAMs (programmable random-access memories) is discussed, and differentiated from that of static allocation. The version of the PRAM considered, also called the CREW model is a parallel computer with global ...
Work-Time Optimal k-Merge Algorithms on the PRAM
For 2 k n, the k-merge problem is to merge a collection of k sorted sequences of total length n into a new sorted sequence. The k-merge problem is fundamental as it provides a common generalization of both merging and sorting. The main contribution of ...
Comments