By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 8 • Aug 1993

Filter Results

Displaying Results 1 - 10 of 10
  • Reconfiguration and analysis of a fault-tolerant circular butterfly parallel system

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

    The butterfly parallel system has a regular and simple interconnection pattern, making it suitable for VLSI or WSI implementation. The authors propose an effective fault-tolerant technique for the circular butterfly parallel system to ensure its rigid full butterfly structure even in the presence of failures, addressing reconfiguration in detail. The resulting butterfly system has L level... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Benchmarking parallel processing platforms: an applications perspective

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

    Given the increased availability of general purpose parallel computers two issues arise: One needs to compare the performance of the different available platforms using realistic examples, and it is necessary to write application software that can be ported easily in order to take advantage of different platforms. The authors address these issues from an applications point of view. They are intere... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The SNAP-1 parallel AI prototype

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

    The Semantic Network Array Processor (SNAP) is a parallel architecture for knowledge representation and reasoning that uses the marker-propagation paradigm. The primary application areas of SNAP are natural language understanding and speech processing. A first-generation SNAP-1 system has been designed and constructed using an array of 144 digital signal processors organized as 32 multiprocessing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel algorithm for an efficient mapping of grids in hypercubes

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

    The authors parallelize the embedding strategy for mapping any two-dimensional grid into its optimal hypercube with minimal dilation. The parallelization allows each hypercube node to independently determine, in constant time, which grid node it will simulate and the communication paths it will take to reach the hypercube nodes that simulate its grid-neighbors. The paths between grid-neighbors are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conservative parallel simulation of continuous time Markov chains using uniformization

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

    The authors describe parallel algorithms for simulating certain continuous time Markov chains, such as those arising in queueing network models of distributed computing systems or communications systems. The algorithms are based on the technique of uniformization. Two variations of a conservative parallel simulation algorithm are presented. In each algorithm, a relatively short presimulation is pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of algorithm-based fault-tolerant systems from dependence graphs

    Publication Year: 1993, Page(s):864 - 874
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1120 KB)

    Algorithm-based fault tolerance (ABFT) is a method for improving the reliability of parallel architectures used for computation-intensive tasks. A two-stage approach to the synthesis of ABFT systems is proposed. In the first stage, a system-level code is chosen to encode the data used in the algorithm. In the second stage, the optimal architecture to implement the scheme is chosen using dependence... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient protocol for checkpointing recovery in distributed systems

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

    The authors present an efficient synchronized checkpointing protocol that exploits the dependency relation between processes in distributed systems. In this protocol, a process takes a checkpoint when it knows that all processes on which it computationally depends took their checkpoints, hence the process need not always wait for the decision made by the checkpointing coordinator as in the convent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The scalability of FFT on parallel computers

    Publication Year: 1993, Page(s):922 - 932
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    The authors present the scalability analysis of a parallel fast Fourier transform (FFT) algorithm on mesh and hypercube connected multicomputers using the isoefficiency metric. The isoefficiency function of an algorithm architecture combination is defined as the rate at which the problem size should grow with the number of processors to maintain a fixed efficiency. It is shown that it is more cost... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of macro-dataflow dynamic scheduling on nonuniform memory access architectures

    Publication Year: 1993, Page(s):875 - 888
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1316 KB)

    The author studies dynamic scheduling of computational tasks with communication costs using nonuniform memory access architecture. The computing model assumes that data transfer can be partitioned into parallel and sequential parts with respect to the task execution. A scheduling heuristic, called least-communication (LC), together with a two-level scheduler is proposed in an attempt to minimize t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance issues in distributed query processing

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

    The authors discuss various performance issues in distributed query processing. They validate and evaluate the performance of the local reduction (LR) the fragment and replicate strategy (FRS) and the partition and replicate strategy (PRS) optimization algorithms. The experimental results reveal that the choices made by these algorithms concerning which local operations should be performed, which ... 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.

Full Aims & Scope

Meet Our Editors

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