Extending the two-partner shared variable protocol to n partners

  • Authors:
  • Thomas Kolarik

  • Affiliations:
  • -

  • Venue:
  • APL '93 Proceedings of the international conference on APL
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

APL as a language has always provided a high level of abstraction to its users. Only in the field of communication have APL channels --- called shared variables --- been restricted to at most two partners. As most distributed applications demand more than two interacting programs, APL users had to apply their own techniques, like client-server, to develop applications that share information among more than two partners. This paper presents a proposal to move the administration of shared memory from application to language level: An extension to the well known shared variable protocol to share memory among more than two partners. Two applications of this distributed shared memory system are presented: A combinatorial optimization problem that is distributed among the machines of a workstation network and an application for students that learn APL in a working group are based upon a prototype implementation of the proposed protocol.