By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 3 • March 2008

Filter Results

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

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

    Publication Year: 2008, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (81 KB)
    Freely Available from IEEE
  • Offloading Data Distribution Management to Network Processors in HLA-Based Distributed Simulations

    Publication Year: 2008, Page(s):289 - 298
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1586 KB) | HTML iconHTML

    The high-level architecture (HLA) standard developed by the Department of Defense in the United States is a key technology to perform distributed simulation. Inside the HLA framework, many different simulators (termed federates) may be interconnected to create a single more complex simulator (federation). Data distribution management (DDM) is an optional subset of services that controls which fede... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Implementation of the 2D Discrete Wavelet Transform on Graphics Processing Units: Filter Bank versus Lifting

    Publication Year: 2008, Page(s):299 - 310
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3660 KB) | HTML iconHTML

    The widespread usage of the discrete wavelet transform (DWT) has motivated the development of fast DWT algorithms and their tuning on all sorts of computer systems. Several studies have compared the performance of the most popular schemes, known as filter bank scheme (FBS) and lifting scheme (LS), and have always concluded that LS is the most efficient option. However, there is no such study on st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks

    Publication Year: 2008, Page(s):311 - 322
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2759 KB) | HTML iconHTML

    In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in multiprotocol label switching (MPLS) networks. While performing dynamic explicit survivable routing in a distributed environment, link-state dissemination may cause a nontrivial signaling overhead in the process of exploring spare resource sharing among indivi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NFS-CD: Write-Enabled Cooperative Caching in NFS

    Publication Year: 2008, Page(s):323 - 333
    Cited by:  Papers (8)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1617 KB) | HTML iconHTML

    We present the network file system with cluster delegation (NFS-CD), an enhancement to the NFSv4 that reduces server load and increases the scalability of distributed file systems in computing clusters. The cluster delegation feature of NFS-CD allows data sharing among clients by extending the NFSv4 delegation model so that multiple clients manage a single file without interacting with the server.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Embedding Hamiltonian Cycles in Crossed Cubes

    Publication Year: 2008, Page(s):334 - 346
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2701 KB) | HTML iconHTML

    We study the embedding of Hamiltonian cycle in the Crossed Cube, which is a prominent variant of the classical hypercube, obtained by crossing some straight links of a hypercube, and has been attracting much research interest in literatures since its proposal. We will show that due to the loss of link-topology regularity, generating Hamiltonian cycles in a crossed cube is a more complicated proced... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Hashing for Scalable Multicast in Wireless Ad Hoc Networks

    Publication Year: 2008, Page(s):347 - 362
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1796 KB) | HTML iconHTML

    Several multicast protocols for mobile ad hoc networks have been proposed, which build multicast trees by using location information that is available from the Global Positioning System (GPS) or localization algorithms and use geographic forwarding to forward packets down the multicast trees. These stateless multicast protocols carry encoded membership, location, and tree information in each packe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks

    Publication Year: 2008, Page(s):363 - 377
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2876 KB) | HTML iconHTML

    Broadcast-based peer-to-peer (P2P) networks, including flat (for example, Gnutella) and two-layer superpeer implementations (for example, Kazaa), are extremely popular nowadays due to their simplicity, ease of deployment, and versatility. The unstructured network topology, however, contains many cyclic paths, which introduce numerous duplicate messages in the system. Although such messages can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overhead Analysis of Scientific Workflows in Grid Environments

    Publication Year: 2008, Page(s):378 - 393
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3038 KB) | HTML iconHTML

    Scientific workflows are a topic of great interest in the grid community that sees in the workflow model an attractive paradigm for programming distributed wide-area grid infrastructures. Traditionally, the grid workflow execution is approached as a pure best effort scheduling problem that maps the activities onto the grid processors based on appropriate optimization or local matchmaking heuristic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing Queue Oscillation at a Congested Link

    Publication Year: 2008, Page(s):394 - 407
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5173 KB) | HTML iconHTML

    Queue length oscillation at a congested link causes many undesirable properties such as large delay jitter, underutilization of the link and packet drops in burst. The main reason of this oscillation is that most queue management schemes determine the drop probability based on the current traffic without consideration on the impact of that drop probability on the future traffic. In this paper, we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalability Analysis of the Hierarchical Architecture for Distributed Virtual Environments

    Publication Year: 2008, Page(s):408 - 417
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2373 KB) | HTML iconHTML

    A distributed virtual environment (DVE) is a shared virtual environment where multiple users at their workstations interact with each other over a network. Some of these systems may support a large number of users, for example, multiplayer online games. An important issue is how well the system scales as the number of users increases. In terms of scalability, a promising system architecture is a t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Scheduling for Symmetric Multiprocessors

    Publication Year: 2008, Page(s):418 - 431
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1769 KB) | HTML iconHTML

    Hierarchical scheduling has been proposed as a scheduling technique to achieve aggregate resource partitioning among related groups of threads and applications in uniprocessor and packet scheduling environments. Existing hierarchical schedulers are not easily extensible to multiprocessor environments because 1) they do not incorporate the inherent parallelism of a multiprocessor system while resou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Digital Library [advertisement]

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

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

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