A VLSI Architecture for Concurrent Data Structures

Author:   J. W. Dally ,  J W Dally
Publisher:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 1987
Volume:   27
ISBN:  

9781461291916


Pages:   244
Publication Date:   01 November 2011
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $448.77 Quantity:  
Add to Cart

Share |

A VLSI Architecture for Concurrent Data Structures


Add your own review!

Overview

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.

Full Product Details

Author:   J. W. Dally ,  J W Dally
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 1987
Volume:   27
Dimensions:   Width: 15.50cm , Height: 1.40cm , Length: 23.50cm
Weight:   0.415kg
ISBN:  

9781461291916


ISBN 10:   1461291917
Pages:   244
Publication Date:   01 November 2011
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

1 Introduction.- 1.1 Original Results.- 1.2 Motivation.- 1.3 Background.- 1.4 Concurrent Computers.- 1.5 Summary.- 2 Concurrent Smalltalk.- 2.1 Object-Oriented Programming.- 2.2 Distributed Objects.- 2.3 Concurrency.- 2.4 Locks.- 2.5 Blocks.- 2.6 Performance Metrics.- 2.7 Summary.- 3 The Balanced Cube.- 3.1 Data Structure.- 3.2 Search.- 3.3 Insert.- 3.4 Delete.- 3.5 Balance.- 3.6 Extension to B-Cubes.- 3.7 Experimental Results.- 3.8 Applications.- 3.9 Summary.- 4 Graph Algorithms.- 4.1 Nomenclature.- 4.2 Shortest Path Problems.- 4.3 The Max-Flow Problem.- 4.4 Graph Partitioning.- 4.5 Summary.- 5 Architecture.- 5.1 Characteristics of Concurrent Algorithms.- 5.2 Technology.- 5.3 Concurrent Computer Interconnection Networks.- 5.4 A Message-Driven Processor.- 5.5 Object Experts.- 5.6 Summary.- 6 Conclusion.- A Summary of Concurrent Smalltalk.- B Unordered Sets.- B.1 Dictionaries.- B.2 Union-Find Sets.- C On-Chip Wire Delay.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

wl

Shopping Cart
Your cart is empty
Shopping cart
Mailing List