By Topic

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing

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 permission for commercial reuse | 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 permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Parallel matching on expanders

    Publication Year: 1991, Page(s):752 - 758
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    If a matching on a bipartite expander does not have maximum cardinality, it has a short augmenting path. This fact leads to an improved parallel algorithm for finding maximum cardinality matchings on such graphs. This paper describes a deterministic parallel algorithm paths that runs in (logn)4log log n+O(1) time on an EREW PRAM with O(nm) processors and that finds a m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal parallel matching algorithm for cographs

    Publication Year: 1991, Page(s):759 - 766
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. The authors show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With a n-vertex cograph G represented by its parse tree as input the algorithm finds a maximum ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Debugging concurrent programs using static analysis and run-time hardware monitoring

    Publication Year: 1991, Page(s):716 - 719
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    This paper describes the design and implementation of PMD-a debugger for Occam2 on an experimental distributed memory MIMD machine. Static analysis of the source code is used to build a model of the program, albeit incomplete, with minimal run-time information being filled in dynamically from a dedicated hardware monitor. The notion of Region of Channel Usage (RCU) is introduced to efficiently det... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analytical model for predicting performance in a heterogeneous system

    Publication Year: 1991, Page(s):334 - 341
    Cited by:  Papers (3)
    Request permission for commercial reuse | 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.
  • An NC algorithm for the general planar monotone circuit value problem

    Publication Year: 1991, Page(s):196 - 203
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in a plane and that has only AND and OR gates. Although a special case of the planar monotone circuit value problem (PMCVP) has been shown to be in NC2, it was not known whether the general PMCVP is in NC. In the paper, the author first gives an NC2 algorithm to evaluate a layered one-input-face PMC usi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed computing on anonymous hypercube networks

    Publication Year: 1991, Page(s):722 - 729
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    The authors consider the bit-complexity (i.e. the total number of bits transmitted) of computing boolean functions on an anonymous canonically labeled n-dimensional hypercube network with N=2n nodes and give a characterization of the boolean functions computable on such a network as exactly those boolean functions which are invariant under all bit-complement automorphisms of the hypercu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circuit partitioning using parallel mean field annealing algorithms

    Publication Year: 1991, Page(s):534 - 541
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    Mean field annealing (MFA) algorithm, recently proposed for solving combinatorial optimization problems, combines the characteristics of neural networks and simulated annealing. Previous works on MFA resulted with successful mapping of the algorithm to some classic optimization problems such as travelling salesman problem and graph partitioning problem. In this paper, MFA is formulated for circuit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Off-line routing with small queues on a mesh-connected processor array

    Publication Year: 1991, Page(s):301 - 304
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    Presents efficient and simple algorithm for offline routing that uses very small queues. Our main result is that there exists an off-line algorithm for permutation routing on the n×n mesh-connected processor array, that takes 2.2 n+5 steps, and uses queues of size not more than 14. The algorithm uses novel and interesting techniques, and the bound on the queue size... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability oriented allocation of files on distributed systems

    Publication Year: 1991, Page(s):886 - 893
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    One of the important features of distributed computing systems (DCSs) is the potential of high reliability. When the hardware configuration of a DCS is fixed, the system reliability mainly depends on the allocation of various resources. One of the important resources used in a DCS are various files. The authors have developed a reliability oriented file allocation scheme for distributed systems. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Well-formed generalized task graphs

    Publication Year: 1991, Page(s):344 - 351
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    Generalized task graphs further extend the well-known extended task graphs by introducing a new node which provides the 1-out-of-n type of completion semantics along with abortion of certain computations. This extension allows modeling of problems involving parallel state-space search and exception handling. Arbitrary generalized task graphs may not be `well-formed', i.e. they may not re... 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 (6)
    Request permission for commercial reuse | 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.
  • Compiling functional languages for SIMD architectures

    Publication Year: 1991, Page(s):79 - 86
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A major impediment to the wider proliferation of Single-Instruction, Multiple Datastream (SIMD) [3] architectures rests in the unsuitability of sequential, scalar, languages for programming data-parallel systems. Existing languages lack sufficient expressive power to describe data-parallel computation. A functional language, extended with data-parallel primitives, provides a powerful abstraction o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel independent subsets and matrix factorizations

    Publication Year: 1991, Page(s):204 - 211
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    A parallel algorithm is given for computation of a maximal linearly independent subset of a set of vectors over a field. The algorithm uses polylogarithmic time and uses a number of processors that differs by only a polylog factor from the number required for fast parallel matrix inversion. It is used to produce efficient parallel algorithms for orthogonalizations of arbitrary matrices over real f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a complexity hierarchy of wait-free concurrent objects

    Publication Year: 1991, Page(s):730 - 737
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The author studies the time complexity of wait-free implementations of a generalized version of consensus, the set-consensus problem, in synchronous message-passing systems. The time complexity of such characteristic problems as consensus and strong renaming have been studied earlier. These two problems seem to exist at two ends of the spectrum, one taking O(n) time, while the ot... 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 permission for commercial reuse | 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.
  • A parallel hybrid learning approach to artificial neural nets

    Publication Year: 1991, Page(s):542 - 545
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    The requirements of well chosen applications are of great importance for developing new parallel computer architectures. The algorithms presented are implemented on the EDS (European Declarative System) parallel computer. By using a hybrid approach of genetic and gradient descend algorithms in an appropriate manner the advantages of both methods are combined. It is shown how artificial neural netw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and optimization of complex database queries in a shared-nothing system

    Publication Year: 1991, Page(s):52 - 59
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The author introduces queueing network models for the optimization of the concurrent evaluation of complex database queries, which occur e.g. in deductive query processing. The basic principle for the optimization is the reduction of response time by a better load distribution. If data access leads to a bottleneck on any CPU, response time may possibly be reduced by a preceding dynamic replication... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic control of parallelism and granularity in executing nested parallel loops

    Publication Year: 1991, Page(s):678 - 685
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The effects of controlling granularity and the growth of parallelism at runtime in executing automatically parallelized programs are addressed. The authors version-switch method allows the runtime system to dynamically choose the appropriate version of codes for execution in order to achieve better performance. The decision when to switch version is shown to be critical to the effectiveness of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal randomized algorithms for multipacket and cut through routing on the mesh

    Publication Year: 1991, Page(s):305 - 311
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    Presents a randomized algorithm for the multipacket (i.e. k -k) routing problem on an n×n mesh. The algorithm completes with high probability in at the most kn+O(k log n) parallel communication steps, with a constant queue size of O(k). The previous best known algorithm takes 5/4 kn+O(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper and lower bounds for one-write multivalued regular registers

    Publication Year: 1991, Page(s):134 - 141
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    This paper presents an algorithm for implementing a k-ary regular register (the logical register) using k(k-1)/2 binary regular registers (the physical registers) that requires only one physical write per logical write. The algorithm is simple to describe and depends on properties of paths in a related graph. Two lower bounds on the number of registers required by one-wr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithm and complexity results for telephone link simulation

    Publication Year: 1991, Page(s):378 - 385
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    The telephone connection problem (TCP) is the problem of simulating a telephone link of fixed capacity to assess its ability to serve incoming calls. This simulation is performed on a large number of sample calls at AT&T Bell Laboratories. In order to speed up the simulation, it is desirable to obtain good parallel algorithms for the problem. The authors give an O(k log n) time parallel on an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multi-threaded list-processing and garbage collection

    Publication Year: 1991, Page(s):894 - 897
    Cited by:  Papers (1)  |  Patents (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    The authors discuss the problem of parallel list-processing and garbage collection in an environment based on lightweight processes (threads). Their main insight is that the threads paradigm suggests a heap memory layout and garbage collection technique which is quite different from existing Lisp and Prolog systems. They introduce a hierarchy of fork constructs and a memory structure which support... View full abstract»

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

    Publication Year: 1991, Page(s):352 - 356
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    A fundamental criterion of a robust distributed system is its ability to recover from perturbations that can possibly corrupt the state of the system. In a Petri net model, system perturbations may affect the marking of the net in an unpredictable manner. The paper shows that for certain classes of nets, it is possible to devise a self-stabilizing extension, so that regardless of the initial marki... View full abstract»

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