By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 10 • Date Oct 1993

Filter Results

Displaying Results 1 - 10 of 10
  • Multicast communication in multicomputer networks

    Publication Year: 1993, Page(s):1105 - 1117
    Cited by:  Papers (98)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1124 KB)

    Efficient routing of messages is a key to the performance of multicomputers. Multicast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. While multicast communication is highly demanded in many applications, most of the existing multicomputers do not directly support this service; rather it is indirectly supported by multiple o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system

    Publication Year: 1993, Page(s):1147 - 1164
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1324 KB)

    The authors model a parallel processing system comprising several homogeneous computers interconnected by a communication network. Jobs arriving to this system have a linear fork-join structure. Each fork of the job gives rise to a random number of tasks that can be processed independently on any of the computers. Since exact analysis of fork-join models is known to be intractable, the authors res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NETRA: a hierarchical and partitionable architecture for computer vision systems

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

    Computer vision is regarded as one of the most complex and computationally intensive problems. In general, a Computer Vision System (CVS) attempts to relate scene(s) in terms of model(s). A typical CVS employs algorithms from a very broad spectrum such as numerical, image processing, graph algorithms, symbolic processing, and artificial intelligence. The authors present a multiprocessor architectu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An availability model for MIN-based multiprocessors

    Publication Year: 1993, Page(s):1118 - 1129
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1080 KB)

    System decomposition is a novel technique for modeling the dependability of complex systems without constructing a single-level Markov Chain (MC). This is demonstrated in this paper for the availability computation of a class of multiprocessors that uses 4×4 switching elements for the multistage interconnection network (MIN). The availability model is known as task-based availability, where ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal architectures and algorithms for mesh-connected parallel computers with separable row/column buses

    Publication Year: 1993, Page(s):1073 - 1080
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    A two-dimensional mesh of processing elements (PE's) with separable row and column buses (i.e., broadcast mechanisms for rows and columns that can be logically divided into a number of local buses through the use of PE-controlled switches) has been shown to be quite effective for semigroup computation, prefix computation, and a wide class of other computations that do not require excessive communi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new graph approach to minimizing processor fragmentation in hypercube multiprocessors

    Publication Year: 1993, Page(s):1165 - 1171
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    The authors propose a new approach for subcube and noncubic processor allocations for hypercube multiprocessors. The main idea is to represent available processors in the system by means of a prime cube graph (PC-graph). The PC-graph maintains the inter-relationships between free subcubes and hence reduces both internal and external processor fragmentations. Their simulation results show that the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving memory utilization in cache coherence directories

    Publication Year: 1993, Page(s):1130 - 1146
    Cited by:  Papers (3)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1732 KB)

    Efficiently maintaining cache coherence is a major problem in large-scale shared memory multiprocessors. Hardware directory coherence schemes have very high memory requirements, while software-directed schemes must rely on imprecise compile-time memory disambiguation. Recently proposed dynamically tagged directory schemes allocate pointers to blocks only as they are referenced, which significantly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HARP: an open architecture for parallel matrix and signal processing

    Publication Year: 1993, Page(s):1081 - 1091
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB)

    Describes and analyzes the Hybrid Array Ring Processor (HARP) architecture. The HARP is an application specific architecture built around a host processor, shared memory, and a set of memory mapped processing cells that are connected both into an open backplane and a bidirectional systolic ring. The architecture is analyzed through detailed simulation of a system implementation based on the Texas ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal routing algorithm and the diameter of the cube-connected cycles

    Publication Year: 1993, Page(s):1172 - 1178
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    Communication between processors is one of the most important issues in parallel and distributed systems. The authors study the communication aspects of a well known multiprocessor structure, the cube-connected cycles (CCC). Only nonoptimal routing algorithms and bounds on the diameter of restricted subclasses of the CCC have been presented in earlier work. The authors present an optimal routing a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A family of parallel prefix algorithms embedded in networks

    Publication Year: 1993, Page(s):1179 - 1184
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    This paper presents a family of algorithms for producing, from (υ0, υ1, ..., υn-1), all initial prefixes xi0θυ1 θ···θυi (i=0, 1, ..., n-1) in parallel in interconnection networks such as the omega network and the hypercube, where θ is an associat... 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