Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 66,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In English.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. 1st edition NO-PA16APR2015-KAP.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 73,99
Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New.
Lingua: Inglese
Editore: Springer International Publishing, 2021
ISBN 10: 303100678X ISBN 13: 9783031006784
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 58,84
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
EUR 54,80
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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 124,44
Quantità: 10 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: As New. Unread book in perfect condition.
Condizione: New.
EUR 156,01
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
EUR 148,31
Quantità: 10 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 166,03
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New.
EUR 180,46
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
EUR 216,57
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 192 pages. 9.18x6.12x9.45 inches. In Stock.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 50,23
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Da: Majestic Books, Hounslow, Regno Unito
EUR 75,57
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Lingua: Inglese
Editore: Springer International Publishing Jun 2021, 2021
ISBN 10: 303100678X ISBN 13: 9783031006784
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 58,84
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 77,88
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.
Lingua: Inglese
Editore: Springer, Berlin|Springer International Publishing|Morgan & Claypool|Springer, 2021
ISBN 10: 303100678X ISBN 13: 9783031006784
Da: moluna, Greven, Germania
EUR 51,51
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.
Lingua: Inglese
Editore: Springer, Palgrave Macmillan Jun 2021, 2021
ISBN 10: 303100678X ISBN 13: 9783031006784
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 58,84
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: moluna, Greven, Germania
EUR 176,88
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.