By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 12 • Date Dec. 2009

Filter Results

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

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

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • Editorial: EIC Farewell and New EIC Introduction

    Publication Year: 2009, Page(s): 1713
    Request permission for commercial reuse | PDF file iconPDF (173 KB) | HTML iconHTML
    Freely Available from IEEE
  • A Hybrid Network Architecture for File Transfers

    Publication Year: 2009, Page(s):1714 - 1725
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2441 KB) | HTML iconHTML

    In prior work, we proposed a hybrid architecture that complements the connectionless Internet with a high-speed, dynamically shared circuit-switched network for file-transfer applications. "Smallrdquo files are directed to the connectionless network while for "largerdquo files, a high-speed circuit setup is attempted. If the attempt is unsuccessful (because all circuits are already in use), the ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded-Bypass Mutual Exclusion with Minimum Number of Registers

    Publication Year: 2009, Page(s):1726 - 1737
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1593 KB) | HTML iconHTML

    A mutual exclusion mechanism that is both fair and space efficient can be highly valuable for shared memory systems under time and memory constraints such as embedded real-time systems. Several algorithms that utilize only one shared variable and guarantee a certain level of fairness have been proposed. However, these use hypothetical read-modify-write operations that have never been implemented i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Distributed Spanning Tree Structure

    Publication Year: 2009, Page(s):1738 - 1751
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1936 KB) | HTML iconHTML

    Search algorithms are a key issue to share resources in large distributed systems as peer networks. Several distributed interconnection structures and algorithms have already been studied in this context. With expanding ring algorithms, the efficiency of searches depends on the topology used to send query requests and the dynamics of the structure. In this paper, we present an interconnection stru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Stack Simulation of CMP Cache Capacity and Accessibility

    Publication Year: 2009, Page(s):1752 - 1763
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3944 KB) | HTML iconHTML

    Performance trade-offs between fast data access by local data replication and cache capacity maximization by global data sharing have been extensively studied for many-core Chip Multiprocessors (CMPs). Costly simulations over a wide spectrum of the design space are generally required to gain insight for a sound design. To lower the cost, we develop an abstract model for understanding the performan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy-Preserving Multiparty Collaborative Mining with Geometric Data Perturbation

    Publication Year: 2009, Page(s):1764 - 1776
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1865 KB) | HTML iconHTML

    In multiparty collaborative data mining, participants contribute their own data sets and hope to collaboratively mine a comprehensive model based on the pooled data set. How to efficiently mine a quality model without breaching each party's privacy is the major challenge. In this paper, we propose an approach based on geometric data perturbation and data mining service-oriented framework. The key ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovering Network Topology in the Presence of Byzantine Faults

    Publication Year: 2009, Page(s):1777 - 1789
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (717 KB) | HTML iconHTML

    We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem is an abstraction of fault-tolerant routing. We formally state the weak and strong versions of the problem. The weak version requires that either each node discovers the topology of the network or at least one node detects the presence of a faulty node. The strong version requires... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A DHT-Based Identifier-to-Locator Mapping Approach for a Scalable Internet

    Publication Year: 2009, Page(s):1790 - 1802
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1600 KB) | HTML iconHTML

    It is commonly recognized that today's Internet routing and addressing system is facing serious scaling problems, which are mainly caused by the overloading of IP address semantics. That is, an IP address represents not only the location but also the identity of a host. To address this problem, several recent schemes propose to replace the IP namespace in today's Internet with a locator namespace ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Leveraging Identity-Based Cryptography for Node ID Assignment in Structured P2P Systems

    Publication Year: 2009, Page(s):1803 - 1815
    Cited by:  Papers (7)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2041 KB) | HTML iconHTML

    Structured peer-to-peer (P2P) systems have grown enormously because of their scalability, efficiency, and reliability. These systems assign a unique identifier to each user and object. However, current assignment schemes allow an adversary to carefully select user IDs and/or simultaneously obtain many pseudo-identities-ultimately leading to an ability to disrupt the P2P system in very targeted and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Auction-Based On-Demand P2P Min-Cost Media Streaming with Network Coding

    Publication Year: 2009, Page(s):1816 - 1829
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2443 KB) | HTML iconHTML

    Realizing on-demand media streaming in a peer-to-peer (P2P) fashion is more challenging than in the case of live media streaming, since only peers with close-by media play progresses may help each other in obtaining the media content. The situation is further complicated if we wish to pursue low aggregated link cost in the transmission. In this paper, we present a new algorithmic perspective towar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Gravitational Gossip: A Gossip-Based Communication Protocol with User-Selectable Rates

    Publication Year: 2009, Page(s):1830 - 1843
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2011 KB) | HTML iconHTML

    Gossip-based communication protocols are attractive in cases where absolute delivery guarantees are not required due to their scalability, low overhead, and probabilistically high reliability. In earlier work, a gossip-based protocol known as gravitational gossip was created that allows the selection of quality ratings within subgroups based on workload and information update frequency. This paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overlapping Multihop Clustering for Wireless Sensor Networks

    Publication Year: 2009, Page(s):1844 - 1856
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3062 KB) | HTML iconHTML Multimedia Media

    Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Traditionally, clustering algorithms aim at generating a number of disjoint clusters that satisfy some criteria. In this paper, we formulate a novel clustering problem that aims at generating overlapping multihop clusters. Overlapping clusters are useful in many sensor network applicatio... 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: 2009, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • [Back cover]

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