Mobile objects in distributed Oz

ABSTRACT

Some of the most difficult questions to answer when designing a distributed application are related to mobility: what information to transfer between sites and when and how to transfer it. Network-transparent distribution, the property that a program's behavior is independent of how it is partitioned among sites, does not directly address these questions. Therefore we propose to extend all language entities with a network behavior that enables efficient distributed programming by giving the programmer a simple and predictable control over network communication patterns. In particular, we show how to give objects an arbitrary mobility behavior that is independent of the objects definition. In this way, the syntax and semantics of objects are the same regardless of whether they are used as stationary servers, mobile agents, or simply as caches. These ideas have been implemented in Distributed Oz, a concurrent object-oriented language that is state aware and has dataflow synchronization. We prove that the implementation of objects in Distributed Oz is network transparent. To satisfy the predictability condition, the implementation avoids forwarding chains through intermediate sites. The implementation is an extension to the publicly available DFKI Oz 2.0 system.

REFERENCES

• 1: Harold Abelson , Gerald Jay Sussman , Julie Sussman, Structure and interpretation of computer programs, MIT Press, Cambridge, MA, 1985
• 2: Joe Armstrong , Robert Virding , Claes Wikström , Mike Williams, Concurrent programming in ERLANG (2nd ed.), Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1996
• 3: AXLING, T., HARIDI, S., AND FAHLEN, L. 1995. Concurrent constraint programming virtual reality applications. In the 2nd International Conference on Military Applications of Synthetic Environments and Virtual Reality (MASEVR 95). Defence Material Administration, Stockholm, Sweden.
• 4: Henri E. Bal , M. Frans Kaashoek , Andrew S. Tanenbaum, Orca: A Language for Parallel Programming of Distributed Systems, IEEE Transactions on Software Engineering, v.18 n.3, p.190-205, March 1992 [doi>10.1109/32.126768]
• 5: Henri E. Bal , Jennifer G. Steiner , Andrew S. Tanenbaum, Programming languages for distributed computing systems, ACM Computing Surveys (CSUR), v.21 n.3, p.261-322, Sep. 1989 [doi>10.1145/72551.72552]
• 6: Paul S. Barth , Rishiyur S. Nikhil , Arvind Nikhil, M-structures: extending a parallel, non-strict, functional language with state, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.538-568, June 1991, Cambridge, Massachusetts, United States
• 7: Andrew D. Birrell , Bruce Jay Nelson, Implementing remote procedure calls, ACM Transactions on Computer Systems (TOCS), v.2 n.1, p.39-59, February 1984 [doi>10.1145/2080.357392]
• 8: CALLAGHAN, B. 1996. WebNFS--The file system for the World-Wide Web. White paper, Sun Microsystems, Mountain View, Calif. May.
• 9: Luca Cardelli, A language with distributed scope, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.286-297, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199516]
• 10: CARLSSON, C. AND HAGSAND, O. 1996. DIVE--A platform for multi-user virtual environments. Comput. and Graph. 17, 6.
• 11: David Gelernter , Nicholas Carriero, Coordination languages and their significance, Communications of the ACM, v.35 n.2, p.97-107, Feb. 1992 [doi>10.1145/129630.129635]
• 12: John B. Carter , John K. Bennett , Willy Zwaenepoel, Implementation and performance of Munin, Proceedings of the thirteenth ACM symposium on Operating systems principles, p.152-164, October 13-16, 1991, Pacific Grove, California, United States
• 13: Douglas E. Comer, Internetworking with TCP/IP (2nd ed.), vol. I, Prentice-Hall, Inc., Upper Saddle River, NJ, 1991
• 14: George Coulouris , Jean Dollimore , Tim Kindberg, Distributed systems (3rd ed.): concepts and design, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2000
• 15: Jon Crowcroft, Open Distributed Systems, Artech House, Inc., Norwood, MA, 1996
• 16: DEERING, S. 1989. Host extensions for IP multic&sting. Tech. Rep. RFCl112. Aug.
• 17: ERICSSON. 1996. Open Telecom Platform--User's Guide, Reference Manual, Installation Guide, OS Specific Parts. Telefon&ktiebol&get LM Ericsson, Stockholm, Sweden.
• 18: FISCHER, K., KUHN, N., AND MULLER, J. P. 1994. Distributed, knowledge-based, reactive scheduling in the transportation domain. In the 10th IEEE Conference on Artificial Intelligence and Applications. IEEE, New York.
• 19: FISCHER, K., MULLER, J. P., AND PISCHEL, M. 1995. A model for cooperative transportation scheduling. In the 1st International Conference on Multiagent Systems (ICMAS 95). 109- 116.
• 20: Mike Foody, Let's talk, BYTE, v.22 n.4, p.99-102, April 1997
• 21: Robert H. Halstead, Jr., MULTILISP: a language for concurrent symbolic computation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.4, p.501-538, Oct. 1985 [doi>10.1145/4472.4478]
• 22: HARIDI, S. 1996. An Oz 2.0 tutorial. Tech. rep., Swedish Inst. of Computer Science, Stockholm, Sweden. Available at http://www.sics.se/ seif/oz.html.
• 23: Seif Haridi , Peter Van Roy , Gert Smolka, An overview of the design of Distributed Oz, Proceedings of the second international symposium on Parallel symbolic computation, p.176-187, July 20-22, 1997, Maui, Hawaii, United States [doi>10.1145/266670.266726]
• 24: HENZ, M. 1997. Objects in Oz. Doctoral dissertation, Univ. des S&&rl&ndes, S&&rbrficken, Germany.
• 25: Martin Henz , Stefan Lauer , Detlev Zimmermann, COMPOzE---Intention-based Music Composition through Constraint Programming, Proceedings of the 8th International Conference on Tools with Artificial Intelligence (ICTAI '96), p.118, November 16-19, 1996
• 26: Martin Henz , Jörg Würtz, Using Oz for College Timetabling, Selected papers from the First International Conference on Practice and Theory of Automated Timetabling, p.162-177, August 29-September 01, 1995
• 27: Robert A. Iannucci, Parallel Machines: Parallel Machine Languages, Kluwer Academic Publishers, Norwell, MA, 1990
• 28: Sverker Janson , Johan Montelius , Seif Haridi, Ports for objects in concurrent logic programs, Research directions in concurrent object-oriented programming, MIT Press, Cambridge, MA, 1993
• 29: E. B. Jul, Object mobility in a distributed object-oriented system, University of Washington, Seattle, WA, 1990
• 30: Eric Jul , Henry Levy , Norman Hutchinson , Andrew Black, Fine-grained mobility in the Emerald system, ACM Transactions on Computer Systems (TOCS), v.6 n.1, p.109-133, Feb. 1988 [doi>10.1145/35037.42182]
• 31: Butler W. Lampson, Reliable messages and connection establishment, Distributed systems (2nd Ed.), ACM Press/Addison-Wesley Publishing Co., New York, NY, 1993
• 32: LETH, L. AND WHOMSEN, B. 1992. Some Facile chemistry. Tech. Rep. ECRC-92-14, ECRC, Munich, Germany. May.
• 33: Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1996
• 34: SUN MICROSYSTEMS. 1996. The Java Series. Sun Microsystems, Mountain View, Calif. Available at http ://www. aw. com/cp/j avaseries, htm:l.
• 35: Randy Otte , Paul Patrick , Mark Roy, Understanding CORBA (Common Object Request Broker Architecture), Prentice-Hall, Inc., Upper Saddle River, NJ, 1995
• 36: David Plainfossé , Marc Shapiro, A Survey of Distributed Garbage Collection Techniques, Proceedings of the International Workshop on Memory Management, p.211-249, September 27-29, 1995
• 37: SCHMEIER, S. AND ACHIM, S. 1996. PASHA II--Person&l &ssist&nt for scheduling &ppointments. In the 1st International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology (PAAM 96). The Pr&ctic&l Applic&tion Comp&ny, L&nc&shire, United Kingdom.
• 38: Ehud Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.413-510, Sep. 1989 [doi>10.1145/72551.72555]
• 39: SMOLKA, G. 1995&. An Oz Primer. Progr&mming Systems L&b, Univ. des S&&rl&ndes, S&&rbrficken, Germ&ny. Av&il&ble &t http ://www. ps. uni-sb, de.
• 40: SMOLKA, G. 1995b. The Oz progr&mming model. In Computer Science Today. Lecture Notes in Computer Science, vol. 1000. Springer-Verl&g, Berlin, 324-343.
• 41: Gert Smolka , Martin Henz , Jörg Würtz, Object-Oriented Concurrent Constraint Programming in Oz, Grundlagen und Anwendungen der Künstlichen Intelligenz, 17. Fachtagung für Künstliche Intelligenz, Humboldt-Universität zu, p.44-59, September 13-16, 1993
• 42: SMOLKA, G., SCHULTE, C., AND VAN ROY, P. 1995. PERDIO--Persistent &nd distributed progr&mming in Oz. BMBF project propos&l. Av&il&ble &t http://www.ps.uni-sb.de.
• 43: Andrew S. Tanenbaum, Distributed operating systems, Prentice-Hall, Inc., Upper Saddle River, NJ, 1994
• 44: Gerard Tel, Introduction to distributed algorithms, Cambridge University Press, New York, NY, 1994
• 45: WALSER, J. P. 1996. Fe&sible cellul&r frequency &ssignment using constr&int progr&mming &bstr&ctions. In the 1st Workshop on Constraint Programming Applications, CP 96.
• 46: WIKSTROM, C. 1994. Distributed progr&mming in Erl&ng. In the 1st International Symposium on Parallel Symbolic Computation (PASCO 94). World Scientific, Sing&pore, 412-421.

INDEX TERMS

Primary Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
      D.1.3 Concurrent Programming
          Subjects: Distributed programming

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications
          Subjects: Concurrent, distributed, and parallel languages; Data-flow languages; Object-oriented languages

  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS
      F.3.2 Semantics of Programming Languages
          Subjects: Operational semantics

General Terms:
Languages, Performance, Security, Theory

Keywords:
latency tolerance, mobile objects, network transparency