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,647
Discovery Miles 46 470
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,647 Discovery Miles 46 470 | Repayment Terms: R435 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 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
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..

Parallel Computing
Moreshwar R. Bhujade Hardcover R1,057 Discovery Miles 10 570
Rust Atomics and Locks - Low-Level…
Mara Bos Paperback R962 Discovery Miles 9 620
Grokking Continuous Delivery
Christie Wilson Paperback R1,260 Discovery Miles 12 600
Vehicular Ad Hoc Networks - Futuristic…
Muhammad Arif, Guojun Wang, … Hardcover R3,257 Discovery Miles 32 570
Monolith to Microservices - Evolutionary…
Sam Newman Paperback R963 Discovery Miles 9 630
Cassandra - The Definitive Guide, 3e…
Jeff Carpenter, Eben Hewitt Paperback R1,707 R1,213 Discovery Miles 12 130
Parallel Algorithms
Henri Casanova, Arnaud Legrand, … Paperback R1,458 Discovery Miles 14 580
LTE Cellular Narrowband Internet of…
Hossam Fattah Hardcover R3,568 Discovery Miles 35 680
Parallel Computers 2 - Architecture…
R.W. Hockney, C.R. Jesshope Paperback R1,815 Discovery Miles 18 150
GPU Parallel Program Development Using…
Tolga Soyata Paperback R1,477 Discovery Miles 14 770
Parallel Programming for Modern High…
Pawel Czarnul Paperback R1,441 Discovery Miles 14 410
Building Machine Learning Pipelines
Hannes Hapke Paperback R1,337 Discovery Miles 13 370

See more

Partners