Model and complexity of termination for distributed computations

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 13 Nov 2005 English Publisher:Springer Science and Business Media LLC

Authors: Brigitte Rozoy;

doi: 10.1007/bfb0016283

Model and complexity of termination for distributed computations

- Summary
- Metrics

Abstract

We define a model to describe the global running of a network of processes, as well as termination detection. We find algorithms required to be super-imposed on the system without disturbing the underlying computation. In the case of asynchronous protocols, we prove that the complexity of termination detection is equal to the number of messages of the initial computation.

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

1

Average

Fields of Science

engineering and technology

electrical engineering, electronic engineering, information engineering

Fields of Science

engineering and technology

electrical engineering, electronic engineering, information engineering

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now