By Topic

Parallel and Distributed Systems, 1996. Proceedings., 1996 International Conference on

Date 3-6 June 1996

Filter Results

Displaying Results 1 - 25 of 71
  • Proceedings of 1996 International Conference on Parallel and Distributed Systems

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

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (112 KB)
    Freely Available from IEEE
  • Synchronization model for multimedia communication and presentation in distributed systems

    Publication Year: 1996, Page(s):122 - 128
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The integration of time dependent media in applications requires the synchronization of media streams. The problem of synchronization is more important if we consider multimedia data presented in distributed systems. The specification of synchronization is supported by the synchronization editor, the creation and the transport of synchronization objects are managed by the synchronization coordinat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic modification of a protocol specification based on changes of a service specification

    Publication Year: 1996, Page(s):129 - 134
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The problem of modifying an existing protocol specification of a communicating system in Labelled Transition System (LTS) based on changes of it's service specification in LTS is discussed. Two types of changes of a service specification are treated: addition of a behaviour expression to the service specification and deletion of some parts of the behaviour expression from the service specification... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed checkpointing based on influential messages

    Publication Year: 1996, Page(s):440 - 447
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    In distributed applications, a group of multiple objects are cooperated to achieve some objectives. The computation on the objects are based on the massage passing, i.e. remote procedure call. The objects may suffer from different kinds of faults. In the presence of the object faults, the states of the objects in the system have to be kept consistent. If some object o is faulty, o is rolled back t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some sparse time-relaxed broadcast communication networks

    Publication Year: 1996, Page(s):135 - 140
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Broadcasting is the process of information dissemination in communication networks (modelled as graphs) whereby a message originated at one vertex becomes known to all members under the constraints that each call requires one unit of time and at every step any member can call at most one of its neighbours. A broadcast graph on n vertices is a network in which message can be broadcast in minimum po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed connection manager interface for web services on IBM SP systems

    Publication Year: 1996, Page(s):2 - 9
    Cited by:  Papers (2)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    In essence, the World Wide Web is a worldwide string of computer databases using a common information retrieval architecture. With the increasing popularity of the World Wide Web, more and more functions have been added to retrieve not only documents written in HTML (Hypertext Markup Language), but also those in other forms through the Common Gateway Interface (CGI), by constructing HTML documents... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal deadlock resolution algorithm in multidatabase systems

    Publication Year: 1996, Page(s):516 - 521
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of victims for removing deadlocks. It makes use of network flow techniques, and runs in time O(n 3), where n is the number of the deadlocked global transactions. Furthermore, the proposed deadlock resolution algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution transparent MIB based on MSA (Management System Agent) model

    Publication Year: 1996, Page(s):478 - 485
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    OSI Management model defines only peer to peer communication process between a managing application (AP) and a managed AP. Thus, when more than one managed AP stores portions of Management Information Base (MIB) distributively, the managing AP needs a sophisticated distributed processing function. This paper proposes an agent, called Management System Agent (MSA) which provides location transparen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed fault detection in communication protocols using extended finite state machines

    Publication Year: 1996, Page(s):310 - 318
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Run-time fault detection in communication protocols is essential because of faults that occur in the form of coding defects, memory problems, and external disturbances. Finite State Machine models have been used in the past to detect and diagnose protocol faults. However, the fault coverage of these models is limited to vocabulary faults and sequencing faults. We present an Extended Finite State M... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive routing in k-ary n-cube multicomputers

    Publication Year: 1996, Page(s):404 - 411
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Wormhole routing makes the communication latency insensitive of the network diameter and reduces the buffer size of each router. It has been widely adopted in many new generation distributed memory multiprocessor systems (DMMPs). The concept of virtual system is invented for deadlock-free routing design. Using a great deal of virtual channels is quite expensive to be implemented in practice and is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended group communication algorithm for updating distributed programs

    Publication Year: 1996, Page(s):386 - 393
    Cited by:  Patents (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Large-scale distributed systems are not always stable because the environments and the user requirements are changeable. The author has discussed the receptive platform to make distributed systems flexible and reliable. In order to achieve the receptive platform, it is essential to discuss how to update the distributed programs. Since conventional updating methods require that multiple processes b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks

    Publication Year: 1996, Page(s):90 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The WK-recursive networks, which were originally proposed by Vecchia and Sanges, have suffered from the rigorous restriction on the number of nodes. Like the other incomplete networks, the incomplete WK-recursive networks have been proposed to relieve this restriction. In this paper, it is first shown that the structures of the incomplete WK-recursive networks are conveniently represented with mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Register renaming for x86 superscalar design

    Publication Year: 1996, Page(s):336 - 343
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Register renaming eliminates storage conflicts for registers to allow more instruction level parallelism. This idea requires nontrivial implementation, however, especially when registers are accessible with different fields and data lengths. As a result, not all bits in a register are to be updated upon a register write, and a register read may be data-dependent on multiple register writes. We pro... View full abstract»

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

    Publication Year: 1996, Page(s):292 - 299
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Griffin is a statically typed language designed specifically for the rapid prototyping of Ada software. In this paper we describe the Griffin language constructs for expressing concurrency. There are two salient innovations: (1) an extended select statement that provides greater flexibility in managing non-deterministic behavior and (2) the capability of a receiving thread to concurrently rendezvo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication protocol for group of distributed objects

    Publication Year: 1996, Page(s):370 - 377
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    In distributed applications, a group of multiple objects are cooperated. On receipt of request messages, the objects send back the responses. The kinds of group communication protocols discussed so far, support the reliable and ordered delivery of messages at the network level. Only messages to be ordered at the application level, not necessarily all messages, are required to be causally delivered... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Studies for realizing soft TCCS residing on top of Ethernet LAN

    Publication Year: 1996, Page(s):141 - 148
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    In this paper, the theoretical studies and solutions regarding problems for realizing Soft TCCS (Time Critical Communication System), residing on top of Ethernet LAN are presented. We analyze Ethernet LAN including its precise back off sequence to obtain throughput and delay characteristics in a light loaded circumstances. We also analyze the same performance characteristics effected by multi-moda... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes

    Publication Year: 1996, Page(s):98 - 105
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Set-to-set node-disjoint paths problem is that given two sets S={s 1,...,sk} and T={t1,...,tk} of nodes in a graph, find k node disjoint paths si→tji, where (j1,...,jk) is a permutation of (1,...,k). For general undirect graphs G(V,E), this problem is usually solved by applying flow techniques which take Poly(|V|) ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient fault protection of block gradient-based adaptive filters

    Publication Year: 1996, Page(s):359 - 366
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Adaptive FIR filters are important in modern digital signal processing applications, and many situations require significant computational power attainable only through multi-processor configurations. Various block processing techniques have been proposed as viable alternatives to the sequential implementations to achieve the high throughput rate and reduce the effect of finite word length. While ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors

    Publication Year: 1996, Page(s):230 - 237
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    In this paper, we propose a new class of interconnection networks, called swapped networks, for general-purpose parallel processing. Swapped networks not only generate a wide class of high-performance interconnection networks, but also generalize, and serve to unify, many proposed parallel architectures as well as their algorithms. We show that swapped networks can efficiently emulate hypercubes, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Double parity sparing for performance improvement in disk arrays

    Publication Year: 1996, Page(s):169 - 174
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    RAID level 5 disk arrays provide highly reliable, cost effective secondary storage with high performance for reads and large writes. Small writes, however, cause the degradation of their performance, since small writes need additional disk accesses to update parity data. There have been many studies to overcome this problem. In this paper, we propose a new technique, double parity sparing, which i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Allowing cycle-stealing direct memory access I/O concurrent with hard-real-time programs

    Publication Year: 1996, Page(s):422 - 429
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    Hard-real-time schedulability analysis is carried out based on the assumption that the worst-case execution time (WCET) of each task is known. Cycle-stealing Direct Memory Access (DMA) I/O steals bus cycles from an executing program and prolongs the execution time of the program. Because of the difficulty in bounding the interference on the executing program, cycle-stealing DMA I/O is often disabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Roll-forward error recovery in embedded real-time systems

    Publication Year: 1996, Page(s):414 - 421
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Roll-forward checkpointing schemes are developed in order to avoid rollback in the presence of independent faults and to increase the possibility that a task completes within a tight deadline. However, despite of the adoption of roll-forward recovery, these schemes are not necessarily appropriate for time-critical applications because interactions with the external environment and communications b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant routing strategy using routing capability in hypercube multicomputers

    Publication Year: 1996, Page(s):396 - 403
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    This paper addresses fault-tolerant routing which is concerned with finding feasible minimum paths in a faulty hypercube. The concept of routing capability, which is defined with respect to the entire spectrum of distance, is proposed to assist routing function. The amount of information that is useful for message routing is increased with our scheme. The proposed algorithm routes a message in an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast parallel chessboard distance transform algorithms

    Publication Year: 1996, Page(s):488 - 493
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    In this paper, based on the diagonal propagation approach, we first provide an O(N2) time sequential algorithm to compute the chessboard distance transform (CDT) of an N×N image, which is a DT using the chessboard distance metrics. Based on the proposed sequential algorithm, the CDT of a 2-D binary image array of size N×N can be computed in O (log N) time on the EREW PRAM mo... View full abstract»

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