Issue No. 07 - July (1993 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.238568
<p>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.</p>
parallel resource management; processor architectures; data structures; system state; weakened specifications; priority queue; multiple processes; concurrent heap; software banyan; simultaneous update; parallel algorithms; resource allocation; operating systems; data structures; parallel algorithms; parallel programming; resource allocation
J. Biswas and J. Browne, "Simulation Data Structures for Parallel Resource Management," in IEEE Transactions on Software Engineering, vol. 19, no. , pp. 672-686, 1993.