By Topic

Proceedings of International Conference on Parallel Processing

15-19 April 1996

Filter Results

Displaying Results 1 - 25 of 135
  • Proceedings of International Conference on Parallel Processing

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (565 KB)
    Freely Available from IEEE
  • Ocean circulation on the Intel Paragon: modeling and implementation

    Publication Year: 1996
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nested parallel call optimization

    Publication Year: 1996, Page(s):225 - 229
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (577 KB)

    We present a novel optimization called Last Parallel Call Optimization (LPCO) for parallel systems. The last parallel call optimization can be regarded as a parallel extension of last call optimization found in sequential systems. While the LPCO is fairly general, we use and-parallel logic programming systems to illustrate it and to report its performance on multiprocessor systems. The last parall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Panel on "For a Massive Number of Massively Parallel Machines: What are the Target Applications, Who

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (358 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (218 KB)
    Freely Available from IEEE
  • Planned Direct Transfers: a programming model for real-time applications

    Publication Year: 1996, Page(s):502 - 505
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    This paper presents the “Planned Direct Transfer” programming model, developed by Mercury Computer Systems to meet the requirements of embedded high-performance computing applications. In this model, data transfers are “Planned” before they occur, resulting in low software overhead execution; they are also “Direct”-they do not require intermediate data copying. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing parallel processing in a rugged embeddable environment

    Publication Year: 1996, Page(s):496 - 501
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Litton Guidance and Control Systems, together with MasPar Computer Corporation and support from the Advanced Research Projects Agency (ARPA), Information Technology Office (ITO), is addressing the problem of our military not having a fieldable, high performance, parallel processor. We are packaging MasPar's commercially successful, massively parallel processing system to minimize its size and maxi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overview of IBM system/390 parallel sysplex-a commercial parallel processing system

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

    Scalability has never been more a part of System/390 than with Parallel Sysplex. The Parallel Sysplex environment permits a mainframe or Parallel Enterprise Server to grow from a single system to a configuration of 32 systems (initially), and appear as a single image to the end user and applications. The IBM S/390 Parallel Sysplex provides capacity for today's largest commercial workloads by enabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance prediction with benchmaps

    Publication Year: 1996, Page(s):479 - 484
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Benchmapping is a performance prediction method for data-parallel programs that is based on modeling the performance of runtime systems. This paper describes a benchmapping system, called BENCHCVL, that predicts the running time of data-parallel programs written in the NESL language on several computer systems. BENCHCVL predicts performance using a set of more than 200 parameterized models. The mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete parallelization of computations: integration of data partitioning and functional parallelism for dynamic data structures

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

    This paper presents a parallel programming system which: supports complete parallelization of array-oriented computations through a coherent integration of data partitioning parallelization and functional decomposition based parallelization; and implements a declarative representation of operations over distributed dynamic arrays. The conceptual framework for this integration is a generalized depe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward symbolic performance prediction of parallel programs

    Publication Year: 1996, Page(s):474 - 478
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    Critical analyses in performance estimators for parallel programs require an algorithm that count the number of integer solutions to a set of inequalities. Most current performance estimators are restricted to linear inequalities for this analysis. In this paper we describe a symbolic algorithm which can estimate the number of integer solutions to a set of both linear and non-linear inequalities. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive approach to data placement

    Publication Year: 1996, Page(s):349 - 353
    Cited by:  Papers (4)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    Programming distributed-memory machines requires careful placement of data to balance the computational load among the nodes and minimize excess data movement between the nodes. Most current approaches to data placement require the programmer or compiler to place data initially and then possibly to move it explicitly during a computation. This paper describes a new, adaptive approach. It is implem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Profiling optimized code: a profiling system for an HPF compiler

    Publication Year: 1996, Page(s):469 - 473
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    High Performance Fortran (HPF), a portable data-parallel language, is based on a high-level model which abstracts programming details away from the user. To achieve high performance, the HPF compiler must optimize the code, which may result in a significant change to the original code structure. Because the performances of the optimized and non-optimized codes differ, profiling HPF programs with c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hector: automated task allocation for MPI

    Publication Year: 1996, Page(s):344 - 348
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Many institutions already have networks of workstations, which could potentially be harnessed as a powerful parallel processing resource. A new, automatic task allocation system has been built on top of MPI, an environment that permits parallel programming by using the message-passing paradigm and implemented in extensions to C and FORTRAN. This system, known as “Hector”, supports dyna... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximizing speedup through self-tuning of processor allocation

    Publication Year: 1996, Page(s):463 - 468
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Addresses the problem of maximizing application speedup through run-time self-selection of an appropriate number of processors on which to run. Automatic run-time selection of processor allocations is important because many parallel applications exhibit peak speedups at allocations that are data- or time-dependent. We propose the use of a run-time system that: (a) dynamically measures job efficien... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of scalable blocking locks using an adaptive thread scheduler

    Publication Year: 1996, Page(s):339 - 343
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    Blocking locks are commonly used in parallel programs to improve application performance and system throughput. However, most implementations of such locks suffer from two major problems-latency and scalability. We propose an implementation of blocking locks using scheduler adaptation which exploits the interaction between thread schedulers and locks. By experimentation using well-known multiproce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dome: parallel programming in a distributed computing environment

    Publication Year: 1996, Page(s):218 - 224
    Cited by:  Papers (8)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    The Distributed object migration environment (Dome) addresses three major issues of distributed parallel programming: ease of use, load balancing, and fault tolerance. Dome provides process control, data distribution, communication, and synchronization for Dome programs running in a heterogeneous distributed computing environment. The parallel programmer writes a C++ program using Dome objects whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The relation of scalability and execution time

    Publication Year: 1996, Page(s):457 - 462
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Scalability has been used extensively as a de facto performance criterion for evaluating parallel algorithms and architectures. In this paper, the relation between scalability and execution time is carefully studied. Results show that isospeed scalability well characterizes the variation of execution time. Three algorithms from scientific computing are implemented on an Intel Paragon and an IBM SP... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous compression of makespan and number of processors using CRP

    Publication Year: 1996, Page(s):332 - 338
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    This paper presents a new 2D compression (2DC) method for solving the multiprocessor scheduling (MS) problems to simultaneously achieve both objectives of minimizing the makespan and the number of processors used. Most existing approaches tend to focus on a very specific range of the MS problems, while risking the loss of the solution quality elsewhere. 2DC synthesizes two main classes of compress... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application load imbalance on parallel processors

    Publication Year: 1996, Page(s):836 - 842
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    This paper addresses the issue of dynamic load imbalance in a class of synchronous iterative applications, and develops a model to represent their workload dynamics. Such models of application load dynamics help in more accurate performance prediction and in the design of efficient load balancing algorithms. Our model captures the workload dynamics across iterations, and predicts the workload dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel solution to the extended set union problem with unlimited backtracking

    Publication Year: 1996, Page(s):182 - 186
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    We study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition Π of an n-element set S subject to the usual operations Find, Union, Backtrack and Restore as well as the new operations SetUnion, MultiUnion. The SetUnion operation as a special case of the commonly known Union operation aimed to unify two pre-sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Converse: an interoperable framework for parallel programming

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

    Many different parallel languages and paradigms have been developed, each with its own advantages. To benefit from all of them, it should be possible to link together modules written in different parallel languages in a single application. Since the paradigms sometimes differ in fundamental ways, this is difficult to accomplish. This paper describes a framework, Converse, that supports such multi-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient execution of parallel applications in multiprogrammed multiprocessor systems

    Publication Year: 1996, Page(s):448 - 456
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    Existing techniques for sharing the processing resources in multiprogrammed shared-memory multiprocessors, such as time-sharing, space-sharing and gang-scheduling, typically sacrifice the performance of individual parallel applications to improve overall system utilization. We present a new processor allocation technique that dynamically adjusts the number of processors an application is allowed t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for image enhancement and segmentation by region growing with an experimental study

    Publication Year: 1996, Page(s):414 - 423
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB)

    Presents efficient and portable implementations of a useful image enhancement process, the symmetric neighborhood filter (SNF), and an image segmentation technique which makes use of the SNF and a variant of the conventional connected components algorithm which we call δ-connected components. We use efficient techniques for distributing and coalescing data as well as efficient combinations o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource placement in torus-based networks

    Publication Year: 1996, Page(s):327 - 331
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost/performance tradeoffs in a torus parallel machine. This paper contains some solutions to perfect distance-t and perfect/quasi-perfect j-adjacency placement in a κ-ary n-cube and a torus using Lee (1958) distance error-correcting codes View full abstract»

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