Citations
Altmetric:
Alternative Title
Abstract
In this paper we present two simple algorithms for implementing the trie structure based on the MIMD (Multiple Instruction Streams Multiple Data Streams) model of computation. Unlike the sequential implementation, our schemes allow concurrent operations on the trie structure by multiple processes. No hash function will be employed and the problem due to collision is thus, eliminated. By making use of a simple segmentation scheme, we are able to garbage collect and recycle unused memory space in an efficient manner. Results from simulation show that our proposed algorithms attain satisfactory speedup.
Keywords
Source Title
Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
Publisher
Series/Report No.
Collections
Rights
Date
1994
DOI
Type
Conference Paper