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. 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. Notes This article is a direct transclusion of the Wikipedia article and therefore may not meet the same editing standards as LIMSwiki. Jump to: navigation , search. System whose components are located on different networked computers. For trustless applications, see Decentralized application.
For the computer company, see DIP Research. Main article: Distributed algorithm. Dijkstra Prize in Distributed Computing Fog computing Folding home Grid computing Inferno Jungle computing Layered queueing network Library Oriented Architecture LOA List of distributed computing conferences List of distributed computing projects List of important publications in concurrent, parallel, and distributed computing Model checking Parallel distributed processing Parallel programming model Plan 9 from Bell Labs Shared nothing architecture.
Distributed systems: principles and paradigms. Dolev Ghosh , p. Journal of Physics: Conference Series. Dolev , p.
Lynch , p. Peleg , p. Keidar National University of Singapore. Retrieved 20 July Introduction to Distributed Algorithms. Cambridge University Press.
In Rothlauf, F. Applications of Evolutionary Computing. Retrieved Lupu, Mihai.
Heidelberg: Springer. Journal of Cluster Computing. In Fijany, A.
World Scientific. Models of Computation: Exploring the Power of Computing. Addison Wesley. Papadimitriou , Section Linial In Peleg, D. Distributed Computing. Ghosh , Chapter Peleg , Section 6. Ghosh , Sections 6. Apache ZooKeeper Essentials. Packt Publishing Ltd. Information Processing.
Gallager , P. Humblet, and P. Spira January Retrieved 16 March In Hector, Z. Parallel computing. Process Thread Fiber Instruction window Array data structure. Multiprocessing Memory coherency Cache coherency Cache invalidation Barrier Synchronization Application checkpointing. These cookies allow you to explore OverDrive services and use our core features. Without these cookies, we can't provide services to you. These cookies allow us to monitor OverDrive's performance and reliability.
They alert us when OverDrive services are not working as expected. Without these cookies, we won't know if you have any performance-related issues that we may be able to address. These cookies help us understand user behavior within our services.
There are no discussion topics on this book yet.
Goodreads is hiring! If you like books and love to build cool products, we may be looking for you. About Nicola Santoro. Nicola Santoro.