Layering distributed algorithms

Research output: Book/Journal/ReportCommissioned reportProfessional

1 Downloads (Pure)

Abstract

Superposition is a powerful program modularization and structuring method for developing parallel and distributed systems by adding new functionality to an algorithm while preserving the original computation. The superposition method will, thus, structure the distributed algorithm in a number of mechanisms on top of the original computation. In this paper the derivation using the superposition method is presented in a B-like notation explicitely expressing each new mechanism with a layer in order to improve the presentation of the superposition method. We also show that superposition refinement with layers can be used as the single formalism for developing distributed systems by using it for formalizing the derivation of a distributed load balancing algorithm of Hofstee et al. [11,12].
Original languageEnglish
PublisherTurku Center for Computer Science (TUCS)
ISBN (Print)952-12-0043-X
Publication statusPublished - 1997
MoE publication typeD4 Published development or research report or study

Publication series

NameTUCS Technical Reports
Volume121

Keywords

  • Distributed Systems
  • Action Systems
  • superposition refinement
  • layers
  • B-notation

Fingerprint

Dive into the research topics of 'Layering distributed algorithms'. Together they form a unique fingerprint.

Cite this