By Topic

Distributed Computing Systems, 1999. Proceedings. 19th IEEE International Conference on

Date 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
  • 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.
  • Striping and buffer caching for software RAID file systems in workstation clusters

    Publication Year: 1999, Page(s):544 - 551
    Cited by:  Papers (5)  |  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.
  • 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.
  • Reducing message overhead in TMR systems

    Publication Year: 1999, Page(s):45 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    Traditional TMR protocols assume either single, reliable voters for each triple-modular redundant unit (TMRU) or triplicated voters (one for each processor) for each TMRU. In the first case a voter is a single point of failure for the system. In the second case, many physical messages must be sent across the communication network for each logical data item. We examine some protocols which attempt ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HiFi: a new monitoring architecture for distributed systems management

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

    With the increasing complexity of large scale distributed (LSD) systems, an efficient monitoring mechanism has become an essential service for improving the performance and reliability of such complex applications. The paper presents a scalable, dynamic, flexible and nonintrusive monitoring architecture for managing large scale distributed (LSD) systems. This architecture, which is referred to as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adapting distributed applications using extensible networks

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

    Active networks have been proposed to allow the dynamic extension of network behavior by downloading application-specific protocols (ASPs) into network routers. We demonstrate the feasibility of the use of ASPs in an active network for the adaptation of distributed software components. We have implemented three examples which show that ASPs can be used to easily extend distributed applications, an... 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 (5)  |  Patents (9)
    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.
  • 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.
  • Efficient kernel support of fine-grained protection domains for mobile code

    Publication Year: 1999, Page(s):64 - 73
    Cited by:  Papers (6)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    Mobile code is an emerging paradigm of distributed computing. It roams over a network, is linked with an application, and runs as a part of an application. In the case of Web browsers, it is commonplace to download a mobile code, called a plug-in, from a truly open network such as the Internet. Owing to the anonymity of an open network, the mobile code may be malicious; thus, it is important to pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and performance evaluation of a Java-based multicast browser tool

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

    This paper presents a case study in the use of reliable multicasting in Web-based multi-party applications. To carry out this study, we have designed and implemented WEBCLASS, a multicast browser tool written in Java. In WEBCLASS, all the actions of a “master” Web browser are mimicked on a set of client browsers. Monitoring of the master browser is performed by a set of threads, which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient multicast protocol for content-based publish-subscribe systems

    Publication Year: 1999, Page(s):262 - 272
    Cited by:  Papers (72)  |  Patents (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    The publish/subscribe (or pub/sub) paradigm is an increasingly popular model for interconnecting applications in a distributed environment. Many existing pubsystems are based on pre-defined subjects, and hence are able to exploit multicast technologies to provide scalability and availability. An emerging alternative to subject-based systems, known as content-based systems, allow information c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Possession System: middleware for adaptive multiuser applications in a mobile environment

    Publication Year: 1999, Page(s):198 - 205
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1636 KB)

    Describes the design and implementation of a middleware system named the Possession System. The system is designed based on the “possession model”, which provides users with a consistent view of application components, networked sensors and distributed devices by introducing two separate abstractions: “body” and “soul”. The Possession System realizes a simple fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Initial synchronization of TDMA communication in distributed real-time systems

    Publication Year: 1999, Page(s):370 - 379
    Cited by:  Papers (5)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    This paper discusses the startup phase of a TDMA protocol intended for safety-critical real-time systems using a broadcast bus. The protocol contains sender id in each message, and nodes send messages of equal size in a fixed order. A single channel media is used and data and synchronization information must therefore share the same channel. Synchronization is challenging, since clocks must be syn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interpreting stale load information

    Publication Year: 1999, Page(s):285 - 296
    Cited by:  Papers (9)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each request to the machine with the apparent lowest load can behave badly in such systems, yet this technique is common in practice. Other systems use round-robin or random selection algorithms that entirely ignore load informat... 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.
  • Effective complexity reduction for optimal scheduling of distributed real-time applications

    Publication Year: 1999, Page(s):360 - 369
    Cited by:  Papers (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.
  • 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.
  • ETE: a customizable approach to measuring end-to-end response times and their components in distributed systems

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

    Detecting and resolving performance problems in distributed systems often requires measurements of end-to-end (“finger tip to eyeball”) response times. Existing approaches embed transaction definitions in instrumentation codes. As a result, service providers (e.g., ISPs) cannot tailor transaction definitions to the usage patterns of their customers. We propose a new approach-ETE (end-t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uniform timing of a multi-cast service

    Publication Year: 1999, Page(s):478 - 486
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    Presents a new architecture for a clock synchronization protocol based on multi-cast communication. The protocol implements the gradual tuning of the clocks, in order to automatically compensate the systematic drift and increase the time between re-synchronizations. Hosts participating in the same service are grouped into a cohort: the protocol self-stabilizes into an optimal routine where all mem... 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.
  • Active correlation tracking

    Publication Year: 1999, Page(s):324 - 331
    Cited by:  Papers (7)  |  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.
  • Fast and fair mutual exclusion for shared memory systems

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

    Two fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented. The first one uses both compare&swap and fetch&store; the second uses only fetch&store. Fetch&store are more commonly available than compare&swap. It is impossible to obtain better algorithms if “time” is measured by counting remote memory references. We were ... View full abstract»

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

    Publication Year: 1999, Page(s):384 - 392
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    We present the design of an interface to allow applications to export tuning alternatives to a higher-level system. By exposing different parameters that can be changed at runtime, applications can be made to adapt to changes in their execution environment due to other programs, or the addition or deletion of nodes, communication links, etc. An integral part of this interface is that an applicatio... View full abstract»

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