Concurrent data structures simplify the development of concurrent programs by encapsulating commonly used mechanisms for synchronization and commu- nication into data structures. This thesis develops a notation for describing concurrent data structures, presents examples of concurrent data structures, and describes an architecture to support concurrent data structures. Concurrent Smalltalk (CST), a derivative of Smalltalk-80 with extensions for concurrency, is developed to describe concurrent data structures. CST allows the ...
Read More
Concurrent data structures simplify the development of concurrent programs by encapsulating commonly used mechanisms for synchronization and commu- nication into data structures. This thesis develops a notation for describing concurrent data structures, presents examples of concurrent data structures, and describes an architecture to support concurrent data structures. Concurrent Smalltalk (CST), a derivative of Smalltalk-80 with extensions for concurrency, is developed to describe concurrent data structures. CST allows the programmer to specify objects that are distributed over the nodes of a concurrent computer. These distributed objects have many constituent objects and thus can process many messages simultaneously. They are the foundation upon which concurrent data structures are built. The balanced cube is a concurrent data structure for ordered sets. The set is distributed by a balanced recursive partition that maps to the subcubes of a binary 7lrcube using a Gray code. A search algorithm, VW search, based on the distance properties of the Gray code, searches a balanced cube in O(log N) time. Because it does not have the root bottleneck that limits all tree-based data structures to 0(1) concurrency, the balanced cube achieves 0C.: N) con- currency. Considering graphs as concurrent data structures, graph algorithms are pre- sented for the shortest path problem, the max-flow problem, and graph parti- tioning. These algorithms introduce new synchronization techniques to achieve better performance than existing algorithms.
Read Less
Add this copy of A Vlsi Architecture for Concurrent Data Structures to cart. $116.25, new condition, Sold by Educational Media Centre rated 4.0 out of 5 stars, ships from New Delhi, DELHI, INDIA, published 2011 by Springer.
Add this copy of A Vlsi Architecture for Concurrent Data Structures to cart. $128.46, new condition, Sold by Educational Media Centre rated 4.0 out of 5 stars, ships from New Delhi, DELHI, INDIA, published 2011 by Springer.
Add this copy of A Vlsi Architecture for Concurrent Data Structures to cart. $133.71, new condition, Sold by Basi6 International rated 5.0 out of 5 stars, ships from Irving, TX, UNITED STATES, published 2011 by Springer.
Add this copy of A VLSI Architecture for Concurrent Data Structures to cart. $168.69, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2011 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Trade paperback (US). Glued binding. 244 p. Contains: Unspecified. The Springer International Engineering and Computer Science, 27.
Add this copy of A VLSI Architecture for Concurrent Data Structures to cart. $177.50, new condition, Sold by GreatBookPricesUK5 rated 5.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2011 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 244 p. Contains: Unspecified. The Springer International Engineering and Computer Science, 27. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of A VLSI Architecture for Concurrent Data Structures to cart. $192.20, new condition, Sold by Ria Christie Books rated 5.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2011 by Springer.
Add this copy of A Vlsi Architecture for Concurrent Data Structures (the to cart. $195.58, new condition, Sold by Just one more Chapter rated 4.0 out of 5 stars, ships from Miramar, FL, UNITED STATES, published 2011 by Springer.
Add this copy of A VLSI Architecture for Concurrent Data Structures to cart. $200.98, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2011 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Trade paperback (US). Glued binding. 244 p. Contains: Unspecified. The Springer International Engineering and Computer Science, 27. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
