research-article

Open access

Distributed maximum maintenance on hierarchically divided graphs

Authors:

P. J. A. Lentfert,

S. D. SwierstraAuthors Info & Claims

Formal Aspects of Computing, Volume 5, Issue 1

Pages 21 - 60

https://doi.org/10.1007/BF01211315

Published: 01 January 1993 Publication History

PDF eReader

Abstract

The design and verification of distributed and concurrent algorithms is highly complex, and thus error-prone. It is our experience that the intertwined use of an informal description as well as a formal method in designing and studying an algorithm, is a fruitful one. The advantage of the informal description is the ease with which algorithms can be produced, studied and discussed. In contrast with formal methods however, errors are easily made in informal arguments about programs that seem to be correct, but in fact are not.

In this paper we use an informal argument, carefully augmented with the use of the UNITY formalism, in the design of a distributed algorithm for maintaining the maximum value of a bag of frequently changing integers on a hierarchically divided network. The resulting algorithm is obtained by first designing an abstract algorithm on a virtual datastructure. Next, the abstract algorithm is transformed into the distributed algorithm.

References

[1]

Chandy, K.M. and Misra, J.:Parallel Program Design — A Foundation. Addison-Wesley Publishing Company, Inc., 1988.

Google Scholar

[2]

Knapp E. An exercise in the formal derivation of parallel programs: Maximum flows in graphs ACM Transactions on Programming Languages and Systems 1990 12 2 203-223

Digital Library

Google Scholar

[3]

Lentfert, P.J.A. Uittenbogaard, A.H. Swierstra, S.D. and Tel, G.: Distributed hierarchical routing. Technical Report RUU-CS-89-5, Utrecht University, March 1989. Also in: P.M.G. Apers et al. (Eds.).Proceedings CSN89. Utrecht, November 9–10, 1989.

Google Scholar

[4]

Misra J. van de Snepscheut J. L. A. Specifications of concurrently accessed data Proceedings of the Conference on the Mathematics of Program Construction, Groningen 1989 New York Springer-Verlag 91-114

Google Scholar

[5]

Perlman R. Fault-tolerant broadcast of routing information Computer Networks 1983 7 395-405

Google Scholar

[6]

Sanders B.A. Eliminating the substitution axiom from UNITY logic Formal aspects of Computing 1991 3 2 189-205

Digital Library

Google Scholar

[7]

Staskauskas M.G. The formal specification and design of a distributed electronic funds transfer system IEEE Trans. Comp. 1988 37 12 1515-1528

Digital Library

Google Scholar

Index Terms

Distributed maximum maintenance on hierarchically divided graphs

Index terms have been assigned to the content through auto-classification.

Recommendations

π-ARL: an architecture refinement language for formally modelling the stepwise refinement of software architectures

A key aspect of the formal development of any software system is the specification and stepwise refinement of its architecture. In a stepwise refinement, a sequence of steps starting from an abstract specification of the architecture leads to a concrete,...
Formally Modeling and Verifying Ricart & Agrawala Distributed Mutual Exclusion Algorithm
APAQS '01: Proceedings of the Second Asia-Pacific Conference on Quality Software

One of the promising approaches to creating quality software is to formally model systems, describe the models ina formal specification language, and verify that the systems have some desirable properties based on the formaldocuments with an automatic ...
A UNITY-Based Formalism for Dynamic Distributed Systems
IPDPS '03: Proceedings of the 17th International Symposium on Parallel and Distributed Processing

We describe Dynamic UNITY, a new formalism for the specification of dynamic distributed systems based on the UNITY formalism. This formalism allows for the specification and proof of systems where processes may be created and destroyed, and where ...

Comments

Information & Contributors

Information

Published In

Formal Aspects of Computing Volume 5, Issue 1

Jan 1993

90 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 1993

Accepted: 15 November 1991

Received: 15 October 1990

Published in FAC Volume 5, Issue 1

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
37
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)3

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

References

Index Terms

Recommendations

π-ARL: an architecture refinement language for formally modelling the stepwise refinement of software architectures

Formally Modeling and Verifying Ricart & Agrawala Distributed Mutual Exclusion Algorithm

A UNITY-Based Formalism for Dynamic Distributed Systems

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations