Conflict-free access to templates of trees and hypercubes in parallel memory systems

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

Volumn 1276, Issue , 1997, Pages 1-10

  Das, Sajal K ^a   Cristina Pinotti, M ^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); COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; FORESTRY; GEOMETRY; MAPPING;

CONFLICT-FREE ACCESS; MAXIMUM DISTANCE SEPARABLE CODE; MEMORY BANDWIDTHS; MINIMUM DISTANCE; MULTI PROCESSOR SYSTEMS; N-DIMENSIONAL HYPERCUBE; NODE RELOCATIONS; PARALLEL MEMORY;

MEMORY ARCHITECTURE;

EID: 84947719875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0045066     Document Type: Conference Paper

References (9)

1. S. K. Dos and F. Sarkar, "Conflict-Free Data Access of Arrays and Trees in Parallel Memory Systems", Proe. of the Sixth IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, Oct 1994, pp. 377-384.
2. S. K. Dos, M.C. Pinotti, and F. Saxkar, "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.
3. S.K. Dos and and M.C. Pinotti, "Load Balanced Mapping of Data Sctuxctures in Parallel Memory Modules for Fast and Conflict-Free Templates Access", in Workshop on Algorithms and Data Structures, Halifax, August 6-8, 1997.
4. M. GSssel, and B. Rebel, "Memories for Parallel Subtree Access", Proe. of Int'l Workshop on Parallel Algorithms and Architectures (Eds. A. Albrecht, H. Jung and K. Mehlhorn), in Lecture Notes in Computer Science, Springer-Verlag, Vol. 299, 1987, pp. 120-130.
5. 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.
6. K. Kim, and V. K. Prasanna Kumar, "Latin Squares for Parallel Array Access", IEEE Trans. on Parallel and Distributed Systems, Vol. 4, No. 4, April 1993, pp. 361-370.
7. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Parts I and II, North-Holland, New York, 1977.
8. Vuillemin, J., "A Data Structure for Manipulating Priority Queues", Comm. ACM, Vol. 21, No. 4, 1978, pp. 309-314.
9. H. A. G. Wijshoff, "Storing Trees into Parallel Memories", Parallel Computing 85, (Ed. Feilmeier), Elsevier Science Pub., 1986, pp. 253-261.