By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 1 • Date Jan 1991

Filter Results

Displaying Results 1 - 10 of 10
  • Performance of synchronous parallel algorithms with regular structures

    Publication Year: 1991, Page(s):105 - 116
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    New methods are presented for bounding and approximating the mean execution time of partitioning algorithm, and these methods are compared to previous approaches. Distribution-driven and program-driven simulations show that two of the methods are usually accurate to within 10% and give good estimates even when certain independence assumptions are violated. Asymptotic approximations and upper bound... View full abstract»

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

    Publication Year: 1991, Page(s):93 - 104
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB)

    A description is given of the relaxation lattice method, a new approach to specifying graceful degradation for a large class of programs. A relaxation lattice is a lattice of specifications parameterized by a set of constraints, where the stronger the set of constraints, the more restrictive the specification. While a program is able to satisfy its strongest set of constraints, it satisfies its pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties and performance of folded hypercubes

    Publication Year: 1991, Page(s):31 - 42
    Cited by:  Papers (177)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    A new hypercube-type structure, the folded hypercube (FHC), which is basically a standard hypercube with some extra links established between its nodes, is proposed and analyzed. The hardware overhead is almost 1/n, n being the dimensionality of the hypercube, which is negligible for large n. For this new design, optimal routing algorithms are developed and proven to be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A template-based approach to the generation of distributed applications using a network of workstations

    Publication Year: 1991, Page(s):52 - 67
    Cited by:  Papers (25)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1268 KB)

    A computational model and system for the generation of distributed applications in a workstation environment are presented. The well-known RPC model is modified by a novel concept known as template attachment. A computation consists of a network of sequential procedures which have been encapsulated in templates. A small selection of templates is available from which a distributed application with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel execution model of logic programs

    Publication Year: 1991, Page(s):79 - 92
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1372 KB)

    A parallel-execution model that can concurrently exploit AND and OR parallelism in logic programs is presented. This model employs a combination of techniques in an approach to executing logic problems in parallel, making tradeoffs among number of processes, degree of parallelism, and combination bandwidth. For interpreting a nondeterministic logic program, this model (1) performs frame inheritanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A top-down processor allocation scheme for hypercube computers

    Publication Year: 1991, Page(s):20 - 30
    Cited by:  Papers (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1108 KB)

    An efficient processor allocation policy is presented for hypercube computers. The allocation policy is called free list since it maintains a list of free subcubes available in the system. An incoming request of dimension k (2k nodes) is allocated by finding a free subcube of dimension k or by decomposing an available subcube of dimension greater than k. This ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient modular spare allocation scheme and its application to fault tolerant binary hypercubes

    Publication Year: 1991, Page(s):117 - 126
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    Consideration is given to fault tolerant systems that are built from modules called fault tolerant basic blocks (FTBBs), where each module contains some primary nodes and some spare nodes. Full spare utilization is achieved when each spare within an FTBB can replace any other primary or spare node in that FTBB. This, however, may be prohibitively expensive for larger FTBBs. Therefore, it is shown ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block, multistride vector, and FFT accesses in parallel memory systems

    Publication Year: 1991, Page(s):43 - 51
    Cited by:  Papers (41)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    A discussion is presented of the use of dynamic storage schemes to improve parallel memory performance during three important classes of data accesses: vector accesses in which multiple strides are used to access a single vector, block accesses, and constant-geometry FFT accesses. The schemes investigated are based on linear address transformations, also known as XOR schemes. It has been shown tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic generation of self-scheduling programs

    Publication Year: 1991, Page(s):68 - 78
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    Techniques are described for the automatic generation of self-scheduling parallel programs. Both scheduling algorithms and the concurrent components of applications are expressed in a high-level concurrent language. Partitioning and data dependency information are expressed by simple control statements, which may be generated either automatically or manually. A self-scheduling compiler, implemente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonal graphs for the construction of a class of interconnection networks

    Publication Year: 1991, Page(s):3 - 19
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    A graph theoretical representation for a class of interconnection networks is suggested. The idea is based on a definition of orthogonal binary vectors and leads to a construction rule for a class of orthogonal graphs. An orthogonal graph is first defined as a set of 2 m nodes, which in turn are linked by 2m-n edges for every link model defined in an integer set Q*. ... 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