By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 3 • Date March 2005

Filter Results

Displaying Results 1 - 13 of 13
  • [Front cover]

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (158 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • Efficient algorithms for the all nearest neighbor and closest pair problems on the linear array with a reconfigurable pipelined bus system

    Publication Year: 2005, Page(s):193 - 206
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB) | HTML iconHTML

    We present two O(1)-time algorithms for solving the 2D all nearest neighbor (2D_ANN) problem, the 2D closest pair (2D_CP) problem, the 3D all nearest neighbor (3D_ANN) problem and the 3D-closest pair (3D_CP) problem of n points on the linear array with a reconfigurable pipelined bus system (LARPBS) from the computational geometry perspective. The first O(1) time algorithm, whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling divisible loads on star and tree networks: results and open problems

    Publication Year: 2005, Page(s):207 - 218
    Cited by:  Papers (68)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    Many applications in scientific and engineering domains are structured as large numbers of independent tasks with low granularity. These applications are thus amenable to straightforward parallelization, typically in master-worker fashion, provided that efficient scheduling strategies are available. Such applications have been called divisible-loads because a scheduler may divide the computation a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Workload-aware load balancing for clustered Web servers

    Publication Year: 2005, Page(s):219 - 233
    Cited by:  Papers (69)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2128 KB) | HTML iconHTML

    We focus on load balancing policies for homogeneous clustered Web servers that tune their parameters on-the-fly to adapt to changes in the arrival rates and service times of incoming requests. The proposed scheduling policy, ADAPTLOAD, monitors the incoming workload and self-adjusts its balancing parameters according to changes in the operational environment such as rapid fluctuations in the arriv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A complete compiler approach to auto-parallelizing C programs for multi-DSP systems

    Publication Year: 2005, Page(s):234 - 245
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB) | HTML iconHTML

    Auto-parallelizing compilers for embedded applications have been unsuccessful due to the widespread use of pointer arithmetic and the complex memory model of multiple-address space digital signal processors (DSPs). This work develops, for the first time, a complete auto-parallelization approach, which overcomes these issues. It first combines a pointer conversion technique with a new modulo elimin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Peer-to-peer data preservation through storage auctions

    Publication Year: 2005, Page(s):246 - 257
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB) | HTML iconHTML

    Digital archives protect important data collections from failures by making multiple copies at other archives, so that there are always several good copies of a collection. In a cooperative replication network, sites "trade" space, so that each site contributes storage resources to the system and uses storage resources at other sites. Here, we examine bid trading: a mechanism where sites conduct a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-constrained failure diagnosis in distributed embedded systems: application to actuator diagnosis

    Publication Year: 2005, Page(s):258 - 270
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1752 KB) | HTML iconHTML

    Advanced automotive control applications such as steer-by-wire are typically implemented as distributed systems comprising many embedded processors, sensors, and actuators interacting via a communication bus. They have severe cost constraints, but demand a high level of safety and performance. Motivated by the need for timely diagnosis of faulty actuators in such systems, we present a method to ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The impact of incorrectly speculated memory operations in a multithreaded architecture

    Publication Year: 2005, Page(s):271 - 285
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1616 KB) | HTML iconHTML

    The speculated execution of threads in a multithreaded architecture, plus the branch prediction used in each thread execution unit, allows many instructions to be executed speculatively, that is, before it is known whether they actually needed by the program. In this study, we examine how the load instructions executed on what turn out to be incorrectly executed program paths impact the memory sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Additions to 2004 Annual Index

    Publication Year: 2005, Page(s):286 - 287
    Request permission for commercial reuse | PDF file iconPDF (112 KB)
    Freely Available from IEEE
  • Call for Papers for Special Issue on High Performance Computational Biology

    Publication Year: 2005, Page(s): 288
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • TPDS Information for authors

    Publication Year: 2005, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2005, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (158 KB)
    Freely Available from IEEE

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