Skip to main content
SpringerLink
Log in
Book cover

A VLSI Architecture for Concurrent Data Structures

  • Book
  • © 1987

Overview

Authors:
  1. William J. Dally

    1. Massachusetts Institute of Technology, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Pages i-xix
    Download chapter PDF

  2. Introduction

    • William J. Dally
    Pages 1-11

  3. Concurrent Smalltalk

    • William J. Dally
    Pages 13-25

  4. The Balanced Cube

    • William J. Dally
    Pages 27-73

  5. Graph Algorithms

    • William J. Dally
    Pages 75-132

  6. Architecture

    • William J. Dally
    Pages 133-195

  7. Conclusion

    • William J. Dally
    Pages 197-202

  8. Back Matter

    Pages 203-243
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Massachusetts Institute of Technology, USA

    William J. Dally

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation