0
Your cart

Your cart is empty

Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > Parallel processing

Buy Now

A VLSI Architecture for Concurrent Data Structures (Hardcover, 1987 ed.) Loot Price: R4,524
Discovery Miles 45 240
A VLSI Architecture for Concurrent Data Structures (Hardcover, 1987 ed.): J W Dally

A VLSI Architecture for Concurrent Data Structures (Hardcover, 1987 ed.)

J W Dally

Series: The Springer International Series in Engineering and Computer Science, 27

 (sign in to rate)
Loot Price R4,524 Discovery Miles 45 240 | Repayment Terms: R424 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

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."

General

Imprint: Kluwer Academic Publishers
Country of origin: United States
Series: The Springer International Series in Engineering and Computer Science, 27
Release date: September 1987
First published: 1987
Authors: J W Dally
Dimensions: 235 x 155 x 15mm (L x W x T)
Format: Hardcover
Pages: 244
Edition: 1987 ed.
ISBN-13: 978-0-89838-235-8
Categories: Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > Parallel processing
Books > Computing & IT > Applications of computing > Databases > Data capture & analysis
Promotions
LSN: 0-89838-235-1
Barcode: 9780898382358

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners