By Topic

[1993] Proceedings. The 13th International Conference on Distributed Computing Systems

Date 25-28 May 1993

Filter Results

Displaying Results 1 - 25 of 64
  • Proceedings of IEEE International Conference on Distributed Computing Systems - ICDCS '93

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Using group communication to implement a fault-tolerant directory service

    Publication Year: 1993, Page(s):130 - 139
    Cited by:  Papers (5)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    Group communication is an important paradigm for building distributed applications. The authors discuss a fault-tolerant distributed directory service based on group communication, and compare it with the previous design and implementation based on remote procedure call (RPC). The group directory service uses an active replication scheme and, when triplicated, can handle 627 lookup operations per ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structuring distributed shared memory with the π architecture

    Publication Year: 1993, Page(s):93 - 100
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    The authors examine the use of a new architecture for the design of system software. The architecture allows the construction of flexible system software components, and the resulting realizations can be tailored to the needs of various applications. The focus is on the application of that architecture to distributed shared memory (DSM). The system software architecture, called π, defines eleme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collective learning of action sequences

    Publication Year: 1993, Page(s):203 - 209
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    Learning in multiagent systems is a new research field in distributed artificial intelligence. The author investigates an action-oriented approach to delayed reinforcement learning in reactive multiagent systems and focuses on the question of how the agents can learn to coordinate their actions. Two basic algorithms, the ACE algorithm and the AGE algorithm (ACE and AGE stand for Action Estimation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deriving protocol specifications from service specifications in extended FSM models

    Publication Year: 1993, Page(s):141 - 148
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The authors propose a synthetic technique to derive a correct protocol specification from a given service specification modeled as a nondeterministic extended finite state machine (EFSM). Each EFSM has a finite state control and a finite number of registers. In the model, the next state and the next values of the registers are determined depending on not only the current state and input but also t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Composition of concurrent programs

    Publication Year: 1993, Page(s):391 - 398
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    A model and a notation are developed for specifying the composition of concurrent programs. The work is based on the observation that the composition of concurrent programs often requires not only intraprocessor coordination but also interprocessor coordination. A notation is developed for explicitly specifying both forms of coordination within a single uniform framework. Much prior work has eithe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic reconfiguration in distributed systems: adapting software modules for replacement

    Publication Year: 1993, Page(s):101 - 110
    Cited by:  Papers (27)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    Dynamic reconfiguration of a distributed application is the act of changing the configuration of the application as it executes. Examples of configuration changes are replacing a software component (module), moving a module to another machine, and adding or removing a module from the application. The extension to a reconfiguration platform described automatically prepares a module for participatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting reliable and atomic transaction management in multidatabase systems

    Publication Year: 1993, Page(s):457 - 464
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    Transaction management in multidatabase systems (MDBSs) is complicated by the autonomy requirement, especially in the case of failure. We demonstrate necessary and sufficient conditions for supporting reliable and atomic transaction management in MDBSs. Most previous work assumes single version histories and conflict serializability; this precludes the use of multiversion scheduling protocols in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A state-aggregation method for analyzing dynamic load-balancing policies

    Publication Year: 1993, Page(s):482 - 489
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Exact performance analyses of dynamic load-balancing policies for distributed systems are very difficult because the state space is multidimensional and load-balancing decisions are state-dependent. A state-aggregation method is proposed to analyze the performance of dynamic load-balancing policies. Those states with the same number of jobs are aggregated into a single state. The number of jobs in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of a collaborative application in CSDL

    Publication Year: 1993, Page(s):210 - 217
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Cooperative system programming deals with four topics: multiuser interfaces, coordination, shared workspace, and networking control. The goal of CSDL (Cooperative Systems Design Language) is to cover all these aspects. The authors present the development of a system in CSDL. The system allows a group of physically distributed users to edit a document concurrently. It permits sharing the single-use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Run-time support and storage management for memory-mapped persistent objects

    Publication Year: 1993, Page(s):508 - 515
    Cited by:  Papers (1)  |  Patents (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The authors present the design and implementation of a persistent store called SPOMS. SPOMS is a runtime system that provides a store for persistent objects and is language independent. The objects are created via calls to SPOMS, and, when used, SPOMS directly maps them into the spaces of all requesting processes. The objects are stored in native format and are concurrently sharable. The store can... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Laura: a coordination language for open distributed systems

    Publication Year: 1993, Page(s):39 - 46
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Open distributed systems are an emerging class of distributed systems that have to take into account a number of heterogeneities in the system components and possibly high dynamics in the system structure by unrestrictedly joining and leaving agents. Uncoupled processing is a basis for a solution of the coordination problem that arises. Laura is a coordination language for open distributed systems... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Responsive aperiodic services in high-speed networks

    Publication Year: 1993, Page(s):337 - 346
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    A fast packet-switched network is considered that transmits fixed-sized packets or cells and provides connection-oriented services. A number of rate-based service disciplines that offer timing guarantees have recently been proposed. These disciplines work well for connections which exhibit low burstiness or whose burstiness can be managed by admission control. However, some messages have irregular... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proxy-based authorization and accounting for distributed systems

    Publication Year: 1993, Page(s):283 - 291
    Cited by:  Papers (58)  |  Patents (136)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    A unified model is presented for authentication, authorization, and accounting that is based on proxies. It is shown that the proxy model for authorization can be used to support a wide range of authorization and accounting mechanisms. The proxy model strikes a balance between access-control-list anti capability-based mechanisms, allowing each to be used where appropriate and allowing their use in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formal assessment of synchronous testability for communicating systems

    Publication Year: 1993, Page(s):149 - 156
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    A testability assessment approach for multicomponent systems is proposed within the framework of formal description techniques. The approach relies on the formal definition of implementation conformance with respect to a given specification. It provides measures of user confidence and guidelines for an automatic design analysis. Both items are based on test requirements. The proposed technique for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Degradable agreement in the presence of Byzantine faults

    Publication Year: 1993, Page(s):237 - 244
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    The authors consider a system consisting of a sender that wants to send a value to certain receivers. Byzantine agreement protocols have previously been proposed to achieve this in the presence of arbitrary failures. The imposed requirement typically is that the fault-free receivers must all agree on the same value. An agreement protocol is proposed that achieves Lamport's Byzantine agreement (L. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution and inheritance in the HERON approach to heterogeneous computing

    Publication Year: 1993, Page(s):399 - 408
    Cited by:  Papers (2)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    HERON is a platform for object-oriented distributed computing in an open systems environment. We try to achieve a degree of distribution transparency previously known only from special distributed programming systems, while at the same time accommodating heterogeneous, autonomous computer systems. Distributed programs are written in Eiffel. The Eiffel language system is not modified: HERON employs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling cooperative work: viewing distributed systems as both CSP and SCL

    Publication Year: 1993, Page(s):532 - 539
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The authors propose to view cooperating tasks in distributed systems as both CSPs: (communicating sequential processes) and SCLs (sequential cooperating layers). This dual, complementary, view of distributed systems is based on the notion of communication closed layers. The same state-space abstraction and global assertions that were used for the design, development, verification, and testing of s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating caching schemes for the X.500 directory

    Publication Year: 1993, Page(s):112 - 119
    Cited by:  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The OSI (Open Systems Interconnection) X.500 directory system and other distributed naming systems use name caching to minimize the cost of name lookups for nonlocal names. The authors evaluate the impact of name caching on the performance of the OSI directory system. They consider the issues of cache sizing and cache replacement policies. It was found that a locality of reference property holds i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sharing complex objects in a distributed PEER environment

    Publication Year: 1993, Page(s):186 - 193
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    For distributed computing environments, required for computer integrated manufacturing and other engineering applications, it is most important to support the sharing and exchange of complex objects among cooperating sites, while preserving their autonomy. Specification of complex objects and their object boundaries in a federated database are described. Each database, as well as the entire federa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate analysis of priority scheduling systems using stochastic reward nets

    Publication Year: 1993, Page(s):466 - 473
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Presents a performance analysis of a heterogeneous multiprocessor system where tasks may arrive from Poisson sources as well as by spawning and probabilistic branching of other tasks. Non-preemptive priority scheduling is used between different tasks. Stochastic reward nets are used as the system model, and are solved analytically by generating the underlying continuous-time Markov chain. An appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining information about persistent replicated objects in a distributed system

    Publication Year: 1993, Page(s):491 - 498
    Cited by:  Papers (5)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Presents a general model for persistent replicated object management and identify what metainformation about objects needs to be maintained by a naming and binding service to ensure that objects named by application programs are bound to only those object replicas which are in a mutually consistent state. These ideas are developed within the framework of a distributed system in which application p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed shared repository: a unified approach to distribution and persistency

    Publication Year: 1993, Page(s):20 - 29
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    The authors propose an information management system providing distribution and persistency. By separating context from virtual address space, the system has a unified approach for both distribution and persistency. The former is achieved by moving contents between sites and the latter by moving contents between virtual address space and persistent storage. Contents include any information includi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconfiguration of spanning trees in networks in the presence of node failures

    Publication Year: 1993, Page(s):219 - 226
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Connectivity among a set of user entities in a network can be provided by a network level abstraction of an acyclic graph (or spanning tree). The authors discuss the reconfiguration of a graph in the presence of failures of network nodes. A reconfiguration manifests itself as a graph fragmentation problem, whereby two or more disjoint subgraphs attempt to connect with one another to form a composi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent job selection for distributed scheduling

    Publication Year: 1993, Page(s):517 - 524
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    A key issue in distributed scheduling is selecting appropriate jobs to transfer. A job selection policy that considers the diversity of job behaviors is proposed. A mechanism used in artificial neural networks, called weight climbing, is employed. Using this mechanism, a distributed scheduler can learn the behavior of a job from its past executions and make a correct prediction about whether trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.