By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 4 • April 2005

Filter Results

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

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

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • Dynamic load balancing and efficient load estimators for asynchronous iterative algorithms

    Publication Year: 2005, Page(s):289 - 299
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB) | HTML iconHTML

    In a previous paper, we have shown the very high power of asynchronism for parallel iterative algorithms in a global context of grid computing. In this article, we study the interest of coupling load balancing with asynchronism in such algorithms. After proposing a noncentralized version of dynamic load balancing which is best suited to asynchronism, we verify its efficiency by some experiments on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pipelining broadcasts on heterogeneous platforms

    Publication Year: 2005, Page(s):300 - 313
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB) | HTML iconHTML

    In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macrocommunication schemes, for example, to broadcast data items. Rather than aiming at minimizing the execution time of a single broadcast, we focus on the steady-state operation. We assume that there is a large number of message... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosabilities of regular networks

    Publication Year: 2005, Page(s):314 - 323
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB) | HTML iconHTML

    In this paper, we study diagnosabilities of multiprocessor systems under two diagnosis models: the PMC model and the comparison model. In each model, we further consider two different diagnosis strategies: the precise diagnosis strategy proposed by Preparata et al. and the pessimistic diagnosis strategy proposed by Friedman. The main result of this paper is to determine diagnosabilities of regular... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth optimization for Internet traffic in generalized processor sharing servers

    Publication Year: 2005, Page(s):324 - 334
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB) | HTML iconHTML

    Bandwidth optimization is considered when several classes of Internet traffic are served in generalized processor sharing (GPS) servers. Internet traffic shows self-similar patterns that make it difficult to obtain analytical performance in GPS. Thus, for performance estimation of different classes of traffic, we use fluid simulation techniques that can reduce the simulation complexity, compared t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing algorithms on the bus-based hypercube network

    Publication Year: 2005, Page(s):335 - 348
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB) | HTML iconHTML

    In this paper, we study the properties of the bus-based hypercube, denoted as U(n,b), which is a kind of multiple-bus networks (MBN). U(n,b) consists of 2n processors and 2b buses, where 0 ≤ b ≤ n - 1, and each processor is connected to either (b+2)/2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient, proximity-aware load balancing for DHT-based P2P systems

    Publication Year: 2005, Page(s):349 - 361
    Cited by:  Papers (85)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB) | HTML iconHTML

    Many solutions have been proposed to tackle the load balancing issue in DHT-based P2P systems. However, all these solutions either ignore the heterogeneity nature of the system, or reassign loads among nodes without considering proximity relationships, or both. In this paper, we present an efficient, proximity-aware load balancing scheme by using the concept of virtual servers. To the best of our ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving source routing reliability in mobile ad hoc networks

    Publication Year: 2005, Page(s):362 - 373
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB) | HTML iconHTML

    In this paper, we propose a novel on-demand routing protocol called backup source routing (BSR) to establish and maintain backup routes that can be utilized after the primary path breaks. The key advantage of BSR is the reduction of the frequency of route discovery flooding, which is recognized as a major overhead in on-demand protocols. We define a new routing metric, called the route reliability... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shared data allocation in a mobile computing system: exploring local and global optimization

    Publication Year: 2005, Page(s):374 - 384
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB) | HTML iconHTML

    In this paper, we devise data allocation algorithms that can utilize the knowledge of user moving patterns for proper allocation of shared data in a mobile computing system. By employing the data allocation algorithms devised, the occurrences of costly remote accesses can be minimized and the performance of a mobile computing system is thus improved. The data allocation algorithms for shared data,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TPDS Information for authors

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

    Publication Year: 2005, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (142 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