Loslan implementation of the AMPL message-passing system

ABSTRACT

AMPL is an asynchronous message-passing scheme developed at CMU, and Loslan is a universal, Simula-based programming language worked out at the Warsaw University. The paper presents a straightforward implementation of AMPL in Loslan, profiting from the generalized prefixing mechanism of the latter. The method of controlling the communicating processes by handling the so-called awaited condition trees is applicable to other asynchronous message-passing systems.

REFERENCES

• 1: {Ada81} "The programming language Ada reference manual", Honeywell Inc., Minneapolis, Nov 80; in: Lecture Notes in Comp. Sc. 106, 1981.
• 2: {Arv82} Arvind, and Brock J. D. "Streams and msnsgers", Lab. for Comp. Sc. (CSG Memo 217), MIT, Cambridge, June 82.
• 3: {Bar80} Bartol W. M., et. al., "Semantics and Implementation of prefixing at many levels', Institute of Informatics (Rep. 94), Warsaw University, 1980.
• 4: Ole-Johan Dahl, SIMULA 67 common base language, (Norwegian Computing Center. Publication), 1968
• 5: {Dan81} Dannenbers R. B., "AMPL: design, implementation and evaluation of a multiprocessing language", Dept. of Comp. Sc., Carnegie-Mellon University, March 81.
• 6: C. A. R. Hoare, Monitors: an operating system structuring concept, Communications of the ACM, v.17 n.10, p.549-557, Oct. 1974 [doi>10.1145/355620.361161]
• 7: C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
• 8: {Log82} "Report on the Loglan-82 programming language", Inst. of Informatics, Warsaw University, June 82.
• 9: R. W. Marczyński , J. Milewski, A data driven system based on a microprogrammed processor module, Proceedings of the 10th annual international symposium on Computer architecture, p.98-106, June 13-17, 1983, Stockholm, Sweden
• 10: Richard James Swan, The switching structure and addressing architecture of an extensible multiprocessor: cm*., 1978
• 11: {Weng75} Weng K.-S., "Stream-oriented computation in recursive data flow schemas", Lab. for Comp. Sc. (TM-68), MIT, Cambridge, Oct 75.