A VLSI Architecture for Concurrent Data Structures - J. W. Dally
-40% ar kodu BOOKS
Piegāde 12-18 darba dienu laikā
30 dienu atgriešanas politika
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 derivati ... Pilns apraksts
Jums varētu patikt arī
TOP
INCOSE Systems Engineering Handbook
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
If Anyone Builds It, Everyone Dies: The Case Against Superintelligent AI
Eliezer Yudkowsky, Nate Soares
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Open Circuits: The Inner Beauty of Electronic Components
Eric Schlaepfer, Windell Oskay
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Get started with MicroPython on Raspberry Pi Pico: The Official Raspberry Pi Pico Guide
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
We Are Not Machines: The Fight for the Future of Work
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Foundations of Flavor: The Noma Guide to Fermentation: Including Step-By-Step Information on Making and Cooking with: Koji, Kombuchas, Shoyus, Misos, Vinegars, Garums, Lacto-Ferments and black Fruits Vegetables
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Nucleo Boards Programming with the STM32CubeIDE: Hands-on in more than 50 projects
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Steven L. Brunton, J. Nathan Kutz
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Black Holes: The Key to Understanding the Universe
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Practical Electronics for Inventors
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Flowers For Algernon: A Modern Literary Classic
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Human Compatible: Artificial Intelligence and the Problem of Control
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How To Read Water: Clues & Patterns from Puddles to the Sea
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Make: Electronics: Learning by Discovery: A hands-on primer for the new electronics enthusiast
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Mastering the Arduino Uno R4: Programming and Projects for the Minima and WiFi
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Idea Factory: Bell Labs and the Great Age of American Innovation
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Fundamentals of Aerodynamics ISE
Christopher Cadou, John D. Anderson
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Foundation Design and Construction
-40% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
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.
Vairāk informācijas
| Autors | J. W. Dally |
|---|---|
| Izdevējs | Springer New York |
| Series | The Springer International Series in Engineering and Computer Science |
| Izlaides gads | 2011 |
| Vāka tips | Mīkstais vāks |
| EAN | 9781461291916 |