Search results

...istributed-systems.net/index.php/books/ds3/|access-date=2021-03-20|website=DISTRIBUTED-SYSTEMS.NET|language=en-US}}</ref> The first logical clock implementation, .../ Ajay Kshemkalyani and Mukesh Singhal, Distributed Computing: Principles, Algorithms, and Systems, Cambridge University Press, 2008</ref> ...

...harder to design and often less efficient than the equivalent synchronous algorithms. By using a synchronizer, algorithm designers can deal with the simplified == Available synchronizer algorithms == ...

...<ref name="lynch1997">{{cite book|last=Lynch|first=Nancy|title=Distributed Algorithms|url=https://archive.org/details/distributedalgor0000lync|url-access=registr ...failures and unreliable communications links. The choice of an appropriate distributed algorithm to solve a given problem depends on both the characteristics of t ...

...pt of [[fault-tolerance]] in [[distributed computing]]. Superstabilizing [[distributed algorithm]]s combine the features of [[self-stabilizing algorithm]]s and [[ ...ergence from an arbitrary starting state. In the study of superstabilizing algorithms, special attention is paid to the time it takes to recover from a single ch ...

...the [[Association for Computing Machinery]] [[Special Interest Group]] on Algorithms and Computation Theory, whose purpose is support of research in [[theoretic *PODC: ACM [[Symposium on Principles of Distributed Computing]] (jointly sponsored by SIGOPS) ...

...ges |first=Uzi |last=Vishkin |publisher=Class notes of courses on parallel algorithms taught since 1992 at the University of Maryland, College Park, Tel Aviv Uni ...en referred to as "[[sequential algorithm]]s", by contrast with concurrent algorithms. ...

|fields = [[Genetic algorithms]] |known_for = Work in the field of [[genetic algorithms]] ...

...saan |author1-link=Shing-Tsaan Huang |title=Termination detection by using distributed snapshots |journal=Information Processing Letters |volume=32 |issue=3 |page ...oncept of a distributed system process' state. At any time, a process in a distributed system is either in an active state or in an idle state. An active process ...

...lgorithm searches for numbers with a certain mathematical relationship. In distributed factoring projects, this is the step that is parallelized to a large number ...o using larger keys (computationally more expensive) or to using different algorithms, whose security rests on some other computationally hard problem (like the ...

...iv = 1906.09629}}</ref> It has been used in [[PiHex]], the now-completed [[distributed computing]] project. ...ns. Rather than having to compute all of the digits twice by two separate algorithms to ensure that a computation is correct, the final digits of a very long al ...

...638337 |chapter=A Survey on Centralised and Distributed Clustering Routing Algorithms for WSNs |author1=Morteza M. Zanjireh |author2=Hadi Larijani |title=2015 IE ...

...rformed are already decided, and in practice, scheduling tends to focus on algorithms for specific problem domains".<ref>{{cite web |url=http://ai.jpl.nasa.gov/p *[[Distributed artificial intelligence]] ...

==Algorithms and theory== * ISAAC – [[International Symposium on Algorithms and Computation]] ...

...findings in the fields of [[Parallel computing|parallel processing]] and [[distributed computing]]. In addition to technical sessions of submitted paper presentat ...rs representing original unpublished research in all areas of parallel and distributed processing, including the development of experimental or commercial systems ...

* [[Network File System]], a distributed file system protocol * [[Number field sieve (disambiguation)]], algorithms for factoring integers ...

'''Maekawa's algorithm''' is an algorithm for [[mutual exclusion]] on a [[distributed system]]. The basis of this algorithm is a [[quorum]]-like approach where a ...edu/~dga/15-440/F09/lectures/Distributed-Mutual-Exclusion-slides.pdf|title=Distributed Mutual Exclusion|last=|first=|date=|website=|access-date=}}</ref> ...

'''Distributed ray tracing''', also called '''distribution ray tracing''' and '''stochasti Distributed ray tracing removes these restrictions by averaging multiple rays distributed over an interval. For example, soft shadows can be rendered by distributin ...

...of selection. This technique can be used to approximate other scheduling [[algorithms]], such as ...ing should take into consideration that there could be billions of tickets distributed among a large pool of [[Thread (computing)|threads]]. To have an [[Array (d ...

...lamport/pubs/time-clocks.pdf "Time, Clocks and the Ordering of Events in a Distributed System"], ''Communications of the ACM'', 21(7), 558-565.</ref> ...istributed-systems.net/index.php/books/ds3/|access-date=2021-03-20|website=DISTRIBUTED-SYSTEMS.NET|language=en-US}}</ref> ...

...a [[Distributed computing#Election|coordinator]] or leader from a group of distributed computer processes. The process with the highest process ID number from amo ...t1=George |last2=Dollimore |first2=Jean |last3=Kindberg |first3=Tim |title=Distributed Systems: Concepts and Design |date=2000 |publisher=Addison Wesley |isbn=978 ...