By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 1 • Date Jan 1990

Filter Results

Displaying Results 1 - 11 of 11
  • Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors

    Publication Year: 1990, Page(s):91 - 106
    Cited by:  Papers (47)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1568 KB)

    A discussion is presented of two ways of mapping the cells in a two-dimensional area of a chip onto processors in an n-dimensional hypercube such that both small and large cell moves can be applied. Two types of move are allowed: cell exchanges and cell displacements. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for list ranking and for solving graph problems on the hypercube

    Publication Year: 1990, Page(s):83 - 90
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    A hypercube algorithm to solve the list ranking problem is presented. Let n be the length of the list, and let p be the number of processors of the hypercube. The algorithm described runs in time O(n/p) when n=Ω(p 1+ε) for any constant ε>0, and in time O(n log n/p+log3 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Odd even shifts in SIMD hypercubes

    Publication Year: 1990, Page(s):77 - 82
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    A linear-time algorithm is developed to perform all odd (even) length circular shifts of data in an SIMD (single-instruction-stream, multiple-data-stream) hypercube. As an application, the algorithm is used to obtain an O(M2+log N) time and O(1) memory per processor algorithm to compute the two-dimensional convolution of an N×N image and an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of spin lock alternatives for shared-money multiprocessors

    Publication Year: 1990, Page(s):6 - 16
    Cited by:  Papers (158)  |  Patents (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1148 KB)

    The author examines the questions of whether there are efficient algorithms for software spin-waiting given hardware support for atomic instructions, or whether more complex kinds of hardware support are needed for performance. He considers the performance of a number of software spin-waiting algorithms. Arbitration for control of a lock is in many ways similar to arbitration for control of a netw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping nested loop algorithms into multidimensional systolic arrays

    Publication Year: 1990, Page(s):64 - 76
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1368 KB)

    Consideration is given to transforming depth p-nested for loop algorithms into q-dimensional systolic VLSI arrays where 1⩽qp-1. Previously, there existed complete characterizations of correct transformation only for the cases where q=p-1 or q=1. This gap is filled by giving formal necessary and sufficient conditions for correc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed management scheme for partitionable parallel computers

    Publication Year: 1990, Page(s):120 - 126
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A distributed scheme for dynamic partitioning is investigated. Distributed procedures to split a subsystem and to combine subsystems are presented. The correctness of each of these two procedures is shown, and the complexity is analyzed. The procedures are applicable to parallel computers that use interconnection networks, such as hypercube, omega, multistage cube, and extra-stage cube networks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On mapping systolic algorithms onto the hypercube

    Publication Year: 1990, Page(s):48 - 63
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB)

    Consideration is given to the problem of mapping systolic array algorithms into efficient algorithms for a fixed-size hypercube architecture. The authors describe in detail several optimal implementations of algorithms given for one-way one- and two-dimensional systolic arrays. Since interprocessor communication is many times slower than local computation in parallel computers built to date, the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing location independent invocation

    Publication Year: 1990, Page(s):107 - 119
    Cited by:  Papers (13)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1352 KB)

    The problems of finding objects in large and wide-area networks where objects may change their location in volatile memory as well as on stable storage are presented. The authors discuss possible solutions and describe those adopted in the Hermes system (a corporate wide, real life office application). They have designed and developed a location-independent-invocation (LII) mechanism that combines... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcast protocols for distributed systems

    Publication Year: 1990, Page(s):17 - 25
    Cited by:  Papers (120)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    An innovative approach is presented to the design of fault-tolerant distributed systems that avoids the several rounds of message exchange required by current protocols for consensus agreement. The approach is based on broadcast communication over a local area network, such as an Ethernet or a token ring, and on two novel protocols, the Trans protocol, which provides efficient reliable broadcast c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient data dependence analysis for parallelizing compilers

    Publication Year: 1990, Page(s):26 - 34
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    A novel algorithm, called the λ test, is presented for an efficient and accurate data dependence analysis of multidimensional array references. It extends the numerical methods to allow all dimensions of array references to be tested simultaneously. Hence, it combines the efficiency and the accuracy of both approaches. This algorithm has been implemented in Parafrase, a Fortran program para... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelizing programs with recursive data structures

    Publication Year: 1990, Page(s):35 - 47
    Cited by:  Papers (31)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    A study is made of the problem of estimating interference in an imperative language with dynamic data structures. The authors focus on developing efficient and implementable methods for recursive data structures. In particular, they present interference analysis tools and parallelization techniques for imperative programs that contain dynamically updatable trees and directed acyclic graphs. The an... View full abstract»

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

Aims & Scope

IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers. Particular areas of interest include, but are not limited to:

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology