Proceedings of 17th International Conference on Distributed Computing Systems

27-30 May 1997

Filter Results

Displaying Results 1 - 25 of 69
  • Proceedings of 17th International Conference on Distributed Computing Systems

    Publication Year: 1997
    Request permission for commercial reuse | |PDF file iconPDF (714 KB)
    Freely Available from IEEE
  • Index Of Authors, Speakers, Moderators And Chairs

    Publication Year: 1997, Page(s):594 - 596
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (153 KB)

    Presents an index of the authors whose papers are published in the conference. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Client/server qualities: a basis for reliable distributed workflow management systems

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

    In distributed workflow management systems (WfMSs) many workflow servers and application programs referenced within workflows have to work together cooperatively. We introduce a middleware service for WfMSs which offers qualities for client/server communication. These qualities characterize the behavior of clients and servers in case of failure and recovery. Our middleware service builds an abstra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed data mining of probabilistic knowledge

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

    We present a distributed approach to data mining of a knowledge representation scheme known as Bayesian belief networks which are capable of dealing with uncertain knowledge. We make use of a machine learning paradigm and a distributed asynchronous search technique to achieve the task of distributed knowledge discovery from data. Our approach boasts a number of features, including dynamic load bal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extensible resource management for cluster computing

    Publication Year: 1997, Page(s):561 - 568
    Cited by:  Papers (8)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (732 KB)

    Advanced general purpose parallel systems should be able to support diverse applications with different resource requirements without compromising effectiveness and efficiency. We present a resource management model for cluster computing that allows multiple scheduling policies to co-exist dynamically. In particular, we have built Octopus, an extensible and distributed hierarchical scheduler that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load profiling: a methodology for scheduling real-time tasks in a distributed system

    Publication Year: 1997, Page(s):449 - 456
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (856 KB)

    Traditionally, the goal of load management protocols for distributed systems has been to ensure that nodes are equally loaded. We show that for real time systems, load balancing is not desirable since it results in the available bandwidth being distributed equally amongst all nodes-in effect making all nodes in the system capable of offering almost the same bandwidth (e.g., in cycles per second) t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of an RSVP-based quality of service architecture for integrated services Internet

    Publication Year: 1997, Page(s):543 - 551
    Cited by:  Papers (5)  |  Patents (35)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1068 KB)

    The paper presents the design and implementation of a quality of service architecture for the Internet. The architecture is based on the emerging standards for resource reservation in the Internet, namely the RSVP protocol and the associated service specifications defined by the Internet Engineering Task Force. Our architecture represents a major functional enhancement to the traditional sockets b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling algorithms for distributed Web servers

    Publication Year: 1997, Page(s):169 - 176
    Cited by:  Papers (19)  |  Patents (32)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (752 KB)

    A distributed Web system, consisting of multiple servers for data retrieval and a Domain Name Server (DNS) for address resolution, can provide the scalability necessary to keep up with growing client demand at popular sites. However, balancing the requests among these atypical distributed servers opens interesting new challenges. Unlike traditional distributed systems in which a centralized schedu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building trust for distributed commerce transactions

    Publication Year: 1997, Page(s):322 - 329
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (892 KB)

    The explosive growth of the Internet exposes unprecedented commercial opportunities over the network. The vast computer networks easily bring together customers and vendors who are physically distributed in different continents. Current research in electronic commerce mainly focuses on payment mechanisms. However, the global presence of customers and vendors makes it difficult to build trust among... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An open architecture for secure interworking services

    Publication Year: 1997, Page(s):315 - 321
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (808 KB)

    There is a developing need for applications and distributed services to cooperate or interoperate. The article describes an architectural approach to security. The key idea is that a process is the universal client entity; a process may act on behalf of an identified individual as in traditional security schemes. More generally, a process may adopt an application specific name or role, and this is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining the expected load of dynamic tree embeddings in hypercubes

    Publication Year: 1997, Page(s):508 - 515
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (812 KB)

    The main contribution to use recurrence relations in analyzing the performance of a dynamic tree embedding algorithm in hypercubes. These recurrence relations characterize the expected load on each processor in a randomized tree embedding, and enable us to evaluate expected loads numerically and analytically. As a matter of fact, our methodology does not depend on the hypercube topology, and can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fragment reconstruction: providing global cache coherence in a transactional storage system

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

    Cooperative caching is a promising technique to avoid the increasingly formidable disk bottleneck problem in distributed storage systems; it reduces the number of disk accesses by servicing client cache misses from the caches of other clients. However, existing cooperative caching techniques do not provide adequate support for fine grained sharing. We describe a new storage system architecture, sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimistic quality-of-service provisioning scheme for cellular networks

    Publication Year: 1997, Page(s):536 - 542
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (676 KB)

    We propose an optimistic quality-of-service (QoS) provisioning scheme for multimedia traffic in wireless networks. The scheme uses the standard classification of network traffic into two priority classes based on their bandwidth requirement and delay tolerance. We classify the users as local or departing based on their current coordinates in the cell. A call admission algorithm, a call management ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-threading and remote latency in software DSMs

    Publication Year: 1997, Page(s):296 - 304
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1084 KB)

    This paper evaluates the use of per-node multi-threading to hide remote memory and synchronization latencies in a software DSM. As with hardware systems, multi-threading in software systems can be used to reduce the costs of remote requests by switching threads when the current thread blocks. We added multi-threading to the CVM software DSM and evaluated its impact on performance for a suite of co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable support for a persistent distributed shared memory

    Publication Year: 1997, Page(s):68 - 77
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (916 KB)

    This paper describes a reliable distributed storage server used to back segments located in a distributed virtual shared memory (DVSM). It focuses on the design of a generic logging support and gives hints about its implementation. The prototype developed within the AIX system is evaluated and exhibits good results. Using these results, some evolutions are proposed to improve performance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reflective model for mobile software objects

    Publication Year: 1997, Page(s):339 - 346
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (860 KB)

    Mobile software objects are autonomous computational entities that travel in large-scale and widely-distributed heterogeneous systems, and whose functionality can be attached to diverse computing environments. An object model that supports mobile objects should have special characteristics such as mutability of object's structure and semantics to facilitate adjustment to different environments, se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed detection of generalized deadlocks

    Publication Year: 1997, Page(s):553 - 560
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (728 KB)

    Fast and efficient detection of deadlocks remains an important problem in distributed operating systems. We present a distributed algorithm to detect generalized deadlocks in distributed systems. The algorithm performs reduction of a distributed wait-for-graph (WFG) to determine a deadlock. If sufficient information to decide the reducibility of a node is not available at that node, the algorithm ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of message ordering specifications and protocols

    Publication Year: 1997, Page(s):492 - 499
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (704 KB)

    We study the problem of determining which message ordering specifications can be implemented in a distributed system. Further, if a specification can be implemented, we give a technique to determine whether it can be implemented by tagging information with user messages or if it requires control messages. To specify the message ordering, we use a novel method called forbidden predicates. All exist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of virtual circuit rerouting on application performance

    Publication Year: 1997, Page(s):374 - 383
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (988 KB)

    One of the key problems in extending ATM protocols to support host mobility is designing virtual circuit rerouting protocols to maintain continual network connectivity to a mobile host. Ideally, VC rerouting must be done fast enough so as to cause minimal disruption to applications, running on mobile hosts. In this paper, we evaluate the impact of several virtual circuit rerouting strategies on ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comprehensive distributed garbage collection by tracking causal dependencies of relevant mutator events

    Publication Year: 1997, Page(s):516 - 525
    Cited by:  Papers (1)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (900 KB)

    Comprehensive distributed garbage collection in object-oriented distributed systems has mostly been addressed via distributed versions of graph-tracing algorithms, a legacy of centralised garbage collection techniques. Two features jeopardise the scalability of these approaches: the bottleneck associated with having to reach a global consensus before any resource can actually be reclaimed; and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed recovery with K-optimistic logging

    Publication Year: 1997, Page(s):60 - 67
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (804 KB)

    Fault-tolerance techniques based on checkpointing and message logging have been increasingly used in real-world applications to reduce service downtime. Most industrial applications have chosen pessimistic logging because it allows fast and localized recovery. The price that they must pay, however, is the higher failure-free overhead. In this paper, we introduce the concept of K-optimistic logging... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical, adaptive cache consistency in a page server OODBMS

    Publication Year: 1997, Page(s):22 - 31
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1092 KB)

    Due to its simplicity and communication efficiency many client-server object-oriented database systems are based on the basic page server architecture-pages serve as their smallest unit of data transfer, client caching, and concurrency control. In an earlier paper, we showed how to extend this architecture to permit object-level callback locking, and we showed through simulations that significant ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load management in distributed video servers

    Publication Year: 1997, Page(s):528 - 535
    Cited by:  Papers (40)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (732 KB)

    We define and formulate various policies for load management in distributed video servers. We propose a predictive placement policy that determines the degree of replication necessary for popular videos using a cost based optimization procedure based on a priori predictions of expected subscriber requests. For scheduling requests, we propose an adaptive scheduling policy that compares the relative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic probe strategy for quorum systems

    Publication Year: 1997, Page(s):95 - 99
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (388 KB)

    A quorum system is a collection of sets called quorums. Any two quorums in a quorum system must have at least one element in common. Quorum systems can be used for many different applications in a distributed system. A quorum system is available, if all elements in at least one quorum ore operational. The elements are probed to determine if they are available. A probe strategy is used to determine... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layered analytic performance modelling of a distributed database system

    Publication Year: 1997, Page(s):482 - 490
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (812 KB)

    Very few analytic models have been reported for distributed database systems, perhaps because of complex relationships of the different kinds of resources in them. Layered queueing models seem to be a natural framework for these systems, capable of modelling all the different features which are important for performance (e.g. devices, communications, multithreaded processes, locking). To demonstra... View full abstract»

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