By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 4 • April 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 (177 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
  • Virtual-Force-Based Geometric Routing Protocol in MANETs

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

    Routing is the foremost issue in mobile ad hoc networks (MANETs). To guarantee delivery and improve performance, most position-based routing protocols, e.g., greedy-face-greedy (GFG), forward a message in greedy routing mode until the message is forwarded to a local minimum where greedy forwarding is impossible. They then switch to a less efficient mode known as face routing. Face routing requires... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AVMON: Optimal and Scalable Discovery of Consistent Availability Monitoring Overlays for Distributed Systems

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

    This paper proposes to build overlays that help in monitoring of long-term availability histories of hosts, with a focus on large-scale distributed settings where hosts may be selfish or colluding. Concretely, we target the important problems of selection and discovery of an availability monitoring overlay. We motivate six significant goals - firstly, consistency, verifiability, and randomness, in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-Aware Runtime Strategies for High-Performance Computing

    Publication Year: 2009, Page(s):460 - 473
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4699 KB) | HTML iconHTML

    As the scale of parallel systems continues to grow, fault management of these systems is becoming a critical challenge. While existing research mainly focuses on developing or improving fault tolerance techniques, a number of key issues remain open. In this paper, we propose runtime strategies for spare node allocation and job rescheduling in response to failure prediction. These strategies, toget... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting Threats in Star Graphs

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

    In this paper, we consider the problem of searching a network for intruders. We propose a strategy for capturing the intruder in the popular interconnection topology, the star network. According to the proposed strategy, a team of collaborative software agents are responsible for capturing a hostile intruder (e.g. a virus). These agents asynchronously move along the network links and the intruder ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LID Assignment in InfiniBand Networks

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

    To realize a path in an InfiniBand network, an address, known as local identifier (LID) in the InfiniBand specification, must be assigned to the destination of the path and used in the forwarding tables of intermediate switches to direct the traffic following the path. Hence, routing in InfiniBand has two components: (1) computing all paths, and (2) assigning LIDs to destinations and using them in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication-Aware Supernode Shape

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

    In this paper we revisit the supernode-shape selection problem, that has been widely discussed in bibliography. In general, the selection of the supernode transformation greatly affects the parallel execution time of the transformed algorithm. Since the minimization of the overall parallel execution time via an appropriate supernode transformation is very difficult to accomplish, researchers have ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mitigating Denial-of-Service Attacks on the Chord Overlay Network: A Location Hiding Approach

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

    Serverless distributed computing has received significant attention from both the industry and the research community. Among the most popular applications are the wide area network file systems, exemplified by CFS, Farsite and OceanStore. These file systems store files on a large collection of untrusted nodes that form an overlay network. They use cryptographic techniques to maintain file confiden... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VOVO: VCR-Oriented Video-on-Demand in Large-Scale Peer-to-Peer Networks

    Publication Year: 2009, Page(s):528 - 539
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2474 KB) | HTML iconHTML

    Most P2P Video-On-Demand (VOD) schemes mainly focus more on mending service architectures and optimizing overlays but do not carefully consider the user behavior and the benefit of prefetching strategies. As a result, they cannot better support VCR-oriented services in terms of substantive asynchronous clients, and free VCR controls for P2P VODs. In this paper, we propose VOVO, VCR-oriented VOD fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information Leakage as a Model for Quality of Anonymity Networks

    Publication Year: 2009, Page(s):540 - 552
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1067 KB) | HTML iconHTML

    Measures for anonymity in systems must be on one hand simple and concise, and on the other hand reflect the realities of real systems. Such systems are heterogeneous, as are the ways they are used, the deployed anonymity measures, and finally the possible attack methods. Implementation quality and topologies of the anonymity measures must be considered as well. We therefore propose a new measure f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

    Publication Year: 2009, Page(s):553 - 566
    Cited by:  Papers (87)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1498 KB) | HTML iconHTML

    This paper addresses the schedulability problem of periodic and sporadic real-time task sets with constrained deadlines preemptively scheduled on a multiprocessor platform composed by identical processors. We assume that a global work-conserving scheduler is used and migration from one processor to another is allowed during a task lifetime. First, a general method to derive schedulability conditio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible Deterministic Packet Marking: An IP Traceback System to Find the Real Source of Attacks

    Publication Year: 2009, Page(s):567 - 580
    Cited by:  Papers (42)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3018 KB) | HTML iconHTML

    IP traceback is the enabling technology to control Internet crime. In this paper we present a novel and practical IP traceback system called Flexible Deterministic Packet Marking (FDPM) which provides a defense system with the ability to find out the real sources of attacking packets that traverse through the network. While a number of other traceback schemes exist, FDPM provides innovative featur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditional Edge-Fault Hamiltonicity of Matching Composition Networks

    Publication Year: 2009, Page(s):581 - 592
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1644 KB) | HTML iconHTML

    A graph G is called Hamiltonian if there is a Hamiltonian cycle in G. The conditional edge-fault Hamiltonicity of a Hamiltonian graph G is the largest k such that after removing k faulty edges from G, provided that each node is incident to at least two fault-free edges, the resulting graph contains a Hamiltonian cycle. In this paper, we sketch common properties of a class of networks, called match... 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 (177 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