Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Overview of the Article
Cells: Semantics and Mobile State Protocol
Outline of Protocol (
Related Work
Conclusions, Status, and Current Work
References
All Topics
Computer Science
Distributed Systems

Mobile objects in distributed Oz

Profile image of Peter Van RoyPeter Van Roy

1997, ACM Transactions on Programming Languages and Systems

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. Networktransparent 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 object's 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.

Related papers

A Distributed Object-Oriented Language with Session Types
Sophia Drossopoulou

Lecture Notes in Computer Science, 2005

In the age of the world-wide web and mobile computing, program- ming communication-centric software is essential. Thus, programmers and pro- gram designers are exposed to new levels of complexity, such as ensuring the correct composition of communication behaviours and guaranteeing deadlock- freedom of their protocols. This paper proposes the language Ldoos, a simple distributed object-oriented language augmented with session communication

View PDFchevron_right
Extensions to the object paradigm for the development of distributed applications
Lutz Heuser

1988

View PDFchevron_right
The object paradigm is to be reconsidered for distributed systems
Antonio Corradi

Proceedings of the 4th workshop on ACM SIGOPS European workshop, 1990

The object paradigm has been proposed as a breakthrough because of many of its features: information hiding, dynamic object communication, grouping of information into classes, inheritance among classes, possibility of changing behavior at run-time by manipulating classes. The information hiding property states a clean distinction between external visibility and internal perspective of an object. The external world has reduced visibility of the inside of an object: normally only an interface constitued by operation names is visible. Within any object, instead, there is the full visibility, in particular of the object state. This makes possible thateach object decides its internal policies independently of any environment decision. Object communications produce the global computation in object-based systems. An object can communicate with another if and only if knows it via a reference [Lis79]. In object systems, a communication implies that client objects request operations defined in the interface of server objects. These requests are exchanged by using message-passing mechanisms. Dynamicity of communications means that an object can change its visibility, i.e. the objects it can refer. Classification and factorization by inheritance gives object environments the possibility of applying reusability and extensibility. On the one hand, object applications can be designed and programmed by reusing already developed software. On the other hand, applications based on objectscan evolve to follow changes of specification. In the case of dynamic changes, the possibility of updating classes at run-time constitutes an useful tool.

View PDFchevron_right
Object Models for Distributed or Persistent Programming
Fethi Rabhi

The Computer Journal, 1997

As use of object orientation for application development has increased, many researchers have investigated the design of object-based programming languages for the distributed and persistent programming. This paper concentrates on reviewing a number of object-oriented languages for distributed or persistent programming. In each case, the focus is on the object model supported and the mechanisms and policies employed in the implementation of distributed or persistent objects. In particular, each language reviewed has been chosen to illustrate a particular object model or implementation strategy.

View PDFchevron_right
From distributed objects to distributed components: the Olan approach
Michel RIVEILL

1996

Programming of distributed applications is now supported by multiple alternatives when considering high level distributed environments. Using a system platform for remote access to services Such a platform can be a pure distributed operating system or a distributed language runtime like Emerald[1], Argus[2] , Guide[3] , or a platform that integrates distribution like CORBA[4], ILU[5] , Network OLE, etc. Those technologies aim at providing transparent and easy access to distributed services available on a workstation cluster, thus normalizing the way of accessing them. Such a normalization most often deals with the interface description language (IDL[6]) that statically describe services available from various objects, and the mapping of such a language with existing programming languages used for the core implementation of objects. In order to access a service, a client object must first know the identity of the server object (that really provides the desired service), the type of interface that can be dynamically accessed. Then the client object submits a request to the system platform that handles the search for the server, the execution of the request and the delivery of the results. In contrast with this rather static approach, message busses[7][8] are providers of distributed access to dynamically declared services. A client requesting a service is

View PDFchevron_right
Objects, Replication and Decoupled Communication in Distributed Environments
Andreas Polze

We hav e developed the Object Space approach which integrates that communication style with object-oriented techniques. It allows encapsulation of protocols for interactions in distributed applications into classes, thus providing a newlev elofabstraction.

View PDFchevron_right
Distributed objects: An approach based on replication and migration
Ernesto Pimentel

JOURNAL OF OBJECT ORIENTED …, 1999

The achievement of efficient implementations is still considered an open problem in the distributed object-oriented programming languages field. In this paper we present an approach to implement in a reasonable efficient way distributed objects. This approach is based on the use of a protocol that allows objects to be migrated and replicated. The basic idea is to reduce the overhead of remote invocations among objects making them local. The effectiveness of our scheme requires a strict programming model, where object invocations must be enclosed between pairs of acquire and release operations, and operations are classified in commands or queries. Details of a thread based implementation are presented. Experiments with a parallel matrix multiply program and a parallel branch and bound program, executed in three different architectures, demonstrate that significant speedups can be obtained.

View PDFchevron_right
Object-oriented distributed programming in BETA
Ole Lehrmann Madsen

Lecture Notes in Computer Science

This paper describes abstractions that have been designed to support distributed programming in the object oriented programming language BETA. The approach is minimalistic in the sense that a goal is to provide the essential building blocks on top of which other distribution related abstractions may be built. This goal is made easier by demanding for type orthogonal persistence and distribution as the full power of the underlying language may then be used when building higher level abstractions on top of the basic ones.

View PDFchevron_right
Distributed Proxy: A Design Pattern for Distributed Object Communication
António Rito Silva

1997

This paper presents the Distributed Proxy pattern, a design pattern for distributed object communication. The Distributed Proxy pattern decouples distributed object communication from object specific functionalities. It further decouples logical communication from physical communication. The Distributed Proxy pattern enforces an incremental development process, encapsulates the underlying distribution mechanisms, and offers location transparency. 1 Intent The Distributed Proxy pattern decouples the communication between distributed objects by isolating distributionspecific issues from object functionality. Moreover, distributed communication is further decoupled into logical communication and physical communication parts. 2 Motivation An example motivates for the problems and respective forces involved in distributed object communication. 2.1 Example A distributed agenda application has several users which manipulate agenda items, either private (appointments) or shared (meetings). ...

View PDFchevron_right
Distributed typed concurrent objects: a programming language for distributed computations with mobile resources
Fernando Silva

2003

Abstract: We describe a programming language for distributed computations that supports mobile resources and is based on a process calculus. The syntax, semantics and implementation of the language are presented with a focus on the novel model of computation. Key Words: Process-Calculus, Distributed Computing, Mobile Resources Category: D. 1.3, D. 3.2

View PDFchevron_right

References (55)

  1. ∧ P.state=FREE Send(P.manager,get(P.
  2. P
  3. Request content and reply to thread (content present). Receive(P,request(T,N y ))
  4. ∧ P.content =NULL Send(T,proceed(P.content))
  5. P.content ← N y
  6. Accept content and reply to thread. Receive(P,put(N z ))
  7. P.content ← N z Send(P.thread,proceed(P.content))
  8. P.content ← P.newcontent
  9. Accept forward. Receive(P,forward(P'))
  10. P.forward ← P'
  11. Forward content. P.forward =NULL ∧ P.content =NULL Send(P.forward,put(P.content))
  12. P.forward ← NULL P.content ← NULL P.state ← FREE
  13. Serialize content requests (at manager). Receive(M,get(P)) Send(M.tail,forward(P))
  14. M.tail ← P REFERENCES Abelson, H., Sussman, G. J., and Sussman, J. 1985. Structure and Interpretation of Computer Programs. MIT Press, Cambridge, Mass.
  15. Armstrong, J., Williams, M., Wikström, C., and Virding, R. 1996. Concurrent Programming in Erlang. Prentice-Hall, Englewood Cliffs, N.J.
  16. Axling, T., Haridi, S., and Fahlen, L. 1995. Concurrent constraint programming virtual reality applications. In the 2nd International Conference on Military Applications of Synthetic Envi- ronments and Virtual Reality (MASEVR 95 ). Defence Material Administration, Stockholm, Sweden.
  17. Bal, H. E., Kaashoek, F. E., and Tanenbaum, A. S. 1992. Orca: A language for parallel programming of distributed systems. IEEE Trans. Softw. Eng. 18, 3 (Mar.), 190-205.
  18. Bal, H. E., Steiner, J. G., and Tanenbaum, A. S. 1989. Programming languages for distributed computing systems. ACM Comput. Surv. 21, 3 (Sept.), 261-322.
  19. Barth, P. S., Nikhil, R. S., and Arvind. 1991. M-structures: Extending a parallel, nonstrict, functional language with state. In Functional Programming and Computer Architecture. Springer-Verlag, Berlin.
  20. Birrell, A. D. and Nelson, B. J. 1984. Implementing remote procedure calls. ACM Trans. Comput. Syst. 2, 1 (Feb.), 39-59.
  21. Callaghan, B. 1996. WebNFS-The file system for the World-Wide Web. White paper, Sun Microsystems, Mountain View, Calif. May.
  22. Cardelli, L. 1995. A language with distributed scope. ACM Trans. Comput. Syst. 8, 1 (Jan.), 27-59. Also appeared in POPL 95.
  23. Carlsson, C. and Hagsand, O. 1996. DIVE-A platform for multi-user virtual environments. Comput. and Graph. 17, 6.
  24. Carriero, N. and Gelernter, D. 1992. Coordination languages and their significance. Commun. ACM 35, 2 (Feb.), 96-107.
  25. Carter, J. B., Bennett, J. K., and Zwaenepoel, W. 1991. Implementation and performance of Munin. In the 13th ACM Symposium on Operating System Principles. ACM, New York, 152-164.
  26. Comer, D. E. 1995. Internetworking with TCP/IP. Vol. 1, Principles, Protocols, and Architec- ture. Prentice-Hall, Englewood Cliffs, N.J.
  27. Coulouris, G., Dollimore, J., and Kindberg, T. 1994. Distributed Systems Concepts and Design, 2nd ed. Addison-Wesley, Reading, Mass.
  28. Crowcroft, J. 1996. Open Distributed Systems. University College London Press, London, U.K. Deering, S. 1989. Host extensions for IP multicasting. Tech. Rep. RFC1112. Aug. Ericsson. 1996. Open Telecom Platform-User's Guide, Reference Manual, Installation Guide, OS Specific Parts. Telefonaktiebolaget LM Ericsson, Stockholm, Sweden.
  29. Fischer, K., Kuhn, N., and Müller, J. P. 1994. Distributed, knowledge-based, reactive schedul- ing in the transportation domain. In the 10th IEEE Conference on Artificial Intelligence and Applications. IEEE, New York.
  30. 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.
  31. Foody, M. 1997. Let's talk (Special report building networked applications). BYTE 22, 4 (Apr.), 99-102.
  32. Halstead, R. H. 1985. MultiLisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct.), 501-538.
  33. 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.
  34. Haridi, S., Van Roy, P., and Smolka, G. 1997. An overview of the design of Distributed Oz. In the 2nd International Symposium on Parallel Symbolic Computation (PASCO 97 ). ACM, New York.
  35. Henz, M. 1997. Objects in Oz. Doctoral dissertation, Univ. des Saarlandes, Saarbrücken, Germany.
  36. Henz, M., Lauer, S., and Zimmermann, D. 1996. COMPOzE-Intention-based music composi- tion through constraint programming. In the International Conference on Tools with Artificial Intelligence. IEEE, New York.
  37. Henz, M. and Würtz, J. 1996. Using Oz for college timetabling. In the International Conference on the Practice and Theory of Automated Timetabling, E. K. Burke and P. Ross, Eds. Lecture Notes in Computer Science, vol. 1153. Springer-Verlag, Berlin, 162-177.
  38. Iannucci, R. A. 1990. Parallel Machines: Parallel Machine Languages. The Emergence of Hybrid Dataflow Computer Architectures. Kluwer, Dordrecht, The Netherlands.
  39. Janson, S., Montelius, J., and Haridi, S. 1993. Ports for objects in concurrent logic programs. In Research Directions in Concurrent Object-Oriented Programming. MIT Press.
  40. Jul, E. 1988. Object mobility in a distributed object-oriented system. Ph.D. thesis, Univ. of Washington, Seattle, Wash.
  41. Jul, E., Levy, H., Hutchinson, N., and Black, A. 1988. Fine-grained mobility in the Emerald system. ACM Trans. Comput. Syst. 6, 1 (Feb.), 109-133.
  42. Lampson, B. W. 1993. Reliable messages and connection establishment. In Distributed Systems, S. Mullender, Ed. Addison-Wesley, Reading, Mass., 251-281.
  43. Leth, L. and Thomsen, B. 1992. Some Facile chemistry. Tech. Rep. ECRC-92-14, ECRC, Munich, Germany. May.
  44. Lynch, N. 1996. Distributed Algorithms. Morgan Kaufmann, San Francisco, Calif. Sun Microsystems. 1996. The Java Series. Sun Microsystems, Mountain View, Calif. Available at http://www.aw.com/cp/javaseries.html.
  45. Otte, R., Patrick, P., and Roy, M. 1996. Understanding CORBA: The Common Object Request Broker Architecture. Prentice-Hall PTR, Upper Saddle River, N.J.
  46. Plainfossé, D. and Shapiro, M. 1995. A survey of distributed garbage collection techniques. In the International Workshop on Memory Management. Lecture Notes in Computer Science, vol. 986. Springer-Verlag, Berlin, 211-249.
  47. Schmeier, S. and Achim, S. 1996. PASHA II-Personal assistant for scheduling appointments. In the 1st International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology (PAAM 96 ). The Practical Application Company, Lancashire, United Kingdom.
  48. Shapiro, E. 1989. The family of concurrent logic programming languages. ACM Comput. Surv. 21, 3 (Sept.), 413-510.
  49. Smolka, G. 1995a. An Oz Primer. Programming Systems Lab, Univ. des Saarlandes, Saarbrücken, Germany. Available at http://www.ps.uni-sb.de.
  50. Smolka, G. 1995b. The Oz programming model. In Computer Science Today. Lecture Notes in Computer Science, vol. 1000. Springer-Verlag, Berlin, 324-343.
  51. Smolka, G., Henz, M., and Würtz, J. 1995. Object-oriented concurrent constraint program- ming in Oz. In Principles and Practice of Constraint Programming, P. Van Hentenryck and V. Saraswat, Eds. MIT Press, Cambridge, Mass., 29-48.
  52. Smolka, G., Schulte, C., and Van Roy, P. 1995. PERDIO-Persistent and distributed pro- gramming in Oz. BMBF project proposal. Available at http://www.ps.uni-sb.de.
  53. Tanenbaum, A. S. 1995. Distributed Operating Systems. Prentice-Hall, Englewood Cliffs, N.J. Tel, G. 1994. An Introduction to Distributed Algorithms. Cambridge University Press, Cam- bridge, United Kingdom.
  54. Walser, J. P. 1996. Feasible cellular frequency assignment using constraint programming ab- stractions. In the 1st Workshop on Constraint Programming Applications, CP 96.
  55. Wikström, C. 1994. Distributed programming in Erlang. In the 1st International Symposium on Parallel Symbolic Computation (PASCO 94 ). World Scientific, Singapore, 412-421.

Related papers

An overview of the design of Distributed Oz
Peter Van Roy

Proceedings of the Second International Symposium on Parallel Symbolic Computation, 1997

We present a design for a distributed programming system, Distributed Oz, that abstracts away the network. This means that all network operations are invoked implicitly by the system as an incidental result of using particular language constructs. However, since network operations are expensive, the programmer must retain control over network communication patterns. This control is provided through the language constructs. While retaining their centralized semantics, they are extended with a distributed semantics. Distributed Oz is an extension of Oz, a concurrent state-aware language with rst-class procedures. Distributed Oz extends Oz with just two concepts: mobility control and asynchronous ordered communication. Mobility control provides for truly mobile objects in a simple and clean way. Asynchronous ordered communication allows to conveniently build servers. These two concepts give the programmer a control over network communications that is both simple and predictable. We give scenarios to show how common distributed programming tasks can be implemented e ciently. There are two reasons for the simplicity of Distributed Oz. First, Oz has a simple formal semantics. Second, the distributed extension is built using network protocols that are natural extensions to the centralized language operations. We discuss the operational semantics of Oz and Distributed Oz and the architecture of the distributed implementation. We give an overview of the basic network protocols for communication and mobility.

View PDFchevron_right
Language design for distributed objects
William R Cook

2009

Abstract The fundamental ideas of distributed objects have changed little in the last 20 years. Existing languages are retrofitted with transparent distribution mechanisms based on proxies. Experiments with mobile code demonstrate its power but have little impact on practice. The problems with transparency and mobile code have been well known since at least 1994. But in the absence of any fundamental new ideas, the same problematic approaches are used, for example in the design of Java RMI.

View PDFchevron_right
Using mobility to make transparent distribution practical
seif haridi

1997

Some of the most di cult 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. 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 the language semantics with mobility control, the ability for objects to migrate between sites or to remain stationary at one site. 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. We show how to give objects an arbitrary mobility behavior that is independent of the object's de nition. This gives the programmer a simple and e ective control both over information transfer and over the resulting network communication patterns. These ideas have been implemented in Distributed Oz, a concurrent object-oriented language which is state-aware and has data ow synchronization. Distributed Oz is an extension to the publicly-available DFKI Oz 2.0 system.

View PDFchevron_right
MAGE: A Distributed Programming Model
Michael Haungs

2001

Writing distributed programs is difficult. To ease this task, we introduce a new programming abstraction which we call a mobility attribute. Mobility attributes provide a syntax that describes the mobility semantics of program components. Programmers attach mobility attributes to program components to dynamically control the placement of these components within the network. Mobility attributes intercept component invocations and decide whether and where to move a component before the component executes. This allows the programmer to improve her program's runtime efficiency by colocating components and resources. We present MAGE, an object oriented distributed system, that supports mobility attributes and illustrates their utility

View PDFchevron_right
A framework for seamlesly making object oriented applications distributed
Pierre Vignéras

Advances in Parallel Computing, 2004

View PDFchevron_right

Related topics

  • Information Systems
  • Languages
  • Computer Science
  • Algorithms
  • Distributed Computing
  • Syntax
  • Semantics (Computer Science)
  • Mobile Agent
  • Mobile Objects
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved