Articles liés à A VLSI Architecture for Concurrent Data Structures
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour A VLSI Architecture for Concurrent Data Structures
Image fournie par le vendeur
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Edité par
Springer, 1987
ISBN 10 : 0898382351
ISBN 13 : 9780898382358
Ancien ou d'occasion
Couverture rigide
Vendeur : Bay State Book Company, North Smithfield, RI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing. N° de réf. du vendeur BSM.1BWS4
Acheter D'occasion
EUR 103,04
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
A VLSI Architecture for Concurrent Data Structures
Edité par
Springer US Sep 1987, 1987
ISBN 10 : 0898382351
ISBN 13 : 9780898382358
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9780898382358
Acheter neuf
EUR 160,49
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
A VLSI Architecture for Concurrent Data Structures
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : New. N° de réf. du vendeur 5982396
Acheter neuf
EUR 136,16
Expédition à EUR 48,99
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Vlsi Architecture for Concurrent Data Structures
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 2387559-n
Acheter neuf
EUR 191,32
Expédition à EUR 2,35
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 15 disponible(s)
Image fournie par le vendeur
Vlsi Architecture for Concurrent Data Structures
Edité par
Springer, 1987
ISBN 10 : 0898382351
ISBN 13 : 9780898382358
Ancien ou d'occasion
Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 2387559
Acheter D'occasion
EUR 192,62
Expédition à EUR 2,35
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 15 disponible(s)
Image d'archives
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In English. N° de réf. du vendeur ria9780898382358_new
Acheter neuf
EUR 185,09
Expédition à EUR 13,36
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
VLSI Architecture for Concurrent Data Structures
Edité par
Kluwer Academic Publishers, 1987
ISBN 10 : 0898382351
ISBN 13 : 9780898382358
Neuf
Couverture rigide
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. . . . . N° de réf. du vendeur V9780898382358
Acheter neuf
EUR 200,83
Expédition à EUR 9,50
Expédition depuis Irlande vers Etats-Unis
Expédition depuis Irlande vers Etats-Unis
Quantité disponible : 15 disponible(s)
Image fournie par le vendeur
A VLSI Architecture for Concurrent Data Structures
impression à la demandeVendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. A VLSI Architecture for Concurrent Data Structures | J. W. Dally | Buch | The Springer International Series in Engineering and Computer Science | 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. N° de réf. du vendeur 102483114
Acheter neuf
EUR 141,20
Expédition à EUR 70
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image d'archives
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Vendeur : BennettBooksLtd, Los Angeles, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : New. In shrink wrap. Looks like an interesting title! N° de réf. du vendeur Q-0898382351
Acheter neuf
EUR 211,23
Expédition à EUR 6,20
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
A VLSI Architecture for Concurrent Data Structures
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9780898382358
Acheter neuf
EUR 183,30
Expédition à EUR 35
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)