By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 4 • Date Apr 2002

Filter Results

Displaying Results 1 - 8 of 8
  • Systolic opportunities for multidimensional data streams

    Publication Year: 2002, Page(s):388 - 398
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (977 KB) | HTML iconHTML

    Portable image processing applications require an efficient, scalable platform with localized computing regions. This paper presents a new class of area I/O systolic architecture to exploit the physical data locality of planar data streams by processing data where it falls. A synthesis technique using dependence graphs, data partitioning, and computation mapping is developed to handle planar data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed predicate detection in series-parallel systems

    Publication Year: 2002, Page(s):373 - 387
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    This paper addresses the problems of state space decomposition and predicate detection in a distributed computation involving asynchronous messages. We introduce a natural communication dependency which leads to the definition of the communication graph. This abstraction proves to be a useful tool to decompose the state lattice of a distributed computation into simpler structures, known as concurr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated Network Barriers

    Publication Year: 2002, Page(s):337 - 348
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (458 KB) | HTML iconHTML

    Integrated network barriers (INBs) are network protocols for parallel processors. INBs are both pipelinable and have low latency. In this paper, we show that INBs implement barriers-which ensure that all prebarrier operations of any processor appear to complete before any post-barrier operations-and we show how to construct efficient, deadlock-free barriers for any interconnection network and rout... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal tree access by elementary and composite templates in parallel memory systems

    Publication Year: 2002, Page(s):399 - 412
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    In this paper, we study efficient strategies for mapping onto parallel memory systems complete trees that are accessed by fixed templates (like complete subtrees, paths, or any combinations their of). These mappings are evaluated with respect to the following criteria: (1) the largest number of data items that can be accessed in parallel without memory conflicts; (2) the number of memory conflicts... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast gossiping in square meshes/tori with bounded-size packets

    Publication Year: 2002, Page(s):349 - 358
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    Gossiping is a communication problem in which each node has a unique message (token) to be transmitted to every other node. The nodes exchange their tokens by means of packets. A solution to the problem is judged by how many rounds of packet sending are required. In this paper, we consider a version of the problem in which small-sized packets (each carrying exactly one token) are used, the links (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Permutation-based range-join algorithms on N-dimensional meshes

    Publication Year: 2002, Page(s):413 - 431
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1227 KB) | HTML iconHTML

    We present four efficient parallel algorithms for computing a nonequijoin, called range-join, of two relations on N-dimensional mesh-connected computers. Range-joins of relations R and S are an important generalization of conventional equijoins and band-joins and are solved by permutation-based approaches in all proposed algorithms. In general, after sorting all subsets of both relations, the prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topological properties of OTIS-networks

    Publication Year: 2002, Page(s):359 - 366
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    We conduct a general study of the topological properties of optical transpose interconnection systems (OTIS). We first obtain their basic topological metrics of size, degree, shortest distance and diameter, and then we obtain results related to the recursive structure and efficient embedding of meshes, cubes, spanning trees and cycles. We also present minimal one-to-one routing and optimal broadca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair circulation of a token

    Publication Year: 2002, Page(s):367 - 372
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    Suppose that a distributed system is modeled by an undirected graph G = (V, E), where V and E, respectively, are the sets of processes and communication links. Israeli and Jalfon (1990) proposed a simple self-stabilizing mutual exclusion algorithm: a token is circulated among the processes (i.e., vertices) and a process can access the critical section only when it holds the token. In order to guar... 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