By Topic

[1993] Proceedings Seventh International Parallel Processing Symposium

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
  • Designing efficient parallel algorithms: models and paradigms with applications to image processing

    Publication Year: 1993
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (35 KB)

    Summary form only given, as follows. Recent advances in the parallel processing technology promise to provide an unprecedented level of computational power in the near future. A crucial factor to achieve the potential of this emerging technology is the development of efficient parallel algorithms that are scalable across architectures and parallel machines. The author reviews several paradigms for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Writing correct parallel programs

    Publication Year: 1993, Page(s):630 - 634
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    This paper explores the questions: Is writing correct parallel programs harder than writing correct sequential programs? If so, why? What can be done to help in developing reliable parallel programs? View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On some topological properties of hypercube, incomplete hypercube and supercube

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

    Hamiltonian properties of hypercube, incomplete hypercube and supercube are examined. It is known that in a nonfaulty hypercube there are at least n! Hamiltonian cycles. The authors extend this result showing that the lower bound is at least 2n-3n! They show that with at most n-2 faulty links a faulty hypercube has at least 2(n-2)! Hamiltonian cycles. They establish th... View full abstract»

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

    Publication Year: 1993, Page(s):268 - 275
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    The authors investigate the relationship between application program characteristics and interconnection network (ICN) performance using an execution driven simulation testbed: the reconfigurable architecture workbench (RAW). RAW simulates a wide variety of parallel architectures including both fine and coarse grain; SIMD, MIMD, and hybrid machines; and a wide variety of ICNs. They present RAW's n... 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.
  • Design and analysis of generalized link extended hierarchical interconnection networks

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

    Hierarchical interconnection networks (HINs) have been introduced to maintain a low node degree with an increasing network size. This paper presents a systematic procedure for designing a general class of HINs and could be based on existing topologies by connecting a partition of each disjoint cluster as a gateway to all other clusters in the network. The size of these gateways, or the gatewidth, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel MSF algorithm for planar graphs on a mesh and applications to image processing

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

    The author presents an efficient O(n) parallel algorithm for finding a minimum-cost spanning forest (MSF) of a weighted undirected planar graph with n2 edges, on an n ×n mesh-connected computer. He also obtains efficient MSF-based O(n) algorithms for several application problems in image processing. In particular, he s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speedup, communication complexity and blocking-a La Recherche du Temps Perdu

    Publication Year: 1993, Page(s):712 - 721
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    The paper investigates the time lost in a parallel computation due to sequential and duplicated work, communication and control, and blocking. It introduces the concept of relative speedup and proposes characterizations of parallel algorithms based upon the communication complexity and the blocking model. The paper discusses the impact of the processor's architecture upon the measured speedup. It ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel analog algorithms for processing polygonal images on a systolic screen

    Publication Year: 1993, Page(s):557 - 562
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    The systolic screen is a very natural parallel architecture for image processing. A √n×√n systolic screen consists of a √n×√n mesh-of-processors with each processor representing a pixel in a grid. The author studies computational geometry problems for polygonal images on such a screen. The algorithms are analog in that they simulate `physical' processes based on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A high speed dataflow processing element and its performance compared to a von Neumann mainframe

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

    The Event Processor / 3 is a dataflow processing element designed for high performance over a range of general computing tasks. Using a multithreading technique, program parallelism is exploited by interleaving threads onto successive pipeline stages. It may also be used as an element in a multiprocessor system. This paper describes the philosophy and design of the machine, and presents the result... 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 (4)
    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.
  • Mapping realistic data sets on parallel computers

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

    Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the execution time of the application if the size of the problem is large. The authors propose reducing the problem size by a mapping-oriented graph contraction technique. They present a graph contraction (GC) heuristic algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel implementation issues of the textured algorithm for optimal routing in data networks

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

    Parallel implementation issues of the textured algorithm to solve the optimal routing problem (ORP) in data networks is investigated. The textured model decomposes a large data network into a multi-level structure, each level contains a few subnetworks and each subnetwork is controlled by a local processor (e.g. an internet gateway). Subnetworks of the same level are not overlapped with each other... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analytical model for wormhole routing in multicomputer interconnection networks

    Publication Year: 1993, Page(s):650 - 654
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    The communication performance of the interconnection network is critical in a multicomputer system. Wormhole routing has been known to be more efficient than the traditional circuit switching and packet switching. To evaluate wormhole routing, a queueing-theoretic analysis is used. This paper presents a general analytical model for wormhole routing based on very basic assumptions. The model is use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data partitioning schemes for the parallel implementation of the revised simplex algorithm for LP problems

    Publication Year: 1993, Page(s):379 - 383
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    The parallel implementation of the revised simplex algorithm (RSA) using eta-factorization holds the promise of significant improvement in the execution time by virtue of the existence of a high degree of parallelism in the computation within an iteration of the algorithm. However, the scheme employed to partition key data structures in a distributed memory parallel processor has a great impact on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • The CM-2 data transposition problem

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

    The CM-2's natural data layout is not conducive to exchanging data with other machines. Before CM-2 data is sent to a remote machine, a bitwise transpose must be performed on the data. Each bit in an n bit value must be transmitted to a different processor, requiring n send operations through the CM-2's global router network. The time required to transpose the data limits the effective throughput ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel mappings of a dynamic programming algorithm: a summary of results

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

    The authors are concerned with dynamic programming (DP) algorithms whose solution is given by a recurrence relation similar to that for the matrix parenthesization problem. Guibas, Kung and Thompson (1979), presented a systolic array algorithm for this problem that uses O (n2) processing cells and solves the problem in O(n) time. The authors present t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache protocols with partial block invalidations

    Publication Year: 1993, Page(s):16 - 23
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The authors introduce hardware cache protocols in which invalidations affect only part of a cached block so that the processor can keep reading the valid part. On a cache miss the entire block is fetched in the cache. The proposed protocols take advantage of the prefetching effects associated with large block sizes while reducing the false sharing miss rate. It does not rely on synchronization as ... 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.
  • Scheduling independent tasks on partitionable hypercube multiprocessors

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

    A partitionable hypercube allows simultaneous execution of multiple tasks, where each task can be executed on a choice of subcubes. This paper considers the problem of static nonpreemptive scheduling of w independent tasks on a n processor partitionable hypercube system to minimize the overall finishing time of the w tasks. Each task can be executed on subcubes of different sizes, with sm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic multiple copy approach for message passing in a virtual cut-through environment

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

    The paper proposes a scheme where nodes adaptively send multiple copies of time-critical messages to increase the probability of their timely delivery. A message is replicated only when the time remaining to its deadline is below a pre-computed threshold. An off-line algorithm for computing the number of copies and the deadline thresholds is presented. Simulation results indicate that the reductio... 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.
  • A portable parallel algorithm for VLSI circuit extraction

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

    The authors describe a new portable algorithm for parallel circuit extraction. The algorithm is built as part of the ongoing ProperCAD project: a portable object-oriented parallel environment for CAD applications that is built on top of the CHARM system. The algorithm, unlike prior approaches like PACE is asynchronous and is based on a coarse-grained dataflow execution model. Performance of circui... View full abstract»

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