By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 3 • Date Jul 1990

Filter Results

Displaying Results 1 - 10 of 10
  • VMMP: a practical tool for the development of portable and efficient programs for multiprocessors

    Publication Year: 1990, Page(s):304 - 317
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1220 KB)

    The VMMP (virtual machine for multiprocessors) software package is presented. It provides a coherent set of services for parallel application programs running on diverse multiple input multiple data (MIMD) multiprocessors, including shared memory and message passing multiprocessors. The communication, synchronization, and data distribution requirements of parallel algorithms are analyzed. Related ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting performance of parallel computations

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

    An accurate and computationally efficient method for predicting the performance of a class of parallel computations running on concurrent systems is described. A parallel computation is modeled as a task system with precedence relationships expressed as a series-parallel directed acyclic graph. Resources in a concurrent system are modeled as service centers in a queuing network model. Using these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of fork-join program response times on multiprocessors

    Publication Year: 1990, Page(s):286 - 303
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    Models for two processor sharing policies called task scheduling processor sharing and job scheduling processor sharing are developed and analyzed. The first policy schedules each task independently and allows parallel execution of an individual program, whereas the second policy schedules each job as a unit, thereby not allowing parallel execution of an individual program. It is found that task s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A resilient mutual exclusion algorithm for computer networks

    Publication Year: 1990, Page(s):344 - 355
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1208 KB)

    The authors present an extension to the work of I. Suzuki and T. Kasami (see Proc. 3rd Int. Conf. Distributed Compact Syst., p.365-70 (1982)), where a mutual exclusion algorithm uses a message called a token to transfer the privilege of entering a critical region among the participating sites. The proposed algorithm checks whether the token is lost during network failure, and regenerates it if nec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel algorithm for 2-D DFT computation with no interprocessor communication

    Publication Year: 1990, Page(s):377 - 382
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    A parallel algorithm is proposed for the two-dimensional discrete Fourier transform (2-D DFT) computation which eliminates interprocessor communications and uses only O(N) processors. The mapping of the algorithm onto architectures with broadcast and report capabilities is discussed. Expressions are obtained for estimating the speed performance on these machines as a function of the size ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware support for interprocess communication

    Publication Year: 1990, Page(s):318 - 329
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1080 KB)

    The use of a special-purpose coprocessor for supporting message passing is proposed. An actual message-based operating system is partitioned into computation and communication parts, executing, respectively, on a host and a message coprocessor which interact through shared queues. Its performance is measured on a multiprocessor. Hardware support in the form of a special-purpose smart bus and smart... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant protocol for atomic broadcast

    Publication Year: 1990, Page(s):271 - 285
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1332 KB)

    A general protocol for atomic broadcast in networks is presented. The protocol tolerates loss, duplication, reordering, delay of messages, and network partitioning in an arbitrary network of fail-stop sites (i.e. no Byzantine site behavior is tolerated). The protocol is based on majority-concensus decisions to commit on unique ordering of received broadcast messages. Under normal operating conditi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An empirical study of Fortran programs for parallelizing compilers

    Publication Year: 1990, Page(s):356 - 364
    Cited by:  Papers (61)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    Some results are reported from an empirical study of program characteristics, that are important in parallelizing compiler writers, especially in the area of data dependence analysis and program transformations. The state of the art in data dependence analysis and some parallel execution techniques are examined. The major findings are included. Many subscripts contain symbolic terms with unknown v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hypertool: a programming aid for message-passing systems

    Publication Year: 1990, Page(s):330 - 343
    Cited by:  Papers (318)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    Programming assistance, automation concepts, and their application to a message-passing system program development tool called Hypertool are discussed. Hypertool performs scheduling and handles the communication primitive insertion automatically, thereby increasing productivity and eliminating synchronization errors. Two algorithms, based on the critical-path method, are presented for scheduling p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A UNITY-style programming logic for shared dataspace programs

    Publication Year: 1990, Page(s):365 - 376
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    A proof system for a shared dataspace programming notation called Swarm (a programming logic similar in style to that of UNITY) is specified. Relevant aspects of the Swarm language and model are overviewed. To illustrate the proof system, the Swarm logic is used to verify the correctness of a program for labeling connected equal-intensity regions of a digital image. Like UNITY, the Swarm proof sys... 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