Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003)

5-5 June 1999

Filter Results

Displaying Results 1 - 25 of 59
  • Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003)

    Publication Year: 1999
    Request permission for commercial reuse | |PDF file iconPDF (301 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1999, Page(s):553 - 554
    Request permission for commercial reuse | |PDF file iconPDF (221 KB)
    Freely Available from IEEE
  • Striping and buffer caching for software RAID file systems in workstation clusters

    Publication Year: 1999, Page(s):544 - 551
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (168 KB)

    A software RAID file system is defined as a system that distributes data redundantly across an array of disks attached to each of the workstations connected to a high-speed network. This configuration provides higher throughput and availability compared to conventional file systems. In this paper, we consider two specific issues, namely the distribution of data among the cluster (i.e. striping) an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stateful group communication services

    Publication Year: 1999, Page(s):82 - 89
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (104 KB)

    Reliable group multicasts provide a nice abstraction for communicating data reliably among group members and have been used for a variety of applications. In this paper we present Corona, a group communication service for building collaboration tools and reliable data dissemination services in Web-based environments, where clients connect independently of other clients and are not necessarily conn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static and dynamic mapping of media assets on a network of distributed multimedia information servers

    Publication Year: 1999, Page(s):253 - 260
    Cited by:  Papers (2)  |  Patents (33)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (116 KB)

    This paper presents principles and algorithms for the management of a network of media servers. Such a server network allows the online delivery of broadband multimedia data, e.g. audio and video streams, to a large number of widely distributed clients. Thus, the implementation of large scale distributed broadband media information services is possible if such networks can be handled efficiently. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective complexity reduction for optimal scheduling of distributed real-time applications

    Publication Year: 1999, Page(s):360 - 369
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (208 KB)

    The application of optimal search strategies to scheduling for distributed real-time systems is, in general, plagued by an inherent computational complexity. This has effectively prevented the integration of strategies such as branch-and-bound (B&B) in scheduling frameworks and tools used in practice today. To show that optimal scheduling is, in fact, a viable alternative for many real-time sc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • (h, k)-arbiters for h-out of-k mutual exclusion problem

    Publication Year: 1999, Page(s):216 - 223
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (148 KB)

    h-out of-k mutual exclusion is a generalization of 1-mutual exclusion problem, where there are k limits of shared resources and each process requests h(1⩽h⩽k) units at the same time. Though the k-arbiter has been shown to be a quorum-based solution to this problem, quorums in the k-arbiter are much larger than these in the 1-coterie for 1-mutual exclusion. Thus, the algorithm based on the ... View full abstract»

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

    Publication Year: 1999, Page(s):324 - 331
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (240 KB)

    We describe methods of identifying and exploiting sharing patterns in multi-threaded DSM applications. Active correlation tracking is used to determine the affinity, or amount of sharing, in pairs of threads. Thread affinities are combined to create correlation maps, which summarize sharing between all pairs of threads in the application. Correlation maps can be used in two ways. First, they can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PASS-a service for efficient large scale dissemination of time varying data using CORBA

    Publication Year: 1999, Page(s):496 - 506
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (132 KB)

    A common class of wide-area distributed applications remotely collect time-varying data and send it to consumers around the network. Some examples of these include network management, stock ticker data and event logs. The environment in which these applications must operate often dictates the schemes for disseminating the data between the writers and the readers. If the transport channel can be op... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient collective communication in distributed heterogeneous systems

    Publication Year: 1999, Page(s):15 - 24
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (168 KB)

    The Information Power Grid (IPG) is emerging as an infrastructure that will enable distributed applications-such as videoconferencing and distributed interactive simulation-to seamlessly integrate collections of heterogeneous workstations, multiprocessors, and mobile nodes over heterogeneous wide-area networks. This paper introduces a framework for developing efficient collective communication sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable processing of read-only transactions in broadcast push

    Publication Year: 1999, Page(s):432 - 439
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (132 KB)

    Recently, push-based delivery has attracted considerable attention as a means of disseminating information to large client populations in both wired and wireless settings. We address the problem of ensuring the consistency and currency of client read-only transactions in the presence of updates. To this end, additional control information is broadcast. A suite of methods is proposed that vary in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic object replication and migration protocol for an Internet hosting service

    Publication Year: 1999, Page(s):101 - 113
    Cited by:  Papers (30)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (248 KB)

    The paper proposes a protocol suite for dynamic replication and migration of Internet objects. It consists of an algorithm for deciding on the number and location of object replicas and an algorithm for distributing requests among currently available replicas. Our approach attempts to place replicas in the vicinity of a majority of requests, while ensuring at the same time that no servers are over... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design considerations for distributed caching on the Internet

    Publication Year: 1999, Page(s):273 - 284
    Cited by:  Papers (34)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (164 KB)

    We describe the design and implementation of an integrated architecture for cache systems that scale to hundreds or thousands of caches with thousands to millions of users. Rather than simply try to maximize hit rates, we take an end-to-end approach to improving response time by also considering hit times and miss times. We begin by studying several Internet caches and workloads, and we derive thr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A property-based clustering approach for the CORBA Trading Service

    Publication Year: 1999, Page(s):517 - 525
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (248 KB)

    The CORBA Trading Service is an object service advertiser for heterogeneous distributed computing environments. Current approaches for the design and implementation of such a CORBA service do not deal with some of the major problems of searching for service offers in large-scale distributed systems, namely performance and scalability problems. This paper proposes an appropriate approach for cluste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Causally ordered multicast: the conservative approach

    Publication Year: 1999, Page(s):36 - 44
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (124 KB)

    Process group toolkits provide methods to structure a system as a set of groups of cooperating processes, to detect process failures, and to order events (by ordering messages). Such tools have a performance cost for applications, particularly when a system is built using a large number of overlapping groups. We built an event-driven simulation to study performance of causally ordered message deli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond the black box: event-based inter-process communication in process support systems

    Publication Year: 1999, Page(s):450 - 457
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (140 KB)

    We describe the concept and implementation of an inter-process communication facility based on the exchange of events between concurrently running processes. In contrast to previous approaches based on shared data stored in a common database, our approach has the advantage of being platform independent and providing straightforward support for distribution. In addition, we also explore the problem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing and hot spot relief for hash routing among a collection of proxy caches

    Publication Year: 1999, Page(s):536 - 543
    Cited by:  Papers (4)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (716 KB)

    Hash routing partitions the entire URL space among a collection of cooperating proxy caches. Each partition is assigned to a cache server. Duplication of cache contents is eliminated. Client requests to a cache server for non-assigned partition objects are forwarded to proper sibling caches. As a result, the load level of the cache servers can be quite unbalanced. We examine an adaptable controlle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Progressive construction of consistent global checkpoints

    Publication Year: 1999, Page(s):55 - 62
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (152 KB)

    A checkpoint pattern is an abstraction of the computation performed by a distributed application. A progressive view of this abstraction is formed by a sequence of consistent global checkpoints that may have occurred in this order during the execution of the application. Considering pairs of checkpoints, we have determined that a checkpoint must be observed before another in a progressive view if ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Swarm scalable storage system

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

    Swarm is a storage system that provides scalable, reliable, and cost-effective data storage. Swarm is based on storage servers, rather than file servers; the storage servers are optimized for cost-performance and aggregated to provide high-performance data access. Swarm uses a striped log abstraction to store data on the storage servers. This abstraction simplifies storage allocation, improves fil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NAP: practical fault-tolerance for itinerant computations

    Publication Year: 1999, Page(s):180 - 189
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (288 KB)

    One use of mobile agents is support for itinerant computation (D. Chess et al., 1995). An itinerant computation is a program that moves from host to host in a network. Which hosts the program visits is determined by the program. The program can have a pre-defined itinerary or can dynamically compute the next host to visit as it visits each successive host; it can visit the same host repeatedly or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Run-time detection in parallel and distributed systems: application to safety-critical systems

    Publication Year: 1999, Page(s):163 - 170
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (100 KB)

    There is growing interest in run-time detection as parallel and distributed systems grow larger and more complex. This work targets run-time analysis of complex, interactive scientific applications for purposes of attaining scalability improvements with respect to the amount and complexity of the data transmitted, transformed, and shared among different application components. Such improvements ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerant video on demand services

    Publication Year: 1999, Page(s):244 - 252
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (172 KB)

    This paper describes a highly available distributed video on demand (VoD) service which is inherently fault tolerant. The VoD service is provided by multiple servers that reside at different sites. New servers may be brought up “on the fly” to alleviate the load on other servers. When a server crashes it is replaced by another server in a transparent way; the clients are unaware of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Imprecise calendars: an approach to scheduling computational grids

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

    We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources between different clusters of computers that are part of a computational grid. In addition, they can be used to provide specific time reservations for applications. We describe the algorithms and policies for manipulation of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed deadlock detection and resolution based on hardware clocks

    Publication Year: 1999, Page(s):208 - 215
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (124 KB)

    Inexpensive but accurate hardware clocks are now commonplace on many systems. A clock synchronization protocol can keep the collection of clocks for a group of networked systems roughly synchronized without the expenditure of a great deal of processor time or network bandwidth. As long as the bounded skew between clocks is taken into account, rough real time can provide an intuitive and valuable m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Search space reduction in QoS routing

    Publication Year: 1999, Page(s):142 - 149
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (280 KB)

    To provide real time service, integrated networks require the underlying routing algorithm to be able to find low cost paths that satisfy given Quality of Service (QoS) constraints. The problem of constrained shortest (least cost) path routing is known to be NP hard, and some heuristics have been proposed to find a near optimal solution. However, these heuristics either impose relationships among ... View full abstract»

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