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,150
Discovery Miles 41 500
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,150 Discovery Miles 41 500 | Repayment Terms: R389 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 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!

You might also like..

Kreislauf des Lebens
Jacob Moleschott Hardcover R1,199 Discovery Miles 11 990
Applying Integration Techniques and…
Gabor Kecskemeti Hardcover R6,050 Discovery Miles 60 500
Creativity in Load-Balance Schemes for…
Alberto Garcia-Robledo, Arturo Diaz Perez, … Hardcover R3,901 Discovery Miles 39 010
Cyber-Physical Systems for Social…
Maya Dimitrova, Hiroaki Wagatsuma Hardcover R6,528 Discovery Miles 65 280
Constraint Decision-Making Systems in…
Santosh Kumar Das, Nilanjan Dey Hardcover R7,404 Discovery Miles 74 040
Concurrency - The Works of Leslie…
Dahlia Malkhi Hardcover R2,469 Discovery Miles 24 690
Computation and Storage in the Cloud…
Dong Yuan, Yun Yang, … Paperback R986 R856 Discovery Miles 8 560
Migrating Legacy Applications…
Anca Daniela Ionita, Marin Litoiu, … Hardcover R4,968 Discovery Miles 49 680
Cloud Technology - Concepts…
Irma Hardcover R17,860 Discovery Miles 178 600
Cloud Technology - Concepts…
Irma Hardcover R17,858 Discovery Miles 178 580
Blockchain Applications
Arshdeep Bagha Hardcover R1,870 R1,522 Discovery Miles 15 220
Magnetic Core Memory Decoded
J.S. Walker Hardcover R850 Discovery Miles 8 500

See more

Partners