Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 72,32
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. 1st edition NO-PA16APR2015-KAP.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 65,56
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In English.
Idioma: Inglés
Publicado por Springer International Publishing, 2021
ISBN 10: 303100678X ISBN 13: 9783031006784
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 58,84
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Search structures support the fundamental data storage primitives on key-value pairs: insert a pair, delete by key, search by key, and update the value associated with a key. Concurrent search structures are parallel algorithms to speed access to search structures on multicore and distributed servers. These sophisticated algorithms perform fine-grained synchronization between threads, making them notoriously difficult to design correctly. Indeed, bugs have been found both in actual implementations and in the designs proposed by experts in peer-reviewed publications. The rapid development and deployment of these concurrent algorithms has resulted in a rift between the algorithms that can be verified by the state-of-the-art techniques and those being developed and used today. The goal of this book is to show how to bridge this gap in order to bring the certified safety of formal verification to high-performance concurrent search structures. Similar techniques and frameworks can be applied to concurrent graph and network algorithms beyond search structures.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 123,65
Cantidad disponible: 10 disponibles
Añadir al carritoCondición: New.
EUR 54,80
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Automated Verification of Concurrent Search Structures | Siddharth Krishna (u. a.) | Taschenbuch | Synthesis Lectures on Computer Science | x | Englisch | 2021 | Springer | EAN 9783031006784 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
EUR 123,39
Cantidad disponible: 10 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 146,44
Cantidad disponible: 10 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 147,17
Cantidad disponible: 10 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 158,19
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
EUR 168,36
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 175,52
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
EUR 180,46
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
EUR 217,07
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 192 pages. 9.18x6.12x9.45 inches. In Stock.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 50,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 76,22
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 71,66
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Idioma: Inglés
Publicado por Springer International Publishing Jun 2021, 2021
ISBN 10: 303100678X ISBN 13: 9783031006784
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 58,84
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Search structures support the fundamental data storage primitives on key-value pairs: insert a pair, delete by key, search by key, and update the value associated with a key. Concurrent search structures are parallel algorithms to speed access to search structures on multicore and distributed servers. These sophisticated algorithms perform fine-grained synchronization between threads, making them notoriously difficult to design correctly. Indeed, bugs have been found both in actual implementations and in the designs proposed by experts in peer-reviewed publications. The rapid development and deployment of these concurrent algorithms has resulted in a rift between the algorithms that can be verified by the state-of-the-art techniques and those being developed and used today. The goal of this book is to show how to bridge this gap in order to bring the certified safety of formal verification to high-performance concurrent search structures. Similar techniques and frameworks can be applied to concurrent graph and network algorithms beyond search structures. 192 pp. Englisch.
Idioma: Inglés
Publicado por Springer, Berlin|Springer International Publishing|Morgan & Claypool|Springer, 2021
ISBN 10: 303100678X ISBN 13: 9783031006784
Librería: moluna, Greven, Alemania
EUR 51,51
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Search structures support the fundamental data storage primitives on key-value pairs: insert a pair, delete by key, search by key, and update the value associated with a key. Concurrent search structures are parallel algorithms to speed access to search str.
Idioma: Inglés
Publicado por Springer, Palgrave Macmillan Jun 2021, 2021
ISBN 10: 303100678X ISBN 13: 9783031006784
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 58,84
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Search structures support the fundamental data storage primitives on key-value pairs: insert a pair, delete by key, search by key, and update the value associated with a key. Concurrent search structures are parallel algorithms to speed access to search structures on multicore and distributed servers. These sophisticated algorithms perform fine-grained synchronization between threads, making them notoriously difficult to design correctly. Indeed, bugs have been found both in actual implementations and in the designs proposed by experts in peer-reviewed publications. The rapid development and deployment of these concurrent algorithms has resulted in a rift between the algorithms that can be verified by the state-of-the-art techniques and those being developed and used today. The goal of this book is to show how to bridge this gap in order to bring the certified safety of formal verification to high-performance concurrent search structures. Similar techniques and frameworks can be applied to concurrent graph and network algorithms beyond search structures.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 192 pp. Englisch.
Librería: moluna, Greven, Alemania
EUR 176,88
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Vamsi Krishna Kudapa, Associate Professor, working in Department of Chemical and Petroleum Engineering, UPES, Dehradun Since 2013. Before UPES, he worked as an Assistant Professor and Head in the Department of Petroleum Engineering, Sri Aditya Eng.