By Topic

Parallel and Distributed Systems, IEEE Transactions on

Issue 8 • Date Aug 1997

Filter Results

Displaying Results 1 - 10 of 10
  • A theory of fault-tolerant routing in wormhole networks

    Publication Year: 1997 , Page(s): 790 - 802
    Cited by:  Papers (29)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (148 KB)  

    Fault-tolerant systems aim at providing continuous operation in the presence of faults. Multicomputers rely on an interconnection network between processors to support the message-passing mechanism. Therefore, the reliability of the interconnection network is very important for the reliability of the whole system. This paper analyzes the effective redundancy available in a wormhole network by comb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel incremental graph partitioning

    Publication Year: 1997 , Page(s): 884 - 896
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1252 KB)  

    Partitioning graphs into equally large groups of nodes while minimizing the number of edges between different groups is an extremely important problem in parallel computing. For instance, efficiently parallelizing several scientific and engineering applications requires the partitioning of data or tasks among processors such that the computational load on each node is roughly the same, while commu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matrix decomposition on the star graph

    Publication Year: 1997 , Page(s): 803 - 812
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (252 KB)  

    We present and evaluate, for the first time, a parallel algorithm for solving the LU decomposition problem on the star graph. The proposed parallel algorithm is of O(N3/n!) computation complexity and uses O(Nn) communication time to decompose a matrix of order N on a star graph of dimension n, where N⩾(n-1)!. The incurred communication time is better than the best known results for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical real-time channels on multiaccess bus networks

    Publication Year: 1997 , Page(s): 769 - 780
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (248 KB)  

    Real-time communication with performance guarantees is expected to become an important and necessary feature of future computer networks. In this paper, we present a scheme which can provide real-time communication services with both absolute and statistical performance guarantees on multiaccess bus networks for given input traffic characteristics and performance requirements. The proposed scheme ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing the application execution time through scheduling of subtasks and communication traffic in a heterogeneous computing system

    Publication Year: 1997 , Page(s): 857 - 871
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (492 KB)  

    In a heterogeneous computing (HC) environment consisting of different types of machines, an application program is decomposed into subtasks, each of which is computationally homogeneous. The goal is to execute subtasks on the machines in such a way that the total program execution time is minimized. A mathematical framework is presented that models the matching of subtasks to machines, scheduling ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general method for deflection worm routing on meshes based on packet routing algorithms

    Publication Year: 1997 , Page(s): 781 - 789
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (172 KB)  

    In this paper, we consider the deflection worm routing problem on n×n meshes. In deflection routing, a message cannot be queued and it is always moving until it reaches its destination. In worm routing, the message is considered to be a worm, a sequence of k flits which, during the routing, follow the head of the worm, which knows the destination address. We show how to derive a deflection w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel execution of hash joins in parallel databases

    Publication Year: 1997 , Page(s): 872 - 883
    Cited by:  Papers (8)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (556 KB)  

    We explore two important issues, processor allocation and the use of hash filters, to improve the parallel execution of hash joins. To exploit the opportunity of pipelining for hash join execution, a scheme to transform a bushy execution tree to an allocation tree is first devised. In an allocation tree, each node denotes a pipeline. Then, using the concept of synchronous execution time, processor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for data distribution on distributed memory parallel computers

    Publication Year: 1997 , Page(s): 825 - 839
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (436 KB)  

    Data distribution has been one of the most important research topics in parallelizing compilers for distributed memory parallel computers. Good data distribution schema should consider both the computation load balance and the communication overhead. In this paper, we show that data redistribution is necessary for executing a sequence of Do-loops if the communication cost due to performing this se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing a scalable processor array for recurrent computations

    Publication Year: 1997 , Page(s): 840 - 856
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (624 KB)  

    In this paper, we study the design of a coprocessor (CoP) to execute efficiently recursive algorithms with uniform dependencies. Our design is based on two objectives: 1) fixed bandwidth to main memory (MM) and 2) scalability to higher performance without increasing MM bandwidth. Our CoP has an access unit (AU) organized as multiple queues, a processor array (PA) with regularly connected processin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical algorithms for selection on coarse-grained parallel computers

    Publication Year: 1997 , Page(s): 813 - 824
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (480 KB)  

    In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. We also consider several algorithms for load balancing needed to keep a balanced distribution of data across processors during the execution of the selection algorithms. We have carried out detailed implement... 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