By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 12 • Date Dec. 2001

Filter Results

Displaying Results 1 - 11 of 11
  • Author index

    Publication Year: 2001, Page(s):1332 - 1335
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 2001, Page(s):1335 - 1341
    Request permission for commercial reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • Parallel processing of adaptive meshes with load balancing

    Publication Year: 2001, Page(s):1269 - 1280
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (767 KB) | HTML iconHTML

    Many scientific applications involve grids that lack a uniform underlying structure. These applications are often also dynamic in nature in that the grid structure significantly changes between successive phases of execution. In parallel computing environments, mesh adaptation of unstructured grids through selective refinement/coarsening has proven to be an effective approach. However, achieving l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiler-directed Collective-I/O

    Publication Year: 2001, Page(s):1318 - 1331
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (885 KB) | HTML iconHTML

    Current approaches to parallel I/O demand extensive user effort to obtain acceptable performance. This is in part due to difficulties in understanding the characteristics of a wide variety of I/O devices and in part due to inherent complexity of I/O software. While parallel I/O systems provide users with environments where persistent data sets can be shared between parallel processors, the ultimat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • L2 vector median filters on arrays with reconfigurable optical buses

    Publication Year: 2001, Page(s):1281 - 1292
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1565 KB) | HTML iconHTML

    In spite of their good filtering characteristics for vector-valued image processing, the usability of vector median filters is limited by their high computational complexity. Given an N × N image and a W × W window, the computational complexity of vector median filter is O(W4N2). In this paper, we design three fast and efficient parallel algorithms for vector medi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiler-assisted multiple instruction word retry for VLIW architectures

    Publication Year: 2001, Page(s):1293 - 1304
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3064 KB) | HTML iconHTML

    Very Long Instruction Word (VLIW) architectures can enhance performance by exploiting fine-grained instruction level parallelism. In this paper, we describe a compiler assisted multiple instruction word retry scheme for VLIW architectures. A read buffer is used to resolve the more frequent on-path hazards, while the compiler resolves the remaining branch hazards. Performance evaluation is describe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speculative Versioning Cache

    Publication Year: 2001, Page(s):1305 - 1317
    Cited by:  Papers (9)  |  Patents (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (731 KB) | HTML iconHTML

    Dependences among loads and stores whose addresses are unknown hinder the extraction of instruction level parallelism during the execution of a sequential program. Such ambiguous memory dependences can be overcome by memory dependence speculation which enables a load or store to be speculatively executed before the addresses of all preceding loads and stores are known. Furthermore, multiple specul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Controlling aggregation in distributed object systems: a graph-based approach

    Publication Year: 2001, Page(s):1236 - 1255
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1091 KB) | HTML iconHTML

    The Distributed Object Kernel is a federated database system providing a set of services which allow cooperative processing across different databases. The focus of this paper is the design of a DOK security service that provides for enforcing both local security policies, related to the security of local autonomous databases, and federated security policies, governing access to data aggregates co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid algorithms for complete exchange in 2D meshes

    Publication Year: 2001, Page(s):1201 - 1218
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1113 KB) | HTML iconHTML

    Parallel algorithms for several common problems such as sorting and the FFT involve a personalized exchange of data among all the processors. Past approaches to doing complete exchange have taken one of two broad approaches: direct exchange or the indirect message-combining approaches. While combining approaches reduce the number of message startups, direct exchange minimizes the volume of data tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A delay-optimal quorum-based mutual exclusion algorithm for distributed systems

    Publication Year: 2001, Page(s):1256 - 1268
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-off in mutual exclusion algorithms. The Lamport algorithm (1978) and the Ricart-Agrawal algorithm (1981) both have a synchronization delay of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general theory for deadlock-free adaptive routing using a mixed set of resources

    Publication Year: 2001, Page(s):1219 - 1235
    Cited by:  Papers (33)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (438 KB) | HTML iconHTML

    This paper presents a theoretical framework for the design of deadlock-free fully adaptive routing algorithms for a general class of network topologies and switching techniques in a single, unified theory. A general theory is proposed that allows the design of deadlock avoidance-based as well as deadlock recovery-based wormhole and virtual cut-through adaptive routing algorithms that use a homogen... 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