Abstract
In this paper we present a concurrency measure that is especially adapted to distributed programs that exhibit regular run-time behaviours, including many programs that are obtained by automatic parallelization of sequential code. This measure is based on the antichain lattice of the partial order that models the distributed execution under consideration. We show the conditions under which the measure is computable on an infinite execution that is the repetition of a finite pattern. There, the measure can be computed by considering only a bounded number of patterns, the bound being at most the number of processors.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
F. André, O. Chéron, and J-L. Pazat. Compiling Sequential Programs for Distributed Memory Parallel Computers with Pandore II. In Jack J. Dongarra and Bernard Tourancheau, editors, Environments and Tools for Parallel Scientific Computing, pages 293–308, Elsevier Science Publishers B.V., 1993.
C. Bareau, B. Caillaud, C. Jard, and R. Thoraval. Correctness of automated distribution of sequential programs. In A. Bode, M. Reeve, and G. Wolf, editors, PARLE'93, pages 517–528, LNCS 694, Springer Verlag, June 1993.
C. Bareau, B. Caillaud, C. Jard, and R. Thoraval. Measuring Concurrency of Regular Distributed Computations. Research Report 882, Irisa, Rennes, France, October 1994.
D. Callahan and K. Kennedy. Compiling programs for distributed-memory multiprocessors. Journal of Supercomputing, 2:151–169, 1988.
B. Charron-Bost. Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory. In Bernard and Raynal, editors, Int. Workshop on Parallel and Distributed Algorithms, pages 45–56, Springer Verlag, Nice, France, 1989.
B.A. Davey and Priestley H.A. Introduction to Lattices and Order. Cambridge University Press, 1990.
C. Diehl, C. Jard, and J.X. Rampon. Reachability analysis on distributed executions. In JP. Jouannaud MC. Gaudel, editor, Proc. TAPSOFT, 93 LNCS 668, pages 629–643, Springer-Verlag, Orsay, Paris, April 1993.
T. Fahringer, R. Blasko, and H.P. Zima. Automatic Performance Prediction to Support Parallelization of Fortran Programs for Massively Parallel Systems. In Proc. of the '92 International Conference on Supercomputing, pages 347–356, ACM press, July 1992.
C.J. Fidge. A simple run-time concurrency measure. In Proceedings of the 3 rd Australian Transputer and OCCAM User Group Conference, pages 92–101, 1990.
G.H. Golub and C.F. Van Loan. Matrix computations. The Johns Hopkins University Press, second edition, 1990.
M. Habib, M. Morvan, and J.X. Rampon. Remarks on some concurrency measures. In Graph-Theoretic Concepts in Computer Science, pages 221–238, LNCS 484, june 1990.
C. Jard and J.-M. Jézéquel. ECHIDNA, an Estelle-compiler to prototype protocols on distributed computers. Concurrency Practice and Experience, 4(5):377–397, 1992.
C. Jard, G.V. Jourdan, and J.X. Rampon. Some On-Lines Computations of the Ideal Lattice of Posets. Research Report 773, IRISA, December 1993.
L. Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
F. Mattern. Virtual time and global states of distributed systems. In Cosnard, Quinton, Raynal, and Robert, editors, Proc. Int. Workshop on Parallel and Distributed Algorithms Bonas, France, Oct. 1988, North Holland, 1989.
M. Raynal, M. Mizuno, and M.-L. Neilsen. A synchronization and concurrency measure for distributed computations. In 12th IEEE Int. Conf. on Distributed Computing Systems, pages 657–664, Yokokama, June 1992.
H. Sips. 4th Int. Workshop on Compilers for Parallel Computers. Sips, H. Editor. Delft, 13–16 december. Delft University of Technology, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bareau, C., Caillaud, B., Jard, C., Thoraval, R. (1995). Measuring concurrency of regular distributed computations. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds) TAPSOFT '95: Theory and Practice of Software Development. CAAP 1995. Lecture Notes in Computer Science, vol 915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59293-8_230
Download citation
DOI: https://doi.org/10.1007/3-540-59293-8_230
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59293-8
Online ISBN: 978-3-540-49233-7
eBook Packages: Springer Book Archive