Reliable synchronization in distributed systems

References

• Attie , PA and Emerson , EA . (2001) . Synthesis of concurrent programs for an atomic read/write model of computation . ACM Transactions on Prog. Lang. and Sys. , 23 ( 2 ) : 187 – 242 .
   Google Scholar
• Burns , J and Pachl , J . (1989) . Uniform self-stabilizing ringles . ACM , 11 ( 2 ) : 330 – 344 .
   Google Scholar
• Dijkstra , EW . (1986) . A belated proof of self-stabilization . Journal of Distributed Computing , 1 : 5 – 6 .
   Web of Science ®Google Scholar
• Gehani , N . (1984) . Broadcasting sequential processes . IEEE Transactions on Software Engineering SE-10 , 4 : 343 – 351 .
   Google Scholar
• Lamport , L . (1978) . Time, clocks, and the ordering of events in a distributed system . CACM , 21 ( 7 ) : 558 – 565 .
   Web of Science ®Google Scholar
• Rabin MO (1983) Randomized Byzantine Generals 24th IEEE FOCS 403 409
   Google Scholar
• Abu-Amara , H . (1988) . Fault-tolerant distributed algorithm for election in complete networks . IEEE Transactions on Computers , C-37 ( 4 ) : 449 – 453 .
   Google Scholar
• Pease , M , Shotak , R and Lamport , L . (1980) . Reaching agreement in presence of faults . JACM , 27 ( 2 ) : 228 – 234 .
   Google Scholar
• Lamport L Shostak RR Pease M (1982) The Byzantine Generals problem ACM TOPLAS 4 3 July, 382 401
   Google Scholar
• Fisher MJ Lynch NA (1982) A lower bound for the time to assure interactive consistency Information Processing Letters 14 4 June, 183 186
   Google Scholar
• Dolev D (1982) Polynomial algorithms for multiple processor agreement 14th ACM Symposium on Theory of Computing 383 400
   Google Scholar
• Perry KJ (1987) A framework for agreement Proceedings of 2nd International Workshop on Distributed Algorithms 57 75
   Google Scholar
• Perry , KJ . (1995) . Randomized Byzantine agreement . IEEE Transactions of Software Engineering , 6 : 539 – 546 .
   Google Scholar
• Bilas , Jiang D and Singh , JP . (2001) . Accelerating shared virtual memory via general-purpose network interface support . ACM Transactions on Computer Systems , 19 ( 1 ) : 1 – 35 .
   Google Scholar
• Fisher , MJ , Lynch , NA and Paterson , MS . (1985) . Impossibility of distributed consensus with one faulty process . JACM , 32 ( 2 ) : 374 – 382 .
   Google Scholar
• Kwok Y-K Ahmad I (1999) Static scheduling algorithms for allocating directed task graphs to multiprocessors ACM Surveys 31 4 December, 406 471
   Web of Science ®Google Scholar
• Dolev , D , Dwork , C and Stockmeyer , L . (1987) . On the minimal synchronization needed for distributed systems . JACM , 34 ( 1 ) : 77 – 97 .
   Google Scholar
• Hasselbring W (2000) Programming languages and systems for prototyping concurrent applications ACM Computing Surveys 32 1 March, 43 79
   Web of Science ®Google Scholar
• Dymond PW Ruzzo WL (2000) Parallel RAMs with owned global memory and deterministic context-free language recognition Journal of the ACM 47 1 January, 16 45
   Google Scholar
• Feldman P Micali S (1988) Optimal algorithms for Byzantine agreement 20th ACM Symposium on Theory of Computing 148 161
   Google Scholar
• Diniz P Rinard MC (1999) Eliminating synchronization overhead in parallelized programs using dynamic feedback ACM Transactions on Computer Systems 17 2 May, 89 132
   Google Scholar
• Ben-Or M (1983) Another advantage of free-choice: completely asynchronous agreement protocols 2nd ACM PODC 27 30
   Google Scholar
• Mendelson Gabbay F (2001) The effect of communication on multiprocessing systems ACM Transactions on Computer Systems 19 2 May, 252 281
   Google Scholar
• Reischuk , R . (1999) . A new solution for the Byzantine Generals problems . Information and Control , 64 : 23 – 34 .
   Google Scholar
• Turpin R (1984) Extending binary Byzantine agreement to multi-valued Byzantine agreement Information Processing Letters 18 February, 73 76
   Google Scholar
• Perry KJ (1985) Randomized Byzantine agreement IEEE Trans. of Software Engineering SE-11, 6 539 546
   Google Scholar
• Roosta S (2002) Implicit and explicit synchronization in parallel computers ACM Computing Surveys submitted for publication
   Google Scholar
• Yeung D (2000) MultiGrain shared memory ACM Transactions on Computer Systems 18 2 May, 154 196
   Google Scholar
• Keleher PJ (2000) A high-level abstraction of shared accesses ACM Transactions on Computer Systems 18 1 February, 1 36
   Google Scholar
• Roosta S (2002) Performance evaluation models for parallel computers ACM Transactions on Computer Systems submitted for publication
   Google Scholar
• Kruijer HS (1979) Self-stabilization in tree-structured systems Information Processing Letters 8 2 February, 91 95
   Web of Science ®Google Scholar
• Brown GM Gouda MG Wu C (1989) Token systems that self-stavlize IEEE Transactions on Computers C-38 6 June, 845 852
   Google Scholar
• Roosta S (2000) Parallel Processing and Parallel Algorithms: Theory and Computation Springer
   Google Scholar
• Arpaci-Dusseau , C . (2001) . Implicit coscheduling: coordinated scheduling with implicit information in distributed systems . ACM Transactions on Computer Systems , 19 ( 3 ) : 83 – 331 .
   Google Scholar
• Dijkstra , EW . (1974) . Self-stabilizing systems in spite of distributed control . CACM , 17 ( 11 ) : 643 – 644 .
   Web of Science ®Google Scholar