By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 6 • June 2010

Filter Results

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

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

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

    Publication Year: 2010, Page(s):737 - 738
    Request permission for commercial reuse | PDF file iconPDF (140 KB) | HTML iconHTML
    Freely Available from IEEE
  • Buffer Management Strategies to Reduce HoL Blocking

    Publication Year: 2010, Page(s):739 - 753
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4113 KB) | HTML iconHTML

    Congestion management is likely to become a critical issue in interconnection networks, as increasing power consumption and cost concerns lead to improvements in the efficiency of network resources. In previous configurations, networks were usually oversized and underutilized. In a smaller network, however, contention is more likely to occur and blocked packets cause head-of-line (HoL) blocking am... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-Domain Data Sharing in Distributed Electronic Health Record Systems

    Publication Year: 2010, Page(s):754 - 764
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (610 KB) | HTML iconHTML

    Cross-organization or cross-domain cooperation takes place from time to time in Electronic Health Record (EHR) system for necessary and high-quality patient treatment. Cautious design of delegation mechanism must be in place as a building block of cross-domain cooperation, since the cooperation inevitably involves exchanging and sharing relevant patient data that are considered highly private and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Update Scheduling for Improving Consistency in Distributed Virtual Environments

    Publication Year: 2010, Page(s):765 - 777
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2441 KB) | HTML iconHTML

    The fundamental goal of distributed virtual environments (DVEs) is to create a common and consistent presentation of the virtual world among a set of computers interconnected by a network. This paper investigates update scheduling algorithms to make efficient use of network capacity and improve consistency in DVEs. Our approach is to schedule state updates according to their potential impacts on c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Benefit of Processor Coallocation in Multicluster Grid Systems

    Publication Year: 2010, Page(s):778 - 789
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2107 KB) | HTML iconHTML

    In multicluster grid systems, parallel applications may benefit from processor coallocation, that is, the simultaneous allocation of processors in multiple clusters. Although coallocation allows the allocation of more processors than available in a single cluster, it may severely increase the execution time of applications due to the relatively slow wide-area communication. The aim of this paper i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum Latency Gossiping in Radio Networks

    Publication Year: 2010, Page(s):790 - 800
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1436 KB) | HTML iconHTML

    We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and the objective is to distribute each node's message to the entire network with minimum latency. We studied this problem in the unit-size message model and the unit disk graph model. The unit-size model means different message... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable Broadcast in Radio Networks with Locally Bounded Failures

    Publication Year: 2010, Page(s):801 - 811
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1549 KB) | HTML iconHTML

    This paper studies the reliable broadcast problem in a radio network with locally bounded failures. We present a sufficient condition for achievability of reliable broadcast in a general graph subject to Byzantine/crash-stop failures. We then consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Global Contribution Approach to Maintain Fairness in P2P Networks

    Publication Year: 2010, Page(s):812 - 826
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4423 KB) | HTML iconHTML

    For many P2P systems, implementing right incentives and policies to promote efficient and fair resource sharing is the key to improve the overall system performance. In this paper, we propose a points-based incentive mechanism named Global Contribution (GC) approach that efficiently and naturally maintains fairness in a P2P network. In this approach, a proposed GC algorithm first calculates a glob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems

    Publication Year: 2010, Page(s):827 - 840
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1437 KB) | HTML iconHTML

    In peer-to-peer file sharing systems, file replication technology is widely used to reduce hot spots and improve file query efficiency. Most current file replication methods replicate files in all nodes or two end points on a client-server query path. However, these methods either have low effectiveness or come at a cost of high overhead. File replication in server side enhances replica hit rate, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Swarming for Massive Content Distribution

    Publication Year: 2010, Page(s):841 - 856
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1532 KB) | HTML iconHTML

    A distinct trend has emerged that the Internet is used to transport data on a more and more massive scale. Capacity shortage in the backbone networks has become a genuine possibility, which will be more serious with fiber-based access. The problem addressed in this paper is how to conduct massive content distribution efficiently in the future network environment, where the capacity limitation can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Streamline: An Optimal Distribution Algorithm for Peer-to-Peer Real-Time Streaming

    Publication Year: 2010, Page(s):857 - 871
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2561 KB) | HTML iconHTML

    In this paper, we propose and evaluate an overlay distribution algorithm for P2P, chunk-based, streaming systems over forest-based topologies. In such systems, the stream is divided in chunks; chunks are delivered by each node in a store-and-forward way. A relaying node starts distributing a chunk only when it has completed its reception from another node. Peers are logically organized in a forest... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isoefficiency Maps for Divisible Computations

    Publication Year: 2010, Page(s):872 - 880
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1616 KB) | HTML iconHTML

    In this paper, we propose a new technique of presenting performance relationships in parallel processing. Performance of parallel processing is a hard matter with many counterintuitive phenomena. It is relatively easy to obtain some numerical indicators of the performance using various performance models. However, it is far more difficult to comprehend the nature of the analyzed problem. To facili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks

    Publication Year: 2010, Page(s):881 - 896
    Cited by:  Papers (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2830 KB) | HTML iconHTML

    Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood information for packet forwarding can achieve a high efficiency in geographic routing, but may not be appropriate for WSNs in highly dynamic scenarios where network topology changes frequently due to nodes mobility and availabili... 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: 2010, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (140 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2010, 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.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology