Read While You Wait - Get immediate ebook access, if available*, when you order a print book

The Springer International Series in Engineering and Computer Science

A VLSI Architecture for Concurrent Data Structures

Authors: Dally, J. W.

Free Preview

Buy this book

eBook $109.00
price for USA in USD
  • ISBN 978-1-4613-1995-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $199.99
price for USA in USD
Softcover $139.99
price for USA in USD
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.

Table of contents (6 chapters)

Table of contents (6 chapters)

Buy this book

eBook $109.00
price for USA in USD
  • ISBN 978-1-4613-1995-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $199.99
price for USA in USD
Softcover $139.99
price for USA in USD
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
A VLSI Architecture for Concurrent Data Structures
Authors
Series Title
The Springer International Series in Engineering and Computer Science
Series Volume
27
Copyright
1987
Publisher
Springer US
Copyright Holder
Kluwer Academic Publishers
eBook ISBN
978-1-4613-1995-5
DOI
10.1007/978-1-4613-1995-5
Hardcover ISBN
978-0-89838-235-8
Softcover ISBN
978-1-4612-9191-6
Series ISSN
0893-3405
Edition Number
1
Number of Pages
XX, 244
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works and instructor copies are not included.