Experience with Distributed Programming in Orca

• Published in: Proceedings. 1990 International Conference on Computer Languages
• Main Authors: Bal, H.E., Kaashoek, M.F., Tanenbaum, A.S.
• Format: Other Non-Article Part of Journal/Newspaper
• Language: English
• Published: IEEE 1990
• Subjects: Orca
• Online Access: https://research.vu.nl/en/publications/e8a2d329-ccbc-4101-b443-b433929ebbc1; https://doi.org/10.1109/ICCL.1990.63763; http://hdl.handle.net/1871.1/e8a2d329-ccbc-4101-b443-b433929ebbc1; http://www.scopus.com/inward/record.url?scp=0025028328&partnerID=8YFLogxK; http://www.scopus.com/inward/citedby.url?scp=0025028328&partnerID=8YFLogxK

Orca is a language for programming parallel applications on distributed computing systems. Although processors in such systems communicate only through message passing and not through shared memory, Orca provides a communication model based on logically shared data. The language and its implementation are briefly described and a report is given on experiences in using Orca for three parallel applications: the traveling salesman problem, the all-pairs shortest paths problem, and successive overrelaxation. These applications have different needs for shared data: TSP benefits greatly from the support for shared data; ASP benefits from the use of broadcast communication, even though it is hidden in the implementation; SOR merely requires point-to-point communication, but still can be implemented in the language by simulating message passing. How these applications are programmed in Orca is discussed and the most interesting portions of the Orca code are given. Performance measurements for these programs on a distributed system consisting of 10 MC68020s connected by an Ethernet are also included. These measurements show that significant speedups are obtained for all three programs.