By Topic

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date 23-26 March 1992

Filter Results

Displaying Results 1 - 25 of 119
  • Comparisons and analysis of massively parallel SIMD architectures for parallel logic simulation

    Publication Year: 1992, Page(s):671 - 674
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB)

    This paper compares and analyzes massively parallel SIMD architectures as processing environments for parallel logic simulation. The CM-2 and the MP-1 are considered as target machines for the comparison. Detailed contrasts between the two parallel schemes are made based on actual simulation results and system performance. Distributed event-driven simulation protocols are used to obtain experiment... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings. Sixth International Parallel Processing Symposium (Cat. No.92TH0419-2)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • Some architectural and compilation issues in the design of hierarchical shared memory multiprocessors

    Publication Year: 1992, Page(s):567 - 572
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    Latency and synchronization overheads have been identified as two fundamental problems in large-scale shared memory multiprocessors. The authors discuss architectures based on hierarchical memories which exploit the notion of partial sharing of variables to significantly reduce latency and synchronization overheads. They examine a particular class of architectures, the tree-structured hierarchical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The interplay between granularity, performance and availability in a replicated Linda tuple space

    Publication Year: 1992, Page(s):508 - 511
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    Replication is a common method for increasing the availability of data in a distributed environment. The authors' interest is in the application of replication techniques in the domain of parallel processing. They explore the issues concerning degree of replication and granularity in the context of a distributed and highly available Linda tuple space. In particular, they study the performance effe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A library environment for distributed memory multiprocessors

    Publication Year: 1992, Page(s):483 - 486
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    The authors propose the design of a library environment, called PARUL (PARallel User Library), for distributed memory multiprocessor systems. An important feature of the environment is that it allows the data distributed for use of a library function as well as the results generated by the function to be retained in the network of processors to be used by subsequent library functions. The user of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel heap: improved and simplified

    Publication Year: 1992, Page(s):448 - 451
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Describes a new updated version of the data structure parallel heap. Employing p processors, a parallel heap allows detections of Θ(p) highest-priority items and insertion of Θ( p) new items each in O(logn) time on an EREW PRAM where n is the size of the parallel heap. Furthermore, it can efficiently utilize processors in the range ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive graph computations with a connection machine

    Publication Year: 1992, Page(s):18 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    Results from parallel computing on a CM-2 Connection Machine are reported for a variety of graph-theoretic models for fitness optimization in evolutionary biology. These computations are among the most complex ever undertaken in this field and make full use of the internal hypercube architecture of the CM-2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A software tool for cellular mapping of discrete unitary transforms

    Publication Year: 1992, Page(s):298 - 304
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    The paper describes a software tool that facilitates mapping onto array processors of a wide class of unitary transforms. The mapping formalism of the tool depends on matrix factorizations combined with abstract constructs that link the linear concepts to a model of the array's architecture. A prototype design of the tool is graphics-based and user-driven View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hash table in massively parallel systems

    Publication Year: 1992, Page(s):660 - 664
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    The authors look at the performance and new collision resolution strategies for hash tables in massively parallel systems. The results show that using a hash table with linear probing yields O(log N) time performance for handling M accesses by N processors when the load factor of the table is 50%, where N is the size of the hash table. This is better ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CCHIME: a cache coherent hybrid interconnected memory extension

    Publication Year: 1992, Page(s):573 - 577
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    This paper presents a hybrid shared memory architecture which combines the scalability of a multistage interconnection network with the contention reduction benefits of coherent caches. The authors achieve this by replacing the memory modules and final stages of a multistage interconnection network with clusters of coherent caches. The performance of Cache Coherent Hybrid Interconnected Memory Ext... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors

    Publication Year: 1992, Page(s):254 - 257
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    The authors propose a parallel decomposite, best-first` search branch-and bound algorithm for MIN-based multiprocessors. They start with a new probabilistic model to estimate the number of evaluated nodes for a serial algorithm. The proposed algorithm initially decomposes a problem into several subproblems. Each processor executes the serial best-first search to find a local feasible solution. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The impact of task-length parameters on the performance of the random load-balancing algorithm

    Publication Year: 1992, Page(s):82 - 85
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    Considers the problem of dynamic load balancing in an n processors parallel system. The authors focus on the algorithm which randomly assigns newly generated tasks to processors for execution. This process is modeled by randomly throwing weighted balls into n holes. For a given program A, the ball weights (task lengths) are chosen according to an unknown probability dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive deadlock-free worm-hole routing in hypercubes

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

    Two new algorithms for worm-hole routing in the hypercube are presented. The first hypercube algorithm is adaptive, but non-minimal in the sense that some derouting is permitted. Then another deadlock-free adaptive worm-hole based routing algorithm for the hypercube interconnection is presented which is minimal. Finally some well-known worm-hole algorithms for the hypercube were evaluated together... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performability studies of hypercube architectures

    Publication Year: 1992, Page(s):488 - 495
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The authors propose a novel technique to study composite reliability and performance (performability) measures of hypercube systems using generalized stochastic Petri nets (GSPNs). This technique essentially consists of the following: (i) a GSPN reliability model; (ii) a GSPN performance model; and (iii) a way of combining the results from these two models. Models and performability results for an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Householder transformation for the regularized least square problem on iPSC/860

    Publication Year: 1992, Page(s):433 - 436
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    Discusses a householder factorization algorithm for a special type of matrix arising from the application of the Tikhnov regularization method to an ill-conditioned least square problem. The matrix involved is half dense and half sparse. The algorithm has been implemented on iPSC/860 hypercubes. By overlapping communications with computations, the code has been optimized to take advantage of the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language constructs for structured parallel programming

    Publication Year: 1992, Page(s):454 - 461
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Advocates a structured style for parallel program development. It is argued that a high-quality parallel computing program should be terminating (the program always halts in finite time) and determinate (the program always produces the same result for the same input). A methodology is presented for structured parallel programming, drawing on the successful philosophies of structured sequential pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new parallel algorithm for breadth-first search on interval graphs

    Publication Year: 1992, Page(s):150 - 153
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    The authors design an efficient parallel algorithm for constructing a breadth-first spanning tree of an interval graph. Their novel approach is based on elegantly capturing the structure of a given collection of intervals. This structure reveals important properties of the corresponding interval graph, and is found to be instrumental in solving many other problems including the computation of a br... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quadtree building algorithms on an SIMD hypercube

    Publication Year: 1992, Page(s):22 - 27
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    Presents O(log n) time SIMD hypercube algorithms for transforming binary images to linear quadtrees and vice versa, where n is the size of the images as well as the number of hypercube nodes. The quadtree building algorithm, which generates the locational codes in preorder, is an improvement of a recently reported algorithm that runs in O(log2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualization of a simple routing scheme for meshes

    Publication Year: 1992, Page(s):606 - 609
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    The authors propose a simple quasi-static routing scheme for buffered mesh connected network computers. Under the assumption of uniform traffic demands, it is demonstrated numerically that their simple routing scheme achieves near-optimal performance; in the sense of minimizing the total number of outstanding packets in a Jackson-type network. Simulation results are also presented for the case of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and analysis of fault-detecting and fault-locating schedules for computation DAGs

    Publication Year: 1992, Page(s):348 - 351
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The paper investigates issues concerning the construction of fault-detecting and fault-locating schedules for multiprocessor systems. It develops conditions for a schedule to be fault-detecting or fault-locating and further uses these conditions to propose schemes for construction of the schedules. Lower-bounds on the length of the schedules are calculated and for the special case of binary comput... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient process migration in the EMPS multiprocessor system

    Publication Year: 1992, Page(s):58 - 66
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The process migration facility in the Eindhoven multiprocessor system (EMPS) is presented. In the EMPS system, mailboxes are used for interprocess communication. These mailboxes provide transparency of location for communicating processes. The major advantages of mailbox communication in the EMPS system are: (1) interprocess communication can proceed without losing messages; and (2) the communicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting matrix operations in vector architectures

    Publication Year: 1992, Page(s):216 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    Many elementary numerical algorithms involve not only vector operations but also matrix operations. Today's vector processors only support vector operations, and execute matrix operations in terms of vector operations, because they can not access matrix operands in one instruction. This will lead to poor sustained performances of vector machines. The paper discusses how to support both vector oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal algorithms for the vertex updating problem of a minimum spanning tree

    Publication Year: 1992, Page(s):306 - 314
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The vertex updating problem for a minimum spanning tree (MST) is defined as follows: Given a graph G=(V,EG) and its MST T, update T when a new vertex z is introduced along with weighted edges that connect z with the vertices of G. The authors present a set of rules that, together with a valid tree-contraction schedule are used to produce simple optimal paralle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preventing recursion deadlock in concurrent object-oriented systems

    Publication Year: 1992, Page(s):665 - 670
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    This paper presents solutions to the problem of deadlock due to recursion in concurrent object-oriented programming languages. Two language-independent, system-level mechanisms are proposed: a novel technique using multi-ported objects, and a named-threads scheme that borrows from previous work in distributed computing. The authors compare the solutions, and present an analysis of their relative m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The impact of wiring constraints on hierarchical network performance

    Publication Year: 1992, Page(s):580 - 588
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    A unified approach, incorporating architectural and packaging issues, is necessary in the design of high performance computer networks. Clustering enables the authors to exploit the physical hierarchy imposed by packaging. Previously the authors examined the clustering of hypercube networks within the context of wiring constraints (see 1991 Int. Conf. on Parallel Processing, Aug. 1991). The author... View full abstract»

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