By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 11 • Date Nov. 2001

Filter Results

Displaying Results 1 - 7 of 7
  • Backtracking in independent and-parallel implementations of logic programming languages

    Publication Year: 2001, Page(s):1169 - 1189
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1368 KB) | HTML iconHTML

    In this paper, we present an implementation model which efficiently supports backtracking in an independent and-parallel nondeterministic system. The problem is tackled in the context of logic programming, although the solution proposed is sufficiently general to be easily extended to different nondeterministic systems, such as constraint programming systems. The complexity of the problem is demon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Composite k-arbiters

    Publication Year: 2001, Page(s):1134 - 1145
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (179 KB) | HTML iconHTML

    The k-arbiter is a useful concept to solve the distributed h-out-of-k mutual exclusion problem. The distributed h-out-of-k mutual exclusion algorithms, based on the k-arbiter, have the benefits of high fault tolerance and low message cost. However, according to the definition of the k-arbiter, it is required to have a nonempty intersection among any (κ + 1) quorums in a k-arbiter. Consequent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A group membership algorithm with a practical specification

    Publication Year: 2001, Page(s):1190 - 1200
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    Presents a solvable specification and gives an algorithm for the group membership problem in asynchronous systems with crash failures. Our specification requires processes to maintain a consistent history in their sequences of views. This allows processes to order failures and recoveries in time and simplifies the programming of high level applications. Previous work has proven that the group memb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Response time analysis of parallel computer and storage systems

    Publication Year: 2001, Page(s):1146 - 1161
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    Fork-join structures have gained increased importance in recent years as a means of modeling parallelism in computer and storage systems. The basic fork-join model is one in which a job arriving at a parallel system splits into K independent tasks that are assigned to K unique, homogeneous servers. In the paper, a simple response time approximation is derived for parallel systems with exponential ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On rolling back and checkpointing in time warp

    Publication Year: 2001, Page(s):1105 - 1121
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (985 KB) | HTML iconHTML

    In this paper, we present a family of three algorithms which serve to perform checkpoints and to roll back time warp. These algorithms are primarily intended for use in simulations in which there are a large number of LPs and in which events have a small computational granularity. Important representatives of this class are VLSI and computer network simulations. In each of our algorithms, LPs are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal total exchange in Cayley graphs

    Publication Year: 2001, Page(s):1162 - 1168
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (162 KB) | HTML iconHTML

    Consider an interconnection network and the following situation: Every node needs to send a different message to every other node. This is the total exchange or all-to-all personalized communication problem, one of a number of information dissemination problems known as collective communications. Under the assumption that a node can send and receive only one message at each step (single-port model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power-aware localized routing in wireless networks

    Publication Year: 2001, Page(s):1122 - 1133
    Cited by:  Papers (327)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    A cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also proposed. We define a power-cost metric based on the combination of both node's lifetime and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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