By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 5 • Date May 1997

Filter Results

Displaying Results 1 - 8 of 8
  • Analysis of quorum-based protocols for distributed (k+1)-exclusion

    Publication Year: 1997, Page(s):533 - 537
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    A generalization of the majority quorum for the solution of the distributed (k+1)-exclusion problem is proposed. This scheme produces a family of quorums of varying sizes and availabilities indexed by integral divisors r of k. The cases r=1 and r=k correspond to known majority based quorum generation algorithms MAJ and DIV, whereas intermediate values of r interpolate between these two extremes. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of switch-based wormhole networks

    Publication Year: 1997, Page(s):462 - 474
    Cited by:  Papers (18)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    Multistage interconnection networks (MINs) are a popular class of switch-based network architectures for constructing scalable parallel computers. Four wormhole MINs built from k×k switches, where k=2 i for some j, are considered in this paper: traditional MINs (TMINs), dilated MINs (DMINs), MINs with virtual channels (VMINs), and bidirectional MINs (BMINs). The first three MINs a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Highly scalable parallel algorithms for sparse matrix factorization

    Publication Year: 1997, Page(s):502 - 520
    Cited by:  Papers (46)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    In this paper, we describe scalable parallel algorithms for symmetric sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1,024 processors on a Gray T3D parallel computer. Through our analysis and experimental results, we demonstrate that our algorithms substantially improve the state of the art in parallel direct solution of sparse li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel algorithm for graph matching and its MasPar implementation

    Publication Year: 1997, Page(s):490 - 501
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    Search of discrete spaces is important in combinatorial optimization. Such problems arise in artificial intelligence, computer vision, operations research, and other areas. For realistic problems, the search spaces to be processed are usually huge, necessitating long computation times, pruning heuristics, or massively parallel processing. We present an algorithm that reduces the computation time f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal algorithm for global termination detection in shared-memory asynchronous multiprocessor systems

    Publication Year: 1997, Page(s):538 - 543
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    In the literature, the problem of global termination detection in parallel systems is usually solved by message passing. In shared-memory systems, this problem can also be solved by using exclusively accessible variables with locking mechanisms. In this paper, we present an algorithm that solves the problem of global termination detection in shared-memory asynchronous multiprocessor systems withou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance models for the processor farm paradigm

    Publication Year: 1997, Page(s):475 - 489
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    In this paper, we describe the design, implementation, and modeling of a runtime kernel to support the processor farm paradigm on multicomputers. We present a general topology-independent framework for obtaining performance models to predict the performance of the start-up, steady-state, and wind-down phases of a processor farm. An algorithm is described, which for any interconnection network dete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal multiplication algorithm on reconfigurable mesh

    Publication Year: 1997, Page(s):521 - 532
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    An O(1) time algorithm to multiply two K-bit binary numbers using an N×N bit-model of reconfigurable mesh is shown. It uses optimal mesh size and it improves previously known results for multiplication on the reconfigurable mesh. The result is obtained by using novel techniques for data representation and data movement and using multidimensional Rader Transform. The algorithm is extended to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal polling in communication networks

    Publication Year: 1997, Page(s):449 - 461
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    Polling is the process in which an issuing node of a communication network (polling station) broadcasts a query to every other node in the network and waits to receive a unique response from each of them. Polling can be thought of as a combination of broadcasting and gathering and finds wide applications in the control of distributed systems. In this paper, we consider the problem of polling in mi... 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