Atjaunināt sīkdatņu piekrišanu

E-grāmata: Recoverable Mutual Exclusion

  • Formāts - EPUB+DRM
  • Cena: 41,62 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This book discusses the recent research work on designing efficient fault-tolerant synchronization mechanisms for concurrent processes using the relatively new persistent memory technology that combines the low latency benefits of DRAM with the persistence of magnetic disks. The authors include all of the major contributions published to date, and also convey some perspective regarding how the problem itself is evolving. The results are described at a high level to enable readers to gain a quick and thorough understanding of the RME problem and its nuances, as well as various solutions that have been designed to solve the problem under a variety of important conditions and how they compare to each other.
Introduction.- Persistent Memory.- Prior Work.- Problem
Formulation.- Load and Store based Algorithms.- Sublogarithmic
Algorithms.- Adaptive Algorithms.- Constant Amortized Complexity
Algorithm.- Abortable Recoverable Mutual Exclusion.- Tight Lower
Bound.- System Wide Failures.-Discussion and Open Problems.
Sahil Dhoked, Ph.D., is a Research Scientist at Meta Platforms. He received his Ph.D. in computer science from the University of Texas at Dallas in 2022 under the supervision of Dr. Neeraj Mittal. He received his B.Tech. degree in computer science and engineering from the Indian Institute of Technology, Indore in 2013. He previously worked as a software development engineer at Microsoft.





Wojciech Golab, Ph.D., is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo. He received his Ph.D. in computer science from the University of Toronto in 2010. In the same year, he completed a post-doctoral fellowship at the University of Calgary and later joined Hewlett-Packard Labs in Palo Alto as a Research Scientist. He is broadly interested in concurrency and fault tolerance in distributed systems, with a special focus on bridging the gap between theory and practice.





Neeraj Mittal, Ph.D., is a Pofessor in theDepartment of Computer Science at the University of Texas at Dallas and Co-director of the Advanced Networking and Dependable System Laboratory (ANDES). He received his B.Tech. degree in computer science and engineering from the Indian Institute of Technology, Delhi in 1995 and the M.S. and Ph.D. degrees in computer science from the University of Texas at Austin in 1997 and 2002, respectively.  His research interests include multi-core computing, distributed computing, fault tolerant computing, and distributed algorithms for wireless networking.