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 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 and distributed algorithms for finite constraint satisfaction problems

    Publication Year: 1991, Page(s):394 - 397
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    The authors develop two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, they give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. If an FCSP can be represented by an acyclic constraint network of size n with width bounded by a constant then: the parallel algorithm takes O(log ... 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.
  • 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 permission for commercial reuse | 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.
  • Distributed fault-tolerant routing on hypercubes algorithms and performance study

    Publication Year: 1991, Page(s):474 - 481
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Increasing use of hypercube systems in reliability-critical applications has made fault-tolerant communication algorithms for hypercube important. This paper describes four fault-tolerant routing algorithms for hypercubes subject to link failures, namely any- nd, sidewalk, lookahead and lookside. The principle of sidewalk and lookahead are similar to two existing approaches. Lookside is... 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.
  • ATARIC: an algebraic technique to analyse reconfiguration for fault tolerance in a hypercube

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

    The hypercube architecture is a popular topology for many parallel processing applications. Several researchers have analysed the performance and dependability aspects of this architecture or its variants. Fault tolerance by reconfiguration is another important problem in a large distributed computing environment, for continued operation of the hypercube multiprocessors after the failure of one or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to parallel functional programming

    Publication Year: 1991, Page(s):95 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    Functional languages exhibit `implicit parallelism' which has been used in attempts to achieve an efficient execution on parallel architectures; as a matter of the fact, the work has been focussed on process parallelism, leaving almost unexplored the field of data parallelism despite it seeming quite promising. To exploit data parallelism properly it is necessary to design a suitable collection. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • 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.
  • Packet routing on square meshes with row and column buses

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

    General point-to-point communication among processors in the classical two-dimensional n×n square mesh architecture necessarily takes at least 2n-2 time steps. The authors investigate the problem of routing arbitrary permutations on an enhanced square mesh with separate broadcast buses along each of its rows and columns. They prove that any packet routing algorithm... 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 permission for commercial reuse | 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 complete binary trees in faulty hypercubes

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

    This paper studies the ability of the hypercube to implement tree-structured algorithms in the presence of faults. The hypercube is able to implement a wide range of algorithms efficiently, and the authors' selection of tree computations is motivated by the fact that many parallel algorithms, including broadcasting, parallel prefix, and other divide-and-conquer algorithms, have a natural tree stru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evaluation of concurrent priority queue algorithms

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

    This paper describes the design and experimental evaluation of two novel concurrent priority queue algorithms, a parallel Fibonacci heap and a concurrent priority pool, and compares them with the concurrent binary heap. The parallel Fibonacci heap is based on the sequential Fibonacci heap, which is theoretically the most efficient data structure for sequential priority queues. The concurrent prior... 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.
  • Parallel algorithm and complexity results for telephone link simulation

    Publication Year: 1991, Page(s):378 - 385
    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.
  • Performance evaluation of an efficient multiple copy update algorithm

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

    The authors study the response-time behavior of a symmetric distributed update-synchronization algorithm where nodes need to obtain permission from only O(√N) (N being the number of database copies) other nodes before performing an update (as opposed to N/2+1 nodes in the well-known Thomas majority consensus algorithm). The algorithm used is an adaptation of M. Maekawa's O(√N) distribu... 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 permission for commercial reuse | 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.
  • Synthesis of parallel Ada code from a knowledge base of rules

    Publication Year: 1991, Page(s):600 - 607
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    A synergistic approach utilizing compilation, compaction, and parallelization is described to achieve real-time computing throughput from rule-based expert systems. The methodology involves synthesizing a set of concurrently executable Ada tasks from a knowledge base of rules. Compaction of code size is accomplished by eliminating the overhead associated with inference engine control constructs no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel system for test pattern generation

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

    The problem of generating test pattern sequences for digital circuits is a crucial one in the area of electronic CAD. While a significant effort has been made to develop new and more powerful algorithms to solve it, the required CPU times are still unacceptable in many cases. The authors propose a different approach based on the use of a general-purpose parallel architecture. The attention is devo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Univariate polynomial division with a remainder by means of evaluation and interpolation

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

    The authors apply the evaluation-interpolation techniques of A. Toom (1963) to approximate polynomial division with a non-vanishing remainder. Surprisingly, this elementary technique immediately leads us to the same computations and to the same record parallel complexity estimates for this problem, OA(log m,m ), as do far more sophisticated algorithms. The aut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Propagating buffer: a new approach to deadlock freedom in store-and-forward networks

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

    The authors address the problem of guaranteeing deadlock-freedom in store-and-forward networks which are vulnerable to deadlocks due to limited buffer space at the nodes. Approaches based on structured buffer pools and acyclic buffer graphs suffer from restrictions on the use of the available buffers and routing of packets. The authors propose and discuss a new approach that has little restriction... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast load balancing on a PRAM

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

    Consider the following setting: n processors of a PRAM are given n independent tasks. Each task can be executed in constant time by a single processor. The distribution of tasks among the processors is unknown; each processor has information only about its set of tasks. The batch execution problem is to reschedule the tasks so that quickest execution of all tasks is achieved. Ignoring rescheduling... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectrum of choices: superpipelined, superscalar, or multiprocessor?

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

    An analytical model is proposed as an alternative tool for analyzing the tradeoff between superpipelined processors, superscalar processors, and multiprocessors. The duality of superpipelines and superscalars is examined in detail. Combined systems, such as superpipelined multiprocessors and superscalar multiprocessors, are also analyzed. The model shows that the number of pipelines (or processors... View full abstract»

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