A VLSI Architecture for Concurrent Data Structures by J. W. Dally
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science) by J. W. Dally
English | Sep 30, 1987 | ISBN: 0898382351 | 257 Pages | DJVU | 1 MB
English | Sep 30, 1987 | ISBN: 0898382351 | 257 Pages | DJVU | 1 MB
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.