Synchronizing shared abstract types
ACM Transactions on Computer Systems (TOCS)
A VLSI architecture for concurrent data structures
A VLSI architecture for concurrent data structures
Distributing Hot-Spot Addressing in Large-Scale Multiprocessors
IEEE Transactions on Computers
Concurrent Access of Priority Queues
IEEE Transactions on Computers
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Extendible hashing for concurrent operations and distributed data
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
Techniques and data structures for parallel resource management
Techniques and data structures for parallel resource management
Lock bypassing: an efficient algorithm for concurrently accessing priority heaps
Journal of Experimental Algorithmics (JEA)
Scalable concurrent priority queue algorithms
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
The problem of resource management for many processor architectures can be viewed as the problem of simultaneously updating data structures that hold system state. An approach in which the possibility of using structures with weakened specifications is examined, is presented. Specifically, data structures that weaken the specification of a priority queue, permitting it to be updated simultaneously by multiple processes are introduced. Two structures, the concurrent heap and the software banyan are proposed, along with their associated algorithms for update. The algorithms are shown to possess attractive properties of simultaneous update and throughput. The results of simulation and actual implementations show that such data structures can improve the execution times of parallel algorithms quite significantly. These structures are proposed as possible basic building blocks for implementation of resource allocation in operating systems.