Conflict-free template access in k-ary and binomial trees

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 1997, Pages 237-244

  Pinotti, M Cristina ^a   Das, Sajal K ^a   Sarkar, Falguni ^a  

^a IEI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER ARCHITECTURE; DATA ACQUISITION; DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; DATA TRANSFER; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; RECURSIVE FUNCTIONS;

BINOMIAL TREES; DATA DISTRIBUTION; MEMORY MODULES; ORIENTED SUBTREES;

DATA STRUCTURES;

EID: 0030717058     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/263580.263641     Document Type: Conference Paper

References (18)