Open AccessProceedings Article
A Generalized Simultaneous Access Dictionary Machine.
Zhenqiang Fan,Kam-Hoi Cheng +1 more
- pp 597-598
TLDR
A simultaneous access design of a dictionary machine which supports insert, delete, and search operations is presented, and provides a fast mechanism to avoid the sequential access bottleneck in any large multiprocessor system.Abstract:
A simultaneous access design of a dictionary machine which supports insert, delete, and search operations is presented. The design is able to handle p accesses simultaneously and allows redundant accesses to occur. In the design, processors performing insert or delete operations are free to perform other tasks after submitting their accesses to the design; processors that perform search operations get their response in O(log N) time. Compared to all sequential access designs of a dictionary which require O(p) time to process p accesses, the presented design provides much higher throughput; specifically, O(p/log p) times better. It also provides a fast mechanism to avoid the sequential access bottleneck in any large multiprocessor system. >read more
Citations
More filters
Book ChapterDOI
MIMD Dictionary Machines: From Theory to Practice
TL;DR: The implementation of a dictionary structure on a distributed memory parallel computer is described, an important data structure used in applications such as sorting and searching, symbol-table and index-table implementations.
Proceedings ArticleDOI
Achieving good performance for dictionary machines; a scalable distributed data balancing technique
T. Duboux,A. Ferreira +1 more
TL;DR: This work proposes an elegant solution to the problem of how to process utility commands in database applications while the system remains operational and the data remains available for concurrent accesses and proves that it solves this problem.
Journal ArticleDOI
A scalable design for VLSI dictionary machines
TL;DR: A new design for dictionary machines that assembles blocks of standard existing dictionary machines is proposed that is as efficient as the best machines described in the literature, with the enormous advantage of scaling up quite easily, with no degradation of its performance, by simply adding more and more standard blocks.
References
More filters
Journal ArticleDOI
Parallel Processing with the Perfect Shuffle
TL;DR: Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to aperfect shuffle of a deck of cards.
Journal ArticleDOI
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
TL;DR: This paper implements several basic operating system primitives by using a "replace-add" operation, which can supersede the standard "test and set" and which appears to be a universal primitive for efficiently coordinating large numbers of independently acting sequential processors.
Journal ArticleDOI
A Self-Routing Benes Network and Parallel Permutation Algorithms
TL;DR: A Benes permutation network capable of setting its own switches dynamically and leading to efficient O(log N) parallel algorithms to perform the same class of permutations on cube connected and perfect shuffle computers.