IEEE Transactions on Parallel and Distributed Systems

Issue 6 • Jun 2000

Filter Results

Displaying Results 1 - 8 of 8
  • Analytical results for optimal choice of location update interval for mobility database failure restoration in PCS networks

    Publication Year: 2000, Page(s):615 - 624
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    When the location information for a mobile user in the Home Location Register (HLR) is corrupted or obsolete, the new arriving calls to the user may be lost. In order to minimize the effect of such HLR mobility database failure, a location update scheme called period location updating is proposed, and the cost analysis is performed. Analytical results for the failure recovery time distribution and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing overall loop schedules using prefetching and partitioning

    Publication Year: 2000, Page(s):604 - 614
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    In this paper, a method combining the loop pipelining technique with data prefetching, called Partition Scheduling with Prefetching (PSP), is proposed. In PSP, the iteration space is first divided into regular partitions. Then a two-part schedule, consisting of the ALU and memory parts, is produced and balanced to produce high throughput. These two parts are executed simultaneously, and hence, the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating the scalability of distributed systems

    Publication Year: 2000, Page(s):589 - 603
    Cited by:  Papers (66)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    Many distributed systems must be scalable, meaning that they must be economically deployable in a wide range of sizes and configurations. This paper presents a scalability metric based on cost-effectiveness, where the effectiveness is a function of the system's throughput and its quality of service. It is part of a framework which also includes a sealing strategy for introducing changes as a funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constant time dynamic programming on directed reconfigurable networks

    Publication Year: 2000, Page(s):529 - 536
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Several dynamic programming algorithms are considered which can be efficiently implemented using parallel networks with reconfigurable buses. The bit model of general reconfigurable meshes with directed links, common write, and unit-time delay for broadcasting is assumed. Given two sequences of length m and n, respectively, their longest common subsequence can be found in constant time by an O(mh)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fair distributed mutual exclusion algorithm

    Publication Year: 2000, Page(s):537 - 549
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    This paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N-1 and 2(N-1) messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the computation. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel pruning technique for highly asymmetric assignment problems

    Publication Year: 2000, Page(s):550 - 558
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    We introduce a new two-phase technique to solve highly asymmetric assignment problems. In the first phase, the assignment problem is decomposed into subproblems which are solved in parallel. The first phase is used to exclude certain suboptimal assignments from consideration in the second phase. In the second phase, the optimal assignment is finalized. We show that the two-phase algorithm can redu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognizing unordered depth-first search trees of an undirected graph in parallel

    Publication Year: 2000, Page(s):559 - 570
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    Let G be an undirected graph and T be a spanning tree of G. In this paper, an efficient parallel algorithm is proposed for determining whether T is an unordered depth-first search tree of G. The proposed algorithm runs in O(m/p+log m) time using p processors on the EREW PRAM, where m is the number of edges contained in G. It is cost-optimal and achieves linear speedup View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A routing protocol for anycast messages

    Publication Year: 2000, Page(s):571 - 588
    Cited by:  Papers (35)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    An anycast packet is one that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. Little work has been done on routing anycast packets. In this paper, we propose and analyze a routing protocol for anycast message. It is composed of two subprotocols: the routing table establishment subprotocol and the packet forw... 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.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology