By Topic

Parallel Processing Symposium, 1993., Proceedings of Seventh International

Date 13-16 April 1993

Filter Results

Displaying Results 1 - 25 of 130
  • Proceedings of Seventh International Parallel Processing Symposium (Cat. No.93TH0513-2)

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • On the shortest path problem for permutation graphs

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

    The authors show that the single-source shortest path problem for permutation graphs can be solved in O(logn) time using O(n/logn) processors on an EREW PRAM. As an application, they show that a minimum connected dominating set of a permutation graph can be found in O(logn) time using O(n/logn) processors. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards optimal parallel radix sorting

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

    The authors propose a radix sorting algorithm for n m -bit numbers (where m=Ω(log n) and polynomially upper bounded in n) that runs in O(t (n)log m) time, on any PRAM with mp(n)/logn logm O(logn)-bit processors; p(n) and t(n) are th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance characteristics of the iPSC/860 and CM-2 I/O systems

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

    Typical scientific applications require vast amounts of processing power coupled with significant I/O capacity. Highly parallel computer systems can provide processing power at low cost, but have historically lacked I/O capacity. By evaluating the performance and scalability of the Intel iPSC/860 Concurrent File System and the Connection Machine DataVault, one can get an idea of the current state ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient parallel algorithm for min-cost flow on directed series-parallel networks

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

    The authors consider the problem of finding the minimum cost of a feasible flow in directed series-parallel networks with real-valued lower and upper bounds for the flows on edges. While strongly polynomial-time algorithms are known for this problem on arbitrary networks, it is known to be `hard' for parallelization. The authors develop, for the first time, an NC algorithm to solve the min-cost fl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting insertions and deletions in striped parallel filesystems

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

    The dramatic improvements in the processing rates of parallel computers are turning many compute-bound jobs into IO-bound jobs. Parallel file systems have been proposed to better match IO throughput to processing power. Many parallel file systems stripe files across numerous disks; each disk has its own controller. A striped file can be appended (or prepended) to and maintain its structure. Howeve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OCCAM prototyping of massively parallel applications from colored Petri-nets

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

    The authors present a technique to build a massively parallel application from a formal description. They use the colored Petri-net formalism to model applications. This formalism allows them to concisely describe parallel applications. Theoretical results on this formalism contribute to proving the correctness of the description before implementation. Furthermore, they use some linear invariants ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal mesh computer algorithms for simple polygons

    Publication Year: 1993, Page(s):182 - 187
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    The author presents optimal parallel algorithms that run in O(√n) time on a √n×√n mesh-connected computer for a number of fundamental problems concerning visibility and distance properties inside a simple polygon. These include computing shortest paths, shortest path trees, shortest path partitions, all-farthest neighbors (both internal and external), the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorting n2 numbers on n×n meshes

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

    The authors show that by folding data from an n×n mesh onto an n×(n/ k) submesh, sorting on the submesh, and finally unfolding back onto the entire n×n mesh it is possible to sort on bidirectional and strict unidirectional meshes using a number of routing steps that is very close to the distance lower bound for these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New wormhole routing algorithms for multicomputers

    Publication Year: 1993, Page(s):419 - 423
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. The authors provide a general result which enables them to design deadlock-free wormhole routing algorithms from store-and-forward routing algorithms that satisfy certain criteria. They illustrate this result by developing fully-adaptive deadlock-free... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical interconnection cache networks

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

    The hierarchical interconnection cache network (HICN) is a novel network architecture for massively parallel processing systems. The HICN's topology is a hierarchy of multiple, three-stage interconnection cache networks. The first and third stages of each network use small, fast crossbar switches. Large, slow switching (reconfigurable) crossbars are used in the middle stages. HICN exploits a speci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • C parallelizing compiler on local-network-based computer environment

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

    The local-network-based computer system, in which some workstations are connected is coming into practical use. Software development is, however, very difficult for end-users because the system has complicated problems such as load balancing, communication among processes on different workstations and so on. The authors propose a C-specific parallelizing compiler to solve these problems. The compi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorting n numbers on n×n reconfigurable meshes with buses

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

    The authors show how column sort and rotate sort can be implemented on the different reconfigurable mesh with buses (RMB) architectures that have been proposed in the literature. On all of these proposed RMB architectures, the authors are able to sort n numbers on an n×n configuration in O(1) time. For the PARBUS RMB architecture the authors' column sort and rotate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for rectilinear link distance problems

    Publication Year: 1993, Page(s):65 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The authors provide optimal parallel solutions to several fundamental link distance problems set in trapezoided rectilinear polygons. All parallel algorithms are deterministic, run in logarithmic time, have an optimal time-processor product and are designed to run on EREW PRAM. The authors develop techniques (e.g. rectilinear window partition) for solving link distance problems in parallel which a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the hierarchical hypercube interconnection network

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

    The paper explores the hierarchical hypercube (HHC) interconnection network, suitable for building massively parallel systems with thousands of processors. HHC is self-embedded, that is, an HHC can embed HHCs of lower dimensions. In addition, HHC is a communication-efficient architecture. Two algorithms for data communication in the HHC are presented. The first algorithm is for one-to-one transfer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of efficient reconfigurable networks

    Publication Year: 1993, Page(s):413 - 418
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The author presents a methodology to design an efficient communication reconfigurable network of processor using a circuit switching environment. He assumes that the operation is synchronous and reconfigurations occur at pre-specified times. This network is based on two architectural concepts, the generalized folding cube and the enhanced hypercube architectures. The author demonstrates the effect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing of DOALL loops in the Perfect Club

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

    The speedup achieved by concurrent execution of loop iterations is determined by load balance and several other factors, so no single strategy provides maximum speedup for all classes of programs and all target architectures. Hence, the selection of a load balancing strategy must be guided by characteristics of both the application domain and the target machine architecture. The authors study loop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stereo and image matching on fixed size linear arrays

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

    The authors present parallel techniques to implement two vision tasks; stereo matching and image matching using linear features as primitives. The implementations are performed on a fixed size linear array and achieve processor-time optimal performance. For stereo matching, they propose an O(Nn3/P) time algorithm on a P-processor linear array, where N is the number of line segments in o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient atomic multicast protocol for client-server models

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

    Distributed applications which are replicated to achieve fault tolerance usually are faced with the problem of maintaining consistent states. To eliminate potential divergence of replica states caused by unreliable communication primitives, an atomic multicast protocol is required which guarantees delivery of messages at all receivers in the same order. The authors propose a new efficient protocol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel A* algorithms and their performance on hypercube multiprocessors

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

    The authors develop parallel A* algorithms suitable for distributed-memory machines. In parallel A* algorithms, inefficiencies grow with the number of processors P used, causing performance to drop significantly at lower and intermediate work densities (the ratio of the problem size to P). To alleviate this effect, they propose a novel parallel startup phase and efficient dynamic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for height balancing binary trees

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

    The authors present a simple parallel algorithm to height-balance a binary tree. The algorithm accepts any arbitrary binary tree as its input and yields an optimally shaped binary tree. For any arbitrary binary tree of n nodes the algorithm has a time complexity of O(lgn) and utilizes O(n) processors on a EREW PRAM model. The algorithm uses Euler tours ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing a simple polygon for monotonicity optimally in parallel

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

    The authors show that, in parallel, an n-vertex simple polygon can be tested for monotonicity optimally in O(logn ) time using O(n/logn) EREW PRAM processors, and present two different optimal parallel algorithms for solving this problem. Their result leads to an optimal parallel algorithm for triangulating monotone polygons that takes ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The connection cubes: symmetric, low diameter interconnection networks with low node degree

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

    The enhanced connection cube or ECC and the minimal connection cube or MCC, proposed in this paper, are regular and symmetric static interconnection networks for large-scale, loosely coupled systems. The ECC connects 22n+1 processing nodes with only n+2 links per node, almost half the number used in a comparable hypercube. Yet its diameter is only n+2, almost half that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New degree four networks: properties and performance

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

    Two-dimensional tori, or its variants such as the midimew networks, are the most popular degree-four interconnection networks. However, the number of nodes interconnected by two-dimensional tori or the midimew networks grows as a square of their diameters. The authors discuss two different types of degree-four interconnection networks, the starcake networks and the k-ary 2-cliques. These ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining bipartite matchings in the presence of failures

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

    The authors present an on-line distributed reconfiguration algorithm for finding a new maximum matching incrementally after some nodes have failed. Their algorithm is deadlock free, and with k failures maintains at least M-k matching pairs during the reconfiguration process, where M is the size of the original maximum matching. The algorithm tolerates failures t... View full abstract»

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