Efficient logic variables for distributed computing
1999 (English)In: ACM Transactions on Programming Languages and Systems, ISSN 0164-0925, E-ISSN 1558-4593, Vol. 21, no 3, 569-626 p.Article in journal (Refereed) Published
We define a practical algorithm for distributed rational tree unification and prove its correctness in both the off-line and on-line cases. We derive the distributed algorithm from a centralized one, showing clearly the trade-offs between local and distributed execution. The algorithm is used to realize logic variables in the Mozart Programming System, which implements the Oz language (see http://www.mozart-oz.org). Oz appears to the programmer as a concurrent object-oriented language with dataflow synchronization Logic variables implement the dataflow behavior. We show that logic variables can easily be added to the more restricted models of Java and ML, thus providing an alternative way to do concurrent programming in these languages. We present common distributed programming idioms in a network-transparent way using logic variables. We show that in common cases the algorithm maintains the same message latency as explicit message passing. In addition, it is able to handle uncommon cases that arise from the properties of latency tolerance and third-party independence. This is evidence that using logic variables in distributed computing is beneficial at both the system and language levels. At the system level, they improve latency tolerance and third-party independence. At the language level, they help make network-transparent distribution practical.
Place, publisher, year, edition, pages
1999. Vol. 21, no 3, 569-626 p.
algorithms, languages, theory, distributed algorithms, Oz, Mozart
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-24876ISI: 000083593400005OAI: oai:DiVA.org:kth-24876DiVA: diva2:353700
QC 201009282010-09-282010-09-282010-09-28Bibliographically approved