By Topic

[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
  • 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.
  • Delivering multicast messages in networks with mobile hosts

    Publication Year: 1993, Page(s):292 - 299
    Cited by:  Papers (35)  |  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.
  • 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.
  • Event ordering in a shared memory distributed system

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

    Past research has concentrated on ordering events in a system where processes communicate through messages. The authors look at issues in ordering events in a distributed system based on shared objects that interact via remote procedure calls (RPCs). They derive clock conditions for ordering operations on an object and provide clock maintenance schemes for time-stamping execution events. An object... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of closely coupled systems for high performance database processing

    Publication Year: 1993, Page(s):301 - 310
    Cited by:  Papers (4)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    Closely coupled systems aim at a more efficient communication and cooperation between processing nodes compared to loosely coupled systems. This can be achieved by using globally shared semiconductor memory to speed up the exchange of messages or to store global data structures. For distributed database processing, the database sharing (shared disk) architecture can benefit most from such a close ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of co-scheduling on a network of workstations

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

    In a set of high performance workstations connected by a network, many workstations may be underutilized by their owners. While each workstation may be primarily responsible for executing its owner's tasks with the highest priority, the unused processing capacity may be made available to computationally intensive tasks submitted externally to the system. Static co-scheduling for such an environmen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical considerations for non-blocking concurrent objects

    Publication Year: 1993, Page(s):264 - 273
    Cited by:  Papers (7)  |  Patents (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    An important class of concurrent objects are those that are nonblocking, that is, whose operations are not contained within mutually exclusive critical sections. A nonblocking object can be accessed by many threads at a time, yet update protocols based on atomic compare-and-swap operations can be used to guarantee the object's consistency. The author examines the compare-and-swap operation in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed divergence control for epsilon serializability

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

    Epsilon serializability (ESR) allows for more concurrency by permitting nonserializable interleavings of database operations among epsilon transactions (ETs). The authors present the design of distributed divergence control (DDC) algorithms for ESR in homogeneous and heterogeneous distributed databases. They first present a strict two-phase locking DDC algorithm (S2PLDDC) and an optimistic DDC alg... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Inter-machine protocols for electronic libraries

    Publication Year: 1993, Page(s):275 - 282
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    Emerging technology permits electronic document libraries which store large numbers of images for access in wide-area networks. The expected statistics and security needs of electronic library applications favor new client-server session protocols. The author proposes a scheme that makes communications efficient in a well-defined sense. DocSS, a document storage subsystem, implements the scheme. A... 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 (13)
    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.
  • Average message overhead of replica control protocols

    Publication Year: 1993, Page(s):474 - 481
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    Management of replicated data has received considerable attention in the last few years. Several replica control schemes have been proposed which work in the presence of both node and communication link failures. However, this resiliency to failure inflicts a performance penalty in terms of the communication overhead incurred. Though the issue of performance of these schemes, from the standpoint o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed modeling and implementation of high performance communication architectures

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

    High performance distributed computing systems require high performance communication systems. Distributed modeling and implementation of these communication systems is important. Toward this goal, the authors refine the process-to-channelagent-to-process (PCP) model of asynchronous distributed communication. While the PCP model provides a versatile and succinct mechanism for specifying... 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.
  • Laura: a coordination language for open distributed systems

    Publication Year: 1993, Page(s):39 - 46
    Cited by:  Papers (5)
    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.
  • 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.
  • 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.
  • 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.