An overview of the design of Distributed Oz

Published 1 January 1997Open access

Seif Haridi, Peter Van Roy, Gert Smolka

Citations44

TL;DR

A design for a distributed programming system, Distributed Oz, that abstracts away the network, which means that all network operations are invoked implicitly by the system as an incidental result of using particular language constructs.

Abstract

Article Free Access Share on An overview of the design of Distributed Oz Authors: Seif Haridi Swedish Institute of Computer Science (SICS), Sweden Swedish Institute of Computer Science (SICS), SwedenView Profile , Peter Van Roy Université catholique de Louvain (UCL), Belgium Université catholique de Louvain (UCL), BelgiumView Profile , Gert Smolka Universität des Saarlandes, Saarbrücken, Germany Universität des Saarlandes, Saarbrücken, GermanyView Profile Authors Info & Claims PASCO '97: Proceedings of the second international symposium on Parallel symbolic computationJuly 1997 Pages 176–187https://doi.org/10.1145/266670.266726Online:20 July 1997Publication History 24citation287DownloadsMetricsTotal Citations24Total Downloads287Last 12 Months13Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Keywords

Computer Science

ACM Transactions on Computer SystemsFine-grained mobility in the Emerald system

733 Citations1988Eric Jul, Henry M. Levy +2 more

The benefits of tine-grained mobility, the Emerald language and run-time mechanisms that support mobility, and techniques for implementing mobility that do not degrade the performance of local operations are discussed.

View PDF

The MIT Press eBooksConcurrent Constraint Programming

576 Citations1993Vijay Saraswat

The Oz Programming Model

134 Citations1997Gert Smolka

A MODEL FOR COOPERATIVE TRANSPORTATION SCHEDULING

119 Citations1995Klaus Fischer

An extension of the contract net protocol is presented; it can be used to obtain good initial solutiom for complex resource allocation problems and can be improved significantly by introducing global information based upon auction protocols.

Obliq, a language with distributed scope

99 Citations1996Luca Cardelli

Obliq is a lexically-scoped untyped interpreted language that supports distributed object-oriented computation that may involve multiple threads of control within an address space, multiple address spaces on a machine, heterogeneous machines over a local network, and multiple networks over the Internet.

ACM Transactions on Programming Languages and SystemsMobile objects in distributed Oz

89 Citations1997Peter Van Roy, Seif Haridi +4 more

It is proved that the implementation of objects in Distributed Oz is network transparent, and how to give objects an arbitrary mobility behavior that is independent of the objects definition is shown.

View PDF

Informatik aktuellObject-Oriented Concurrent Constraint Programming in Oz

67 Citations1993Gert Smolka, Martin Henz +1 more

A novel feature of Oz is that it accommodates higher-order programming without sacrificing that denotation and equality of variables are captured by first-order logic.

Prentice-Hall, Inc eBooksUnderstanding CORBA (Common Object Request Broker Architecture)

64 Citations1995Randy Otte, Paul H. Patrick +1 more

This chapter discusses the general process of building a CORBA Client Application and the design of a Distributed Computing Frameworks, as well as some of the challenges faced in designing and developing such an application.

Lecture notes in computer scienceThe definition of Kernel Oz

41 Citations1995Gert Smolka

Kernel Oz is defined, a semantically complete sublanguage of Oz that introduces three essential abstractions: the Oz universe, the Oz calculus, and the actor model.

Lecture notes in computer scienceUsing Oz for college timetabling

35 Citations1996Martin Henz, Jörg Würtz

It is shown that the higher-order concurrent constraint language Oz provides this high-level expressivity, and can serve as a useful programming tool for college timetabling.