Clock construction in fully asynchronous parallel systems and PRAM simulation

The authors discuss the question of simulating synchronous computations on asynchronous systems. They consider an asynchronous system with very weak, or altogether lacking any, atomicity assumptions. The first contribution of this paper is a novel clock for asynchronous systems. The clock is a basic tool for synchronization in the asynchronous environment. It is a very robust construction and can operate in a system with no atomicity assumptions, and in the presence of a dynamic scheduler. The behavior of the clock is obtained with overwhelming probability (1-2/sup - alpha n/, alpha >0). The authors show how to harness this clock to drive a PRAM simulation on an asynchronous system. The resulting simulation scheme is more efficient than existing ones, while actually relaxing the assumptions on the underlying asynchronous system.<<ETX>>

[1]  Michael O. Rabin,et al.  The information dispersal algorithm and its applications , 1990 .

[2]  Maurice Herlihy,et al.  Impossibility and universality results for wait-free synchronization , 1988, PODC '88.

[3]  Michael O. Rabin.  Optimal Parallel Pattern Matching Through Randomization , 1993 .

[4]  Maurice Herlihy,et al.  Impossibility results for asynchronous PRAM (extended abstract) , 1991, SPAA '91.

[5]  Michael Rabin,et al.  A note on Helly's theorem. , 1955 .

[6]  Phillip B. Gibbons.  A more practical PRAM model , 1989, SPAA '89.

[7]  Yonatan Aumann,et al.  Highly efficient asynchronous execution of large-grained parallel programs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[8]  Joseph Y. Halpern,et al.  A logic to reason about likelihood , 1983, Artif. Intell..

[9]  Shmuel Winograd,et al.  Complexity Of Computations , 1978, ACM Annual Conference.

[10]  Richard Cole,et al.  The APRAM: incorporating asynchrony into the PRAM model , 1989, SPAA '89.

[11]  Michael O. Rabin,et al.  Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..

[12]  Eyal Kushilevitz,et al.  Lower bounds for randomized mutual exclusion , 1993, SIAM J. Comput..

[13]  M. Fischer,et al.  SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .

[14]  Paul G. Spirakis,et al.  Efficient robust parallel computations , 2018, STOC '90.

[15]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[16]  Vijay V. Vazirani,et al.  Maximum Matchings in General Graphs Through Randomization , 1989, J. Algorithms.

[17]  Michael O. Rabin,et al.  Recursive Unsolvability of Group Theoretic Problems , 1958 .

[18]  Michael O. Rabin,et al.  N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable , 1982, J. Comput. Syst. Sci..

[19]  Michael O. Rabin,et al.  Transaction Protection by Beacons , 1983, J. Comput. Syst. Sci..

[20]  Michael O. Rabin.  Arithmetical extensions with prescribed cardinality , 1959 .

[21]  Dexter Kozen.  Two-Way Finite Automata , 1977 .

[22]  R. Z. Norman,et al.  An algorithm for a minimum cover of a graph , 1959 .

[23]  Michael O. Rabin.  Theoretical Impediments to Artificial Intelligence , 1974, IFIP Congress.

[24]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[25]  Alexander A. Shvartsman,et al.  Efficient parallel algorithms on restartable fail-stop processors , 1991, PODC '91.

[26]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[27]  W. W. Peterson,et al.  On Codes for Checking Logical Operations , 1959, IBM J. Res. Dev..

[28]  Z. M. Kedem,et al.  Combining tentative and definite executions for very fast dependable parallel computing , 1991, STOC '91.

[29]  R. Subramonian,et al.  Asynchronous PRAMs are (almost) as good as synchronous PRAMs , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[30]  M. Rabin,et al.  Fast evaluation of polynomials by rational preparation , 1972 .

[31]  Yonatan Aumann,et al.  Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation , 1994, Theor. Comput. Sci..

[32]  Naomi Nishimura,et al.  Asynchronous shared memory parallel computation , 1990, SPAA '90.

[33]  J. D. Tygar,et al.  An Integrated Toolkit for Operating System Security , 1986 .

[34]  Michael O. Rabin,et al.  On recursively enumerable and arithmetic models of set theory , 1958, Journal of Symbolic Logic.

[35]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..