By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 11 • Date Nov. 2006

Filter Results

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

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (92 KB)
    Freely Available from IEEE
  • Bandwidth Efficient String Reconciliation Using Puzzles

    Publication Year: 2006, Page(s):1217 - 1225
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1394 KB) | HTML iconHTML

    Of considerable interest in recent years has been the problem of exchanging correlated data with minimum communication. We thus consider the problem of exchanging two similar strings held by different hosts. Our approach involves transforming a string into a multiset of substrings that are reconciled efficiently using known multiset reconciliation algorithms, and then put back together on a remote... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing Communications of Dynamic Data Redistribution on Symmetrical Matrices in Parallelizing Compilers

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

    Dynamic data redistribution is used to enhance data locality and algorithm performance by reducing interprocessor communication in many parallel scientific applications on distributed memory multicomputers. Since the redistribution is performed at runtime, there is a performance tradeoff between the efficiency of the new data decomposition for a subsequent phase of an algorithm and the cost of red... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Performance of Flooding-Based Resource Discovery

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

    We consider flooding-based resource discovery in distributed systems. With flooding, a node searching for a resource contacts its neighbors in the network, which in turn contact their own neighbors and so on until a node possessing the requested resource is located. Flooding assumes no knowledge about the network topology or the resource distribution thus offering an attractive means for resource ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Replica Placement under Expiration-Based Consistency Management

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

    Expiration-based consistency management is widely used to keep replicated contents up-to-date in the Internet. The effectiveness of replication can be characterized by the communication costs of client accesses and consistency management. Both costs depend on the locations of the replicas. This paper investigates the problem of placing replicas in a network where replica consistency is managed by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable Design and Implementations for MPI Parallel Overlapping I/O

    Publication Year: 2006, Page(s):1264 - 1276
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3308 KB) | HTML iconHTML

    We investigate the message passing interface input/output (MPI I/O) implementation issues for two overlapping access patterns: the overlaps among processes within a single I/O operation and the overlaps across a sequence of I/O operations. The former case considers whether I/O atomicity can be obtained in the overlapping regions. The latter focuses on the file consistency problem on parallel machi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing

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

    Peer-to-peer (P2P) file sharing systems such as Gnutella have been widely acknowledged as the fastest-growing Internet applications ever. The P2P model has many potential advantages, including high flexibility and serverless management. However, these systems suffer from the well-known performance mismatch between the randomly constructed overlay network topology and the underlying IP-layer topolo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Congestion Adaptive Routing in Mobile Ad Hoc Networks

    Publication Year: 2006, Page(s):1294 - 1305
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3002 KB) | HTML iconHTML

    Mobility, channel error, and congestion are the main causes for packet loss in mobile ad hoc networks. Reducing packet loss typically involves congestion control operating on top of a mobility and failure adaptive routing protocol at the network layer. In the current designs, routing is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control, but dealin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks

    Publication Year: 2006, Page(s):1306 - 1320
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1799 KB) | HTML iconHTML

    Internet computing is emerging as an important new distributed computing paradigm in which resource intensive computing is integrated over Internet-scale networks. Over these large networks, different users and organizations share their computing resources, and computations take place in a distributed fashion. In such an environment, a framework is needed in which the resource providers are given ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load Balancing in a Cluster-Based Web Server for Multimedia Applications

    Publication Year: 2006, Page(s):1321 - 1334
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4230 KB) | HTML iconHTML

    We consider a cluster-based multimedia Web server that dynamically generates video units to satisfy the bit rate and bandwidth requirements of a variety of clients. The media server partitions the job into several tasks and schedules them on the backend computing nodes for processing. For stream-based applications, the main design criteria of the scheduling are to minimize the total processing tim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Query Response Delivery Quality in Peer-to-Peer Systems

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

    Unstructured peer-to-peer (P2P) system is the prevalent model in today's P2P systems. In such systems, a response is sent along the same path that carried the incoming query message. To guarantee the anonymity of the requestor, no requestor information is included in the response message, and each node in the query's incoming path only knows its direct neighbors who sent the query request to it. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent Scheduling: Efficient Heuristics for Online Large-Scale Data Transfers in Distributed Real-Time Environments

    Publication Year: 2006, Page(s):1348 - 1359
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (966 KB) | HTML iconHTML

    The static staging heuristics proposed in the literature for staging the data items associated with real-time distributed applications adhere to a method by which only one data item is transferred in each communication step to optimize a specific cost function. In this paper, we first propose the extended partial path (EPP) algorithm based on the same method. In terms of maximizing the number of s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LOMARC: Lookahead Matchmaking for Multiresource Coscheduling on Hyperthreaded CPUs

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

    Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latencies though potentially creating a memory conflict. Hyperthreaded CPUs support coscheduling without any context switches and provide additional options for CPU-internal resource sharing. We present an approach that include... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE ReadyNotes - quick tutorials

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

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

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