By Topic

Parallel and Distributed Systems, IEEE Transactions on

Issue 8 • Date Aug. 2009

Filter Results

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

    Publication Year: 2009 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (317 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2009 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (78 KB)  
    Freely Available from IEEE
  • Editor's Note

    Publication Year: 2009 , Page(s): 1073 - 1074
    Save to Project icon | Request Permissions | PDF file iconPDF (88 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • The Proportional-Share Allocation Market for Computational Resources

    Publication Year: 2009 , Page(s): 1075 - 1088
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (981 KB) |  | HTML iconHTML  

    We study the problem of allocating shared resources, such as bandwidth in computer networks and computational resources in shared clusters, among multiple users by the proportional-share market mechanism. Under this mechanism, each user partitions his budget among the multiple resources and receives a fraction of each resource proportional to his bid. We first formulate the resource allocation gam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions

    Publication Year: 2009 , Page(s): 1089 - 1101
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2984 KB) |  | HTML iconHTML  

    The problem of sharing the cost of multicast transmissions was studied in the past, and two mechanisms, marginal cost (MC) and Shapley value (SH), were proposed to solve it. Although both of them are strategy proof mechanisms, the distributed protocols implementing them are susceptible to manipulation by autonomous nodes. We propose a distributed Shapley value mechanism in which the participating ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Fairness, Optimizing Replica Selection in Data Grids

    Publication Year: 2009 , Page(s): 1102 - 1111
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2525 KB) |  | HTML iconHTML  

    The emergence of scientific applications that produce huge volume of data files requires special attention, and leads to the problem of how to manage and share such data files in wide area properly. In large-scale Grid, data replication provides a suitable solution for managing data files where data reliability and data availability are enhanced. Replica selection is one of the major functions of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SORD: A Fault-Resilient Service Overlay for MediaPort Resource Discovery

    Publication Year: 2009 , Page(s): 1112 - 1125
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2953 KB) |  | HTML iconHTML  

    This paper proposes a new fault-resilient service overlay for MediaPort resource discovery that allows services to be efficiently and accurately located. MediaPorts are network-side functions used in the path between the source (media server) and the sink (media client). MediaPorts enable the adaptation of media content by providing value-added services such as caching, synchronization, and specia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fat H-Tree: A Cost-Efficient Tree-Based On-Chip Network

    Publication Year: 2009 , Page(s): 1126 - 1141
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (5549 KB) |  | HTML iconHTML  

    The topological explorations of on-chip networks are important for efficiently using their enormous wire resources for low-latency and high-throughput communications using a modest silicon budget. In this paper, we propose a novel tree-based interconnection network called Fat H-Tree that meets these requirements. A Fat H-Tree provides a torus structure by combining two folded H-Tree networks and i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fei Teng 64 Stream Processing System: Architecture, Compiler, and Programming

    Publication Year: 2009 , Page(s): 1142 - 1157
    Cited by:  Papers (6)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3559 KB) |  | HTML iconHTML  

    The stream architecture is a novel microprocessor architecture with wide application potential. It is critical to study how to use the stream architecture to accelerate scientific computing programs. However, existing stream processors and stream programming languages are not designed for scientific computing. To address this issue, we design and implement a 64-bit stream processor, Fei Teng 64 (F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

    Publication Year: 2009 , Page(s): 1158 - 1172
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2490 KB) |  | HTML iconHTML  

    Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application tasks with dependences. These applications exhibit both task and data parallelism, and combining these two (also called mixed parallelism) has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task and data paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

    Publication Year: 2009 , Page(s): 1173 - 1187
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2971 KB) |  | HTML iconHTML  

    We present an efficient and practical lock-free method for semiautomatic (application-guided) memory reclamation based on reference counting, aimed for use with arbitrary lock-free dynamic data structures. The method guarantees the safety of local as well as global references, supports arbitrary memory reuse, uses atomic primitives that are available in modern computer systems, and provides an upp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multipath Dissemination in Regular Mesh Topologies

    Publication Year: 2009 , Page(s): 1188 - 1201
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3174 KB) |  | HTML iconHTML  

    Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The quality of service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite the presence of multiple shortest paths in a system, we show that thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An In-Network Querying Framework for Wireless Sensor Networks

    Publication Year: 2009 , Page(s): 1202 - 1215
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2356 KB) |  | HTML iconHTML  

    In contrast to traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, the new generation of information processing applications such as pursuit-evasion games, tracking, evacuation, and disaster relief applications require in-network information storage and querying. Due to the resource limitations of WSNs, it is challenging to implement in-network... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous Corona Training Protocols in Wireless Sensor and Actor Networks

    Publication Year: 2009 , Page(s): 1216 - 1230
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2641 KB) |  | HTML iconHTML  

    Scalable energy-efficient training protocols are proposed for wireless networks consisting of sensors and a single actor, where the sensors are initially anonymous and unaware of their location. The protocols are based on an intuitive coordinate system imposed onto the deployment area, which partitions the sensors into clusters. The protocols are asynchronous, in the sense that the sensors wake up... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CSDA Certification [advertisement]

    Publication Year: 2009 , Page(s): 1231
    Save to Project icon | Request Permissions | PDF file iconPDF (90 KB)  
    Freely Available from IEEE
  • CSDP Certification [advertisement]

    Publication Year: 2009 , Page(s): 1232
    Save to Project icon | Request Permissions | PDF file iconPDF (81 KB)  
    Freely Available from IEEE
  • TPDS Information for authors

    Publication Year: 2009 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (78 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2009 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (317 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