{"title":"Michel Raynal","description":null,"products":[{"product_id":"distributed-algorithms-for-message-passing-systems-book-michel-raynal-9783642381225","title":"Distributed Algorithms for Message-Passing Systems","description":"Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity.      While some distributed algorithms consist of a few lines only, their behavior can be difficult to understand and their properties hard to state and prove. The aim of this book is to present in a comprehensive way the basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an asynchronous network. The book is composed of seventeen chapters structured into six parts: distributed graph algorithms, in particular what makes them different from sequential or parallel algorithms; logical time and global states, the core of the book; mutual exclusion and resource allocation; high-level communication abstractions; distributed detection of properties; and distributed shared memory. The author establishes clear objectives per chapter and the content is supported throughout with illustrative examples, summaries, exercises, and annotated bibliographies.     This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduate students in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications. The reader should have a basic knowledge of algorithms and operating systems.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50037973156113,"sku":"CIN3642381227G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":50404762222865,"sku":"CIN3642381227VG","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":53522754896145,"sku":"NLS9783642381225","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3642381227.jpg?v=1750774624"},{"product_id":"distributed-algorithms-and-protocols-book-michel-raynal-9780471917540","title":"Distributed Algorithms and Protocols","description":"The use of distributed algorithms offers the prospect of great advances in computing speed. This book attempts to provide a clear, practical and up-to-date guide to distributed algoriths and protocols in the area of control. The first chapter lays the foundations; subsequent chapters, which can be studied independently of each other, consider different aspects of control. Each chapter consists of an analysis of the problem, followed by descriptions of the algorithms to solve it, with proofs of correctness. The book will be of use for undergraduate and graduate students in computer science, and also researchers and software engineers.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50356229341457,"sku":"CIN0471917540G","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0471917540.jpg?v=1751198179"},{"product_id":"concurrent-programming-algorithms-principles-and-foundations-book-michel-raynal-9783642320262","title":"Concurrent Programming: Algorithms, Principles, and Foundations","description":"This book is devoted to the most difficult part of concurrent programming, namely synchronization concepts, techniques and principles when the cooperating entities are asynchronous, communicate through a shared memory, and may experience failures. Synchronization is no longer a set of tricks but, due to research results in recent decades, it relies today on sane scientific foundations as explained in this book.  In this book the author explains synchronization and the implementation of concurrent objects, presenting in a uniform and comprehensive way the major theoretical and practical results of the past 30 years. Among the key features of the book are a new look at lock-based synchronization (mutual exclusion, semaphores, monitors, path expressions); an introduction to the atomicity consistency criterion and its properties and a specific chapter on transactional memory; an introduction to mutex-freedom and associated progress conditions such as obstruction-freedom and wait-freedom; a presentation of Lamport's hierarchy of safe, regular and atomic registers and associated wait-free constructions; a description of numerous wait-free constructions of concurrent objects (queues, stacks, weak counters, snapshot objects, renaming objects, etc.); a presentation of the computability power of concurrent objects including the notions of universal construction, consensus number and the associated Herlihy's hierarchy; and a survey of failure detector-based constructions of consensus objects.     The book is suitable for advanced undergraduate students and graduate students in computer science or computer engineering, graduate students in mathematics interested in the foundations of process synchronization, and practitioners and engineers who need to produce correct concurrent software. The reader should have a basic knowledge of algorithms and operating systems.","brand":"WoB","offers":[{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":50404744003857,"sku":"CIN3642320260VG","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52663746494737,"sku":"NLS9783642320262","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3642320260.jpg?v=1750934384"},{"product_id":"concurrent-programming-algorithms-principles-and-foundations-book-michel-raynal-9783642446153","title":"Concurrent Programming: Algorithms, Principles, and Foundations","description":"This book is devoted to the most difficult part of concurrent programming, namely synchronization concepts, techniques and principles when the cooperating entities are asynchronous, communicate through a shared memory, and may experience failures. Synchronization is no longer a set of tricks but, due to research results in recent decades, it relies today on sane scientific foundations as explained in this book.  In this book the author explains synchronization and the implementation of concurrent objects, presenting in a uniform and comprehensive way the major theoretical and practical results of the past 30 years. Among the key features of the book are a new look at lock-based synchronization (mutual exclusion, semaphores, monitors, path expressions); an introduction to the atomicity consistency criterion and its properties and a specific chapter on transactional memory; an introduction to mutex-freedom and associated progress conditions such as obstruction-freedom and wait-freedom; a presentation of Lamport's hierarchy of safe, regular and atomic registers and associated wait-free constructions; a description of numerous wait-free constructions of concurrent objects (queues, stacks, weak counters, snapshot objects, renaming objects, etc.); a presentation of the computability power of concurrent objects including the notions of universal construction, consensus number and the associated Herlihy's hierarchy; and a survey of failure detector-based constructions of consensus objects.     The book is suitable for advanced undergraduate students and graduate students in computer science or computer engineering, graduate students in mathematics interested in the foundations of process synchronization, and practitioners and engineers who need to produce correct concurrent software. The reader should have a basic knowledge of algorithms and operating systems.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51061105557777,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51061107982609,"sku":"NIN9783642446153","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52138181099793,"sku":"NLS9783642446153","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3642446159.jpg?v=1750934399"},{"product_id":"concurrent-crash-prone-shared-memory-systems-book-michel-raynal-9783031792014","title":"Concurrent Crash-Prone Shared Memory Systems","description":"List of Figures.- List of Algorithms.- List of Tables.- Preface.- Acknowledgments.- Distributed Universality.- Distributed Recursivity.- The BG Simulation.- Anonymity.- Bibliography.- Author's Biography.- Index.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51061774876945,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51061777727761,"sku":"NIN9783031792014","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52427527258385,"sku":"NLS9783031792014","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3031792017.jpg?v=1750966894"},{"product_id":"distributed-algorithms-for-message-passing-systems-book-michel-raynal-9783642437434","title":"Distributed Algorithms for Message-Passing Systems","description":"Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity.      While some distributed algorithms consist of a few lines only, their behavior can be difficult to understand and their properties hard to state and prove. The aim of this book is to present in a comprehensive way the basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an asynchronous network. The book is composed of seventeen chapters structured into six parts: distributed graph algorithms, in particular what makes them different from sequential or parallel algorithms; logical time and global states, the core of the book; mutual exclusion and resource allocation; high-level communication abstractions; distributed detection of properties; and distributed shared memory. The author establishes clear objectives per chapter and the content is supported throughout with illustrative examples, summaries, exercises, and annotated bibliographies.     This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduate students in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications. The reader should have a basic knowledge of algorithms and operating systems.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51064346870033,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51064349065489,"sku":"NIN9783642437434","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52125107683601,"sku":"NLS9783642437434","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3642437435.jpg?v=1750934398"},{"product_id":"fault-tolerant-agreement-in-synchronous-message-passing-systems-book-michel-raynal-9783031008733","title":"Fault-tolerant Agreement in Synchronous Message-passing Systems","description":"Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. A previous book Communication and Agreement Abstraction for Fault-tolerant Asynchronous Distributed Systems (published by Morgan \u0026amp; Claypool, 2010) was devoted to the problems created by crash failures in asynchronous message-passing systems. The present book focuses on the way to cope with the uncertainty created by process failures (crash, omission failures and Byzantine behavior) in synchronous message-passing systems (i.e., systems whose progress is governed by the passage of time). To that end, the book considers fundamental problems that distributed synchronous processes have to solve. These fundamental problems concern agreement among processes (if processes are unable to agree in one way or another in presence of failures, no non-trivial problem can be solved). They are consensus, interactiveconsistency, k-set agreement and non-blocking atomic commit. Being able to solve these basic problems efficiently with provable guarantees allows applications designers to give a precise meaning to the words \"\"cooperate\"\" and \"\"agree\"\" despite failures, and write distributed synchronous programs with properties that can be stated and proved. Hence, the aim of the book is to present a comprehensive view of agreement problems, algorithms that solve them and associated computability bounds in synchronous message-passing distributed systems. Table of Contents: List of Figures \/ Synchronous Model, Failure Models, and Agreement Problems \/ Consensus and Interactive Consistency in the Crash Failure Model \/ Expedite Decision in the Crash Failure Model \/ Simultaneous Consensus Despite Crash Failures \/ From Consensus to k-Set Agreement \/ Non-Blocking Atomic Commit in Presence of Crash Failures \/ k-Set Agreement Despite Omission Failures \/ Consensus Despite Byzantine Failures \/ Byzantine Consensusin Enriched Models","brand":"WoB","offers":[{"title":"US \/ NEW \/ INGRAM","offer_id":51064618156305,"sku":"NIN9783031008733","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ GARDNERS","offer_id":52152949440785,"sku":"NGR9783031008733","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52427838226705,"sku":"NLS9783031008733","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3031008731.jpg?v=1751220872"},{"product_id":"communication-and-agreement-abstractions-for-fault-tolerant-asynchronous-distrib-book-michel-raynal-9783031008726","title":"Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems","description":"Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. Considering the uncertainty created by asynchrony and process crash failures in the context of message-passing systems, the book focuses on the main abstractions that one has to understand and master in order to be able to produce software with guaranteed properties. These fundamental abstractions are communication abstractions that allow the processes to communicate consistently (namely the register abstraction and the reliable broadcast abstraction), and the consensus agreement abstractions that allows them to cooperate despite failures. As they give a precise meaning to the words \"communicate\" and \"agree\" despite asynchrony and failures, these abstractions allow distributed programs to be designed with properties that can be stated and proved. Impossibility results are associated with these abstractions. Hence, in order to circumvent these impossibilities, the book relies on the failure detector approach, and, consequently, that approach to fault-tolerance is central to the book. Table of Contents: List of Figures \/ The Atomic Register Abstraction \/ Implementing an Atomic Register in a Crash-Prone Asynchronous System \/ The Uniform Reliable Broadcast Abstraction \/ Uniform Reliable Broadcast Abstraction Despite Unreliable Channels \/ The Consensus Abstraction \/ Consensus Algorithms for Asynchronous Systems Enriched with Various Failure Detectors \/ Constructing Failure Detectors","brand":"WoB","offers":[{"title":"GB \/ NEW \/ GARDNERS","offer_id":52152906088721,"sku":"NGR9783031008726","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52431847260433,"sku":"NLS9783031008726","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783031008726.jpg?v=1757618262"},{"product_id":"fault-tolerant-message-passing-distributed-systems-book-michel-raynal-9783319941400","title":"Fault-Tolerant Message-Passing Distributed Systems","description":"This book presents the most important fault-tolerant distributed programming abstractions and their associated distributed algorithms, in particular in terms of reliable communication and agreement, which lie at the heart of nearly all distributed applications.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52585241182481,"sku":"NLS9783319941400","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761267405073,"sku":"NIN9783319941400","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783319941400.jpg?v=1761052468"},{"product_id":"fault-tolerant-message-passing-distributed-systems-book-michel-raynal-9783030068035","title":"Fault-Tolerant Message-Passing Distributed Systems","description":"This book presents the most important fault-tolerant distributed programming abstractions and their associated distributed algorithms, in particular in terms of reliable communication and agreement, which lie at the heart of nearly all distributed applications.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52592571842833,"sku":"NLS9783030068035","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783030068035.jpg?v=1761066202"}],"url":"https:\/\/www.worldofbooks.com\/en-gb\/collections\/author-books-by-michel-raynal.oembed","provider":"World of Books ","version":"1.0","type":"link"}