By Topic

Parallel and Distributed Systems, IEEE Transactions on

Issue 8 • Date Aug. 2012

Filter Results

Displaying Results 1 - 24 of 24
  • Cover1

    Publication Year: 2012 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (124 KB)  
    Freely Available from IEEE
  • Cover2

    Publication Year: 2012 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (156 KB)  
    Freely Available from IEEE
  • A Sequentially Consistent Multiprocessor Architecture for Out-of-Order Retirement of Instructions

    Publication Year: 2012 , Page(s): 1361 - 1368
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1188 KB) |  | HTML iconHTML  

    Out-of-order retirement of instructions has been shown to be an effective technique to increase the number of in-flight instructions. This form of runtime scheduling can reduce pipeline stalls caused by head-of-line blocking effects in the reorder buffer (ROB). Expanding the width of the instruction window can be highly beneficial to multiprocessors that implement a strict memory model, especially... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Survey of Parallel Programming Models and Tools in the Multi and Many-Core Era

    Publication Year: 2012 , Page(s): 1369 - 1386
    Cited by:  Papers (13)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (477 KB) |  | HTML iconHTML  

    In this work, we present a survey of the different parallel programming models and tools available today with special consideration to their suitability for high-performance computing. Thus, we review the shared and distributed memory approaches, as well as the current heterogeneous parallel programming model. In addition, we analyze how the partitioned global address space (PGAS) and hybrid paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cashing in on the Cache in the Cloud

    Publication Year: 2012 , Page(s): 1387 - 1399
    Cited by:  Papers (5)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2418 KB) |  | HTML iconHTML  

    Over the past decades, caching has become the key technology used for bridging the performance gap across memory hierarchies via temporal or spatial localities; in particular, the effect is prominent in disk storage systems. Applications that involve heavy I/O activities, which are common in the cloud, probably benefit the most from caching. The use of local volatile memory as cache might be a nat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost-Driven Scheduling of Grid Workflows Using Partial Critical Paths

    Publication Year: 2012 , Page(s): 1400 - 1414
    Cited by:  Papers (7)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2998 KB) |  | HTML iconHTML  

    Recently, utility Grids have emerged as a new model of service provisioning in heterogeneous distributed systems. In this model, users negotiate with service providers on their required Quality of Service and on the corresponding price to reach a Service Level Agreement. One of the most challenging problems in utility Grids is workflow scheduling, i.e., the problem of satisfying the QoS of the use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Diagnosis of Dynamic Events in Partitionable Arbitrary Topology Networks

    Publication Year: 2012 , Page(s): 1415 - 1426
    Cited by:  Papers (2)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1223 KB)  

    This work introduces the Distributed Network Reachability (DNR) algorithm, a distributed system-level diagnosis algorithm that allows every node of a partitionable arbitrary topology network to determine which portions of the network are reachable and unreachable. DNR is the first distributed diagnosis algorithm that works in the presence of network partitions and healings caused by dynamic fault ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Privacy-Preserving Access Control in Sensor Networks

    Publication Year: 2012 , Page(s): 1427 - 1438
    Cited by:  Papers (3)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2250 KB) |  | HTML iconHTML  

    The owner and users of a sensor network may be different, which necessitates privacy-preserving access control. On the one hand, the network owner need enforce strict access control so that the sensed data are only accessible to users willing to pay. On the other hand, users wish to protect their respective data access patterns whose disclosure may be used against their interests. This paper prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Beacon Mobility Scheduling for Sensor Localization

    Publication Year: 2012 , Page(s): 1439 - 1452
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2160 KB) |  | HTML iconHTML  

    In mobile-beacon assisted sensor localization, beacon mobility scheduling aims to determine the best beacon trajectory so that each sensor receives sufficient beacon signals and becomes localized with minimum delay. We propose a novel DeteRministic dynamic bEAcon Mobility Scheduling (DREAMS) algorithm, without requiring any prior knowledge of the sensory field. In this algorithm, the beacon trajec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Hardware Barrier Synchronization in Many-Core CMPs

    Publication Year: 2012 , Page(s): 1453 - 1466
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1546 KB) |  | HTML iconHTML  

    Traditional software-based barrier implementations for shared memory parallel machines tend to produce hotspots in terms of memory and network contention as the number of processors increases. This could limit their applicability to future many-core CMPs in which possibly several dozens of cores would need to be synchronized efficiently. In this work, we develop GBarrier, a hardware-based barrier ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data

    Publication Year: 2012 , Page(s): 1467 - 1479
    Cited by:  Papers (22)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (929 KB) |  | HTML iconHTML  

    Cloud computing economically enables the paradigm of data service outsourcing. However, to protect data privacy, sensitive cloud data have to be encrypted before outsourced to the commercial public cloud, which makes effective data utilization service a very challenging task. Although traditional searchable encryption techniques allow users to securely search over encrypted data through keywords, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-Efficient Topology Control in Cooperative Ad Hoc Networks

    Publication Year: 2012 , Page(s): 1480 - 1491
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1711 KB) |  | HTML iconHTML  

    Cooperative communication (CC) exploits space diversity through allowing multiple nodes cooperatively relay signals to the receiver so that the combined signal at the receiver can be correctly decoded. Since CC can reduce the transmission power and extend the transmission coverage, it has been considered in topology control protocols [1], [2]. However, prior research on topology control with CC on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring the Optimal Replication Strategy in P2P-VoD Systems: Characterization and Evaluation

    Publication Year: 2012 , Page(s): 1492 - 1503
    Cited by:  Papers (6)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2922 KB) |  | HTML iconHTML  

    P2P-Video-on-Demand (P2P-VoD) is a popular Internet service which aims to provide a scalable and high-quality service to users. At the same time, content providers of P2P-VoD services also need to make sure that the service is operated with a manageable operating cost. Given the volume-based charging model by ISPs, P2P-VoD content providers would like to reduce peers' access to the content server ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hamiltonian Decomposition of the Rectangular Twisted Torus

    Publication Year: 2012 , Page(s): 1504 - 1507
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (933 KB) |  | HTML iconHTML  

    We show that the 2atimes a rectangular twisted torus introduced by Cámara et al. [5] is edge decomposable into two Hamiltonian cycles. In the process, the 2a × a × a prismatic twisted torus is edge decomposable into three Hamiltonian cycles, and the 2a × a × a prismatic doubly twisted torus admits two edge-disjoint Hamiltonian cycles. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load Balancing Hashing in Geographic Hash Tables

    Publication Year: 2012 , Page(s): 1508 - 1519
    Cited by:  Papers (1)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (739 KB) |  | HTML iconHTML  

    In this paper, we address the problem of balancing the network traffic load when the data generated in a wireless sensor network is stored on the sensor node themselves, and accessed through querying a geographic hash table. Existing approaches allow balancing network load by changing the georouting protocol used to forward queries in the geographic hash table. However, this comes at the expense o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Memoryless Online Routing Algorithms for Delaunay Triangulations

    Publication Year: 2012 , Page(s): 1520 - 1527
    Cited by:  Papers (1)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (584 KB) |  | HTML iconHTML  

    Memoryless online routing (MOR) algorithms are suitable for the applications only using local information to find paths, and Delaunay triangulations (DTs) are the class of geometric graphs widely proposed as network topologies. Motivated by these two facts, this paper reports a variety of new MOR algorithms that work for Delaunay triangulations, thus greatly enriching the family of such algorithms... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Maximizing the Lifetime of Wireless Sensor Networks Using Virtual Backbone Scheduling

    Publication Year: 2012 , Page(s): 1528 - 1535
    Cited by:  Papers (7)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (758 KB) |  | HTML iconHTML  

    Wireless Sensor Networks (WSNs) are key for various applications that involve long-term and low-cost monitoring and actuating. In these applications, sensor nodes use batteries as the sole energy source. Therefore, energy efficiency becomes critical. We observe that many WSN applications require redundant sensor nodes to achieve fault tolerance and Quality of Service (QoS) of the sensing. However,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable RFID Systems: A Privacy-Preserving Protocol with Constant-Time Identification

    Publication Year: 2012 , Page(s): 1536 - 1550
    Cited by:  Papers (2)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (887 KB) |  | HTML iconHTML  

    In RFID literature, most “privacy-preserving” protocols require the reader to search all tags in the system in order to identify a single tag. In another class of protocols, the search complexity is reduced to be logarithmic in the number of tags, but it comes with two major drawbacks: it requires a large communication overhead over the fragile wireless channel, and the compromise of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trustworthy Coordination of Web Services Atomic Transactions

    Publication Year: 2012 , Page(s): 1551 - 1565
    Cited by:  Papers (4)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1791 KB) |  | HTML iconHTML  

    The Web Services Atomic Transactions (WS-AT) specification makes it possible for businesses to engage in standard distributed transaction processing over the Internet using Web Services technology. For such business applications, trustworthy coordination of WS-AT is crucial. In this paper, we explain how to render WS-AT coordination trustworthy by applying Byzantine Fault Tolerance (BFT) technique... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CPS Handles the Details for you [advertisement]

    Publication Year: 2012 , Page(s): 1566
    Save to Project icon | Request Permissions | PDF file iconPDF (227 KB)  
    Freely Available from IEEE
  • Stay Connected with the IEEE Computer Society [advertisement]

    Publication Year: 2012 , Page(s): 1567
    Save to Project icon | Request Permissions | PDF file iconPDF (232 KB)  
    Freely Available from IEEE
  • New Transactions Newsletter [advertisement]

    Publication Year: 2012 , Page(s): 1568
    Save to Project icon | Request Permissions | PDF file iconPDF (1647 KB)  
    Freely Available from IEEE
  • [Inside back cover]

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

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