By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 5 • Date May 2003

Filter Results

Displaying Results 1 - 7 of 7
  • Real-time digital signal processing of phased array radars

    Publication Year: 2003, Page(s):433 - 446
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2856 KB) | HTML iconHTML

    With the advance of hardware and software technology, modern phased array radars are now built with commercial-off-the-shelf (COTS) components, and it opens up a new era in real-time resource scheduling of digital signal processing. This paper targets the essential issues in building a component-oriented signal processor (SP), which is one of the two major modules in modern phased array radars. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Split-path enhanced pipeline scheduling

    Publication Year: 2003, Page(s):447 - 462
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2599 KB) | HTML iconHTML

    Software pipelining increases the loop execution throughput by overlapping the execution of successive iterations in a pipelined fashion. For loops with control flows, however, software pipelining is not straightforward because we need to consider the overlap of more than one execution path. Modulo scheduling simply transforms them into straightline loops through if-conversion which, in effect, ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quorum-based algorithms for group mutual exclusion

    Publication Year: 2003, Page(s):463 - 476
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2643 KB) | HTML iconHTML

    We propose a quorum system, which we referred to as the surficial quorum system, for group mutual exclusion. The surficial quorum system is geometrically evident and is easy to construct. It also has a nice structure based on which a truly distributed algorithm for group mutual exclusion can be obtained and processed loads can be minimized. When used with Maekawa's algorithm, the surficial quorum ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information-flow models for shared memory with an application to the PowerPC architecture

    Publication Year: 2003, Page(s):502 - 515
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    This paper introduces a generic framework for defining instructions, programs, and the semantics of their instantiation by operations in a multiprocessor environment. The framework captures information flow between operations in a multiprocessor program by means of a reads-from mapping from read operations to write operations. Two fundamental relations are defined on the operations: a program orde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multihop all-to-all broadcast on WDM optical networks

    Publication Year: 2003, Page(s):477 - 486
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB) | HTML iconHTML

    Wavelength-division multiplexing (WDM) optical networks provide huge bandwidth by allowing multiple data streams transmitted simultaneously along the same optical fiber, with each stream assigned a distinct wavelength. A key issue on WDM optical networks is to minimize the number of wavelengths for communications. All-to-all broadcast (gossiping) is a fundamental communication application on compu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design of a high-performance adaptive router for CC-NUMA multiprocessors

    Publication Year: 2003, Page(s):487 - 501
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3652 KB) | HTML iconHTML

    This work presents the design and evaluation of an adaptive packet router aimed at supporting CC-NUMA traffic. We exploit a simple and efficient packet injection mechanism to avoid deadlock, which leads to a fully, adaptive routing by employing only three virtual channels. In addition, we selectively use output buffers for implementing the most utilized virtual paths in order to reduce head-of-lin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed initialization algorithms for single-hop ad hoc networks with minislotted carrier sensing

    Publication Year: 2003, Page(s):516 - 528
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2618 KB) | HTML iconHTML

    An ad hoc network is a self-organized and distributed entity, consisting of n mobile stations (MSs) without the coordination of any centralized access point. Initialization is one of the fundamental tasks to set up an ad hoc network, which involves assigning each of the n MSs a distinct ID number from 1 to n, distributedly. In Nakano et al. (2000), randomized initialization protocols are developed... 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