词条 | Distributed computing |
释义 |
Distributed computing is a field of computer science that studies distributed systems. A distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another.[1] The components interact with one another in order to achieve a common goal. Three significant characteristics of distributed systems are: concurrency of components, lack of a global clock, and independent failure of components.[1] Examples of distributed systems vary from SOA-based systems to massively multiplayer online games to peer-to-peer applications. A computer program that runs within a distributed system is called a distributed program (and distributed programming is the process of writing such programs).[2] There are many different types of implementations for the message passing mechanism, including pure HTTP, RPC-like connectors and message queues.[3] Distributed computing also refers to the use of distributed systems to solve computational problems. In distributed computing, a problem is divided into many tasks, each of which is solved by one or more computers,[4] which communicate with each other via message passing.[5]IntroductionThe word parallel in terms such as "parallel system", "distributed programming", and "distributed algorithm" originally referred to computer networks where individual computers were physically distributed within some geographical area.[6] The terms are nowadays used in a much wider sense, even referring to autonomous processes that run on the same physical computer and interact with each other by message passing.[5] While there is no single definition of a distributed system,[7] the following defining properties are commonly used as:
A distributed system may have a common goal, such as solving a large computational problem;[10] the user then perceives the collection of autonomous processors as a unit. Alternatively, each computer may have its own user with individual needs, and the purpose of the distributed system is to coordinate the use of shared resources or provide communication services to the users.[11] Other typical properties of distributed systems include the following:
Parallel and distributed computingDistributed systems are groups of networked computers, which have the same goal for their work. The terms "concurrent computing", "parallel computing", and "distributed computing" have a lot of overlap, and no clear distinction exists between them.[15] The same system may be characterized both as "parallel" and "distributed"; the processors in a typical distributed system run concurrently in parallel.[16] Parallel computing may be seen as a particular tightly coupled form of distributed computing,[17] and distributed computing may be seen as a loosely coupled form of parallel computing.[7] Nevertheless, it is possible to roughly classify concurrent systems as "parallel" or "distributed" using the following criteria:
The figure on the right illustrates the difference between distributed and parallel systems. Figure (a) is a schematic view of a typical distributed system; the system is represented as a network topology in which each node is a computer and each line connecting the nodes is a communication link. Figure (b) shows the same distributed system in more detail: each computer has its own local memory, and information can be exchanged only by passing messages from one node to another by using the available communication links. Figure (c) shows a parallel system in which each processor has a direct access to a shared memory. The situation is further complicated by the traditional uses of the terms parallel and distributed algorithm that do not quite match the above definitions of parallel and distributed systems (see below for more detailed discussion). Nevertheless, as a rule of thumb, high-performance parallel computation in a shared-memory multiprocessor uses parallel algorithms while the coordination of a large-scale distributed system uses distributed algorithms.[20] HistoryThe use of concurrent processes that communicate by message-passing has its roots in operating system architectures studied in the 1960s.[21] The first widespread distributed systems were local-area networks such as Ethernet, which was invented in the 1970s.[22] ARPANET, the predecessor of the Internet, was introduced in the late 1960s, and ARPANET e-mail was invented in the early 1970s. E-mail became the most successful application of ARPANET,[23] and it is probably the earliest example of a large-scale distributed application. In addition to ARPANET, and its successor, the Internet, other early worldwide computer networks included Usenet and FidoNet from the 1980s, both of which were used to support distributed discussion systems.[24]The study of distributed computing became its own branch of computer science in the late 1970s and early 1980s. The first conference in the field, Symposium on Principles of Distributed Computing (PODC), dates back to 1982, and its counterpart International Symposium on Distributed Computing (DISC) was first held in Ottawa in 1985 as the International Workshop on Distributed Algorithms on Graphs.[25] ArchitecturesVarious hardware and software architectures are used for distributed computing. At a lower level, it is necessary to interconnect multiple CPUs with some sort of network, regardless of whether that network is printed onto a circuit board or made up of loosely coupled devices and cables. At a higher level, it is necessary to interconnect processes running on those CPUs with some sort of communication system.[26] Distributed programming typically falls into one of several basic architectures: client–server, three-tier, n-tier, or peer-to-peer; or categories: loose coupling, or tight coupling.[27]
Another basic aspect of distributed computing architecture is the method of communicating and coordinating work among concurrent processes. Through various message passing protocols, processes may communicate directly with one another, typically in a master/slave relationship. Alternatively, a "database-centric" architecture can enable distributed computing to be done without any form of direct inter-process communication, by utilizing a shared database.[30] ApplicationsReasons for using distributed systems and distributed computing may include:
ExamplesExamples of distributed systems and applications of distributed computing include the following:[32]
Theoretical foundations{{main|Distributed algorithm}}ModelsMany tasks that we would like to automate by using a computer are of question–answer type: we would like to ask a question and the computer should produce an answer. In theoretical computer science, such tasks are called computational problems. Formally, a computational problem consists of instances together with a solution for each instance. Instances are questions that we can ask, and solutions are desired answers to these questions. Theoretical computer science seeks to understand which computational problems can be solved by using a computer (computability theory) and how efficiently (computational complexity theory). Traditionally, it is said that a problem can be solved by using a computer if we can design an algorithm that produces a correct solution for any given instance. Such an algorithm can be implemented as a computer program that runs on a general-purpose computer: the program reads a problem instance from input, performs some computation, and produces the solution as output. Formalisms such as random access machines or universal Turing machines can be used as abstract models of a sequential general-purpose computer executing such an algorithm.[33][34] The field of concurrent and distributed computing studies similar questions in the case of either multiple computers, or a computer that executes a network of interacting processes: which computational problems can be solved in such a network and how efficiently? However, it is not at all obvious what is meant by "solving a problem" in the case of a concurrent or distributed system: for example, what is the task of the algorithm designer, and what is the concurrent or distributed equivalent of a sequential general-purpose computer?{{citation needed|date=October 2016}} The discussion below focuses on the case of multiple computers, although many of the issues are the same for concurrent processes running on a single computer. Three viewpoints are commonly used:
In the case of distributed algorithms, computational problems are typically related to graphs. Often the graph that describes the structure of the computer network is the problem instance. This is illustrated in the following example.{{citation needed|date=October 2016}} An exampleConsider the computational problem of finding a coloring of a given graph G. Different fields might take the following approaches:
While the field of parallel algorithms has a different focus than the field of distributed algorithms, there is a lot of interaction between the two fields. For example, the Cole–Vishkin algorithm for graph coloring[39] was originally presented as a parallel algorithm, but the same technique can also be used directly as a distributed algorithm. Moreover, a parallel algorithm can be implemented either in a parallel system (using shared memory) or in a distributed system (using message passing).[40] The traditional boundary between parallel and distributed algorithms (choose a suitable network vs. run in any given network) does not lie in the same place as the boundary between parallel and distributed systems (shared memory vs. message passing). Complexity measuresIn parallel algorithms, yet another resource in addition to time and space is the number of computers. Indeed, often there is a trade-off between the running time and the number of computers: the problem can be solved faster if there are more computers running in parallel (see speedup). If a decision problem can be solved in polylogarithmic time by using a polynomial number of processors, then the problem is said to be in the class NC.[41] The class NC can be defined equally well by using the PRAM formalism or Boolean circuits—PRAM machines can simulate Boolean circuits efficiently and vice versa.[42] In the analysis of distributed algorithms, more attention is usually paid on communication operations than computational steps. Perhaps the simplest model of distributed computing is a synchronous system where all nodes operate in a lockstep fashion. This model is commonly known as the LOCAL model. During each communication round, all nodes in parallel (1) receive the latest messages from their neighbours, (2) perform arbitrary local computation, and (3) send new messages to their neighbors. In such systems, a central complexity measure is the number of synchronous communication rounds required to complete the task.[43] This complexity measure is closely related to the diameter of the network. Let D be the diameter of the network. On the one hand, any computable problem can be solved trivially in a synchronous distributed system in approximately 2D communication rounds: simply gather all information in one location (D rounds), solve the problem, and inform each node about the solution (D rounds). On the other hand, if the running time of the algorithm is much smaller than D communication rounds, then the nodes in the network must produce their output without having the possibility to obtain information about distant parts of the network. In other words, the nodes must make globally consistent decisions based on information that is available in their local D-neighbourhood. Many distributed algorithms are known with the running time much smaller than D rounds, and understanding which problems can be solved by such algorithms is one of the central research questions of the field.[44] Typically an algorithm which solves a problem in polylogarithmic time in the network size is considered efficient in this model. Another commonly used measure is the total number of bits transmitted in the network (cf. communication complexity).[45] The features of this concept are typically captured with the CONGEST(B) model, which similarly defined as the LOCAL model but where single messages can only contain B bits. Other problemsTraditional computational problems take the perspective that we ask a question, a computer (or a distributed system) processes the question for a while, and then produces an answer and stops. However, there are also problems where we do not want the system to ever stop. Examples of such problems include the dining philosophers problem and other similar mutual exclusion problems. In these problems, the distributed system is supposed to continuously coordinate the use of shared resources so that no conflicts or deadlocks occur. There are also fundamental challenges that are unique to distributed computing. The first example is challenges that are related to fault-tolerance. Examples of related problems include consensus problems,[46] Byzantine fault tolerance,[47] and self-stabilisation.[48] A lot of research is also focused on understanding the asynchronous nature of distributed systems:
The network nodes communicate among themselves in order to decide which of them will get into the "coordinator" state. For that, they need some method in order to break the symmetry among them. For example, if each node has unique and comparable identities, then the nodes can compare their identities, and decide that the node with the highest identity is the coordinator.[52] The definition of this problem is often attributed to LeLann, who formalized it as a method to create a new token in a token ring network in which the token has been lost.[53] Coordinator election algorithms are designed to be economical in terms of total bytes transmitted, and time. The algorithm suggested by Gallager, Humblet, and Spira [54] for general undirected graphs has had a strong impact on the design of distributed algorithms in general, and won the Dijkstra Prize for an influential paper in distributed computing. Many other algorithms were suggested for different kind of network graphs, such as undirected rings, unidirectional rings, complete graphs, grids, directed Euler graphs, and others. A general method that decouples the issue of the graph family from the design of the coordinator election algorithm was suggested by Korach, Kutten, and Moran.[55] In order to perform coordination, distributed systems employ the concept of coordinators. The coordinator election problem is to choose a process from among a group of processes on different processors in a distributed system to act as the central coordinator. Several central coordinator election algorithms exist.[56] Properties of distributed systemsSo far the focus has been on designing a distributed system that solves a given problem. A complementary research problem is studying the properties of a given distributed system.[57][58] The halting problem is an analogous example from the field of centralised computation: we are given a computer program and the task is to decide whether it halts or runs forever. The halting problem is undecidable in the general case, and naturally understanding the behaviour of a computer network is at least as hard as understanding the behaviour of one computer.[59] However, there are many interesting special cases that are decidable. In particular, it is possible to reason about the behaviour of a network of finite-state machines. One example is telling whether a given network of interacting (asynchronous and non-deterministic) finite-state machines can reach a deadlock. This problem is PSPACE-complete,[60] i.e., it is decidable, but it is not likely that there is an efficient (centralised, parallel or distributed) algorithm that solves the problem in the case of large networks. See also{{Div col|colwidth=20em}}
Notes1. ^1 {{cite book |author1=Tanenbaum, Andrew S. |author2=Steen, Maarten van |title=Distributed systems: principles and paradigms|publisher=Pearson Prentice Hall |location=Upper Saddle River, NJ |year=2002 |pages= |isbn=0-13-088893-1 |oclc= |doi= |accessdate=|url=https://www.distributed-systems.net/index.php/books/distributed-systems-3rd-edition-2017}} 2. ^{{harvtxt|Andrews|2000}}. {{harvtxt|Dolev|2000}}. {{harvtxt|Ghosh|2007}}, p. 10. 3. ^{{Cite journal|last=Magnoni|first=L.|date=2015|title=Modern Messaging for Distributed Sytems|url=http://stacks.iop.org/1742-6596/608/i=1/a=012038|journal=Journal of Physics: Conference Series|language=en|volume=608|issue=1|pages=012038|doi=10.1088/1742-6596/608/1/012038|issn=1742-6596}} 4. ^{{harvtxt|Godfrey|2002}}. 5. ^1 {{harvtxt|Andrews|2000}}, p. 291–292. {{harvtxt|Dolev|2000}}, p. 5. 6. ^{{harvtxt|Lynch|1996}}, p. 1. 7. ^1 {{harvtxt|Ghosh|2007}}, p. 10. 8. ^{{harvtxt|Andrews|2000}}, pp. 8–9, 291. {{harvtxt|Dolev|2000}}, p. 5. {{harvtxt|Ghosh|2007}}, p. 3. {{harvtxt|Lynch|1996}}, p. xix, 1. {{harvtxt|Peleg|2000}}, p. xv. 9. ^{{harvtxt|Andrews|2000}}, p. 291. {{harvtxt|Ghosh|2007}}, p. 3. {{harvtxt|Peleg|2000}}, p. 4. 10. ^{{harvtxt|Ghosh|2007}}, p. 3–4. {{harvtxt|Peleg|2000}}, p. 1. 11. ^{{harvtxt|Ghosh|2007}}, p. 4. {{harvtxt|Peleg|2000}}, p. 2. 12. ^{{harvtxt|Ghosh|2007}}, p. 4, 8. {{harvtxt|Lynch|1996}}, p. 2–3. {{harvtxt|Peleg|2000}}, p. 4. 13. ^{{harvtxt|Lynch|1996}}, p. 2. {{harvtxt|Peleg|2000}}, p. 1. 14. ^{{harvtxt|Ghosh|2007}}, p. 7. {{harvtxt|Lynch|1996}}, p. xix, 2. {{harvtxt|Peleg|2000}}, p. 4. 15. ^{{harvtxt|Ghosh|2007}}, p. 10. {{harvtxt|Keidar|2008}}. 16. ^{{harvtxt|Lynch|1996}}, p. xix, 1–2. {{harvtxt|Peleg|2000}}, p. 1. 17. ^{{harvtxt|Peleg|2000}}, p. 1. 18. ^{{harvtxt|Papadimitriou|1994}}, Chapter 15. {{harvtxt|Keidar|2008}}. 19. ^See references in Introduction. 20. ^{{cite web |url=http://www.comp.nus.edu.sg/~rahul/allfiles/cs6234-16-pds.pdf |title=Parallel and Distributed Algorithms |author=Bentaleb, A. |author2=Yifan, L. |author3=Xin, J.|display-authors=et al |publisher=National University of Singapore |year=2016 |accessdate=20 July 2018}} 21. ^{{harvtxt|Andrews|2000}}, p. 348. 22. ^{{harvtxt|Andrews|2000}}, p. 32. 23. ^{{harvtxt|Peter|2004}}, The history of email. 24. ^{{cite book |url=https://books.google.com/books?id=1J78hiHKaPoC&pg=PT67 |title=On the Way to the Web: The Secret History of the Internet and its Founders |author=Banks, M. |publisher=Apress |pages=44–5 |year=2012 |isbn=9781430250746}} 25. ^{{cite book |url=https://books.google.com/books?id=vlpnS25qAJQC&pg=PA35 |title=Introduction to Distributed Algorithms |author=Tel, G. |publisher=Cambridge University Press |pages=35–36 |year=2000 |isbn=9780521794831}} 26. ^{{cite book |chapter=Evolutionary Design of OAB and AAB Communication Schedules for Interconnection Networks |title=Applications of Evolutionary Computing |author=Ohlídal, M. |author2=Jaroš, J. |author3=Schwarz, J.|editor=Rothlauf, F. |editor2=Branke, J. |editor3=Cagnoni, S.|display-authors=et al |publisher=Springer Science & Business Media |pages=267–78 |year=2006 |isbn=9783540332374}} 27. ^{{Cite journal |title=Real Time And Distributed Computing Systems |url=https://pdfs.semanticscholar.org/2950/37ee46ac281590f67435380cebc385ac9749.pdf |issn= 2278-0661 |access-date=2017-01-09}} 28. ^Vigna P, Casey MJ. The Age of Cryptocurrency: How Bitcoin and the Blockchain Are Challenging the Global Economic Order St. Martin's Press January 27, 2015 {{ISBN|9781250065636}} 29. ^{{Cite book|title=Peer-to-peer computing : principles and applications|last=Hieu.|first=Vu, Quang|date=2010|publisher=Springer|others=Lupu, Mihai., Ooi, Beng Chin, 1961-|isbn=9783642035135|location=Heidelberg|pages=16|oclc=663093862}} 30. ^{{Citation |vauthors=Lind P, Alm M |title=A database-centric virtual chemistry system |journal=J Chem Inf Model |volume=46 |issue=3 |pages=1034–9 |year=2006 |pmid=16711722 |doi=10.1021/ci050360b |postscript=. }} 31. ^{{harvtxt|Elmasri|Navathe|2000}}, Section 24.1.2. 32. ^{{harvtxt|Andrews|2000}}, p. 10–11. {{harvtxt|Ghosh|2007}}, p. 4–6. {{harvtxt|Lynch|1996}}, p. xix, 1. {{harvtxt|Peleg|2000}}, p. xv. {{harvtxt|Elmasri|Navathe|2000}}, Section 24. 33. ^{{cite book |chapter-url=https://books.google.com/books?id=CKTsCgAAQBAJ&pg=PA214 |chapter=Neural Networks for Real-Time Robotic Applications |title=Parallel Computation Systems For Robotics: Algorithms And Architectures |author=Toomarian, N.B. |author2=Barhen, J. |author3=Gulati, S. |editor=Fijany, A. |editor2=Bejczy, A. |publisher=World Scientific |page=214 |year=1992 |isbn=9789814506175}} 34. ^{{cite book |title=Models of Computation: Exploring the Power of Computing |author=Savage, J.E. |publisher=Addison Wesley |page=209 |year=1998 |isbn=9780201895391}} 35. ^{{harvtxt|Cormen|Leiserson|Rivest|1990}}, Section 30. 36. ^{{harvtxt|Herlihy|Shavit|2008}}, Chapters 2-6. 37. ^{{harvtxt|Lynch|1996}} 38. ^{{harvtxt|Cormen|Leiserson|Rivest|1990}}, Sections 28 and 29. 39. ^{{harvtxt|Cole|Vishkin|1986}}. {{harvtxt|Cormen|Leiserson|Rivest|1990}}, Section 30.5. 40. ^{{harvtxt|Andrews|2000}}, p. ix. 41. ^{{harvtxt|Arora|Barak|2009}}, Section 6.7. {{harvtxt|Papadimitriou|1994}}, Section 15.3. 42. ^{{harvtxt|Papadimitriou|1994}}, Section 15.2. 43. ^{{harvtxt|Lynch|1996}}, p. 17–23. 44. ^{{harvtxt|Peleg|2000}}, Sections 2.3 and 7. {{harvtxt|Linial|1992}}. {{harvtxt|Naor|Stockmeyer|1995}}. 45. ^{{cite book |chapter-url=https://books.google.com/books?id=dT6nwpXvES4C&pg=PA51 |chapter=Trading Bit, Message, and Time Complexity of Distributed Algorithms |title=Distributed Computing |author=Schneider, J. |author2=Wattenhofer, R. |editor=Peleg, D. |publisher=Springer Science & Business Media |pages=51–65 |year=2011 |isbn=9783642240997}} 46. ^{{harvtxt|Lynch|1996}}, Sections 5–7. {{harvtxt|Ghosh|2007}}, Chapter 13. 47. ^{{harvtxt|Lynch|1996}}, p. 99–102. {{harvtxt|Ghosh|2007}}, p. 192–193. 48. ^{{harvtxt|Dolev|2000}}. {{harvtxt|Ghosh|2007}}, Chapter 17. 49. ^{{harvtxt|Lynch|1996}}, Section 16. {{harvtxt|Peleg|2000}}, Section 6. 50. ^{{harvtxt|Lynch|1996}}, Section 18. {{harvtxt|Ghosh|2007}}, Sections 6.2–6.3. 51. ^{{harvtxt|Ghosh|2007}}, Section 6.4. 52. ^1 {{cite book |url=https://books.google.com/books?id=Ym9uBgAAQBAJ&pg=PA100 |title=Apache ZooKeeper Essentials |author=Haloi, S. |publisher=Packt Publishing Ltd |pages=100–101 |year=2015 |isbn=9781784398323}} 53. ^{{Cite journal|last=LeLann|first=G.|year=1977|title=Distributed systems - toward a formal approach|url=|journal=Information Processing|volume=77|pages=155·160|via=Elsevier}} 54. ^{{cite journal|date=January 1983|title=A Distributed Algorithm for Minimum-Weight Spanning Trees|url=http://www.apposite-tech.com/blog/wp-content/uploads/2017/09/p66-gallager.pdf|journal=ACM Transactions on Programming Languages and Systems|volume=5|issue=1|pages=66–77|doi=10.1145/357195.357200|author=R. G. Gallager, P. A. Humblet, and P. M. Spira}} 55. ^{{cite journal|year=1990|title=A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms|journal=ACM Transactions on Programming Languages and Systems|volume=12|issue=1|pages=84–101|doi=10.1145/77606.77610|first1=Ephraim|last1=Korach|first2=Shay|last2=Kutten|first3=Shlomo|last3=Moran|authorlink2=Shay Kutten|authorlink3=Shlomo Moran|url=http://www.cs.technion.ac.il/~moran/r/PS/kkm.pdf|citeseerx=10.1.1.139.7342}} 56. ^{{cite web|url=http://www2.cs.uregina.ca/~hamilton/courses/330/notes/distributed/distributed.html|title=Distributed Algorithms|last=Hamilton|first=Howard|accessdate=2013-03-03}} 57. ^{{cite web|url=http://cstheory.stackexchange.com/questions/10045/major-unsolved-problems-in-distributed-systems|title=Major unsolved problems in distributed systems?|author=|date=|website=cstheory.stackexchange.com|accessdate=16 March 2018}} 58. ^{{cite web|url=http://www.theserverside.com/feature/How-big-data-and-distributed-systems-solve-traditional-scalability-problems|title=How big data and distributed systems solve traditional scalability problems|author=|date=|website=theserverside.com|accessdate=16 March 2018}} 59. ^{{cite book |chapter-url=https://books.google.com/books?id=ep_FCgAAQBAJ&pg=PA112 |chapter=Indeterminism and Randomness Through Physics |title=Randomness Through Computation: Some Answers, More Questions |author=Svozil, K. |editor=Hector, Z. |publisher=World Scientific |pages=112–3 |year=2011 |isbn=9789814462631}} 60. ^{{harvtxt|Papadimitriou|1994}}, Section 19.3. References
| last=Andrews | first=Gregory R. | title=Foundations of Multithreaded, Parallel, and Distributed Programming | publisher=Addison–Wesley | year=2000 | isbn=978-0-201-35752-3 }}.
| last1=Arora | first1=Sanjeev | authorlink1=Sanjeev Arora | last2=Barak | first2=Boaz | title=Computational Complexity – A Modern Approach | publisher=Cambridge | year=2009 | isbn=978-0-521-42426-4 }}.
| last1=Cormen | first1=Thomas H. | authorlink1=Thomas H. Cormen | last2=Leiserson | first2=Charles E. | authorlink2=Charles E. Leiserson | last3=Rivest | first3=Ronald L. | authorlink3=Ron Rivest | title=Introduction to Algorithms | publisher=MIT Press | year=1990 | edition=1st | isbn=978-0-262-03141-7 | title-link=Introduction to Algorithms }}.
| last=Dolev | first=Shlomi | authorlink=Shlomi Dolev | title=Self-Stabilization | publisher=MIT Press | year=2000 | isbn=978-0-262-04178-2 }}.
| last1=Elmasri | first1=Ramez | last2=Navathe | first2=Shamkant B. | authorlink2=Shamkant Navathe | title=Fundamentals of Database Systems | publisher=Addison–Wesley | edition=3rd | year=2000 | isbn=978-0-201-54263-9 }}.
| last=Ghosh | first=Sukumar | title=Distributed Systems – An Algorithmic Approach | publisher=Chapman & Hall/CRC | year=2007 | isbn=978-1-58488-564-1 }}.
| last=Lynch | first=Nancy A. | authorlink=Nancy Lynch | title=Distributed Algorithms | publisher=Morgan Kaufmann | year=1996 | isbn=978-1-55860-348-6 }}.
| last1=Herlihy| first1=Maurice P. | authorlink1=Maurice Herlihy | last2=Shavit | first2=Nir N. | authorlink2=Nir Shavit | title=The Art of Multiprocessor Programming | publisher=Morgan Kaufmann | year=2008 | isbn=978-0-12-370591-4 }}.
| last=Papadimitriou | first=Christos H. | authorlink=Christos Papadimitriou | title=Computational Complexity | publisher=Addison–Wesley | year=1994 | isbn=978-0-201-53082-7 }}.
| last=Peleg | first=David | authorlink=David Peleg (scientist) | title=Distributed Computing: A Locality-Sensitive Approach | publisher=SIAM | year=2000 | isbn=978-0-89871-464-7 | url=http://www.ec-securehost.com/SIAM/DT05.html }}.
| last1 = Cole | first1 = Richard | last2 = Vishkin | first2 = Uzi | authorlink2=Uzi Vishkin | year = 1986 | title = Deterministic coin tossing with applications to optimal parallel list ranking | journal = Information and Control | volume = 70 | issue = 1 | pages = 32–53 | doi = 10.1016/S0019-9958(86)80023-7 }}.
| doi=10.1145/1466390.1466402 | last1=Keidar | first1=Idit | title=Distributed computing column 32 – The year in review | journal=ACM SIGACT News | volume=39 | issue=4 | year=2008 | pages=53–54 | url=http://webee.technion.ac.il/~idish/sigactNews/#column%2032 | citeseerx=10.1.1.116.1285 }}.
| last=Linial | first=Nathan | authorlink = Nati Linial | doi=10.1137/0221015 | title=Locality in distributed graph algorithms | journal=SIAM Journal on Computing | volume=21 | year=1992 | pages=193–201 | issue=1 | citeseerx=10.1.1.471.6378 }}.
| last1=Naor | first1=Moni | authorlink1=Moni Naor | last2=Stockmeyer | first2=Larry | authorlink2=Larry Stockmeyer | doi=10.1137/S0097539793254571 | title=What can be computed locally? | journal=SIAM Journal on Computing | volume=24 | year=1995 | pages=1259–1277 | issue=6 | url=http://www.wisdom.weizmann.ac.il/~naor/PAPERS/lcl.pdf| citeseerx=10.1.1.29.669 }}.
| last=Godfrey | first=Bill | url=http://www.bacchae.co.uk/docs/dist.html | title=A primer on distributed computing | year=2002|ref=harv }}
| last=Peter | first=Ian | url=http://www.nethistory.info/History%20of%20the%20Internet/ | title=Ian Peter's History of the Internet | year=2004 | accessdate=2009-08-04|ref=harv }} Further reading
| editor1-last=Keidar | editor1-first=Idit | editor2-last=Rajsbaum | editor2-first=Sergio | contribution-url=http://webee.technion.ac.il/~idish/sigactNews/ | contribution=Distributed computing column | title=ACM SIGACT News | year=2000–2009 | title-link=ACM SIGACT News }}.
External links{{Commonscat}}
2 : Distributed computing|Decentralization |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。