By Topic

Distributed Computing Systems, 1998. Proceedings. 18th International Conference on

Date 29-29 May 1998

Filter Results

Displaying Results 1 - 25 of 70
  • Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)

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

    Publication Year: 1998, Page(s):630 - 631
    Request permission for commercial reuse | PDF file iconPDF (229 KB)
    Freely Available from IEEE
  • A protocol for removing communication intrusion in monitored distributed systems

    Publication Year: 1998, Page(s):120 - 129
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    The development of a distributed application that exhibits both desired functionality as well as performance is a complex task. Therefore, the construction of monitoring tools to assist in the development of complex distributed applications is of great practical significance. For example, monitoring tools can be used to observe the behavior and fine tune the performance. One of the fundamental pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Globally distributed computation over the Internet-the POPCORN project

    Publication Year: 1998, Page(s):592 - 601
    Cited by:  Papers (35)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1764 KB)

    The POPCORN project provides an infrastructure for globally distributed computation over the whole Internet. It provides any programmer connected to the Internet with a single huge virtual parallel computer composed of all processors on the Internet which care to participate at any given moment. The system provides a market-based mechanism of trade in CPU time to motivate processors to provide the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient ordered broadcasting in reliable CSMA/CD networks

    Publication Year: 1998, Page(s):112 - 119
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    Ordered broadcast is a communication paradigm which requires that all the nodes in the network receive a message, and that the nodes receive the different messages in the same order. Ordered broadcast is particularly useful for supporting fault tolerance in distributed systems. We present a protocol for ordered broadcasts in a CSMA/CD network that uses the high reliability and collision detection ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bandwidth-sensitive update scheduling method for Internet push

    Publication Year: 1998, Page(s):303 - 310
    Cited by:  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    We present the BUS (Bandwidth-sensitive Update Scheduling) method for WWW push proxies that actively sets different update schedules for various WWW push channels. Based on open protocols describing push objects, BUS optimizes the currency of the objects it delivers to the clients under the constraint of the available bandwidth. As a result, push traffic overflow is minimized with adequate gateway... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved lightpath (wavelength) routing in large WDM networks

    Publication Year: 1998, Page(s):516 - 523
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpath is a fully optical transmission path, while a semilightpath is a transmission path constructed by chaining several lightpaths together, using wavelength conversion at their junctions. The problem thus is to find an opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal channel allocation for data dissemination in mobile computing environments

    Publication Year: 1998, Page(s):480 - 487
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    We discuss the wireless channel allocation problem for data dissemination in mobile computing systems. Methods for accessing data through broadcast and on-demand channels are described. We provide analytical models and cost formulae for the exclusive broadcast channels and the exclusive on-demand channels and propose a dynamic channel allocation algorithm for optimizing system performance. Our per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency conditions for multi-object distributed operations

    Publication Year: 1998, Page(s):582 - 589
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    The traditional distributed shared memory (DSM) model provides atomicity at levels of read and write on single objects. Therefore, multi-object operations such as double compare and swap, and atomic m-register assignment cannot be efficiently expressed in this model. We extend the traditional DSM model to allow operations to span multiple objects. We show that memory consistency conditions such as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward transparent selective sequential consistency in distributed shared memory systems

    Publication Year: 1998, Page(s):572 - 581
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    This paper proposes a transparent selective sequential consistency approach to distributed shared memory (DSM) systems. First, three basic techniques-time selection, processor selection, and data selection-are analyzed for improving the performance of strictly sequential consistency DSM systems, and a transparent approach to achieving these selections is proposed. Then, this paper focuses on the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adapting to bandwidth variations in wide-area data combination

    Publication Year: 1998, Page(s):498 - 505
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    Efficient data combination over wide area networks is hard as these networks have large variations in available bandwidth. We examine the utility of changing the location of combination operations as a technique to adapt to variations in network bandwidth. We try to answer the following questions. First, does relocation of operators provide a significant performance improvement? Second, is online ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A statistical method for time synchronization of computer clocks with precisely frequency-synchronized oscillators

    Publication Year: 1998, Page(s):32 - 39
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    With the growing of computer networks, continuous media communication and processing are expected in distributed systems. Continuous media communication and processing require both time and frequency synchronization between computer clocks. The authors propose a statistical time synchronization method for computer clocks that have precisely frequency-synchronized oscillators. This method not only ... View full abstract»

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

    Publication Year: 1998, Page(s):202 - 209
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    Heartbeat protocols are used by distributed programs to ensure that if a process in a program terminates or fails, then the remaining processes in the program terminate. We present a class of heartbeat protocols that tolerate message loss. In these protocols, a root process periodically sends a beat message to every other process then waits to receive a reply beat message from every other process.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CLIQUES: a new approach to group key agreement

    Publication Year: 1998, Page(s):380 - 387
    Cited by:  Papers (55)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    The paper considers the problem of key agreement in a group setting with highly dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the well known Diffie-Hellman key agreement method to support dynamic group operations. Constituent protocols are provably secure and efficient View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-stabilization with global rooted synchronizers

    Publication Year: 1998, Page(s):102 - 109
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    We propose a self-stabilizing synchronization technique, called the global rooted synchronization, that synchronizes processors in a tree network. This synchronizer converts a synchronous protocol for tree networks into a self-stabilizing version. The synchronizer requires only O(1) memory (other than the memory needed to maintain the tree) at each node regardless of the size of the network, stabi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load balancing in geographically distributed heterogeneous Web servers

    Publication Year: 1998, Page(s):295 - 302
    Cited by:  Papers (23)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    With ever increasing Web traffic, a distributed multi server Web site can provide scalability and flexibility to cope with growing client demands. Load balancing algorithms to spread the requests across multiple Web servers are crucial to achieve the scalability. Various domain name server (DNS) based schedulers have been proposed in the literature, mainly for multiple homogeneous servers. The pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Khazana: an infrastructure for building distributed services

    Publication Year: 1998, Page(s):562 - 571
    Cited by:  Papers (8)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    Essentially all distributed systems, applications, and services at some level boil down to the problem of managing distributed shared state. Unfortunately, while the problem of managing distributed shared state is shared by many applications, there is no common means of managing the data-every application devises its own solution. We have developed Khazana, a distributed service exporting the abst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signalling adaptors between distributed systems and telecommunication networks

    Publication Year: 1998, Page(s):138 - 145
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    Conventional telecommunication software components are mainly developed using message passing as the underlying communication mechanisms. Recent standards on modern distributed systems, exemplified by CORBA and DCE, however, have converged to a new programming paradigm based on the client/server architecture, object-oriented model, and remote procedure calls (RPCs). In the near future, we envision... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed predicate detection in a faulty environment

    Publication Year: 1998, Page(s):416 - 423
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    There has been very little research in distributed predicate detection for faulty, asynchronous environments. We define a class of predicates called set decreasing predicates which can be detected in such an environment. We introduce a set of failure detectors called infinitely often accurate detectors which are implementable in asynchronous systems. Based on these failure detectors we present an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detectors and correctors: a theory of fault-tolerance components

    Publication Year: 1998, Page(s):436 - 443
    Cited by:  Papers (19)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    Two primitive components, namely detectors and correctors, provide a basis for achieving the different types of fault tolerance properties required in computing systems. We develop the theory of these primitive tolerance components, characterizing precisely their role in achieving the different types of fault tolerance. Also, we illustrate how they can be used to formulate extant design methods an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coordinated exception handling in distributed object systems: from model to system implementation

    Publication Year: 1998, Page(s):12 - 21
    Cited by:  Papers (6)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    Exception handling in concurrent and distributed programs is a difficult task though it is often necessary. In many cases traditional exception mechanisms for sequential programs are no longer appropriate. One major difficulty is that the process of handling an exception may need to involve multiple concurrent components that are cooperating in pursuit of some global goal. Another complication is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable scheduling algorithm for real-time distributed systems

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

    Scheduling real time tasks in a distributed memory multiprocessor is characterized as sequencing a set of tasks and assigning them to processors of the architecture. Real time systems research has extensively investigated the sequencing dimension of the scheduling problem by extending uniprocessor scheduling techniques to more complex architectures. We introduce a technique that uses an assignment... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for consistent, replicated Web objects

    Publication Year: 1998, Page(s):276 - 284
    Cited by:  Papers (9)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Despite the extensive use of caching techniques, the Web is overloaded. While the caching techniques currently used help some, it would be better to use different caching and replication strategies for different Web pages, depending on their characteristics. We propose a framework in which such strategies can be devised independently per Web document. A Web document is constructed as a worldwide, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HADES: a middleware support for distributed safety-critical real-time applications

    Publication Year: 1998, Page(s):344 - 351
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    Most distributed safety critical real time systems designed in the past have been specialized to meet the particular requirements of the application domain to which they were targeted. This approach led to specific, inflexible, dedicated and non reusable solutions, often based on specialized hardware. The paper presents an overview of HADES, which provides a set of flexible tools built on top of o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timestamps for programs using messages and shared variables

    Publication Year: 1998, Page(s):266 - 273
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    Algorithms for vector timestamps have been developed to determine the “happened before” relations between events of an execution of a message passing program. Many message passing programs contain variables shared by multiple processes (including threads). Such programs need to have vector timestamps for send, receive, read and write events. We define two “happened-before” ... View full abstract»

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