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

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
  • Extraction of logical concurrency in distributed applications

    Publication Year: 1993, Page(s):66 - 73
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    Some methods are discussed to extract and represent the concurrency inherent in distributed applications. Concurrency is an application level property that is characterized completely by the set of messages exchanged in the application and the causal ordering relationship among the messages. The concurrency may be viewed at the logical level in the application rather than at the physical message c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for distributed groupware applications

    Publication Year: 1993, Page(s):195 - 202
    Cited by:  Papers (17)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Computer supported cooperative work (CSCW) is a rapidly growing field. Real-time groupware systems are addressed that allow a group of users to edit a shared document. The architecture and concurrency control algorithm used in this system are described. The algorithm is based on the semantics of the application and can be used by the developers of other groupware systems. The authors begin by intr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • k-coteries for fault-tolerant k entries to a critical section

    Publication Year: 1993, Page(s):74 - 81
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The authors extend the concept of coterie into k-coterie for k entries to a critical section. A structure named Cohorts is proposed to construct quorums in a k-coterie. The solution is resilient to node failures and/or network partitioning and has a low communication cost. The Cohorts structure is further improved to increase the availabilities of 1-entry critical sections 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.
  • Coherence in naming in distributed computing environments

    Publication Year: 1993, Page(s):83 - 92
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    Many different kinds of names (identifiers) are used in computer systems. Names are resolved (interpreted) in a context. A context is a function that maps names to entities. Multiple contexts allow the flexibility of giving different meanings to a name in different parts of the system; however, there are situations where it is desirable for the meaning of a name to be the same in different parts. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of multicast-based object replication strategies in distributed systems

    Publication Year: 1993, Page(s):311 - 318
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    The author presents an analysis of three object replication strategies based on reliable multicast protocols. A multiclass queuing model is used for obtaining performance characteristics of each strategy. The strategies are compared for a wide set of parameters showing the best strategy suitable for a given situation: the parallel update strategy is interesting for low load conditions and for the ... 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 low-level processor group membership protocol for LANs

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

    Presents a processor group membership protocol designed to run on top of a local area network. The protocol maintains information about a selected group of stations that explicitly join the protocol by keeping a replica of a global membership table at every member. Additionally, the protocol guarantees that a given station always occupies the same entry in the table. As a result, table indexes uni... 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 (66)  |  Patents (138)
    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.
  • 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.
  • Hardware assist for distributed shared memory

    Publication Year: 1993, Page(s):246 - 255
    Cited by:  Papers (11)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    The use of software implemented distributed shared memory (SDSM) to provide shared memory programming environments on networks of workstations and message-passing parallel computers has become quite popular. However, the memory reference patterns of many shared memory programs lead to poor performance on such systems. The authors propose hardware assist to improve the performance of SDSM systems f... 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.
  • 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.
  • Failure evaluation of disk array organizations

    Publication Year: 1993, Page(s):319 - 326
    Cited by:  Papers (7)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The authors present an evaluation of some of the disk array organizations proposed in the literature. They evaluate three alternatives for sparing, hot sparing, distributed sparing, and parity sparing, and two options for data layout, regular RAID5 and block designs, and systems based on combinations of these data layout and sparing alternatives. The performance of these organizations is evaluated... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Disk cache replacement policies for network fileservers

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

    Trace driven simulations were used to study the performance of several disk cache replacement policies for network file servers. It is shown that locality based approaches, such as the common least recently used (LRU) policy, which are known to work well on stand-alone disked workstations and at client workstations in distributed systems, are inappropriate at a fileserver. Quite simple frequency b... 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 (7)
    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.
  • Fast message ordering and membership using a logical token-passing ring

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

    The Totem protocol supports consistent concurrent operations by placing a total order on broadcast messages. This total order is achieved by including a sequence number in a token circulated around a logical ring that is imposed on a set of processors in a broadcast domain. A membership algorithm handles reconfiguration, including restarting of a failed processor and remerging of a partitioned net... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance study of general grid structures for replicated data

    Publication Year: 1993, Page(s):178 - 185
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    Recently, there has been considerable interest in the study of replica-control protocols which are based on organizing several copies of an object into logical structures, such as rectangular grids. In addition to high availability, another objective in exploiting such structures is to improve the degree of load sharing in a system. The authors extend the scope of grid structures to general grids,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delivering multicast messages in networks with mobile hosts

    Publication Year: 1993, Page(s):292 - 299
    Cited by:  Papers (37)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    There is a strong trend toward integrating portable computers within existing data networks. Traditional network protocols were designed assuming a static view of network connectivity. A mobile host can connect to the network from different locations at different times. This has led to the emergence of a new set of problems with regard to addressing schemes and network protocols for accommodating ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IPL: a multidatabase transaction specification language

    Publication Year: 1993, Page(s):439 - 448
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    A multidatabase system (MDBS) integrates preexisting and heterogeneous databases in a distributed environment. A multidatabase transaction is a consistent and reliable execution of an application over a multidatabase system. The authors summarize the characteristics of multidatabase transactions and present a multidatabase transaction specification language, the InterBase Parallel Language (IPL). ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using group communication to implement a fault-tolerant directory service

    Publication Year: 1993, Page(s):130 - 139
    Cited by:  Papers (6)  |  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.
  • Diagnosis of single transition faults in communicating finite state machines

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

    The authors propose a generalized diagnostic algorithm for the case where more than one fault (output or transfer) may be present in one of the transitions of a deterministic system represented by a set of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deadlock prevention in the RTC programming system for distributed real-time applications

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

    The RTC distributed real-time programming system was implemented using AND-OR locking of system resources to meet real-time and concurrency control requirements. Since RTC processes can hold locks while acquiring others, deadlock is possible and therefore a deadlock prevention technique was implemented for AND-OR locking in such systems. The authors briefly discuss the RTC programming system, illu... View full abstract»

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