By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 8 • Date Aug 1994

Filter Results

Displaying Results 1 - 12 of 12
  • Massively parallel algorithms for trace-driven cache simulations

    Publication Year: 1994, Page(s):849 - 859
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    Considers the use of massively parallel architectures to execute a trace-driven simulation of a single cache set. A method is presented for the least-recently-used (LRU) policy, which, regardless of the set size C, runs in time O(log N) using N processors on the EREW (exclusive read, exclusive write) parallel model. A simpler LRU simulation algorithm is given that runs in O(C log N) time using N/l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Repeated computation of global functions in a distributed environment

    Publication Year: 1994, Page(s):823 - 834
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1072 KB)

    In a distributed system, many algorithms need repeated computation of a global function. These algorithms generally use a static hierarchy for gathering the necessary data from all processes. As a result, they are unfair to processes at higher levels of the hierarchy, which have to perform more work than processes at lower levels do. In this paper, we present a new revolving hierarchical scheme in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The combining DAG: a technique for parallel data flow analysis

    Publication Year: 1994, Page(s):805 - 813
    Cited by:  Papers (5)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    As the number of available multiprocessors increases, so does the importance of providing software support for these systems, including parallel compilers. Data flow analysis, an important component of software tools, may be computed many times during the compilation of a program, especially when compiling for a multiprocessor. Although converting a sequential data flow algorithm to a parallel alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adding multiple-fault tolerance to generalized cube networks

    Publication Year: 1994, Page(s):785 - 792
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Generalized cube networks are limited to single-fault tolerance with respect to permutation connections. The vector space approach presented here yields many fault-tolerance schemes that can tolerate two and three faults. In each scheme, redundant switches and links are added to networks and interconnected in certain ways. These redundancies are represented by a matrix called the redundancy matrix... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An equivalence theorem for labeled marked graphs

    Publication Year: 1994, Page(s):886 - 891
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    Petri nets and their languages are a useful model of systems exhibiting concurrent behavior. The sequential language associated with a given Petri net S consists of all possible firing sequences of S, where each element of a firing sequence is a single transition. The concurrent language associated with S consists of all possible concurrent firing sequences of S, where each element of a concurrent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On parallelizing the EM algorithm for PET image reconstruction

    Publication Year: 1994, Page(s):860 - 873
    Cited by:  Papers (15)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1336 KB)

    The expectation maximization (EM) algorithm is one of the most suitable iterative methods for positron emission tomography (PET) image reconstruction; however, it requires a long computation time and an enormous amount of memory space. To overcome these problems, we present two classes of highly efficient parallelization schemes: homogeneous and inhomogeneous partitionings. The essential differenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for the longest common subsequence problem

    Publication Year: 1994, Page(s):835 - 848
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1340 KB)

    A subsequence of a given string is any string obtained by deleting none or some symbols from the given string. A longest common subsequence (LCS) of two strings is a common subsequence of both that is as long as any other common subsequences. The problem is to find the LCS of two given strings. The bound on the complexity of this problem under the decision tree model is known to be mn if the numbe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructive methods for scheduling uniform loop nests

    Publication Year: 1994, Page(s):814 - 822
    Cited by:  Papers (58)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    This paper surveys scheduling techniques for loop nests with uniform dependences. First, we introduce the hyperplane method and related variants. Then we extend it by using a different affine scheduling for each statement within the nest. In both cases, we present a new, constructive, and efficient method to determine optimal solutions, i.e., schedules whose total execution time is minimum View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deadlock-free multicast wormhole routing in 2-D mesh multicomputers

    Publication Year: 1994, Page(s):793 - 804
    Cited by:  Papers (156)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1100 KB)

    Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new-generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE-2, a wormhole-routed hypercube multicomputer, provides hardware support for broadcast and a restri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New model and algorithms for leader election in synchronous fiber-optic networks

    Publication Year: 1994, Page(s):891 - 896
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    We improve on I. Cidon, I. Gopal and S. Kutten's leader election algorithm (Proc. 7th ACM Symp. Principles Distrib. Computing, Toronto, Ont., Canada. Aug. 1988) by presenting an algorithm that uses only O(√n log D + f) time units to run on synchronous networks of degree f and diameter D, where f⩾3. When f is 2, the algorithm uses only O(log D) time units View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-latency, concurrent checkpointing for parallel programs

    Publication Year: 1994, Page(s):874 - 879
    Cited by:  Papers (35)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Presents the results of an implementation of several algorithms for checkpointing and restarting parallel programs on shared-memory multiprocessors. The algorithms are compared according to the metrics of overall checkpointing time, overhead imposed by the checkpointer on the target program, and amount of time during which the checkpointer interrupts the target program. The best algorithm measured... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower and upper bounds on time for multiprocessor optimal schedules

    Publication Year: 1994, Page(s):879 - 886
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    The lower and upper bounds on the minimum time needed to process a given directed acyclic task graph for a given number of processors are derived. It is proved that the proposed lower bound on time is not only sharper than the previously known values but also easier to calculate. The upper bound on time, which is useful in determining the worst case behavior of a given task graph, is presented. Th... 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