Articoli correlati a A VLSI Architecture for Concurrent Data Structures:...
Sinossi
Concurrent data structures simplify the development of concurrent programs by encapsulating commonly used mechanisms for synchronization and commu nication into data structures.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
1 Introduction.- 1.1 Original Results.- 1.2 Motivation.- 1.3 Background.- 1.4 Concurrent Computers.- 1.4.1 Sequential Computers.- 1.4.2 Shared-Memory Concurrent Computers.- 1.4.3 Message-Passing 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.1.1 The Ordered Set.- 3.1.2 The Binary nCube.- 3.1.3 The Gray Code.- 3.1.4 The Balanced Cube.- 3.2 Search.- 3.2.1 Distance Properties of the Gray Code.- 3.2.2 VW 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.2.1 Single Point Shortest Path.- 4.2.2 Multiple Point Shortest Path.- 4.2.3 All Points Shortest Path.- 4.3 The Max-Flow Problem.- 4.3.1 Constructing a Layered Graph.- 4.3.2 The CAD Algorithm.- 4.3.3 The CVF Algorithm.- 4.3.4 Distributed Vertices.- 4.3.5 Experimental Results.- 4.4 Graph Partitioning.- 4.4.1 Why Concurrency is Hard.- 4.4.2 Gain.- 4.4.3 Coordinating Simultaneous Moves.- 4.4.4 Balance.- 4.4.5 Allowing Negative Moves.- 4.4.6 Performance.- 4.4.7 Experimental Results.- 4.5 Summary.- 5 Architecture.- 5.1 Characteristics of Concurrent Algorithms.- 5.2 Technology.- 5.2.1 Wiring Density.- 5.2.2 Switching Dynamics.- 5.2.3 Energetics.- 5.3 Concurrent Computer Interconnection Networks.- 5.3.1 Network Topology.- 5.3.2 Deadlock-Free Routing.- 5.3.3 The Torus Routing Chip.- 5.4 A Message-Driven Processor.- 5.4.1 Message Reception.- 5.4.2 Method Lookup.- 5.4.3 Execution.- 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.
Product Description
Book by Dally J W
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per A VLSI Architecture for Concurrent Data Structures:...
Foto dell'editore
A VLSI, Architecture for Concurrent Data Structure
Print on DemandDa: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service. Codice articolo POD-146470
Compra nuovo
EUR 137,68
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 10 disponibili
Foto dell'editore
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780898382358_new
Compra nuovo
EUR 165,85
Spedizione EUR 13,99
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
A VLSI Architecture for Concurrent Data Structures
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 268 pp. Englisch. Codice articolo 9780898382358
Compra nuovo
EUR 160,49
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
A VLSI Architecture for Concurrent Data Structures
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Gebunden. Condizione: New. Codice articolo 5982396
Compra nuovo
EUR 136,16
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
VLSI Architecture for Concurrent Data Structures
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: New. Series: The Springer International Series in Engineering and Computer Science. Num Pages: 244 pages, biography. BIC Classification: UNC; UYFP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 15. Weight in Grams: 553. . 1987. Hardback. . . . . Codice articolo V9780898382358
Compra nuovo
EUR 200,83
Spedizione EUR 9,50
Spedito da Irlanda a U.S.A.
Spedito da Irlanda a U.S.A.
Quantità: 15 disponibili
Immagini fornite dal venditore
A VLSI Architecture for Concurrent Data Structures
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. A VLSI Architecture for Concurrent Data Structures | J. W. Dally | Buch | xx | Englisch | 1987 | Springer | EAN 9780898382358 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Codice articolo 102483114
Compra nuovo
EUR 141,20
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Foto dell'editore
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: New. In shrink wrap. Looks like an interesting title! Codice articolo Q-0898382351
Compra nuovo
EUR 205,49
Spedizione EUR 6,03
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
A VLSI Architecture for Concurrent Data Structures
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 268. Codice articolo 263064054
Compra nuovo
EUR 212,44
Spedizione EUR 3,46
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 4 disponibili
Immagini fornite dal venditore
A VLSI Architecture for Concurrent Data Structures
Editore:
Springer, Springer Sep 1987, 1987
ISBN 10: 0898382351
ISBN 13: 9780898382358
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 268 pp. Englisch. Codice articolo 9780898382358
Compra nuovo
EUR 160,49
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
A VLSI Architecture for Concurrent Data Structures
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
Condizione: New. Print on Demand pp. 268 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Codice articolo 5865257
Compra nuovo
EUR 222,04
Spedizione EUR 7,59
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 4 disponibili