Programming abstracts for synchronization and communication in parallel programs
A class of distributed/shared memory parallel programs with static, race free structure of accesses to shared memory is considered and programming abstracts in the form of regular expressions are proposed as synchronization facilities for these programs. Along with more concurrency these facilities can expose with respect to semaphore-like ones they can be applicable for designing efficient communucation schemes for multilevel distributed/shared memory parallel programs.
Unable to display preview. Download preview PDF.
- 1.R.H. Campbell, N.A. Habermann, The specification of process synchronization by path expressions. Lect. Notes Comput. Sci., 16 (1974) 89–102.Google Scholar
- 2.A.E. Doroshenko, Advancing synchronization and communication techniques for distributed/shared memory parallel programs, in: PARCELLA '94: Proc. VI Int. Workshop on Parallel Processing by Cellular Arrays and Automata, Sept. 20–22, 1994, Potsdam, Germany, ed. C. Jesshope et al. (Academie Verlag, Berlin, 1994) 131–139.Google Scholar
- 3.A.E. Doroshenko, A Programming Methodology for Effective Data Exchanges in Macroconveyor Programs, in Parallel Computing Technologies, Proc. Int. Conf., 7-11 Sept.1991, Novosibirsk, USSR, ed. N.N. Mirenkov (World Scientific, Singapore, 1991) 330–338.Google Scholar
- 4.A.E. Doroshenko, A method of external exchanges synchronization in macroconveyor programs, Cybernetics and System Analysis, No. 5 (1991) 68–76 (Translated from Russian).Google Scholar
- 5.A.A. Letichevsky, Algebra of algorithms, data structures and parallel computations, in: Information Processing 83 (IFIP, Amsterdam, 1983) 895–864.Google Scholar
- 6.V.S. Mikhalevich, Ju.V. Kapitonova, A.A. Letichevsky, On models of macroconveyer computations, in: Information Processing 86 (IFIP, Amsterdam, 1986) 975–980.Google Scholar
- 7.P. Wolcott, S.E. Goodman, High-Speed Computers of the Soviet Union, Computer, 21, No. 9 (1988) 32–41.Google Scholar