Search Results

Advanced search parameters have been applied.
open access

On finding minimum-diameter clique trees

Description: It is well-known that any chordal graph can be represented as a clique tree (acyclic hypergraph, join tree). Since some chordal graphs have many distinct clique tree representations, it is interesting to consider which one is most desirable under various circumstances. A clique tree of minimum diameter (or height) is sometimes a natural candidate when choosing clique trees to be processed in a parallel computing environment. This paper introduces a linear time algorithm for computing a minimum-… more
Date: August 1, 1991
Creator: Blair, J.R.S. (Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science) & Peyton, B.W. (Oak Ridge National Lab., TN (United States))
Partner: UNT Libraries Government Documents Department
open access

A domain decomposition algorithm for solving large elliptic problems

Description: AN algorithm which efficiently solves large systems of equations arising from the discretization of a single second-order elliptic partial differential equation is discussed. The global domain is partitioned into not necessarily disjoint subdomains which are traversed using the Schwarz Alternating Procedure. On each subdomain the multigrid method is used to advance the solution. The algorithm has the potential to decrease solution time when data is stored across multiple levels of a memory hier… more
Date: January 1, 1991
Creator: Nolan, M.P.
Partner: UNT Libraries Government Documents Department
open access

Parallel supercomputing: Advanced methods, algorithms and software for large-scale problems

Description: Research has continued with excellent progress and new results on methodology and algorithms. We have also made supporting benchmark application studies on representative parallel computing architectures. Results from these research studies have been reported at scientific meetings, as technical reports and as journal publications. A list of pertinent presentations and publications is attached. The work on parallel element-by-element techniques and domain decomposition schemes has developed wel… more
Date: April 1, 1992
Creator: Carey, G.F. & Young, D.M.
Partner: UNT Libraries Government Documents Department
open access

Progress Report: Network Based High Performance Concurrent Computing

Description: The overall objectives of this project are to investigate research issues pertaining to programming tools and efficiency issues in network based concurrent computing systems. The basis for these efforts is the PVM project that evolved during my visits to Oak Ridge Laboratories under the DOE Faculty Research Participation program; I continue to collaborate with researchers at Oak Ridge on some portions of the project.
Date: 1991~
Creator: Sunderam, V. S.
Partner: UNT Libraries Government Documents Department
open access

Quasi-Automatic Parallelization : a Simplified Approach to Multiprocessing

Description: As multiprocessors become commercially available, a great deal of concern is being focused on the problems involved in writing and debugging software for such machines. Earlier work described the use of monitors implemented by macro processors to attain portable code. This work formulates a general-purpose monitor which simplifies the programming of a wide class of numeric algorithms. We believe that the approach of describing a set of schedulable units of computation advocated by Brown offers … more
Date: October 1985
Creator: Glickfeld, B. W. & Overbeek, Ross A.
Partner: UNT Libraries Government Documents Department
open access

Activities and Operations of the Advanced Computing Research Facility : January 1989-January 1990

Description: This report reviews the activities and operations of the Advanced Computing Research Facility (ACRF) for the period January 1, 1989, through January 31, 1990. The ACRF is operated by the Mathematics and Computer Science Division at Argonne National Laboratory. The facility's principal objective is to foster research in parallel computing. Toward this objective, the ACRF continues to operate experimental advanced computers and to sponsor new technology transfer efforts and new research projects.
Date: February 1990
Creator: Pieper, Gail W.
Partner: UNT Libraries Government Documents Department
open access

Studying Parallel Program Behavior with Upshot

Description: This is a description of and a user's manual for upshot, an X-based graphics tool for viewing log files produced by parallel programs.
Date: August 1991
Creator: Herrarte, Virginia & Lusk, Ewing
Partner: UNT Libraries Government Documents Department
open access

Research in Mathematics and Computer Science at Argonne : September 1989 - February 1991

Description: This report reviews the research activities in the Mathematics and Computer Science Division at Argonne National Laboratory for the period September 1989 through February 1991. The body of the report gives a brief look at the MCS staff and the research facilities and then discusses the diverse research projects carried out in the division. Projects funded by non-DOE sources are also discussed, and new technology transfer activities are described. Further information on staff, visitors, workshop… more
Date: August 1991
Creator: Pieper, Gail W.
Partner: UNT Libraries Government Documents Department
open access

Activities and Operations of Argonne's Advanced Computing Research Facility : February 1990 through April 1991

Description: This report reviews the activities and operations of the Advanced Computing Research Facility (ACRF) from February 1990 through April 1991. The ACRF is operated by the Mathematics and Computer Science Division at Argonne National Laboratory. The facility's principal objective is to foster research in parallel computing. Toward this objective, the ACRF operates experimental advanced computers, supports investigations in parallel computing, and sponsors technology transfer efforts to industry and… more
Date: May 1991
Creator: Pieper, Gail W.
Partner: UNT Libraries Government Documents Department
open access

Parallel Programming with PCN

Description: PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, a set of tools for developing and debugging programs in this language, and interfaces to Fortran and C that allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN progr… more
Date: September 1991
Creator: Foster, Ian & Tuecke, Steven
Partner: UNT Libraries Government Documents Department
open access

Parallel Programming with PCN. Revision 1

Description: PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, tools for developing and debugging programs in this language, and interfaces to Fortran and C that allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN programming sy… more
Date: December 1991
Creator: Foster, Ian & Tuecke, Steven
Partner: UNT Libraries Government Documents Department
open access

Parallel Programming with PCN. Revision 2

Description: PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, tools for developing and debugging programs in this language, and interfaces to Fortran and C that allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN programming sy… more
Date: January 1993
Creator: Foster, Ian & Tuecke, Steven
Partner: UNT Libraries Government Documents Department
open access

An Approach to Implementing State Space Searches on Heterogeneous Systems of Multiprocessors

Description: We report on experiments run on a set of shared-memory multiprocessors. Our goal was to demonstrate that one could conveniently utilize a set of shared-memory multiprocessors cooperatively working on typical state-space searches. We utilized a technology for writing portable code for multiprocessors, coded three depth-first state-space searches, and ran them on a set of multiprocessors. The final problem used substantial resources (over 65 hours on a single processor) and was successfully distr… more
Date: September 1987
Creator: Glickfeld, Barney & Overbeek, Ross A.
Partner: UNT Libraries Government Documents Department
open access

Research in Mathematics and Computer Science: March 1, 1991 - September 30, 1992

Description: This report discusses the following topics in mathematics and computer science at Argonne National Laboratory: Harnessing the Power; Modeling Piezoelectric Crystals; A Two-Way Street; The Challenge Is On; A True Molecular Engineering Capability; CHAMMPions Attack Climate Issues; Studying Vortex Dynamics; Studying Vortex Structure; Providing Reliable and Fast Derivatives; Automating Reasoning for Scientific Problem Solving; Optimization and Mathematical Programming; Scalable Algorithms for Linea… more
Date: October 1992
Creator: Pieper, Gail W.
Partner: UNT Libraries Government Documents Department
open access

Using a Transfer Function to Describe the Load-Balancing Problem

Description: The dynamic load-balancing problem for mesh-connected parallel computers can be clearly described by introducing a function that identifies how much work is to be transmitted between neighboring processors. This function is a solution to an elliptic problem for which a wealth of knowledge exists. The non-uniqueness of the solution to the load-balancing problem is made explicit.
Date: November 1993
Creator: Conley, Andrew J.
Partner: UNT Libraries Government Documents Department
open access

Early Experiences with the IBM SP1 and the High-Performance Switch

Description: The IBM SP1 is IBM`s newest parallel distributed-memory computer. As part of a joint project with IBM, Argonne took delivery of an early system in order to evaluate the software environment and to begin porting programming packages and applications to this machine. This report discusses the results of those efforts once the high-performance switch was installed. An earlier report (ANL/MCS-TM-177) emphasized software usability and the initial ports to the SP1. This report contains performance re… more
Date: November 1993
Creator: Gropp, William
Partner: UNT Libraries Government Documents Department
open access

A Parallel Genetic Algorithm for the Set Partitioning Problem

Description: In this dissertation the author reports on his efforts to develop a parallel genetic algorithm and apply it to the solution of set partitioning problem -- a difficult combinatorial optimization problem used by many airlines as a mathematical model for flight crew scheduling. He developed a distributed steady-state genetic algorithm in conjunction with a specialized local search heuristic for solving the set partitioning problem. The genetic algorithm is based on an island model where multiple i… more
Date: May 1994
Creator: Levine, David
Partner: UNT Libraries Government Documents Department
open access

BlockSolve v1. 1: Scalable Library Software for the Parallel Solution of Sparse Linear Systems

Description: BlockSolve is a software library for solving large, sparse systems of linear equations on massively parallel computers. The matrices must be symmetric, but may have an arbitrary sparsity structure. BlockSolve is a portable package that is compatible with several different message-passing pardigms. This report gives detailed instructions on the use of BlockSolve in applications programs.
Date: March 1993
Creator: Jones, Mark T. & Plassmann, Paul E.
Partner: UNT Libraries Government Documents Department
open access

A Test Implementation of the MPI Draft Message-Passing Standard

Description: Message passing is a common method for programming parallel computers. The lack of a standard has significantly impeded the development of portable software libraries for these machines. Recently, an ad-hoc committee was formed to develop a standard for message-passing software for parallel computers. This group first met in April 1992 at a workshop sponsored in part by the Center for Research on Parallel Computation (CRPC). Four of the attendees at that meeting produced a draft standard, hence… more
Date: December 1992
Creator: Gropp, William & Lusk, Ewing L.
Partner: UNT Libraries Government Documents Department
open access

Users manual for the Chameleon Parallel Programming Tools

Description: Message passing is a common method for writing programs for distributed-memory parallel computers. Unfortunately, the lack of a standard for message passing has hampered the construction of portable and efficient parallel programs. In an attempt to remedy this problem, a number of groups have developed their own message-passing systems, each with its own strengths and weaknesses. Chameleon is a second-generation system of this type. Rather than replacing these existing systems, Chameleon is mea… more
Date: June 1993
Creator: Gropp, William & Smith, Barry
Partner: UNT Libraries Government Documents Department
open access

Programming in Fortran M

Description: Fortran M is a small set of extensions to Fortran that supports a modular approach to the construction of sequential and parallel programs. Fortran M programs use channels to plug together processes which may be written in Fortran M or Fortran 77. Processes communicate by sending and receiving messages on channels. Channels and processes can be created dynamically, but programs remain deterministic unless specialized nondeterministic constructs are used. Fortran M programs can execute on a rang… more
Date: August 1993
Creator: Foster, Ian; Olson, Robert & Tuecke, Steven
Partner: UNT Libraries Government Documents Department
open access

Programming in Fortran M Revision 1

Description: Fortran M is a small set of extensions to Fortran that supports a modular approach to the construction of sequential and parallel programs. Fortran M programs use channels to plug together processes which may be written in Fortran M or Fortran 77. Processes communicate by sending and receiving messages on channels. Channels and processes can be created dynamically, but programs remain deterministic unless specialized nondeterministic constructs are used. Fortran M programs can execute on a rang… more
Date: October 1993
Creator: Foster, Ian; Olson, Robert & Tuecke, Steven
Partner: UNT Libraries Government Documents Department
open access

Practical Issues Relating to the Internal Database Predicates in an OR-Parallel Prolog: Extensions and Useful Hacks

Description: This technical report is being written to document and explain some of the insights the authors have gained during the implementation of two OR-parallel Prolog systems for shared-memory multiprocessors. We have been quite amazed by how much power and functionality can be achieved through the implementation of just a few primitive predicates. We introduce a few relatively trivial predicates which allow one to implement versions of findall/3, bagof/3, and setof/3 for the a multiprocessor environm… more
Date: February 1988
Creator: Carlsson, Mats; Danhof, Ken & Overbeek, Ross
Partner: UNT Libraries Government Documents Department
Back to Top of Screen