Search results

* [[BQP]]: a complexity class of problems for which there are polynomial-time quantum algorithms which are correct WH ...protocols]]: a [[communication protocol]] used in [[Distributed computing|distributed systems]] to reliably deliver messages to the whole cluster using a constan ...

A '''version vector''' is a mechanism for tracking changes to data in a [[distributed system]], where multiple agents might update the data at different times. T ...ware Engineering. 1983</ref> or variants are used to track updates in many distributed file systems, such as [[Coda (file system)]] and Ficus, and are the main d ...

...o.ethz.ch/alumni/pascal/refs/mst_1987_awerbuch.pdf|journal=SIAM Journal on Computing}}</ref> Unlike [[Mega-Merger]] it has a trivial termination and cost analys ...p://people.scs.carleton.ca/~santoro/DADA.html|title=Design and Analysis of Distributed Algorithms|last=Santoro|first=Nicola|website=people.scs.carleton.ca|page=21 ...

{{redirect|Elastic computing|the physical property|Elasticity (physics)|the economics measurement|Elasti ...Responsive Elastic Computing |date=15 June 2009 |publisher=Association for Computing Machinery |isbn=978-1-60558-578-9|display-authors=etal}}</ref> ...

...te=2023-06-01 |title=Termination of amnesiac flooding |journal=Distributed Computing |language=en |volume=36 |issue=2 |pages=193–207 |doi=10.1007/s00446-023-004 Since its introduction, several variants of and related problems to amnesiac flooding have been studied. For example, a modified variant req ...

...o.ethz.ch/alumni/pascal/refs/mst_1987_awerbuch.pdf|journal=SIAM Journal on Computing}}</ref> ...ger at [[Massachusetts Institute of Technology|MIT]] in 1983. It applies a distributed [[Divide and conquer algorithm|divide and conquer]] approach mixed with a r ...

....<ref>{{Cite web|title=Satish Rao {{!}} Simons Institute for the Theory of Computing|url=https://simons.berkeley.edu/people/satish-rao|access-date=2021-06-02|we ...|access-date=2021-06-02|website=awards.acm.org|publisher=[[Association for Computing Machinery]]|language=en}}</ref> ...

...-Bounded Speedup, X.H. Sun, and L. Ni, Journal of Parallel and Distributed Computing, Vol. 19, p. 27–37, Sept. 1993.</ref> was initially proposed by Xian-He Sun ...its memory-bounded function, ''W=G(M)'', it reveals the trade-off between computing and memory in algorithm and [[Computer architecture|system architecture]] d ...

In distributed computing, shared-memory systems and [[message-passing]] systems are two widely studi ...=Kshemkalyani|first1=Ajay D.|last2=Singhal|first2=Mukesh|title=Distributed computing : principles, algorithms, and systems|url=https://archive.org/details/distr ...

{{Short description|Distributed algorithm for sensor networks}} |title = Robust Distributed Computing and Sensing Algorithm ...

...markov-uniformization-jpdc/| journal = Journal of Parallel and Distributed Computing | volume = 64 | issue = 8 | pages = 908–920 | year = 2004 | hdl = 10044/1/5 ...for typical problems," though they note that for [[stiff equation|stiff]] problems some tailored algorithms are likely to perform better.<ref name="reibman" / ...

{{about|a theoretical model for parallel algorithms|the general concept of computing with many parallel devices|massively parallel}} ...se frameworks such as [[MapReduce]], and frequently applied to algorithmic problems in [[graph theory]].{{r|iklmv}} ...

{{Short description|Data structure in distributed computing}} ...is a type of [[data structure]], which is shared between several [[thread (computing)|threads]] or processes. For many tasks, it is important to have a [[data s ...

...g the best value found during the process. Many real-world and theoretical problems may be modeled in this general framework. For example, the inputs can be de ...um constraints|MPEC]]). Specialized algorithms for nonlinear least squares problems. ...

...under the supervision of [[Jan van Leeuwen]] with the thesis ''Distributed Computing – Structure and Complexity.''<ref name="cv"/><ref>{{mathgenealogy|id=83356| | journal = SIAM Journal on Computing ...

...h|text=[[reconfigurability]], the ability to change the configuration of a computing or communications system}} ...tical computer science]], '''reconfiguration''' problems are computational problems involving [[reachability]] or [[Connectivity (graph theory)|connectivity]] ...

...body|convex bodies]], a problem that can also be used to model many other problems in [[combinatorial enumeration]]. ...thod, it is possible to generate points that are nearly uniformly randomly distributed within a given convex body. The basic scheme of the algorithm is a nearly u ...

...') = ''g''(''y''). The pair (''x'', ''y'') is then called a ''claw''. Some problems, especially in cryptography, are best solved when viewed as a claw finding ...ngyu |title=Computing and Combinatorics |volume=3595 |chapter=Promised and Distributed Quantum Search |publisher=Springer Berlin Heidelberg |pages=430–439 |langua ...

...ue]], where service times must be [[exponential distribution|exponentially distributed]] and of the [[M/G/1 queue]] with a single server. Most performance metrics ...g M/G/m Queues | title = 2011 31st International Conference on Distributed Computing Systems Workshops | pages = 87 | year = 2011 | isbn = 978-1-4577-0384-3 | s ...

...to another, yet their purpose remains the same: manipulation of [[Symbolic computing|symbolic equations]]. Computer algebra systems often include facilities for ...rs then decided to write a similar program in [[C (programming language)|C computing language]] rather than Pascal, which he renamed [[Cadabra (computer program ...