Scheduled System Maintenance
On Tuesday, September 26, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Proceedings of 1996 International Conference on Parallel and Distributed Systems

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
  • A distributable algorithm for optimizing mesh partitions

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

    Much effort has been directed towards developing mesh partitioning strategies to distribute a finite element mesh among the processors of a distributed memory parallel computer. The distribution of the mesh requires a partitioning strategy. This partitioning strategy should be designed such that the computational load is balanced and the communication is minimized. Unfortunately, many of the exist... View full abstract»

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

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (112 KB)
    Freely Available from IEEE
  • Fault-tolerant distributed match-making with weights

    Publication Year: 1996, Page(s):530 - 536
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    Protocols to solve several distributed issues, such as name service, mutual exclusion, and creation of an atomic shared register, require two types of subsets with intersection property. Distributed match-making provides a method of creating the subsets, and the lower bound of the number of messages to solve the issues. This paper discusses the fault-tolerant and weighted case, in which a protocol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relaxed consistency requirements for replicated objects

    Publication Year: 1996, Page(s):522 - 527
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    Shared objects are usually replicated in a distributed environment for higher availability and fault tolerance. Coherent or strongly consistent implementation of replicated objects have been studied extensively in the literature. This paper concentrates on a general method for specifying and implementing replicated objects that only require weaker consistency conditions. The weakness of the object... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of MAP: A system for mobile assistant programming

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

    We have define a network programming model called Mobile Assistant Programming (MAP) for development and execution of communication applications in large scale networks of heterogeneous computers. MAP assistants are high-level interpreted programs that can move between nodes, create clones and report results. Their execution is asynchronous and persistent to take into account client disconnections... 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.
  • What features really make distributed minimum spanning tree algorithms efficient?

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

    Since Gallager, Humblet and Spira first introduced the distributed Minimum Spanning Tree problem, many authors have suggested ways to enhance their basic algorithm to improve its performance. Most of these improved algorithms have even been shown to be very efficient in terms of reducing their worst-case communications and/or time complexity measures. In this paper, however, we take a different ap... 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.
  • RDB structure chart display using fuzzy rules

    Publication Year: 1996, Page(s):510 - 515
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    With rapid spread of EUC (E_nd U_ser C_omputing), RDB (R_elational D¯ataB_ase) construction and retrieval using GUI (G_raphical U_ser I_nterface) have become a major part of information network users. Since main activity in the RDB construction is its structure design, it must be done efficiently in order to shorten the construction term... 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.
  • State reduction in the exact analysis of fork/join queueing systems with homogeneous exponential servers

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

    A state reduction technique for the exact analysis of fork/join queueing systems is presented in this paper. The technique is based on the standard Markov model and can be applied to systems having K homogeneous exponential servers. For a closed system with M jobs, the technique reduces the size of the state space from (M+1)K-M K states to (M+K-1/K-1) states. This amounts to ... 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.
  • A flexible protocol synthesis method for adopting requirement changes

    Publication Year: 1996, Page(s):319 - 326
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Communicating entities in a protocol specification communicate with each other and provide services to their users. Once the behaviours of the entities (specification of the protocol) are specified they are not changed. The entities provide a fixed set of services to their users. However, different users have different requirements and their requirements change often. The requirement changes in ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable routing schemes for massively parallel processing using reconfigurable optical interconnect

    Publication Year: 1996, Page(s):500 - 507
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    We consider the message routing/broadcasting problem in an optically interconnected massively parallel processing system, where each node in the system sends/broadcasts randomly generated packets to others. The network model considered is the reconfigurable optical interconnect (ROI). It is based on the new device capabilities enabled by recent advances in optical technology. A ROI node can use li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping asynchronous parallel simulation on a network of workstations

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

    This paper examines the performance of mapping schemes used in parallel simulation on a network of workstations. A conservative parallel simulation of multistage interconnection networks is used as an example in our analytical model. Performance metrics such as elapsed time, speedup and simulation bandwidth associated with different schemes for partitioning/mapping parallel simulation onto physica... 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.
  • Performance evaluation of a WDMA OIDSM multiprocessors

    Publication Year: 1996, Page(s):162 - 168
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    Optically interconnected distributed shared memory (OIDSM) systems offer significant performance advantages due to the fast interconnection network. The photonic network of the proposed approach is based on a wavelength-division multiplexed (WDMA) passive star-coupled configuration. Optical self-routing is achievable which partitions the traffic, relaxing the design constraints on the receiver sub... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiency of the domain decomposition method for the parallelization of implicit finite element code

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

    An analytical model is presented for estimating parallel efficiency of the domain decomposition method which is used for the parallelization of implicit finite element code. Serial and parallel finite element codes with domain decomposition and direct LDU solution of equation systems are developed. Dependencies of parallel efficiency on problem size are obtained for IBM SP2 with 4,6 and 8 processo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost-balanced cooperation protocol in multi-agent robotic systems

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

    This paper proposes a cooperation protocol based on the cost-balanced strategy for the Object-Sorting Task in multi-agent robotic systems. The protocol coordinates agents for carrying objects to destinations efficiently and effectively. Each agent autonomously makes subjective optimal decision, then the coordination algorithm resolves their conflicts by balancing the load, which is measured in ter... 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.
  • 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.
  • Exploiting the locality of data structures in multithreaded architecture

    Publication Year: 1996, Page(s):352 - 358
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    Multithreaded architectures taking a hybrid approach of von Neumann computers and dataflow computers are recently in active research. Multithreaded architectures can improve the performance by the locality exploitation within threads and asynchronous parallel execution among threads. However, it has been overlooked how to exploit effectively the locality of large shared data structures among threa... 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.