By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 7 • Jul 1993

Filter Results

Displaying Results 1 - 7 of 7
  • Loop-level parallelism in numeric and symbolic programs

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

    A new technique for estimating and understanding the speed improvement that can result from executing a program on a parallel computer is described. The technique requires no additional programming and minimal effort by a program's author. The analysis begins by tracing a sequential program. A parallelism analyzer uses information from the trace to simulate parallel execution of the program. In ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capsules: a shared memory access mechanism for Concurrent C/C++

    Publication Year: 1993, Page(s):795 - 811
    Cited by:  Papers (6)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1260 KB)

    Concurrent C/C++ is a superset of C and C++ that provides parallel programming facilities based on message passing. Upon porting Concurrent C/C++to a shared memory multiprocessor, the authors believed it would be appropriate to supplement Concurrent C/C++ with explicit facilities for synchronizing accesses to shared data structures. The capsule, which is a shared memory access mechanism designed e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient routing schemes for multiple broadcasts in hypercubes

    Publication Year: 1993, Page(s):725 - 739
    Cited by:  Papers (20)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1324 KB)

    The authors analyze the problem in which each node of the binary hypercube independently generates packets according to a Poisson process with rate λ; each of the packets is to be broadcast to all other nodes. Assuming unit packet length and no other communications taking place, it is observed that the system can be stable in steady-state only if the load factor ρ≡λ (2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of coteries: mutual exclusion in distributed systems

    Publication Year: 1993, Page(s):779 - 794
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB)

    A coterie under a ground set U consists of subsets (called quorums) of U such that any pair of quorums intersect with each other. Nondominated (ND) coteries are of particular interest, since they are optimal in some sense. By assigning a Boolean variable to each element in U, a family of subsets of U is represented by a Boolean function of these variables. The a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining possible event orders by analyzing sequential traces

    Publication Year: 1993, Page(s):827 - 840
    Cited by:  Papers (12)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1220 KB)

    One of the fundamental problems encountered when debugging a parallel program is determining the possible orders in which events could have occurred. Various problems, such as data races and intermittent deadlock, arise when there is insufficient synchronization between the tasks in a parallel program. A sequential trace of an execution can be misleading, as it implies additional event orderings, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytic models of adaptive load sharing schemes in distributed real-time systems

    Publication Year: 1993, Page(s):740 - 761
    Cited by:  Papers (21)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1664 KB)

    In a distributed real-time system, nonuniform task arrivals may temporarily overload some nodes while leaving some other nodes idle. As a result, some of the tasks on an overloaded node may miss their deadlines even if the overall system has the capacity to meet the deadlines of all tasks. A decentralized, dynamic load sharing (LS) scheme has been proposed as a solution to this problem. Analytic q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application-dependent dynamic monitoring of distributed and parallel systems

    Publication Year: 1993, Page(s):762 - 778
    Cited by:  Papers (33)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1712 KB)

    Achieving high performance for parallel or distributed programs often requires substantial amounts of information about the programs themselves, about the systems on which they are executing, and about specific program runs. The monitoring system that collects, analyzes, and makes application-dependent monitoring information available to the programmer and to the executing program 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