Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1272, Issue , 1997, Pages 272-281

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

^a Center for Advanced Research and Technology   (United States)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); DATA STRUCTURES; MAPPING; TREES (MATHEMATICS);

ALGEBRAIC FUNCTIONS; CONFLICT-FREE ACCESS; INTERCONNECTION PATH; MAXIMUM DISTANCE SEPARABLE CODE; MEMORY BANDWIDTHS; MINIMUM DISTANCE; MULTI PROCESSOR SYSTEMS; NODE RELOCATIONS;

MEMORY ARCHITECTURE;

EID: 84947936138     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_66     Document Type: Conference Paper

References (12)

1. V. Auletta, A. De Vivo and V. Scarano, "Multiple Templates Access of Trees in Parallel Memory Systems", Proc. Int’l Parallel Processing Symp, Geneva, 1997.
2. S. K. Das and F. Sarkar, "Conflict-Free Data Access of Arrays and Trees in Parallel Memory Systems", Proc. Sixth IEEE Symp on Parallel and Distributed Processing, Dallas, TX, Oct 1994, pp. 377-384.
3. S. K. Das, M.C. Pinotti, and F. Sarkar, "Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes," IEEE Trans. on Parallel and Distributed Systems, Vol. 7, No. 6, June 1996, pp. 555-564.
4. 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", Proc. Int’l Conf. on Parallel Processing, Oconomowoc, Wisconsin, Aug 1995, Vol. III, pp. 164-167.
5. S. K. Das and M.C. Pinotti, "Conflict-Free Access to Templates of Trees and Hypercubes," Third Annual International Computing and Combinatorics Conference (CQCOON’97), Shanghai, China, Aug 20-22, 1997.
6. S.K. Das and and M.C. Pinotti, "A Coding Theory Approach to the Conflict-Free Subcube Access in Parallel Memory Systems", Tech. Rep. CRPDC-96-7, Dept, of Comp. Sci., University of North Texas, Denton, 1996.
7. M. Gösseł, and B. Rebel, "Memories for Parallel Subtree Access", Proc. of Int’l Workshop on Parallel Algorithms and Architectures, in Lecture Notes in Computer Science, Springer-Verlag, Vol. 299, 1987, pp. 120-130.
8. D. G, Hoffmann, D. A. Leonard, C.C. Lindner, K.T. Phelps, C.A. Rodger, J.R. Wall, Coding Theory: The Essentials, Marcel Dekker Inc., New York, 1991.
9. K. Kim, and V. K. Prasanna Kumar, "Latin Squares for Parallel Array Access", IEEE Trans. Parallel and Distributed Systems, Vol. 4, No. 4, Apr 1993, pp. 361-370.
10. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Parts I and II, North-Holland, New York, 1977.
11. H. A. G. Wijshoff, Data Organization in Parallel Memories, Kluwer Academic Publishers, 1989.
12. H. A. G. Wijshoff, "Storing Trees into Parallel Memories", Parallel Computing 85, (Ed. Feilmeier), Elsevier Science Pub., 1986, pp. 253-261.