By Topic

Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing

1-4 Dec. 1993

Filter Results

Displaying Results 1 - 25 of 112
  • Optimal information dissemination in Star and Pancake networks

    Publication Year: 1993, Page(s):720 - 723
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    The paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide and conquer paradigm for weak order problems on very complex architectures as the Star graph or the Pancake. As applications, we introduce asymptotically optimal algorithms for broadcasting, gossiping, and semigroup operations for such interconnection netw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental garbage collection for causal relationship computation in distributed systems

    Publication Year: 1993, Page(s):650 - 655
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (479 KB)

    Many distributed applications require the knowledge of the causality relation induced by the computation. Reconstructing this relation appears to be an interesting tool for such applications, but a vector of size S - where S is the number of processes - must be attached to each event to achieve this reconstruction. This induces a large overhead in secondary memory. After defining special events of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the granularity of events when modeling program executions

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

    In the context of parallel and distributed programming, program execution models are required to obtain a better understanding of the behavior, properties, and characteristics of parallel and distributed applications. One commonly adopted approach consists of representing an execution as a set of events and relations that capture the ordering of the events. The main disadvantages of most existing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for group communication

    Publication Year: 1993, Page(s):226 - 232
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (651 KB)

    We present an algorithm for reliable group communication that guarantees atomicity and total ordering in message delivery. The algorithm has been designed to operate with general omission failures on top of any datagram subnetwork. It allows one to operate within large groups of processes without loss of efficiency and is suitable for an easy implementation. Processes decide in at most 2fk + 2 pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • Optimal communication algorithms on the star interconnection network

    Publication Year: 1993, Page(s):702 - 711
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    We consider three fundamental communication problems on the star interconnection network, namely the multinode broadcast, the single node scattering, and the total exchange. All of these problems are studied under two different assumptions: the assumption that each node can exchange messages of fixed length with one of its neighbors at each time step, or single link availability (SLA), and the ass... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding between 2-D meshes of the same size

    Publication Year: 1993, Page(s):712 - 719
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    It is shown how to embed an x1 × 11 mesh M1 into an s2 × t2 mesh M 2, where s1 × t2, s1 < ti (i = 1,2) such that the dilation is minimized. It is assumed that load = 1 and expansion = 1. For each case there is shown a lower bound on the dilation and a corresponding emb... View full abstract»

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

    Publication Year: 1993, Page(s):320 - 326
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    This paper presents a new multicasting network constructed with a bit-level cost complexity of O(N log2N) and a bit-level time complexity of O(log2 N) using comparators with bit-level I(1) time and cost complexities. The requested addresses for connection are sorted in a pipeline fashion (worm-hole routed) bit-serially most-significant-bit first through the network Bitonic so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • C-Linda implementations of the distinct element model

    Publication Year: 1993, Page(s):538 - 545
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    We discuss C-Linda implementations of a distinct element method used to model geomechanical phenomena. In our implementations, we adopted the master-worker agenda paradigm for parallelization. This paradigm was implemented by using two distinct approaches. These approaches are called distribution by partitions and distribution by blocks. In order to ensure that the master and worker processes are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving Markov chains using bounded aggregation on a massively parallel processor

    Publication Year: 1993, Page(s):128 - 133
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    An SIMD implementation of a method for approximating the stationary distribution vector of a Markov chain is presented. A key feature of the implementation is the simultaneous computation of several matrix inverses. Computational results from a MasPar MP-1 system are discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended distributed genetic algorithm for channel routing

    Publication Year: 1993, Page(s):726 - 733
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    In this paper, we propose a new parallel genetic algorithm (GA), called extended distributed genetic algorithm (EDGA) for channel routing problem. The EDGA combines the advantages of previous parallel GA models, viz., master/slave GA model and distributed GA model. In EDGA, the root processor executes the conventional genetic algorithm with global selection on total population and the remaining pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • STAR: a fault-tolerant system for distributed applications

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

    The paper presents a fault-tolerant manager for distributed applications. This manager provides an efficient recovery of hosts' failures on networks of workstations. An independent checkpointing is used to automatically recover application processes affected by host failures. Domino-effects are avoided by means of message logging and file versions management. STAR provides an efficient software fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache design for an Explicit Token Store data flow architecture

    Publication Year: 1993, Page(s):45 - 50
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    This paper discusses the performance enhancement of an Explicit Token Store (ETS) architecture as a result of the introduction of hierarchical memory system. It indicates how locality can be exploited in a data-flow environment and evaluates a novel cache subsystem design for this purpose. The introduction of an operand cache and an instruction cache, cause a performance enhancement, remarkable en... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Valved routing: Efficient flow control in interconnection networks using misrouting

    Publication Year: 1993, Page(s):327 - 334
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Misrouting deroutes messages away from their destinations in an interconnection network to bypass the congested region, avoid possible deadlock, and improve the network throughput. The deadlock and livelock problems in misrouting have been studied in recent papers. The starvation and performance degradation problems are not fully exploited and existing approaches tend to be complex and ineffective... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicasting in injured hypercubes using limited global information

    Publication Year: 1993, Page(s):548 - 555
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    We study the multicast problem in injured hypercubes with faulty nodes by assuming that each node in a cube has limited global information, which is captured by the safety level associated with the node. Basically, the safety level is an approximate measure of the distribution of faulty nodes in the neighborhood. We first propose a safety-level based multicasting scheme which guarantees time optim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel Euclidean distance transformation algorithms

    Publication Year: 1993, Page(s):216 - 223
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    We present a parallel algorithm for the Euclidean distance transformation (EDT). It is a divide-and-conquer algorithm based on a fast sequential algorithm for the Signed EDT (SEDT). The combining step that follows the local partial calculation of the SEDT can be done efficiently after reformulating the SEDT problem as the partial calculation of a Voronoi Diagram. This leads to an algorithm with tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative parallel methods for boundary value problems

    Publication Year: 1993, Page(s):134 - 140
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A bordered almost block diagonal system (BABD) results from discretizing and linearizing ordinary differential equation (ODE) boundary value problems (BVPs) with nonseparated boundary conditions (BCs) by either spline collocation, finite differences, or multiple shooting. After interval condensation, if necessary, this BABD system reduces to a standard finite difference BABD structure. This system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm to automate non-unimodular transformations of loop nests

    Publication Year: 1993, Page(s):512 - 519
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    This paper provides a solution to the open problem of automatic rewriting loop nests for non-unimodular transformations. We present an algorithm that rewrites a loop nest under any non-singular (unimodular or non-unimodular) transformation. The algorithm works nicely with unimodular transformations being treated as a special case. The first step of the algorithm calculates the loop bounds using th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data-parallel approach to the implementation of weighted medians technique on parallel/super-computers

    Publication Year: 1993, Page(s):734 - 737
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    Nonlinear filters have been used in many signal processing applications, for example, to obtain optimum signal extraction or detection in the presence of random noise. The weighted median filter (WMF), of which the standard median is a special case, is a novel nonlinear technique designed for 2D image processing. A major advantage of the WMF is its flexibility in design to deal with a wide variety... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible user-definable performance of name resolution operations in distributed file systems

    Publication Year: 1993, Page(s):661 - 664
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    We propose a mechanism for improving the performance of name resolution operations in distributed file systems. The mechanism is based on the idea of reducing the number of message exchanges required for the resolution of a particular file name. In this mechanism, users are given the flexibility to dynamically define and change their performance requirements for the various file names being used b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architectural support for block transfers in a shared-memory multiprocessor

    Publication Year: 1993, Page(s):51 - 54
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    This paper examines how the performance of a shared-memory multiprocessor can be improved by including hardware support for block transfers. A system similar to the Hector multiprocessor developed at the University of Toronto is used as a base architecture. It is shown that such hardware support can improve the performance of initialization code by as much as 50%, but that the amount of improvemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing global combine operations in the multi-port postal model

    Publication Year: 1993, Page(s):336 - 343
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    Consider a message-passing system of n processors and each holds one piece of data initially. The goal is to compute an associative and commutative reduction function on the n distributed pieces of data and to make the result known to all the processors. We model the message-passing system using the parameter k for the k-port model and the parameter λ for the communication latency in the po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic permutation routing on meshes

    Publication Year: 1993, Page(s):814 - 821
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    We present new deterministic algorithms for routing permutations on a two-dimensional n × n MIMD mesh. One algorithm runs in the optimal time 2 × n - 2, while the maximal number of packets stored in a processing unit is bounded to 81. Another algorithm runs in near optimal time, 2 × n + O(1), and has maximal queue length only 31 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerance properties of deBruijn and shuffle-exchange networks

    Publication Year: 1993, Page(s):556 - 563
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    We study node fault-tolerance properties of the d-ary deBruijn and shuffle-exchange networks by appealing to the algebraic structure of their underlying digraphs. In particular, we prove that both of these families of digraphs have connectivity equal to their minimum degree. This result is new in the case of the shuffle-exchange digraphs and can be extended for both families to characterize the pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Point visibility of a simple polygon on reconfigurable mesh

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

    We consider the following problem. Given a point z in the interior of a simple polygon P with n vertices, find all the boundary points of P that are "visible" from z. We present two parallel algorithms for this problem on a two dimensional reconfigurable mesh. The first algorithm runs in O(log2 n) timing using n1/2 processors, and the second one runs in O(1) time using n &tim... View full abstract»

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