• Sign In / Register
  • Help
  • Basket0
A VLSI Architecture for Concurrent Data Structures - The Springer International Series in Engineering and Computer Science 27 (Paperback)
  • A VLSI Architecture for Concurrent Data Structures - The Springer International Series in Engineering and Computer Science 27 (Paperback)
zoom

A VLSI Architecture for Concurrent Data Structures - The Springer International Series in Engineering and Computer Science 27 (Paperback)

(author)
£99.99
Paperback 244 Pages / Published: 01/11/2011
  • Not available

This product is currently unavailable.

  • This item has been added to your basket
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.

Publisher: Springer-Verlag New York Inc.
ISBN: 9781461291916
Number of pages: 244
Weight: 415 g
Dimensions: 235 x 155 x 14 mm
Edition: Softcover reprint of the original 1st ed. 198

You may also be interested in...

Make: More Electronics
Added to basket
The Lego Mindstorms Ev3 Discovery Book
Added to basket
Encyclopedia of Electronic Components
Added to basket
Arduino Projects For Dummies
Added to basket
Robotics: A Very Short Introduction
Added to basket
Getting Started with Arduino
Added to basket
Arduino in Easy Steps
Added to basket
Electronics For Dummies
Added to basket
Industrial Electrical Troubleshooting
Added to basket
Electronic Circuits, 4th ed
Added to basket
Exploring Arduino
Added to basket
£27.99
Paperback

Reviews

Please sign in to write a review

Your review has been submitted successfully.