Verwandte Artikel zu A VLSI Architecture for Concurrent Data Structures:...
A VLSI Architecture for Concurrent Data Structures: 27 (The Springer International Series in Engineering and Computer Science) - Hardcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Gebraucht kaufen
Zustand: Gut bis sehr gutAncien livre de bibliothèque. Traces...
Diesen Artikel anzeigen
EUR 24,99
EUR 22,50 für den Versand von Frankreich nach USA
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 157,81
EUR 3,42 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für A VLSI Architecture for Concurrent Data Structures:...
Beispielbild für diese ISBN
A Vlsi Architecture for Concurrent Data Structures
Verlag:
Kluwer Academic Publishers, 1987
ISBN 10: 0898382351
ISBN 13: 9780898382358
Gebraucht
Hardcover
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Bon. Ancien livre de bibliothèque. Traces d'usure sur la couverture. Edition 1987. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Edition 1987. Ammareal gives back up to 15% of this item's net price to charity organizations. Bestandsnummer des Verkäufers E-583-014
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar2317530032032
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9780898382358_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
A VLSI Architecture for Concurrent Data Structures
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9780898382358
Anzahl: 2 verfügbar
Foto des Verkäufers
A VLSI Architecture for Concurrent Data Structures
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Gebunden. Zustand: New. Bestandsnummer des Verkäufers 5982396
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Anbieter: BennettBooksLtd, San Diego, NV, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: New. In shrink wrap. Looks like an interesting title! Bestandsnummer des Verkäufers Q-0898382351
Anzahl: 1 verfügbar
Foto des Verkäufers
A VLSI Architecture for Concurrent Data Structures
Print-on-DemandAnbieter: preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. A VLSI Architecture for Concurrent Data Structures | J. W. Dally | Buch | xx | Englisch | 1987 | Springer US | 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. Bestandsnummer des Verkäufers 102483114
Anzahl: 5 verfügbar
Beispielbild für diese ISBN
VLSI Architecture for Concurrent Data Structures
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. . . . . Bestandsnummer des Verkäufers V9780898382358
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
A VLSI Architecture for Concurrent Data Structures
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 268. Bestandsnummer des Verkäufers 263064054
Anzahl: 4 verfügbar
Foto des Verkäufers
A VLSI Architecture for Concurrent Data Structures
Verlag:
Springer US, Springer US Sep 1987, 1987
ISBN 10: 0898382351
ISBN 13: 9780898382358
Neu
Hardcover
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. 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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 268 pp. Englisch. Bestandsnummer des Verkäufers 9780898382358
Anzahl: 2 verfügbar