By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 12 • Dec. 1996

Filter Results

Displaying Results 1 - 11 of 11
  • 1996 Index IEEE Transactions on Parallel and Distributed Systems vol. 7

    Publication Year: 1996, Page(s):1 - 11
    Request permission for commercial reuse | PDF file iconPDF (1550 KB)
    Freely Available from IEEE
  • Optimal information dissemination in star and pancake networks

    Publication Year: 1996, Page(s):1292 - 1300
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    This paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide and conquer paradigm for some problems on very complex architectures as the star graph or the pancake. As applications, we introduce algorithms for broadcasting and prefix-like operations that improve the best known bounds for these problems. We also give... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A concurrent architecture for serializable production systems

    Publication Year: 1996, Page(s):1265 - 1280
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2260 KB)

    This paper presents a new production system architecture that takes advantage of modern associative memory devices to allow parallel production firing, concurrent matching, and overlap among matching, selection, and firing of productions. We prove that the results produced by the architecture are correct according to the serializability criterion. A comprehensive event driven simulator is used to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loop transformations for fault detection in regular loops on massively parallel systems

    Publication Year: 1996, Page(s):1238 - 1249
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1764 KB)

    Distributed-memory systems can incorporate thousands of processors at a reasonable cost. However, with an increasing number of processors in a system, fault detection and fault tolerance become critical issues. By replicating the computation on more than one processor and comparing the results produced by these processors, errors can be detected. During the execution of a program, due to data depe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of strong unstable predicates in distributed programs

    Publication Year: 1996, Page(s):1323 - 1333
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1224 KB)

    This paper discusses detection of global predicates in a distributed program. A run of a distributed program results in a set of sequential traces, one for each process. These traces may be combined to form many global sequences consistent with the single run of the program. A strong global predicate is true in a run if it is true for all global sequences consistent with the run. We present algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CGIN: a fault tolerant modified Gamma interconnection network

    Publication Year: 1996, Page(s):1301 - 1306
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    To improve the terminal reliability of the Gamma interconnection network (GIN), we consider altering its connecting patterns between stages to attain multiple disjoint paths between any source and destination pair. The new modified GIN, referred to as a CGIN with connecting patterns between stages exhibiting a cyclic feature, is able to tolerate any arbitrary single fault and to lift up terminal r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An application of Petri net reduction for Ada tasking deadlock analysis

    Publication Year: 1996, Page(s):1307 - 1322
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2016 KB)

    As part of our continuing research on using Petri nets to support automated analysis of Ada tasking behavior, we have investigated the application of Petri net reduction for deadlock analysis. Although reachability analysis is an important method to detect deadlocks, it is in general inefficient or even intractable. Net reduction can aid the analysis by reducing the size of the net while preservin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizing the memory behavior of compiler-parallelized applications

    Publication Year: 1996, Page(s):1224 - 1237
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2060 KB)

    Compiler-parallelized applications are increasing in importance as moderate-scale multiprocessors become common. This paper evaluates how features of advanced memory systems (e.g., longer cache lines) impact memory system behavior for applications amenable to compiler parallelization. Using full-sized input data sets and applications taken from standard benchmark suites, we measure statistics such... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mesh-connected trees: a bridge between grids and meshes of trees

    Publication Year: 1996, Page(s):1281 - 1291
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1536 KB)

    The grid and the mesh of trees (or MOT) are among the best-known parallel architectures in the literature. Both of them enjoy efficient VLSI layouts, simplicity of topology, and a large number of parallel algorithms that can efficiently execute on them. One drawback of these architectures is that algorithms that perform best on one of them do not perform very well on the other. Thus there is a gap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data forwarding in scalable shared-memory multiprocessors

    Publication Year: 1996, Page(s):1250 - 1264
    Cited by:  Papers (23)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2292 KB)

    Scalable shared-memory multiprocessors are often slowed down by long-latency memory accesses. One way to cope with this problem is to use data forwarding to overlap memory accesses with computation. With data forwarding, when a processor produces a datum, in addition to updating its cache, it sends a copy of the datum to the caches of the processors that the compiler identified as consumers of it.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On parallel algorithms for single-fault diagnosis in fault propagation graph systems

    Publication Year: 1996, Page(s):1217 - 1223
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    Systems modeled as directed graphs where nodes represent components and edges represent fault propagation between components, are studied from a parallel computation viewpoint. Some of the components are equipped with alarms that ring in response to an abnormal condition. The single fault diagnosis problem is to compute the set of all potential failure sources, PS, that correspond to a ... 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