By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 10 • Oct. 2006

Filter Results

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

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • Distributed Garbage Collection Algorithms for Timestamped Data

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

    There is an important class of interactive multimedia applications that deals with stream data from distributed sources. Indexing the data temporally facilitates ordering individual streams as well as correlating items from different streams. The Stampede programming system organizes stream data into channels that are distributed and synchronized data structures that contain timestamped items. A s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight Bounds for Critical Sections in Processor Consistent Platforms

    Publication Year: 2006, Page(s):1072 - 1083
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1161 KB) | HTML iconHTML

    Most weak memory consistency models are incapable of supporting a solution to mutual exclusion using only read and write operations to shared variables. Processor consistency-Goodman's version (PC-G) is an exception. Ahamad et al. showed that Peterson's mutual exclusion algorithm is correct for PC-G, but Lamport's bakery algorithm is not. This paper derives a lower bound on the number of and type ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Algorithm Selection Framework for Reduction Parallelization

    Publication Year: 2006, Page(s):1084 - 1096
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3334 KB) | HTML iconHTML

    Irregular and dynamic memory reference patterns can cause performance variations for low level algorithms in general and for parallel algorithms in particular. In this paper, we present an adaptive algorithm selection framework which can collect and interpret the characteristics of a particular instance of parallel reduction algorithms and select the best performing one from an existing library. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems

    Publication Year: 2006, Page(s):1097 - 1109
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3188 KB) | HTML iconHTML

    Peer-to-peer networks are widely criticized for their inefficient flooding search mechanism. Distributed hash table (DHT) algorithms have been proposed to improve the search efficiency by mapping the index of a file to a unique peer based on predefined hash functions. However, the tight coupling between indices and hosting peers incurs high maintenance cost in a highly dynamic network. To properly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PeerCluster: A Cluster-Based Peer-to-Peer System

    Publication Year: 2006, Page(s):1110 - 1123
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3074 KB) | HTML iconHTML

    This paper proposes a cluster-based peer-to-peer system, called PeerCluster, for sharing data over the Internet. In PeerCluster, all participant computers are grouped into various interest clusters, each of which contains computers that have the same interests. The intuition behind the system design is that by logically grouping users interested in similar topics together, we can improve query eff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Policies for Caching OLAP Queries in Internet Proxies

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

    The Internet now offers more than just simple information to the users. Decision makers can now issue analytical, as opposed to transactional, queries that involve massive data (such as, aggregations of millions of rows in a relational database) in order to identify useful trends and patterns. Such queries are often referred to as Online-analytical processing (OLAP). Typically, pages carrying quer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FRoots: A Fault Tolerant and Topology-Flexible Routing Technique

    Publication Year: 2006, Page(s):1136 - 1150
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4003 KB) | HTML iconHTML

    Existing solutions for fault-tolerant routing in interconnection networks either work for only one given regular topology, or require slow and costly network reconfigurations that do not allow full and continuous network access. In this paper, we present FRroots, a routing method for fault tolerance in topology-flexible network technologies. Our method is based on redundant paths, and can handle s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replicated Server Placement with QoS Constraints

    Publication Year: 2006, Page(s):1151 - 1162
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB) | HTML iconHTML

    The network planning problem of placing replicated servers with QoS constraints is considered. Each server site may consist of multiple server types with varying capacities and each site can be placed in any location among those belonging to a given set. Each client can be served by more than one location as long as the round-trip delay of data requests satisfies predetermined upper bounds. Our ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Messages Scheduling for Parallel Data Redistribution between Clusters

    Publication Year: 2006, Page(s):1163 - 1175
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2167 KB) | HTML iconHTML

    We study the problem of redistributing data between clusters interconnected by a backbone. We suppose that at most k communications can be performed at the same time (the value of k depending on the characteristics of the platform). Given a set of messages, we aim at minimizing the total communication time assuming that communications can be preempted and that preemption comes with an extra cost. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data-Driven Multithreading Using Conventional Microprocessors

    Publication Year: 2006, Page(s):1176 - 1188
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3088 KB) | HTML iconHTML

    This paper describes the data-driven multithreading (DDM) model and how it may be implemented using off-the-shelf microprocessors. Data-driven multithreading is a nonblocking multithreading execution model that tolerates internode latency by scheduling threads for execution based on data availability. Scheduling based on data availability can be used to exploit cache management policies that reduc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Geographical and Temporal Locality to Boost Search Efficiency in Peer-to-Peer Systems

    Publication Year: 2006, Page(s):1189 - 1203
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2728 KB) | HTML iconHTML

    As a hot research topic, many search algorithms have been presented and studied for unstructured peer-to-peer (P2P) systems during the past few years. Unfortunately, current approaches either cannot yield good lookup performance, or incur high search cost and system maintenance overhead. The poor search efficiency of these approaches may seriously limit the scalability of current unstructured P2P ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS Driven Parallelization of Resources to Reduce File Download Delay

    Publication Year: 2006, Page(s):1204 - 1215
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (950 KB) | HTML iconHTML

    In this paper, we propose a novel approach for reducing the download time of large files over the Internet. Our approach, known as parallelized file transport protocol (P-FTP), proposes simultaneous downloads of disjoint file portions from multiple file servers. P-FTP server selects file servers for the requesting client on the basis of a variety of QoS parameters, such as available bandwidth and ... 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: 2006, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • [Back cover]

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