By Topic

Distributed Computing Systems, 1997., Proceedings of the 17th International Conference on

Date 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.
  • 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.
  • Concurrency control and view notification algorithms for collaborative replicated objects

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

    This paper describes algorithms for implementing a high-level programming model for synchronous distributed groupware applications. In this model, several application data objects may be atomically updated, and these objects automatically maintain consistency with their replicas using an optimistic algorithm. Changes to these objects may be optimistically or pessimistically observed by view object... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Race analysis of traces of asynchronous message-passing programs

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

    An execution of a message-passing program is nondeterministic if message races exist. In this paper, a formal definition of a message race for asynchronous communication is presented. The trace of an execution of a message-passing program is a sequence of send and receive events. For a receive event r in a trace T, its race set is the set of messages in T that have a race with the message received... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed connection management for real-time communication over wormhole-routed networks

    Publication Year: 1997, Page(s):209 - 216
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    Wormhole networks provide a very-high-speed communication medium that is well suited for a large number of bandwidth demanding applications. Unfortunately, the lack of buffering in the switches causes blocked packets to transiently monopolize arbitrary large portions of the network, thus making it difficult to give real-time guarantees when connections contend for communication links. We present a... 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.
  • A framework for environment aware mobile applications

    Publication Year: 1997, Page(s):384 - 391
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    In mobile computing, factors such as add-on hardware components and heterogeneous networks result in an environment of changing resource constraints. An application in such a constrained environment must react to these changes so that available resources are properly utilized. In this paper, we propose a framework to build environment aware applications. The architecture is based on an event deliv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An architecture for post-development configuration management in a wide-area network

    Publication Year: 1997, Page(s):269 - 278
    Cited by:  Papers (10)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB)

    Few tools exist to address the post-development activities of configuring, releasing, installing, updating, reconfiguring, and even de-installing a software system. Certainly there is no unified approach for all of these activities, and none that can take full advantage of a wide-area network. The Software Dock represents an architecture for supporting post-development activities in such a setting... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting dynamic space-sharing on clusters of non-dedicated workstations

    Publication Year: 1997, Page(s):149 - 158
    Cited by:  Papers (4)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB)

    Clusters of workstations are increasingly being viewed as a cost effective alternative to parallel supercomputers. However, resource management and scheduling on workstations clusters is complicated by the fact that the number of idle workstations available for executing parallel applications is constantly fluctuating. We present a case for scheduling parallel applications on non dedicated worksta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connection admission control for hard real-time communication in ATM networks

    Publication Year: 1997, Page(s):217 - 224
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Connection Admission Control (CAC) as needed in ATM networks to provide Quality of Service (QoS) guarantees real-time connections. In this paper, we present a CAC scheme based on (1) a bit-stream traffic model to describe traffic generation patterns of CBR/VBR connections and traffic distortions within a network, and (2) worst-case queueing analysis to obtain hard cell queueing delay bounds. The p... 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.
  • Layered analytic performance modelling of a distributed database system

    Publication Year: 1997, Page(s):482 - 490
    Cited by:  Papers (4)
    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.
  • Building trust for distributed commerce transactions

    Publication Year: 1997, Page(s):322 - 329
    Cited by:  Papers (8)  |  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.
  • 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 (34)
    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.
  • Efficient load balancing in interconnected LANs using group communication

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

    The paper investigates the use of group communication to improve the efficiency of load balancing in interconnected LANs. Conventional load balancing techniques usually assume point-to-point connections among the computers and typically work on a single LAN only. This may waste network bandwidth and lengthen the load balancing time in LANs that support group communication such as the Ethernet. To ... View full abstract»

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

    Publication Year: 1997, Page(s):355 - 362
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    This paper describes a technique to effectively isolate mobile objects or processes that execute downloaded, potentially suspicious programs. It relies on wish lists, trust lists and capability lists. Wish lists are carried along with programs or mobile objects and denote the resources requested by the program to do what it claims to do. Wish lists are transformed into capability lists when downlo... 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 (8)  |  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.
  • The Sage project: a new approach to software engineering for distributed applications

    Publication Year: 1997, Page(s):244 - 252
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    We describe the Sage project, a new approach to software engineering for (fault-tolerant) distributed applications. Sage uses the modal logic of knowledge and applies theoretical results detailing how processes learn facts about each other's state to derive the minimal communication graph for a wide range of coordination problems. The specification interface is controlled, yet expressive enough to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant object service on CORBA

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

    There are more and more COSS (Common Object Service Specifications) on CORBA (Common Object Request Broker Architecture) announced by the OMG (Object Management Group), but no common specification about fault-tolerance exists. We propose a “warm stand-by” replication approach. When an object (primary object) is invoked, it will invoke a secondary object, and the primary object will log... 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.
  • A quality of service based allocation and routing algorithm for distributed, heterogeneous real time systems

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

    An increasing number of applications execute over a set of computing and communication resources and have end-to-end quality of service (QoS) requirements. Given a system and an application with specific flow structure and QoS requirements, this paper describes an integrated QoS-based allocation and routing algorithm that determines which computing and communication resources to utilize for this a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting temporal and spatial constraints on distributed shared objects

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

    Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmability of such systems, by providing globally accessible `object' abstractions. Researchers have developed consistency protocols for replicated `memory' objects. These protocols are well... 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 (1)  |  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.
  • 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.