By Topic

Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on

Date 2-5 Dec. 1991

Filter Results

Displaying Results 1 - 25 of 119
  • Data communication and computational geometry on the star and pancake interconnection networks

    Publication Year: 1991 , Page(s): 415 - 422
    Cited by:  Papers (17)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (698 KB)  

    The star and pancake networks were recently proposed as attractive alternatives to the hypercube topology for interconnecting processors in a parallel computer. However, little has been done to design parallel algorithms on these networks. The paper presents several data communication algorithms that are fundamental to designing algorithms on these two networks. These algorithms are then used to d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing (Cat. No.91TH0396-2)

    Publication Year: 1991
    Request Permissions | PDF file iconPDF (35 KB)  
    Freely Available from IEEE
  • An analytical model for predicting performance in a heterogeneous system

    Publication Year: 1991 , Page(s): 334 - 341
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (624 KB)  

    Presents an analytical model for predicting the response time of tasks in a heterogeneous system with load sharing. The model is general and can be used to evaluate the performance of any algorithm and any system configuration as long as task transfer decisions are based on the load levels of the sending and receiving processors. The methodology is applied to three load sharing algorithms in a sys... View full abstract»

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

    Publication Year: 1991 , Page(s): 590 - 597
    Cited by:  Papers (11)  |  Patents (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (620 KB)  

    Many solutions have been proposed to the problem of multiprogramming a multiprocessor. However, each has limited applicability or fails to address an important source of overhead. In addition, there has been little experimental comparison of the various solutions in the presence of applications with varying degrees of parallelism and synchronization. The authors explore the tradeoffs between three... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prototyping parallel and distributed programs in Proteus

    Publication Year: 1991 , Page(s): 26 - 34
    Cited by:  Papers (3)  |  Patents (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (768 KB)  

    This paper presents Proteus, an architecture-independent language suitable for prototyping parallel and distributed programs. Proteus is a high-level imperative notation based on sets and sequences with a single construct for the parallel composition of processes. Although a shared-memory model is the basis for communication between processes, this memory can be partitioned into shared and private... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a new approach for enhancing the fault coverage of conformance testing of protocols

    Publication Year: 1991 , Page(s): 428 - 435
    Cited by:  Patents (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (536 KB)  

    Proposes a new approach for enhancing the fault coverage of protocol testing using unique input/output (UIO) sequences. UIO sequences can be efficiently employed in checking the conformance specifications of protocols by transition testing and an optimization process based on the rural Chinese postman tour algorithm. The proposed approach is based on a new set of conditions for UIO sequence genera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Super critical tree numbering and optimal tree ranking are in NC

    Publication Year: 1991 , Page(s): 767 - 773
    Request Permissions | Click to expandAbstract | PDF file iconPDF (472 KB)  

    This paper places the optimal tree ranking problem in NC. A ranking is a labeling of the nodes with natural numbers such that if nodes u and v have the same label then there exists another node with a greater label on the path between them. An optimal ranking is a ranking in which the largest label assigned to any node is as small as possible among all rankings. An ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On mapping Bezier curve and surface subdivision algorithms into a hypercube with geometric adjacency constraint

    Publication Year: 1991 , Page(s): 582 - 589
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (600 KB)  

    The authors discuss the Bezier curve and surface generation algorithms on a hypercube computer. They show that the computation structures of Bezier curve and surface generation based on subdivision method can be modeled as binomial trees and extended binomial trees respectively. Properties of binomial trees and extended binomial trees are explored and mappings from these tree structures to hypercu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant meshes with minimal numbers of spares

    Publication Year: 1991 , Page(s): 288 - 295
    Cited by:  Papers (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (560 KB)  

    Presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, the authors create as fault-tolerant graph with n+k nodes such that given any set of k or fewer faulty nodes, the remaining graph is guaranteed to contain the target graph as a fault-free subgraph. As a result, any al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A shared-memory multiprocessor garbage collector and its evaluation for committed-choice logic programs

    Publication Year: 1991 , Page(s): 870 - 877
    Cited by:  Patents (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (716 KB)  

    A parallel copying garbage collection algorithm for symbolic languages executing on shared-memory multiprocessors is proposed. The algorithm is an extension of Baker's sequential algorithm with a novel method of heap allocation to prevent fragmentation and facilitate load distribution during garbage collection. An implementation of the algorithm within a concurrent logic programming system, VPIM, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant routing with regularity restoration in Boolean n -cube interconnection networks

    Publication Year: 1991 , Page(s): 458 - 465
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (608 KB)  

    This paper proposes a set of techniques to restore the regularity of a Boolean n-cube network in the presence of node failures, and algorithms to effectively route messages among the surviving nodes. An analytical model to evaluate the degradation of a damaged network is also presented. One way to restore the regularity of a damaged Boolean n-cube network is by simply disabling t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boolean theory of coteries

    Publication Year: 1991 , Page(s): 150 - 157
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (584 KB)  

    A coterie under a ground set U consists of a set of subsets (quorums) of U such that any pair of quorums intersect each other. `Nondominated' coteries are of particular interest, since they are `optimal' in some sense. By assigning a Boolean variable to each element in U, we represent a coterie by a Boolean function of these variables. The authors characterize the nondominated coteries as exactly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A period-processor-time-minimal systolic array for cubical mesh algorithms

    Publication Year: 1991 , Page(s): 648 - 655
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (580 KB)  

    The paper, using a directed acyclic graph (dag) model of algorithms, investigates precedence constrained multiprocessor schedules for the n×n×n directed mesh. Any such schedule requires at least 3n-2 multiprocessor steps. Time-minimal schedules that use as few processors as possible are called processor-time-minimal. For the cubical mesh, such a schedule requires at least [3n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of strong predicates in distributed programs

    Publication Year: 1991 , Page(s): 692 - 699
    Request Permissions | Click to expandAbstract | PDF file iconPDF (572 KB)  

    This paper discusses detection of unstable predicates in a distributed program. Some applications of this are in program debugging and testing. The authors provide a predicate logic in the form of a grammar giving the rewrite rules for constructing predicates about a distributed program. This predicate logic is general enough to describe many conditions programmers are interested in. These predica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding all binary trees in the hypercube

    Publication Year: 1991 , Page(s): 104 - 111
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (728 KB)  

    An O(N2) heuristic algorithm is presented that embeds all binary trees, with dilation 2 and small average dilation, into the optimal sized hypercube. The heuristic relies on a conjecture about all binary trees with a perfect matching. It provides a practical and robust technique for mapping binary trees into the hypercube and ensures that the communication load is evenly distributed acr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of inclusion effects in multi-level multiprocessor caches

    Publication Year: 1991 , Page(s): 513 - 516
    Request Permissions | Click to expandAbstract | PDF file iconPDF (272 KB)  

    Using multiple levels of cache memory is becoming increasingly popular to bridge the gap between CPU and memory cycle times, but the design of a multi-level cache hierarchy is challenging. One complication is maintaining the inclusion property, where each cache contains a superset of the data contained in all the smaller caches whose requests it services. Inclusion is important for minimizing the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What is an effective schedule?

    Publication Year: 1991 , Page(s): 158 - 161
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (280 KB)  

    Parallel algorithms are more difficult to analyze than sequential algorithms, in part because one has to account for communication between the processors in addition to the usual measures of time and space. To find meaningful lower bounds on communication, one has to restrict the kinds of schedules that are examined. The authors show that the traditional equal work restriction is insufficient, but... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A group of permutations with edge-disjoint paths on hypercubes

    Publication Year: 1991 , Page(s): 746 - 749
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (292 KB)  

    The operation of permuting data among the vertices of a hypercube computer induces a set of paths from senders to receivers. Sets of edge-disjoint paths are desirable for efficient communication. This paper introduces a group of permutations that induce edge-disjoint paths for the commercially popular `e-cube' routing algorithm. In particular, proof is given that any permutation routed thusly has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A heuristic processor allocation strategy in hypercube systems

    Publication Year: 1991 , Page(s): 574 - 581
    Cited by:  Papers (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (736 KB)  

    A new processor allocation scheme for hypercube systems, called the HPA (heuristic processor allocation) strategy, is presented. In this scheme, an undirected graph, called the SC-graph (Subcube-graph), is used to maintain the free subcubes available in system, which are represented by vertices. An allocation request for a k-cube is satisfied by finding a free subcube of dimensio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of distributed communication in multiprotocol Tuple Space

    Publication Year: 1991 , Page(s): 282 - 285
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (300 KB)  

    Tuple Space provides primitives convenient for description of data-sharing and interprocess communication, but its implementation on distributed systems is less efficient than that on shared memory machines. Multiprotocol Tuple Space improves the implementation on distributed systems. That provides three replication-consistency protocols that are weakened to different degrees. By selecting these p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of single-buffered multistage interconnection networks

    Publication Year: 1991 , Page(s): 864 - 867
    Cited by:  Papers (15)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (300 KB)  

    A new model for the performance evaluation of single-buffered multistage interconnection networks (MINs) is proposed. Previous models proposed in solving this problem are either not accurate enough or only applicable to a special case where the switching elements (SEs) are 2×2 crossbars. This new model allows the analysis of a MIN with arbitrary sizes of a×a SEs and, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive routing in generalized hypercube architectures

    Publication Year: 1991 , Page(s): 564 - 571
    Cited by:  Papers (4)  |  Patents (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (672 KB)  

    The authors study generalized hypercube (GHC) interconnection networks. This network provides a rich interconnection topology, is symmetric, and potentially forms the basis of a very reliable architecture. They propose a general taxonomy for adaptive routing protocols, and identify three classes of protocols for generalized hypercubes in particular. These protocols are fully distributed, resilient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BDG-torus union graph-an efficient algorithmically specialized parallel interconnect

    Publication Year: 1991 , Page(s): 407 - 414
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (688 KB)  

    The binary de Bruijn graph (BDG) is a realizable alternative to the hypercube. An extension of the BDG by the edge set union with a torus is shown-union-graph (UG). This achieves graph capabilities/versatility comparable to the product shuffle (PS) graph and the hypercube within a fixed degree graph. The UG improves upon both in implementing pipelined and multi-phase algorithms. More importantly, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data skew and the scalability of parallel joins

    Publication Year: 1991 , Page(s): 44 - 51
    Cited by:  Papers (1)  |  Patents (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (532 KB)  

    When data are uniformly distributed, parallel join algorithms scale up well. However, scalability is curtailed by data skew-nonuniform distribution of data between processors. Investigation of this problem has been hampered by incomplete understanding of data skew as well as inadequate analytic performance models. The authors use a new model of data skew that addresses these shortcomings to examin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compile-time partitioning of a non-strict language into sequential threads

    Publication Year: 1991 , Page(s): 180 - 189
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (816 KB)  

    Presents a practical algorithm for partitioning a program into sequential threads. A thread is a sequence of instructions, possibly including branches, that can be scheduled as an indivisible unit on a von Neumann-like processor. The primary target of the proposed compilation strategy is large-scale parallel systems that rely on multithreading at the processor level to tolerate long communication ... View full abstract»

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