By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 3 • Date Mar 1995

Filter Results

Displaying Results 1 - 8 of 8
  • A fast parallel algorithm for routing unicast assignments in Benes networks

    Publication Year: 1995, Page(s):329 - 334
    Cited by:  Papers (11)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    This paper presents a new parallel algorithm for routing unicast (one-to-one) assignments in Benes networks. Parallel routing algorithms for such networks were reported earlier, but these algorithms were designed primarily to route permutation assignments. The routing algorithm presented in this paper removes this restriction without an increase in the order of routing cost or routing time. We rea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed synchronous clocking

    Publication Year: 1995, Page(s):314 - 328
    Cited by:  Papers (49)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1224 KB)

    It has historically been difficult to distribute a well-aligned hardware clock throughout the physical extent of a synchronous processor. Traditionally, this task has been accomplished by distributing the output of a central oscillator over a tree-like network, with repeaters at necessary intervals. While straightforward in concept, this method suffers from poor reliability, poor scalability and h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal instruction scheduler for superscalar processor

    Publication Year: 1995, Page(s):303 - 313
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    Performance in superscalar processing strongly depends on the compiler's ability to generate codes that can be executed by hardware in an optimal or near optimal order. Generating optimal code is an NP-complete problem. However, there is a need for highly optimized code, such as in superscalar or real-time systems. In this paper, an instruction scheduling scheme for optimizing a program trace is p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding-based replication schemes for distributed systems

    Publication Year: 1995, Page(s):240 - 251
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    Data is often replicated in distributed systems to improve availability and performance. This replication is expensive in terms of disk storage since the existing schemes generally require full files to be stored at each site. In this paper, we present schemes which significantly reduce the storage requirements in replication based systems. These schemes use the coding method suggested by Rabin to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting fault-tolerant parallel programming in Linda

    Publication Year: 1995, Page(s):287 - 302
    Cited by:  Papers (36)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1680 KB)

    Linda is a language for programming parallel applications whose most notable feature is a distributed shared memory called tuple space. While suitable for a wide variety of programs, one shortcoming of the language as commonly defined and implemented is a lack of support for writing programs that can tolerate failures in the underlying computing platform. This paper describes FT-Linda, a version o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advanced array optimizations for high performance functional languages

    Publication Year: 1995, Page(s):229 - 239
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    We discuss and evaluate three optimizations for reducing memory management overhead and data copying costs in SISAL 1.2 programs that build arrays. The first, called framework preconstruction, eliminates superfluous allocate-deallocate sequences in cyclic computations. The second, called aggregate storage subsumption, reduces the management overhead for compound array components. The third, called... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal simulation of full binary trees on faulty hypercubes

    Publication Year: 1995, Page(s):269 - 286
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1540 KB)

    We study the problem of running full binary tree based algorithms on a hypercube with faulty nodes. The key to this problem is to devise a method for embedding a full binary tree into the faulty hypercube. Based on a novel embedding strategy, we present two results for embedding an (n-1) tree fa full binary tree with 2n-1 nodes) into an n-cube (a hypercube with 2n nodes) with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a multipath network for reducing the effects of hot spots

    Publication Year: 1995, Page(s):252 - 268
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1556 KB)

    One type of interconnection network for a medium to large-scale parallel processing system (i.e., a system with 26 to 216 processors) is a buffered packet-switched multistage interconnection network (MIN). It has been shown that the performance of these networks is satisfactory for uniform network traffic. More recently, several studies have indicated that the performance of ... 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