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.
Acheter neuf
Afficher cet article
EUR 136,16
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour A Vlsi Architecture for Concurrent Data Structures
Image d'archives
A Vlsi Architecture for Concurrent Data Structures
Edité par
Kluwer Academic Publishers, 1987
ISBN 10 : 0898382351
ISBN 13 : 9780898382358
Ancien ou d'occasion
Couverture rigide
Vendeur : Ammareal, Morangis, France
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : 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. N° de réf. du vendeur E-583-014
Quantité disponible : 1 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
Quantité disponible : Plus de 20 disponibles
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. N° de réf. du vendeur ria9780898382358_new
Quantité disponible : Plus de 20 disponibles
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
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
A VLSI Architecture for Concurrent Data Structures
Edité par
Springer US, Springer US Sep 1987, 1987
ISBN 10 : 0898382351
ISBN 13 : 9780898382358
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9780898382358
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
A VLSI Architecture for Concurrent Data Structures
Edité par
Springer US, Springer US, 1987
ISBN 10 : 0898382351
ISBN 13 : 9780898382358
Neuf
Couverture rigide
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
Quantité disponible : 1 disponible(s)
Image d'archives
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar2317530032032
Quantité disponible : Plus de 20 disponibles
Image d'archives
A VLSI Architecture for Concurrent Data Structures
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 268. N° de réf. du vendeur 263064054
Quantité disponible : 4 disponible(s)
Image d'archives
A VLSI Architecture for Concurrent Data Structures
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 5865257
Quantité disponible : 4 disponible(s)
Image d'archives
A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27)
Vendeur : BennettBooksLtd, North Las Vegas, NV, 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
Quantité disponible : 1 disponible(s)