By Topic

Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)

4-7 July 2000

Filter Results

Displaying Results 1 - 25 of 67
  • Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)

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

    Publication Year: 2000, Page(s):553 - 554
    Request permission for commercial reuse | PDF file iconPDF (112 KB)
    Freely Available from IEEE
  • An algorithm for distributed hierarchical diagnosis of dynamic fault and repair events

    Publication Year: 2000, Page(s):299 - 306
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The components of a fault-tolerant distributed system must be capable to accurately determine which components of the system are faulty and which are fault-free. In this paper, we present a new distributed algorithm for event diagnosis in fully-connected networks. An event is defined as a faulty node becoming fault-free, or vice versa. Previous hierarchical algorithms considered a static fault sit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reaching fault diagnosis agreement on dual link failure mode

    Publication Year: 2000, Page(s):291 - 298
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Previously, most Byzantine Agreement protocols could reach an agreement by way of fault masking. Few of them can detect and locate the faulty components. On the other hand, most fault diagnosis algorithms can detect and locate faulty components but few of them can make all fault free processors reach an agreement. The study analyses the messages received at the period of reaching agreement, and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing cognitive overheads in a Web warehouse using reverse-osmosis

    Publication Year: 2000, Page(s):171 - 178
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    This paper provides a quantitative analysis of reducing cognitive overheads in a Web warehouse using an important class of operation called reverse osmosis. The analysis is used to examine two different cognitive overheads of locating relevant nodes or information and display time of a Web table. A reverse-osmosis operation enables us to eliminate in relevant information from a collection of Web d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of k-ary n-cubes with fully adaptive routing

    Publication Year: 2000, Page(s):249 - 255
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    Several analytical models of deterministic routing in wormhole-routed k-ary n-cubes have already been reported in the literature. The performance characteristics of most fully-adaptive routing algorithms have often been analyzed by means of simulation and there is hardly any analytical model proposed for calculating message latency in wormhole-routed k-ary n-cubes using adaptive routing. The paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient strategy to support continuous retrieval with dynamic bandwidths

    Publication Year: 2000, Page(s):47 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    To efficiently support continuous retrieval for continuous media, many approaches based on the striping strategy that is implemented on a multi-disk drive have been proposed. However, the striping strategy only considers the fixed bandwidth of an object. Moreover, the aggregate bandwidth of the multi-disk drive is determined when the object is striped. Furthermore, for some applications, such as s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pilgrim performance over a new CAliF communication layer

    Publication Year: 2000, Page(s):203 - 209
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Previously, we defined CAliF (Cooperative Application Framework): a platform for cooperative work applications. First, the lower CAliF layers have been developed separately: the interprocess communication layer CAliFCom and the shared memory layer where the Pilgrim, a new consistency protocol, is implemented. The authors show the qualities of CaliFCom, and study Pilgrim performance over this inter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circumventing/identifying faults effects

    Publication Year: 2000, Page(s):283 - 290
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The literature includes a variety of techniques to address the Byzantine Generals Problem or the Byzantine approach. While the main goal within the Byzantine framework is to circumvent and mask the effect of unreliable units (e.g., traitors), much research has been done on identifying (i.e., demasking) unreliable units. This is often called fault identification in system diagnosis. The paper focus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Estelle-based probabilistic partial timed protocol verification system

    Publication Year: 2000, Page(s):83 - 90
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Complete verification of communication protocols is usually very hard to achieve due to the combinatorial state space explosion problem. Probability based partial verification provides an alternative solution to solve this problem. We adopt a Timed Communicating State Machine (TCSM), which belongs to the Extended Communicating Finite State Machine (ECFSM) model, to formally specify protocols that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient query result retrieval over the Web

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

    Consider a geographic information system (GIS) which is set up as a Web server that allows users to query the database with a Web browser. As the query result may be huge and the network delay could be significant, we investigate the fundamental problem of how to deliver the query result efficiently over the network . In a conventional client-server database system, the commonly used application p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • eBroker: an agent-based query routing system for distributed E-commerce databases

    Publication Year: 2000, Page(s):517 - 522
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    With the rapid increase in the number of E-commerce Web sites, Internet users are now able to purchase items from the Web. Nevertheless, the large number of E-commerce Web sites also brings about the problem of identifying sites that sell the desired products wanted by a potential buyer. To avoid broadcasting the same queries on products to large set of databases maintained at different E-commerce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Does multicast communication make sense in write invalidation traffic?

    Publication Year: 2000, Page(s):221 - 228
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    In distributed shared memory (DSM) multiprocessors, a write operation requires multiple messages to invalidate the nodes which share and cache the memory block to be written. The resulting write stall time is a performance hurdle to such systems. One approach to efficient invalidation is to use multicast messages to reach the sharing nodes. We use application driven simulation to evaluate two mult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing with multiple token policy

    Publication Year: 2000, Page(s):99 - 107
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    In distributed systems, uneven arrivals of tasks may overload a few hosts, whereas some of the hosts are lightly loaded. This load imbalance prevents a distributed system from delivering performance to its capacity. Load balancing has been advocated as a means of improving the performance and reliability of distributed systems. A new load balancing approach has been proposed by the authors (1998) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Java 2 distributed object models performance analysis, comparison and optimization

    Publication Year: 2000, Page(s):239 - 246
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    The paper focuses on the performance analysis, comparison and optimization of the most important distributed object models for Java: RMI (Remote Method Invocation) and RMI-IIOP (Remote Method Invocation over Internet Inter-ORB Protocol). The paper presents the following contributions to the research on distributed object performance. First, a detailed performance analysis of both models is provide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Management of environments in 2K

    Publication Year: 2000, Page(s):479 - 485
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Computer users are increasingly multi-device equipped and no longer sedentary. It is desirable that the execution environment in any of these devices be customized to the user preferences and to the device characteristics. This paper describes a framework for managing execution environments in 2K, an adaptable, distributed, network-centric, user- and application-oriented operating system aimed at ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A synchronization and flow control scheme for interactive multimedia-on demand (MOD) systems

    Publication Year: 2000, Page(s):39 - 46
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Synchronization control with VCR-like user interactions in the multi-stream environment is very complicated and difficult. The main reasons are that: (i) those media units stored in the client buffers and flowing in the networks may be either useful or useless when the user interaction is issued, and (ii) the servers' media transmission should be adjusted according to the presentation status of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multimedia real-time disk scheduling by hybrid local/global seek-optimizing approaches

    Publication Year: 2000, Page(s):323 - 330
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    Real-time disk scheduling is one of the most important problems in designing a multimedia system. It has been proved to be NP-complete. Recently, various approaches have been proposed to improve disk throughput under guaranteed real-time requirements. SCAN-EDF, which scans the disk surface to retrieve the task data block under the disk head in order to re-schedule tasks in a real-time EDF (earlies... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing cache conflicts by multi-level cache partitioning and array elements mapping

    Publication Year: 2000, Page(s):195 - 202
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The paper presents an algorithm to reduce cache conflicts and improve cache localities. The proposed algorithm analyzes unique locality reference space for each reference pattern, partitions the multi-level cache into several parts with different size, and then maps array data onto the scheduled cache positions such that cache conflicts can be eliminated. To reduce the memory overhead for mapping ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recover-x: an adaptive router with limited escape channels

    Publication Year: 2000, Page(s):272 - 279
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    In order to improve network performance, a variety of adaptive routing algorithms have been proposed. Recent research focuses on their implementation costs, as well as the performance to enhance their practical applications. The paper proposes the Recover-x adaptive router, which limits escape message candidate in a blocked or deadlocked configuration. This limitation simplifies the routing logic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed solution for resources allocation to overlapping groups

    Publication Year: 2000, Page(s):73 - 80
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    The distributed resource allocation problem is a well known fundamental problem in distributed systems. Many solutions which avoid the deadlock and starvation have been developed. With the progress of computer networks, however, distributed cooperative group activities in a network environment have been increasing, so that several groups may compete for some resources in the network environment an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic window-based traffic-smoothing for optimal delivery of online VBR media streams

    Publication Year: 2000, Page(s):127 - 134
    Cited by:  Papers (1)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Traffic-smoothing for delivery of online VBR media is one of the most important problems when designing streaming multimedia applications. Given the available client buffer b and playback delay D, Rexford et al. (1997) introduced a window-based approach called SLWIN(k) to smooth online generated traffic for the pre-specified window size W (W<D) and sliding distance k (k⩽W). The required tim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal modeling and analysis of atomic commitment protocols

    Publication Year: 2000, Page(s):151 - 158
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The formal specification and mechanical verification of an atomic commitment protocol (ACP) for distributed real-time and fault-tolerant databases is presented. As an example, the non-blocking ACP of Babaoglu and Toueg (1993) is analyzed. An error in their termination protocol for recovered participants has been detected. We propose a new termination protocol which has been proved correct formally... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Electoral voting protocol-a quorum-based approach for replica control

    Publication Year: 2000, Page(s):463 - 469
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    Data replication is an important technique in distributed systems. Most replication techniques are quorum-based. These approaches employ logical structures or mathematical methods to solve the consistent problem of data replication. They have some improvements in getting smaller quorum size, higher availability, and better load balancing. However, most of them may have the following disadvantages:... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic multicast routing in advance resource reservation environment

    Publication Year: 2000, Page(s):547 - 552
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    Since network resources are usually limited, the ability to carry out resource reservation in advance, as well as efficient dynamic multicasting when destination nodes can join and leave the group during the communication period, are essential in all distributed multi-party applications. Total or partial re-routing of a multicast tree for dynamic multicast groups can optimize the tree cost to some... View full abstract»

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