Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates

Journal of Parallel and Distributed Computing

Volumn 60, Issue 8, 2000, Pages 998-1027

  Das, Sajal K ^a   Pinotti, M Cristina ^b  

^a The University of Texas at Arlington   (United States)

^b ISTI CNR   (Italy)

Author keywords

Binomial tree; Complete q ary tree; Conflict free access; Optimal mapping scheme; Parallel memory system; Path template; Subtree template

Indexed keywords

EID: 0006067209     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2000.1638     Document Type: Article

References (19)

1. V. Auletta, S. K. Das, A. De Vivo, M. C. Pinotti, and V. Scarano, Toward a universal mapping algorithm for accessing trees in parallel memory systems, in Proceedings of IEEE Int'l Parallel Processing Symposium, Orlando, Apr. 1998, pp. 447-4548.
2. Bertossi A. A., Pinotti M. C. Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees. Nota Interna IEI-CNR B4-020. October 1999.
3. Blelloch G. E., Gibbons P. B., Mattias Y., Zagha M. Accounting for memory bank contention and delay in high-bandwidth multiprocessors. IEEE Trans. Parallel Distrib. Systems. Sept. 1997;943-958.
4. M. Balakrishnan, R. Jain, and C. S. Raghavendra, On array storage for conflict-free memory access for parallel processors, in Proc. Int.'l Conf. on Parallel Processing, Aug. 1988, pp. 103-107.
5. Budnik P., Kuck D. J. The organization and use of parallel memories. IEEE Trans. Comput. 1971;1566-1569.
6. R. Creutzburg, Parallel optimal subtree access with recursively linear memory functions, in Proc. of Int'l Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, Sept. 1986 (T. Legendi, D. Parkinson, R. Vollmar, and G. Wolf, Eds.), pp. 203-209.
7. S. K. Das and F. Sarkar, Conflict-free data access of arrays and trees in parallel memory systems, in Proc. of the Sixth IEEE Symposium on Parallel and Distributed Processing, Dallas, Oct. 1994, pp. 377-384.
8. S. K. Das, F. Sarkar, and M. C. Pinotti, Conflict-free access of trees in parallel memory systems and its generalization with applications to distributed heap implementation, in Proc. Int'l Conf. on Parallel Processing, Oconomowoc, WI, Aug. 1995, Vol. III, pp. 164-167.
9. S. K. Das, F. Sarkar, and M. C. Pinotti, Distributed priority queues on hypercube architectures, in 16th IEEE Int'l Conf. on Distributed Computing Systems, Hong Kong, May 1996, pp. 620-627.
10. Das S. K., Sarkar F., Pinotti M. C. Parallel priority queues in distributed memory hypercubes. IEEE Trans. Parallel Distrib. Systems. June 1996;555-564.
11. Das S. K., Pinotti M. C. O(log log N) time algorithms for hamiltonian-suffix and min-max-pair heap operations on the hypercube. J. Parallel Distrib. Comput. 52:Feb. 1998;200-211.
12. S. K. Das and M. C. Pinotti, Conflict-free access to templates of trees and hypercubes, in Proc. 3rd Annu. Int'l Conf. on Computing and Combinatorics (COCOON), Shanghai, Aug. 1997, pp. 1-10.
13. Das S. K., Pinotti M. C. Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access. Dehne, Rau-Chaplin, Sack, Tamassia. Proc. 5th Int. Workshop on Algorithms and Data Structures (WADS'97), Halifax, Canada, Aug. 1997. Lecture Notes in Computer Science. 1272:1997;272-281 Springer-Verlag, Berlin/New York.
14. Denes J., Keedwell A. D. Latin Squares and Their Applications. 1974;Academic Press, New York.
15. Gössel M., Rebel B. Memories for parallel subtree access. Albrecht A., Jung H., Mehlhorn K. Proc. of Int'l Workshop on Parallel Algorithms and Architectures. Lecture Notes in Computer Science. 299:1987;120-130 Springer-Verlag, Berlin/New York.
16. Johnsson S. L., Ho C. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comput. Sept. 1989;1249-1268.
17. Kim K., Prasanna V. K. Latin squares for parallel array access. IEEE Trans. Parallel Distrib. Systems. April 1993;361-370.
18. M. C. Pinotti, S. K. Das, and F. Sarkar, Conflict-free template access in k-ary and binomial trees, in Proceedings of ACM-Int'l Conference on Supercomputing, Wien, Austria, July 1997, pp. 237-244.
19. Wijshoff H. A. G. Storing trees into parallel memories. Feilmeier. Parallel Computing 85. 1986;253-261 Elsevier Science, Amsterdam.