An introduction to distributed algorithms

A senior undergraduate or graduate level computer science textbook on algorithm design for distributed computer systems.

[1]  Neil Immerman,et al.  Foundations of Knowledge for Distributed Systems , 1986, TARK.

[2]  Valmir C. Barbosa,et al.  MPH - a hybrid parallel machine , 1989 .

[3]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[4]  Sukumar Ghosh,et al.  Binary Self-Stabilization in Distributed Systems , 1991, Inf. Process. Lett..

[5]  S. Venkatesan,et al.  The Lower Bounds on Distributed Shortest Paths , 1993, Inf. Process. Lett..

[6]  T. V. Lakshman,et al.  Distributed Computing on Regular Networks with Anonymous Nodes , 1994, IEEE Trans. Computers.

[7]  Richard M. Fujimoto,et al.  Optimistic approaches to parallel discrete event simulation , 1990 .

[8]  Richard J. Anderson,et al.  On the parallel implementation of Goldberg's maximum flow algorithm , 1992, SPAA '92.

[9]  Douglas M. Pase,et al.  Intel iPSC concurrent computer , 1987 .

[10]  Ernest J. H. Chang.  n-Philosophers: An Exercise in Distributed Control , 1980, Comput. Networks.

[11]  Tao Jiang,et al.  The synchronization of nonuniform networks of finite automata , 1989, 30th Annual Symposium on Foundations of Computer Science.

[12]  Wayne M. Loucks,et al.  The role of knowledge in distributed simulation , 1990 .

[13]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[14]  Subbarayan Venkatesan,et al.  A Message-Optimal Algorithm for Distributed Termination Detection , 1990, J. Parallel Distributed Comput..

[15]  Eli Gafni,et al.  A Distributed Implementation of Simulated Annealing , 1989, J. Parallel Distributed Comput..

[16]  Geoffrey C. Fox,et al.  Solving problems on concurrent processors: vol. 2 , 1990 .

[17]  Bertsch,et al.  Numerical simulation of medium energy heavy ion reactions. , 1985, Physical review. C, Nuclear physics.

[18]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[19]  Job Zwiers,et al.  From sequential layers to distributed processes: deriving a distributed minimum weight spanning tree algorithm , 1992, PODC '92.

[20]  Bauer,et al.  Bubble and ring formation in nuclear fragmentation. , 1992, Physical review letters.

[21]  Eli Gafni,et al.  Concurrency in heavily loaded neighborhood-constrained systems , 1989, ICDCS.

[22]  Manfred K. Warmuth,et al.  Gap Theorems for Distributed Computation , 1993, SIAM J. Comput..

[23]  Yehuda Afek,et al.  Time and message bounds for election in synchronous and asynchronous complete networks , 1985, PODC '85.

[24]  K. Mani Chandy,et al.  Asynchronous distributed simulation via a sequence of parallel computations , 1981, CACM.

[25]  Baruch Awerbuch.  Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization , 1985, Networks.

[26]  and Charles K. Taft Reswick,et al.  Introduction to Dynamic Systems , 1967 .

[27]  Thomas J. LeBlanc,et al.  Debugging Parallel Programs with Instant Replay , 1987, IEEE Transactions on Computers.

[28]  Ajay D. Kshemkalyani,et al.  On Characterization and Correctness of Distributed Deadlock Detection , 1994, J. Parallel Distributed Comput..

[29]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Breadth-First Trees , 1992, Inf. Process. Lett..

[30]  B. R. Badrinath,et al.  Recording Distributed Snapshots Based on Causal Order of Message Delivery , 1992, Inf. Process. Lett..

[31]  Valmir Carneiro Barbosa,et al.  Time sharing in hypercube multiprocessors , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[32]  S. Doaitse Swierstra,et al.  Towards the Formal Design of Self-Stabilizing Distributed Algorithms , 1993, STACS.

[33]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[34]  Nancy A. Lynch,et al.  Distributed Computing: Models and Methods , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[35]  Nicola Santoro,et al.  TIME vs BITS , 1989, STACS.

[36]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[37]  Jayadev Misra,et al.  Distributed discrete-event simulation , 1986, CSUR.

[38]  Nancy A. Lynch,et al.  Fast allocation of nearby resources in a distributed system , 1980, STOC '80.

[39]  Makoto Imase,et al.  Gloabl Condtions in Debugging Distributed Programs , 1992, J. Parallel Distributed Comput..

[40]  Marco Schneider,et al.  Self-stabilization , 1993, CSUR.

[41]  Devendra Kumar,et al.  Development of a Class of Distributed Termination Detection Algorithms , 1992, IEEE Trans. Knowl. Data Eng..

[42]  Wayne M. Loucks,et al.  The Impact of Lookahead on the Performance of Conservative Distributed Simulation , 1990 .

[43]  Shlomi Dolev,et al.  Self-Stabilizing Depth-First Search , 1994, Inf. Process. Lett..

[44]  Gurdip Singh,et al.  Leader election in complete networks , 1992, PODC '92.

[45]  Tatsuya Suda,et al.  Survey of traffic control schemes and protocols in ATM networks , 1991, Proc. IEEE.

[46]  Anoop Gupta,et al.  The performance impact of flexibility in the Stanford FLASH multiprocessor , 1994, ASPLOS VI.

[47]  Lewis W. Tucker,et al.  CMMD: Active Messages on the CM-5 , 1994, Parallel Comput..

[48]  Gerard Tel,et al.  Bit-Optimal Election in Synchronous Rings , 1990, Inf. Process. Lett..

[49]  David M. Nicol,et al.  Optimal Dynamic Remapping of Data Parallel Computations , 1990, IEEE Trans. Computers.

[50]  George D. Stamoulis,et al.  Traffic source models for ATM networks: a survey , 1994, Comput. Commun..

[51]  K. Mani Chandy,et al.  Distributed Simulation: A Case Study in Design and Verification of Distributed Programs , 1979, IEEE Transactions on Software Engineering.

[52]  S. Haldar.  An 'All Pairs Shortest Paths' Distributed Algorithm Using 2n² Messages , 1997, J. Algorithms.

[53]  Ajoy Kumar Datta,et al.  Two-State Self-Stabilizing Algorithms for Token Rings , 1994, IEEE Trans. Software Eng..

[54]  Paul F. Reynolds,et al.  Non-interfering GVT computation via asynchronous global reductions , 1993, WSC '93.

[55]  James R. Larus,et al.  Tempest and typhoon: user-level shared memory , 1994, ISCA '94.

[56]  Valmir Carneiro Barbosa,et al.  An Algorithm for FIFO Message Delivery Among Migrating Tasks , 1995, Inf. Process. Lett..

[57]  Lúcia Maria de A. Drummond,et al.  From distributed algorithms to OCCAM programs by successive refinements , 1994, J. Syst. Softw..

[58]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Spanning Trees , 1991, Inf. Process. Lett..

[59]  Mukesh Singhal,et al.  Deadlock detection in distributed systems , 1989, Computer.

[60]  Valmir C. Barbosa,et al.  An Occam-based evaluation of a parallel version of simulated annealing , 1990, Microprocessing and Microprogramming.

[61]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[62]  Mukesh Singhal.  A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems , 1989, IEEE Trans. Computers.

[63]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[64]  Ronald Fagin,et al.  What can machines know?: On the properties of knowledge in distributed systems , 1992, JACM.

[65]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[66]  Mamoru Maekawa,et al.  Operating Systems: Advanced Concepts , 1987 .

[67]  Leonid A. Levin,et al.  Fast and lean self-stabilizing asynchronous protocols , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[68]  Lisa Sokol,et al.  MTW: A Control Mechanism for Parallel Discrete Simulation , 1989, ICPP.

[69]  Anjali Agarwal,et al.  Modified distributed snapshots algorithm for protocol stabilization , 1994, Comput. Commun..

[70]  Shing-Tsaan Huang,et al.  Distributed execution model for self-stabilizing systems , 1994, 14th International Conference on Distributed Computing Systems.

[71]  Ronald Fagin,et al.  Modelling Knowledge and Action in Distributed Systems , 1988, Concurrency.

[72]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[73]  Shing-Tsaan Huang,et al.  Termination detection by using distributed snapshots , 1989, Inf. Process. Lett..

[74]  Sam Toueg,et al.  A distributed algorithm for generalized deadlock detection , 1984, PODC '84.

[75]  Valmir C. Barbosa,et al.  Specification of a communication virtual processor for parallel processing systems , 1988 .

[76]  Yi-Bing Lin,et al.  Some Properties of Conservative Parallel Discrete Event Simulation , 1992, J. Inf. Sci. Eng..

[77]  Ajoy Kumar Datta,et al.  Simulation of self-stabilizing algorithms in distributed systems , 1992, Annual Simulation Symposium.

[78]  David M. Nicol,et al.  Global synchronization for optimistic parallel discrete event simulation , 1993, PADS '93.

[79]  Jian Xu,et al.  Adaptive independent checkpointing for reducing rollback propagation , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[80]  C. Siva Ram Murthy,et al.  Static Task Allocation of Concurrent Programs for Distributed Computing Systems with Processor and Resource Heterogeneity , 1994, Parallel Comput..

[81]  Taesoon Park,et al.  Checkpointing and rollback-recovery in distributed systems , 1989 .

[82]  Evangelos Kranakis,et al.  Computing Boolean Functions on Anonymous Networks , 1990, ICALP.

[83]  Valmir C. Barbosa,et al.  Fast linear system solution by neural networks , 1992, Oper. Res. Lett..

[84]  Richard M. Fujimoto,et al.  An Adaptive Memory Management Protocol for Time Warp Simulation , 1994, SIGMETRICS.

[85]  Alexander I. Tomlinson,et al.  Detecting relational global predicates in distributed systems , 1993, PADD '93.

[86]  Moshe Sidi,et al.  On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays , 1994, IEEE Trans. Parallel Distributed Syst..

[87]  Charles E. McDowell,et al.  Debugging the MP-2001 , 1992, A Workshop on Future Directions of Massively Parallel Processing, The New Frontiers.

[88]  Mukesh Singhal.  A Taxonomy of Distributed Mutual Exclusion , 1993, J. Parallel Distributed Comput..

[89]  Hagit Attiya,et al.  Better Computing on the Anonymous Ring , 1988, J. Algorithms.

[90]  Michel Raynal,et al.  Algorithms for mutual exclusion , 1986 .

[91]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[92]  Anant Agarwal,et al.  Integrating message-passing and shared-memory: early experience , 1993, PPOPP '93.

[93]  Suresh Singh,et al.  Electing "Good" Leaders , 1994, J. Parallel Distributed Comput..

[94]  Philip A. Wilsey,et al.  pGVT: an algorithm for accurate GVT estimation , 1994, PADS '94.

[95]  Sudhakar Yalamanchili,et al.  Adaptive routing protocols for hypercube interconnection networks , 1993, Computer.

[96]  A. V. Karzanov,et al.  Determining the maximal flow in a network by the method of preflows , 1974 .

[97]  Eli Gafni,et al.  Understanding and verifying distributed algorithms using stratified decomposition , 1988, PODC '88.

[98]  Masaaki Mizuno,et al.  A DAG-based algorithm for distributed mutual exclusion , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[99]  Michael Goldsmith,et al.  Programming in occam 2 , 1985, Prentice Hall international series in computer science.

[100]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[101]  Shyan-Ming Yuan,et al.  Message complexity of the tree quorum algorithm for distributed mutual exclusion , 1994, 14th International Conference on Distributed Computing Systems.

[102]  Sergio Rajsbaum,et al.  Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version) , 1991, WDAG.

[103]  A. Bonato,et al.  Graphs and Hypergraphs , 2021, Clustering.

[104]  B. Awerbuch,et al.  Distributed program checking: a paradigm for building self-stabilizing distributed protocols , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[105]  Baruch Awerbuch,et al.  On buffer-economical store-and-forward deadlock prevention , 1994, IEEE Trans. Commun..

[106]  Zhonghua Yang,et al.  Global snapshots for distributed debugging , 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.

[107]  Yehuda Afek,et al.  Distributed Algorithms for Unidirectional Networks , 1994, SIAM J. Comput..

[108]  Valmir C. Barbosa,et al.  An integrated software environment for large-scale Occam programming , 1991, Microprocessing and Microprogramming.

[109]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[110]  Ehud Shapiro,et al.  Spatial machines: a more realistic approach to parallel computation , 1992, CACM.

[111]  K. V. S. Ramarao,et al.  Divide and conquer for distributed mutual exclusion , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[112]  Jean-Michel Hélary.  Observing Global States of Asynchronous Distributed Applications , 1989, WDAG.

[113]  Nachum Shacham,et al.  Distributed algorithms for computing shortest pairs of disjoint paths , 1993, IEEE Trans. Inf. Theory.

[114]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[115]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[116]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[117]  Geoffrey C. Fox,et al.  Concurrent computation and the theory of complex systems , 1986 .

[118]  David Peleg,et al.  Time-Optimal Leader Election in General Networks , 1990, J. Parallel Distributed Comput..

[119]  Baruch Awerbuch,et al.  Randomized distributed shortest paths algorithms , 1989, STOC '89.

[120]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[121]  Francis Y. L. Chin,et al.  Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees , 1990, SIAM J. Comput..

[122]  Stephen J. Turner,et al.  A generalized carrier-null method for conservative parallel simulation , 1994, PADS '94.

[123]  C. R. Muthukrishnan,et al.  A Note on Raymond's Tree Based Algorithm for Distributed Mutual Exclusion , 1992, Inf. Process. Lett..

[124]  Robert E. Tarjan,et al.  Network Flow Algorithms , 1989 .

[125]  K. Gunther,et al.  Prevention of Deadlocks in Packet-Switched Data Transport Systems , 1981 .

[126]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[127]  Ronald C. de Vries,et al.  Reducing Null Messages in Misra's Distributed Discrete Event Simulation Method , 1990, IEEE Trans. Software Eng..

[128]  Heikki Saikkonen,et al.  Distributed Termination Detection with Counters , 1990, Inf. Process. Lett..

[129]  Valmir Carneiro Barbosa,et al.  Experiments in Parallel Heuristic Search , 1991, ICPP.

[130]  Marcin Paprzycki,et al.  Parallel computing works! , 1996, IEEE Parallel & Distributed Technology: Systems & Applications.

[131]  Debra Hoover,et al.  A Distributet Self-Stabilizing Solution to the Dining Philosophers Problem , 1992, Inf. Process. Lett..

[132]  Moti Yung,et al.  Memory-Efficient Self Stabilizing Protocols for General Networks , 1990, WDAG.

[133]  W. Weigel,et al.  Global events and global breakpoints in distributed systems , 1988, [1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track.

[134]  Rajive L. Bagrodia,et al.  A unified framework for conservative and optimistic distributed simulation , 1994, PADS '94.

[135]  Charles E. McDowell,et al.  Debugging concurrent programs , 1989, ACM Comput. Surv..

[136]  Pradip K. Srimani,et al.  A Self-Stabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph , 1992, Parallel Process. Lett..

[137]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[138]  Adrian Segall,et al.  Message Delaying Synchronizers , 1991, WDAG.

[139]  N. Lynch,et al.  A Lattice-Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm , 1988 .

[140]  Shlomi Dolev.  Optimal Time Self Stabilization in Dynamic Systems (Preliminary Version) , 1993, WDAG.

[141]  S. Stahl.  n-Tuple colorings and associated graphs , 1976 .

[142]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[143]  D. A. Reed,et al.  Networks for parallel processors: measurements and prognostications , 1988, C3P.

[144]  Daniel Lehmann,et al.  On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.

[145]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[146]  R. M. Fujimoto,et al.  Parallel discrete event simulation , 1989, WSC '89.

[147]  Jian Xu,et al.  Adaptive message logging for incremental program replay , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.

[148]  Eli Gafni,et al.  Improvements in the time complexity of two message-optimal election algorithms , 1985, PODC '85.

[149]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[150]  Paul G. Spirakis,et al.  Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization , 1992, WDAG.

[151]  Marvin Theimer,et al.  Preemptable remote execution facilities for the V-system , 1985, SOSP '85.

[152]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[153]  V. Barbosa.  Concurrency in systems with neighborhood constraints (distributed systems, parallel processing, dining philosophers, simulated annealing) , 1986 .

[154]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[155]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[156]  Andrew A. Chien,et al.  Architecture of a message-driven processor , 1987, ISCA '87.

[157]  Yi-Bing Lin,et al.  Memory Management Algorithms for Optimistic Parallel Simulation , 1994, Inf. Sci..

[158]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[159]  Ron van der Meyden,et al.  Axioms for Knowledge and Time in Distributed Systems with Perfect Recall , 1994, LICS.

[160]  J. M. Alonso,et al.  Conservative and optimistic distributed simulation in massively parallel computers: a comparative study , 1994, Proceedings of the First International Conference on Massively Parallel Computing Systems (MPCS) The Challenges of General-Purpose and Special-Purpose Computing.

[161]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[162]  Mary K. Vernon,et al.  Hardware Support for Interprocess Communication , 1990, IEEE Trans. Parallel Distributed Syst..

[163]  Amos Israeli,et al.  Uniform Self-Stabilizing Ring Orientation , 1993, Inf. Comput..

[164]  Frank Harary,et al.  Graph Theory , 2016 .

[165]  Manfred K. Warmuth,et al.  The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case , 1989, Inf. Comput..

[166]  Arthur P. Goldberg,et al.  Restoring consistent global states of distributed computations , 1991, PADD '91.

[167]  R. Arlauskas.  iPSC/2 system: a second generation hypercube , 1988, C3P.

[168]  Michel Raynal,et al.  Inevitable global states: a concept to detect unstable properties of distributed computations in an observer independent way , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[169]  Hassan Rajaei,et al.  Parallel simulation based on conservative time windows: A performance study , 1994, Concurr. Pract. Exp..

[170]  W. Morven Gentleman,et al.  Message passing between sequential processes: The reply primitive and the administrator concept , 1981, Softw. Pract. Exp..

[171]  Gerard Tel,et al.  Maximal Matching Stabilizes in Quadratic Time , 1994, Inf. Process. Lett..

[172]  Michel Raynal,et al.  Distributed algorithms and protocols , 1988 .

[173]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[174]  Edward D. Lazowska,et al.  Conservative parallel simulation for systems with no lookahead prediction , 1990 .

[175]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[176]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[177]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[178]  Joep L. W. Kessels,et al.  An Exercise in Proving Self-Stabilization with a Variant Function , 1988, Information Processing Letters.

[179]  Pradip K. Srimani,et al.  A self-stabilizing algorithm for coloring bipartite graphs , 1993, Inf. Sci..

[180]  Vijay K. Garg,et al.  Detection of Weak Unstable Predicates in Distributed Programs , 1994, IEEE Trans. Parallel Distributed Syst..

[181]  Allan Gottlieb,et al.  Highly parallel computing , 1989, Benjamin/Cummings Series in computer science and engineering.

[182]  Hagit Attiya,et al.  Computing on an anonymous ring , 1988, JACM.

[183]  Tai-Kuo Woo,et al.  Huffman trees as a basis for a dynamic mutual exclusion algorithm for distributed systems , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[184]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[185]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[186]  Jong-Deok Choi,et al.  A mechanism for efficient debugging of parallel programs , 1988, PADD '88.

[187]  David M. Nicol,et al.  Conservative Parallel Simulation of Priority Class Queuing Networks , 1992, IEEE Trans. Parallel Distributed Syst..

[188]  Jong-Deok Choi,et al.  Breakpoints and halting in distributed programs , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[189]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[190]  Lúcia Maria de A. Drummond,et al.  Distributed Breakpoint Detection in Message-Passing Programs , 1996, J. Parallel Distributed Comput..

[191]  Achour Mostéfaoui,et al.  A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms , 1994, IEEE Trans. Parallel Distributed Syst..

[192]  Gregory R. Andrews,et al.  Concepts and Notations for Concurrent Programming , 1983, CSUR.

[193]  Keith Marzullo,et al.  Consistent detection of global predicates , 1991, PADD '91.

[194]  Wayne M. Loucks,et al.  On the Trade-off between Time and Space in Optimistic Parallel Discrete-Event Simulation , 1992 .

[195]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[196]  D. R. Fulkerson,et al.  Anti-blocking polyhedra , 1972 .

[197]  Masahiro Tsuchiya,et al.  A Task Allocation Model for Distributed Computing Systems , 1982, IEEE Transactions on Computers.

[198]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[199]  Jon B. Weissman,et al.  MTW: an empirical performance study , 1991, 1991 Winter Simulation Conference Proceedings..

[200]  Eli Gafni,et al.  Perspectives on Distributed Network Protocols: A Case for Building Blocks , 1986, MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's.

[201]  Chien-Chung Shen,et al.  A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion , 1985, IEEE Trans. Computers.

[202]  T. W. Lake,et al.  Cooperative acceleration: robust conservative distributed discrete event simulation , 1994, PADS '94.

[203]  Nancy A. Lynch,et al.  Upper Bounds for Static Resource Allocation in a Distributed System , 1981, J. Comput. Syst. Sci..

[204]  Ronald Fagin,et al.  Knowledge and Implicit Knowledge in a Distributed Environment: Preliminary Report , 1988, TARK.

[205]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[206]  Valmir Carneiro Barbosa.  Massively parallel models of computation - distributed parallel processing in artificial intelligence and optimization , 1993, Ellis Horwood series in artificial intelligence.

[207]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[208]  Guy Bernard,et al.  A survey of load sharing in networks of workstations , 1993, Distributed Syst. Eng..

[209]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[210]  Daniel Lehmann,et al.  Knowledge, common knowledge and related puzzles (Extended Summary) , 1984, PODC '84.

[211]  Amos Israeli,et al.  Self-Stabilizing Ring Orientation , 1990, WDAG.

[212]  Madalene Spezialetti,et al.  Simultaneous regions: a framework for the consistent monitoring of distributed systems , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[213]  Hesham H. Ali,et al.  On the Intractability of Task Allocation in Distributed Systems , 1994, Parallel Process. Lett..

[214]  Anup Kumar,et al.  A hybrid approach for mutual exclusion in distributed computing systems , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[215]  Parameswaran Ramanathan,et al.  Use of Common Time Base for Checkpointing and Rollback Recovery in a Distributed System , 1993, IEEE Trans. Software Eng..

[216]  Zhonghua Yang,et al.  Annotated bibliography on global states and times in distributed systems , 1993, OPSR.

[217]  Bharat K. Bhargava,et al.  Independent checkpointing and concurrent rollback for recovery in distributed systems-an optimistic approach , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.

[218]  Joel H. Spencer,et al.  Balancing vectors in the max norm , 1986, Comb..

[219]  Amos Israeli,et al.  Uniform Dynamic Self-Stabilizing Leader Election , 1997, IEEE Trans. Parallel Distributed Syst..

[220]  Kerry Raymond,et al.  A tree-based algorithm for distributed mutual exclusion , 1989, TOCS.

[221]  Colin J. Fidge,et al.  Logical time in distributed computing systems , 1991, Computer.

[222]  Nancy A. Lynch,et al.  Efficiency of Synchronous Versus Asynchronous Distributed Systems , 1983, J. ACM.

[223]  Jong-Deok Choi,et al.  Techniques for debugging parallel programs with flowback analysis , 1991, TOPL.

[224]  Donald Yeung,et al.  The MIT Alewife machine: architecture and performance , 1995, ISCA '98.

[225]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[226]  Yehuda Afek,et al.  Sparser: A Paradigm for Running Distributed Algorithms , 1992, J. Algorithms.

[227]  Hector Garcia-Molina,et al.  Debugging a Distributed Computing System , 1984, IEEE Transactions on Software Engineering.

[228]  Gordon Bell,et al.  Ultracomputers: a teraflop before its time , 1992, CACM.

[229]  Uzi Vishkin,et al.  An O(n² log n) Parallel MAX-FLOW Algorithm , 1982, J. Algorithms.

[230]  Hao Chen,et al.  An efficient method for mutual exclusion in truly distributed systems , 1994, 14th International Conference on Distributed Computing Systems.

[231]  Michel Raynal,et al.  Detecting atomic sequences of predicates in distributed computations , 1993, PADD '93.

[232]  David M. Nicol,et al.  Parallel simulation today , 1994, Ann. Oper. Res..

[233]  Ronald H. Perrott,et al.  Parallel programming , 1988, International computer science series.

[234]  G. C. Fox,et al.  Load balancing loosely synchronous problems with a neural network , 1988, C3P.

[235]  Subbarayan Venkatesan,et al.  An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering , 1994, Inf. Process. Lett..

[236]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[237]  Felipe M. G. França,et al.  A Randomised Distributed Primer for the Updating Control of Anonymous ANNs , 1994 .

[238]  Ashok K. Agrawala,et al.  An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.

[239]  Ajoy Kumar Datta,et al.  Self-stabilizing deadlock detection algorithms , 1992, CSC '92.

[240]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[241]  George F. Bertsch,et al.  A guide to microscopic models for intermediate energy heavy ion collisions , 1988 .

[242]  Sukumar Ghosh.  An alternative solution to a problem on self-stabilization , 1993, TOPL.

[243]  Friedemann Mattern,et al.  Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation , 1993, J. Parallel Distributed Comput..

[244]  Joseph Y. Halpern.  Reasoning About Knowledge: An Overview , 1986, TARK.

[245]  Valmir Carneiro Barbosa.  Blocking Versus Nonblocking Interprocess Communication: A Note on the Effect on Concurrency , 1990, Inf. Process. Lett..

[246]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[247]  Wayne M. Loucks,et al.  Null Message Cancellation in Conservative Distributed Simulation , 1991 .

[248]  Baruch Awerbuch,et al.  Applying static network protocols to dynamic networks , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[249]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorith for the Shortest Paths Problem with a Fully Distributed Demon , 1994, Parallel Process. Lett..

[250]  Shmuel Katz,et al.  Self-stabilizing extensions for message-passing systems , 1990, PODC '90.

[251]  Robin J. Wilson,et al.  Edge-colourings of graphs , 1977 .

[252]  Mordechai Ben-Ari,et al.  Principles of concurrent programming , 1982 .

[253]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[254]  Michel Raynal.  A simple taxonomy for distributed mutual exclusion algorithms , 1991, OPSR.

[255]  Divyakant Agrawal,et al.  Efficient solution to the distributed mutual exclusion problem , 1989, PODC '89.

[256]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[257]  K M Chandy,et al.  The Conditional-Event Approach to Distributed Simulation , 1989 .

[258]  Valmir Carneiro Barbosa,et al.  Strategies for the Prevention of Communication Deadlocks in Distributed Parallel Programs , 1990, IEEE Trans. Software Eng..

[259]  David Jefferson,et al.  A Basic Protocol for Routing Messages to Migrating Processes , 1988, ICPP.

[260]  William J. Dally,et al.  Network and processor architecture for message-driven computers , 1990 .

[261]  Robert D. Blumofe,et al.  Scheduling large-scale parallel computations on networks of workstations , 1994, Proceedings of 3rd IEEE International Symposium on High Performance Distributed Computing.

[262]  Anoop Gupta,et al.  Integration of message passing and shared memory in the Stanford FLASH multiprocessor , 1994, ASPLOS VI.

[263]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[264]  Stephen Wolfram,et al.  Theory and Applications of Cellular Automata , 1986 .

[265]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[266]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[267]  Janos Simon,et al.  Observing self-stabilization , 1992, PODC '92.

[268]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Maximal Matching , 1992, Inf. Process. Lett..

[269]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[270]  Amos Israeli,et al.  Resource bounds for self stabilizing message driven protocols , 1991, PODC '91.

[271]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[272]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

[273]  Jan K. Pachl,et al.  Uniform self-stabilizing rings , 1988, TOPL.

[274]  Zhonghua Yang,et al.  Global States and Time in Distributed Systems , 1994 .

[275]  Shing-Tsaan Huang,et al.  An Improvement of the Maekawa's Mutual Exclusion Algorithm to Make it Fault-Tolerant , 1993, Parallel Process. Lett..

[276]  Seng Chuan Tay,et al.  Efficient algorithms for conservative parallel simulation of interconnection networks , 1994, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).

[277]  Michel Raynal,et al.  Termination detection in a very general distributed computing model , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[278]  P. Jalote.  Introduction to Distributed Algorithms , 1995 .

[279]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[280]  K. Mani Chandy,et al.  A unifying framework for distributed simulation , 1991, TOMC.

[281]  S. Haldar,et al.  An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages , 1993, WG.

[282]  B. Bagheri,et al.  A comparison of distributed and shared memory scalable architectures. 1. KSR shared memory , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[283]  Baruch Awerbuch,et al.  Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[284]  Madalene Spezialetti.  An approach to reducing delays in recognizing distributed event occurrences , 1991, PADD '91.

[285]  Manhoi Choy,et al.  Distributed Job Scheduling Using Snapshots , 1993, WDAG.

[286]  Margaret Martonosi,et al.  Tradeoffs in Message Passing and Shared Memory Implementations of a Standard Cell Router , 1989, ICPP.

[287]  Richard M. Fujimoto.  Parallel and distributed discrete event simulation: algorithms and applications , 1993, WSC '93.

[288]  Ajoy Kumar Datta,et al.  Distributed Deadlock Detection Algorithms , 1992, Parallel Process. Lett..

[289]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[290]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[291]  Konrad Slind,et al.  Monitoring distributed systems , 1987, TOCS.

[292]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[293]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[294]  Gil Neiger,et al.  Simulating synchronized clocks and common knowledge in distributed systems , 1993, JACM.

[295]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[296]  Seth Copen Goldstein,et al.  Active messages: a mechanism for integrating communication and computation , 1998, ISCA '98.

[297]  Valmir Carneiro Barbosa,et al.  On the distributed parallel simulation of Hopfield's neural networks , 1990, Softw. Pract. Exp..

[298]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[299]  Mario Gerla,et al.  Flow Control Protocols , 1982 .

[300]  Randal E. Bryant,et al.  SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS , 1977 .

[301]  Shing-Tsaan Huang,et al.  Leader election in uniform rings , 1993, TOPL.

[302]  Veljko M. Milutinovic,et al.  A survey of distributed shared memory systems , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[303]  N. Lynch,et al.  DISTRIBUTED ALGORITHMS , Lecture Notes for 6.852 FALL 1992 , 1993 .

[304]  Yi-Bing Lin,et al.  Optimal memory management for time warp parallel simulation , 1991, TOMC.

[305]  Shay Kutten,et al.  Time Optimal Self-Stabilizing Spanning Tree Algorithms , 1993, FSTTCS.

[306]  James B. Sinclair,et al.  Efficient Computation of Optimal Assignments for Distributed Tasks , 1987, J. Parallel Distributed Comput..

[307]  John N. Tsitsiklis,et al.  Some aspects of parallel and distributed iterative algorithms - A survey, , 1991, Autom..

[308]  Gregory R. Andrews,et al.  Concurrent programming - principles and practice , 1991 .

[309]  Andrew R. Cherenson,et al.  The Sprite network operating system , 1988, Computer.

[310]  Valmir Carneiro Barbosa,et al.  A Bayesian-Network Approach to Lexical Disambiguation , 1993, Cogn. Sci..