By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 1 • Jan. 2007

Filter Results

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

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

    Publication Year: 2007, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (82 KB)
    Freely Available from IEEE
  • Editor's Note

    Publication Year: 2007, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (114 KB) | HTML iconHTML
    Freely Available from IEEE
  • Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct Volume Rendering of Unstructured Grids

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

    In this work, image-space-parallel direct volume rendering (DVR) of unstructured grids is investigated for distributed-memory architectures. A hypergraph-partitioning-based model is proposed for the adaptive screen partitioning problem in this context. The proposed model aims to balance the rendering loads of processors while trying to minimize the amount of data replication. In the parallel DVR f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Initialization and Gossiping Algorithms for Random Radio Networks

    Publication Year: 2007, Page(s):17 - 28
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (858 KB) | HTML iconHTML

    The initialization problem, also known as naming, consists to give a unique identifier ranging from 1 to n to a set of n indistinguishable nodes in a given network. We consider a network where n nodes (processors) are randomly deployed in a square (respectively, cube) X. We assume that the time is slotted and the network is synchronous, two nodes are able to communicate if they are within distance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement

    Publication Year: 2007, Page(s):29 - 43
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5825 KB) | HTML iconHTML

    Active queue management (AQM) is an effective means to enhance congestion control, and to achieve trade-off between link utilization and delay. The de facto standard, random early detection (RED), and many of its variants employ queue length as a congestion indicator to trigger packet dropping. Despite their simplicity, these approaches often suffer from unstable behaviors in a dynamic network. Ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Asynchronous Watershed Algorithm-Architecture

    Publication Year: 2007, Page(s):44 - 56
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2380 KB) | HTML iconHTML

    A joint algorithm-architecture study has resulted into a new version of a picture segmentation system complying with multimedia mobile terminal constraints, i.e., real-time computing, and low power consumption. Previously published watershed segmentation algorithms required at least three global synchronization points: minima detection, labeling and flooding. This paper presents a new fully asynch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Register Mapping and Allocation in LaTTe, an Open-Source Java Just-in-Time Compiler

    Publication Year: 2007, Page(s):57 - 69
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4139 KB) | HTML iconHTML

    Java just-in-time (JIT) compilers improve the performance of a Java virtual machine (JVM) by translating Java bytecode into native machine code on demand. One important problem in Java JIT compilation is how to map stack entries and local variables to registers efficiently and quickly, since register-based computations are much faster than memory-based ones, while JIT compilation overhead is part ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • COPACC: An Architecture of Cooperative Proxy-Client Caching System for On-Demand Media Streaming

    Publication Year: 2007, Page(s):70 - 83
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2520 KB) | HTML iconHTML

    Proxy caching is a key technique to reduce transmission cost for on-demand multimedia streaming. The effectiveness of current caching schemes, however, is limited by the insufficient storage space and weak cooperation among proxies and their clients, particularly considering the high bandwidth demands from media objects. In this paper, we propose COPACC, a cooperative proxy-and-client caching syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm-Hardware Codesign of Fast Parallel Round-Robin Arbiters

    Publication Year: 2007, Page(s):84 - 95
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2794 KB) | HTML iconHTML

    As a basic building block of a switch scheduler, a fast and fair arbiter is critical to the efficiency of the scheduler, which is the key to the performance of a high-speed switch or router. In this paper, we propose a parallel round-robin arbiter (PRRA) based on a simple binary search algorithm, which is specially designed for hardware implementation. We prove that our PRRA achieves round-robin f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiclass Multiserver Threshold-Based Systems: A Study of Noninstantaneous Server Activation

    Publication Year: 2007, Page(s):96 - 110
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4428 KB) | HTML iconHTML

    In this paper, we consider performance evaluation of a system which shares K servers (or resources) among N heterogeneous classes of workloads, where server allocation and deallocation for class i is dictated by a class specific threshold-based policy with hysteresis control. In particular, the server activation time for class i is noninstantaneous. There are many systems and applications where a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Longest Edge of Gabriel Graphs in Wireless Ad Hoc Networks

    Publication Year: 2007, Page(s):111 - 125
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (817 KB) | HTML iconHTML

    In wireless ad hoc networks, without fixed infrastructures, virtual backbones are constructed and maintained to efficiently operate such networks. The Gabriel graph (GG) is one of widely used geometric structures for topology control in wireless ad hoc networks. If all nodes have the same maximal transmission radii, the length of the longest edge of the GG is the critical transmission radius such ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2006 Reviewers List

    Publication Year: 2007, Page(s):126 - 129
    Request permission for commercial reuse | PDF file iconPDF (33 KB)
    Freely Available from IEEE
  • 2006 Annual Index

    Publication Year: 2007, Page(s):130 - 142
    Request permission for commercial reuse | PDF file iconPDF (269 KB)
    Freely Available from IEEE
  • IEEE ReadyNotes

    Publication Year: 2007, Page(s): 143
    Request permission for commercial reuse | PDF file iconPDF (289 KB)
    Freely Available from IEEE
  • IEEE Computer Society Digital Library [advertisement]

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

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

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