By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 8 • Aug. 2008

Filter Results

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

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

    Publication Year: 2008, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • Mutual Anonymity for Mobile P2P Systems

    Publication Year: 2008, Page(s):1009 - 1019
    Cited by:  Papers (13)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2369 KB) | HTML iconHTML

    Mobile peer-to-peer networks (MOPNETs) have become popular applications due to their ease of communication and resource sharing patterns in unfixed network infrastructures. As privacy and security are coming under increasing attention, many mobile and ad hoc network protocols attempt to provide mutual anonymity for users. Most existing anonymous designs, however, are path based, where the anonymou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Sustained QoS Guarantees in Operated IEEE 802.11 Wireless LANs

    Publication Year: 2008, Page(s):1020 - 1033
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2297 KB) | HTML iconHTML

    Most of QoS-capable IEEE 802.11 MAC protocols are unable to deliver sustained quality of service while maintaining high network utilization, particularly under congested network conditions. The problem often resides in the fact that flows belonging to the same service class are assigned the same MAC parameters regardless theirs respective bitrate, which leads to throughput fairness rather than per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode

    Publication Year: 2008, Page(s):1034 - 1043
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1374 KB) | HTML iconHTML

    We consider the continuously delivery message dissemination (CDMD) problem over the n processor single-port complete (all links are present and are bi-directional) static network with the multicasting communication primitive. This problem has been shown to be NP-complete even when all messages have equal length. For the CDMD problem we present an efficient approximation algorithm to construct a me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending the TokenCMP Cache Coherence Protocol for Low Overhead Fault Tolerance in CMP Architectures

    Publication Year: 2008, Page(s):1044 - 1056
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2686 KB) | HTML iconHTML

    It is widely accepted that transient failures will appear more frequently in chips designed in the near future due to several factors such as the increased integration scale. On the other hand, chip-multiprocessors (CMP) that integrate several processor cores in a single chip are nowadays the best alternative to more efficient use of the increasing number of transistors that can be placed in a sin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of Distributed Floor Control Protocols on Overlay Networks

    Publication Year: 2008, Page(s):1057 - 1070
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1770 KB) | HTML iconHTML

    Collaborative multimedia applications (CMAs) on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include networked games and collaborative design and simulation. An important challenge in realizing CMAs is obtaining floor control, a problem in which the end-users compete among themselves to gain exclusive access to a shar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links

    Publication Year: 2008, Page(s):1071 - 1085
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1302 KB) | HTML iconHTML

    Let k ges 4 be even and let n ges 2. Consider a faulty k-ary n-cube Qk n in which the number of node faults fv and the number of link faults fe are such that fv + fe les 2n-2. We prove that given any two healthy nodes s and e of Qk n, there is a path from s to e of length at least kn - 2 fv -1 (respe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating Dynamic Task Mapping in Network Processor Runtime Systems

    Publication Year: 2008, Page(s):1086 - 1098
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2789 KB) | HTML iconHTML

    Modern network processor systems require the ability to adapt their processing capabilities at runtime to changes in network traffic. Traditionally, network processor applications have been optimized for a single static workload scenario, but recently several approaches for runtime adaptation have been proposed. Comparing these approaches and developing novel runtime support algorithms is difficul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tree-Based Peer-to-Peer Network with Quality Guarantees

    Publication Year: 2008, Page(s):1099 - 1110
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2115 KB) | HTML iconHTML

    Peer-to-peer (P2P) networks often demand scalability, low communication latency among nodes, and low systemwide overhead. For scalability, a node maintains partial states of a P2P network and connects to a few nodes. For fast communication, a P2P network intends to reduce the communication latency between any two nodes as much as possible. With regard to a low systemwide overhead, a P2P network mi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Framework to Provide Quality of Service over Advanced Switching

    Publication Year: 2008, Page(s):1111 - 1123
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2556 KB) | HTML iconHTML

    Advanced switching (AS) is a network technology that expands the capabilities of PCI-express adding new features like peer-to-peer communication. Together, PCI express and AS have the potential for building the next generation interconnects. Furthermore, the provision of quality of service (QoS) in computing and communication environments is currently the focus of much discussion and research in i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems

    Publication Year: 2008, Page(s):1124 - 1135
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1760 KB) | HTML iconHTML

    The scheduling of arbitrarily divisible loads on a distributed system is studied by Divisible Load Theory (DLT). DLT has the underlying assumption that the processors will not cheat. In the real world, this assumption is unrealistic as the processors are owned and operated by autonomous rational organizations that have no a priori motivation for cooperation. Consequently, they will manipulate the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Distributed Random Grouping for Aggregate Computation on Wireless Sensor Networks with Randomly Changing Graphs

    Publication Year: 2008, Page(s):1136 - 1149
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2069 KB) | HTML iconHTML

    Dynamical connection graph changes are inherent in networks such as peer-to-peer networks, wireless ad hoc networks, and wireless sensor networks. Considering the influence of the frequent graph changes is thus essential for precisely assessing the performance of applications and algorithms on such networks. In this paper, using stochastic hybrid systems (SHSs), we model the dynamics and analyze t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers for a Special Issue on Distributed Cyber-Physical Systems

    Publication Year: 2008, Page(s):1150 - 1151
    Request permission for commercial reuse | PDF file iconPDF (33 KB)
    Freely Available from IEEE
  • Silver Bullet Security Podcast Series

    Publication Year: 2008, Page(s): 1152
    Request permission for commercial reuse | PDF file iconPDF (1080 KB)
    Freely Available from IEEE
  • TPDS Information for authors

    Publication Year: 2008, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2008, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (92 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