Please use this identifier to cite or link to this item: https://doi.org/10.1109/32.238568
Title: Data structures for parallel resource management
Authors: Biswas, Jit 
Browne, James C.
Issue Date: Jul-1993
Citation: Biswas, Jit, Browne, James C. (1993-07). Data structures for parallel resource management. IEEE Transactions on Software Engineering 19 (7) : 672 -686. ScholarBank@NUS Repository. https://doi.org/10.1109/32.238568
Abstract: The problem of resource management for many processor architectures can be viewed as the problem of simultaneously updating data structures that hold system state. Consistency requirements of strict data structures introduce serialization in the resource management functions thereby leading to performance bottlenecks in highly parallel systems. Our approach is to examine the possibility of using structures with weakened specifications. Specifically, this paper introduces data structures that weaken the specification of a priority queue permitting it to be updated simultaneously by multiple processes.
Source Title: IEEE Transactions on Software Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/111164
ISSN: 00985589
DOI: 10.1109/32.238568
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.