By Topic

Parallel and Distributed Systems, IEEE Transactions on

Issue 2 • Date Feb. 2010

Filter Results

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

    Publication Year: 2010 , Page(s): c1
    Request Permissions | PDF file iconPDF (148 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2010 , Page(s): c2
    Request Permissions | PDF file iconPDF (200 KB)  
    Freely Available from IEEE
  • Editor's Note: How to Write Research Articles in Computing and Engineering Disciplines

    Publication Year: 2010 , Page(s): 145 - 147
    Request Permissions | PDF file iconPDF (61 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Efficient Broadcasting Using Network Coding and Directional Antennas in MANETs

    Publication Year: 2010 , Page(s): 148 - 161
    Cited by:  Papers (13)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2975 KB) |  | HTML iconHTML  

    In this paper, we consider the issue of efficient broadcasting in mobile ad hoc networks (MANETs) using network coding and directional antennas. Network coding-based broadcasting focuses on reducing the number of transmissions each forwarding node performs in the multiple source/multiple message broadcast application, where each forwarding node combines some of the received messages for transmissi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time and Space Lower Bounds for Implementations Using k-CAS

    Publication Year: 2010 , Page(s): 162 - 173
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (583 KB) |  | HTML iconHTML  

    This paper presents lower bounds on the time and space complexity of implementations that use k-compare&swap (k-CAS) synchronization primitives. We prove that using k-CAS primitives can improve neither the time nor the space complexity of implementations of widely used concurrent objects, such as counter, stack, queue, and collect. Surprisingly, overly restrictive use of k-CAS may even increas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward Automated Anomaly Identification in Large-Scale Systems

    Publication Year: 2010 , Page(s): 174 - 187
    Cited by:  Papers (15)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2332 KB) |  | HTML iconHTML  

    When a system fails to function properly, health-related data are collected for troubleshooting. However, it is challenging to effectively identify anomalies from the voluminous amount of noisy, high-dimensional data. The traditional manual approach is time-consuming, error-prone, and even worse, not scalable. In this paper, we present an automated mechanism for node-level anomaly identification i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication Requirements and Interconnect Optimization for High-End Scientific Applications

    Publication Year: 2010 , Page(s): 188 - 202
    Cited by:  Papers (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4175 KB) |  | HTML iconHTML  

    The path toward realizing next-generation petascale and exascale computing is increasingly dependent on building supercomputers with unprecedented numbers of processors. To prevent the interconnect from dominating the overall cost of these ultrascale systems, there is a critical need for scalable interconnects that capture the communication requirements of ultrascale applications. It is, therefore... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PEACE: A Novel Privacy-Enhanced Yet Accountable Security Framework for Metropolitan Wireless Mesh Networks

    Publication Year: 2010 , Page(s): 203 - 215
    Cited by:  Papers (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (903 KB) |  | HTML iconHTML  

    Recently, multihop wireless mesh networks (WMNs) have attracted increasing attention and deployment as a low-cost approach to provide broadband Internet access at metropolitan scale. Security and privacy issues are of most concern in pushing the success of WMNs for their wide deployment and for supporting service-oriented applications. Despite the necessity, limited security research has been cond... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Distributed Protocol to Serve Dynamic Groups for Peer-to-Peer Streaming

    Publication Year: 2010 , Page(s): 216 - 228
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2687 KB) |  | HTML iconHTML  

    Peer-to-peer (P2P) streaming has been widely deployed over the Internet. A streaming system usually has multiple channels, and peers may form multiple groups for content distribution. In this paper, we propose a distributed overlay framework (called SMesh) for dynamic groups where users may frequently hop from one group to another while the total pool of users remain stable. SMesh first builds a r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Caching in Wireless P2P Networks: Design, Implementation, and Evaluation

    Publication Year: 2010 , Page(s): 229 - 241
    Cited by:  Papers (27)  |  Patents (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3019 KB) |  | HTML iconHTML  

    Some recent studies have shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. However, all these studies are at a very high level, leaving many design and implementation issues unanswered. In this paper, we present our design and implementation of cooperative cache in wireless P2P networks, and propose solutions to find... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks

    Publication Year: 2010 , Page(s): 242 - 256
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2356 KB) |  | HTML iconHTML  

    Consistent hashing-based DHT networks have an inherent load balancing problem. The problem becomes more severe in heterogeneous networks with nonuniform and time-varying popular files. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an elastic routing table (ERT) mechanism for query load balancin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Channel-Aware Scheduling Algorithms for HDR-WPAN

    Publication Year: 2010 , Page(s): 257 - 274
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (7221 KB) |  | HTML iconHTML  

    In this paper, we consider the performances in terms of system throughput and response time of various channel-aware scheduling algorithms for both MPEG streams and non-MPEG flows in a high-data-rate (HDR) wireless personal area network (WPAN). The algorithms under investigation are the shortest remaining processing time rule, the exponential rule, the modified largest weighted delay first rule, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation

    Publication Year: 2010 , Page(s): 275 - 287
    Cited by:  Papers (44)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1690 KB) |  | HTML iconHTML  

    A sensor in wireless sensor networks (WSNs) periodically produces data as it monitors its vicinity. The basic operation in such a network is the systematic gathering (with or without in-network aggregation) and transmitting of sensed data to a base station for further processing. A key challenging question in WSNs is to schedule nodes' activities to reduce energy consumption. In this paper, we foc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 7 Great Reasons for Joining the IEEE Computer Society [advertisement]

    Publication Year: 2010 , Page(s): 288
    Request Permissions | PDF file iconPDF (604 KB)  
    Freely Available from IEEE
  • TPDS Information for authors

    Publication Year: 2010 , Page(s): c3
    Request Permissions | PDF file iconPDF (200 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2010 , Page(s): c4
    Request Permissions | PDF file iconPDF (148 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