Please use this identifier to cite or link to this item:
|Title:||Parallel implementation of the trie structure|
|Authors:||Chan, I.W. |
|Citation:||Chan, I.W.,Lim, C.Y. (1994). Parallel implementation of the trie structure. Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS : 538-543. ScholarBank@NUS Repository.|
|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.|
|Source Title:||Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.