A VLSI Architecture for Concurrent Data Structures by J. W. Dally.

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 structure...

Full description

Saved in:
Bibliographic Details
Main Author: Dally, J. W. (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: New York, NY : Springer US : Imprint: Springer, 1987.
Edition:1st ed. 1987.
Series:The Springer International Series in Engineering and Computer Science, 27
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
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.