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

Authors:
M. Cristina Pinotti;Sajal K. Das;Falguni Sarkar
Affiliations:
IEI, Consiglio Nazionale delle Ricerche, Via S. Maria, 46, 56126 Pisa, Italy;Department of Computer Sciences, University of North Texas, Denton, TX;Department of Computer Sciences, University of North Texas, Denton, TX
Venue:
ICS '97 Proceedings of the 11th international conference on Supercomputing
Year:
1997

Data structures and parallel memories

Proc. of the Third International Workshop on Parallel processing by cellular automata and arrays
Parallel optimal subtree access with linear memory functions

Proc. of the Third International Workshop on Parallel processing by cellular automata and arrays
Memories for parallel subtree-access

Proc. of an international workshop on Parallel algorithms and architectures
Perfect Latin squares and parallel array access

ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
A data structure for manipulating priority queues

Communications of the ACM
Data Organization in Parallel Computers

Data Organization in Parallel Computers
Latin Squares for Parallel Array Access

IEEE Transactions on Parallel and Distributed Systems
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Multiple Templates Access of Trees in Parallel Memory Systems

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Distributed priority queues on hypercube architectures

ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)

Hi-index	0.00