CLUE: A Cluster Evaluation Tool

CLUE: A Cluster Evaluation Tool

Date: December 2006
Creator: Parker, Brandon S.
Description: Modern high performance computing is dependent on parallel processing systems. Most current benchmarks reveal only the high level computational throughput metrics, which may be sufficient for single processor systems, but can lead to a misrepresentation of true system capability for parallel systems. A new benchmark is therefore proposed. CLUE (Cluster Evaluator) uses a cellular automata algorithm to evaluate the scalability of parallel processing machines. The benchmark also uses algorithmic variations to evaluate individual system components' impact on the overall serial fraction and efficiency. CLUE is not a replacement for other performance-centric benchmarks, but rather shows the scalability of a system and provides metrics to reveal where one can improve overall performance. CLUE is a new benchmark which demonstrates a better comparison among different parallel systems than existing benchmarks and can diagnose where a particular parallel system can be optimized.
Contributing Partner: UNT Libraries
Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design

Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design

Date: December 1993
Creator: Halverson, Ranette Hudson
Description: The goal of a parallel algorithm is to solve a single problem using multiple processors working together and to do so in an efficient manner. In this regard, there is a need to categorize strategies in order to solve broad classes of problems with similar structures and requirements. In this dissertation, two parallel algorithm design strategies are considered: linked list ranking and parentheses matching.
Contributing Partner: UNT Libraries
Practical Parallel Processing

Practical Parallel Processing

Date: August 1996
Creator: Zhang, Hua, 1954-
Description: The physical limitations of uniprocessors and the real-time requirements of numerous practical applications have made parallel processing an essential technology in military, industry and scientific research. In this dissertation, we investigate parallelizations of three practical applications using three parallel machine models. The algorithms are: Finitely inductive (FI) sequence processing is a pattern recognition technique used in many fields. We first propose four parallel FI algorithms on the EREW PRAM. The time complexity of the parallel factoring and following by bucket packing is O(sk^2 n/p), and they are optimal under some conditions. The parallel factoring and following by hashing requires O(sk^2 n/p) time when uniform hash functions are used and log(p) ≤ k n/p and pm ≈ n. Their speedup is proportional to the number processors used. For these results, s is the number of levels, k is the size of the antecedents and n is the length of the input sequence and p is the number of processors. We also describe algorithms for raster/vector conversion based on the scan model to handle block-like connected components of arbitrary geometrical shapes with multi-level nested dough nuts for the IES (image exploitation system). Both the parallel raster-to-vector algorithm and parallel vector-to-raster algorithm require ...
Contributing Partner: UNT Libraries
Parallel Programming with PCN

Parallel Programming with PCN

Date: September 1991
Creator: Foster, Ian & Tuecke, Steven
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 programming system. It includes both tutorial and reference material. It also presents the basic concepts that underlie PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools.
Contributing Partner: UNT Libraries Government Documents Department
Proceedings of the Workshop on Compilation of (Symbolic) Languages for Parallel Computers  : Held October 31 - November 1, 1991, San Diego, CA

Proceedings of the Workshop on Compilation of (Symbolic) Languages for Parallel Computers : Held October 31 - November 1, 1991, San Diego, CA

Date: November 1991
Creator: Foster, Ian & Tick, Evan
Description: This report comprises the abstracts and papers for the talks presented at the Workshop on Compilation of (Symbolic) Languages for Parallel Computers, held October 31 - November 1, 1991, in San Diego. These unrefereed contributions were provided by the participants for the purpose of this workshop; many of them will be published elsewhere in peer-reviewed conferences and publications.
Contributing Partner: UNT Libraries Government Documents Department
Activities and Operations of the Advanced Computing Research Facility : January 1989-January 1990

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

Date: February 1990
Creator: Pieper, Gail W.
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.
Contributing Partner: UNT Libraries Government Documents Department
Parallel Programming with PCN. Revision 1

Parallel Programming with PCN. Revision 1

Date: December 1991
Creator: Foster, Ian & Tuecke, Steven
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 system. In includes both tutorial and reference material. It also presents the basic concepts that underlie PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools.
Contributing Partner: UNT Libraries Government Documents Department
Activities and Operations of Argonne's Advanced Computing Research Facility : February 1990 through April 1991

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

Date: May 1991
Creator: Pieper, Gail W.
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 academia.
Contributing Partner: UNT Libraries Government Documents Department
Research in Mathematics and Computer Science at Argonne : September 1989 - February 1991

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

Date: August 1991
Creator: Pieper, Gail W.
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, workshops, and seminars is found in the appendixes.
Contributing Partner: UNT Libraries Government Documents Department
Research in Mathematics and Computer Science: March 1, 1991 - September 30, 1992

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

Date: October 1992
Creator: Pieper, Gail W.
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 Linear Algebra; Reliable Core Software; Computing Phylogenetic Trees; Managing Life-Critical Systems; Interacting with Data through Visualization; New Tools for New Technologies.
Contributing Partner: UNT Libraries Government Documents Department
Studying Parallel Program Behavior with Upshot

Studying Parallel Program Behavior with Upshot

Date: August 1991
Creator: Herrarte, Virginia & Lusk, E.
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.
Contributing Partner: UNT Libraries Government Documents Department
Activities and Operations of the Advanced Computing Research Facility : November 1987-December 1988

Activities and Operations of the Advanced Computing Research Facility : November 1987-December 1988

Date: January 1989
Creator: Pieper, Gail W.
Description: Report on the activities of Argonne Advanced Computing Research Facility, including LAPACK, vectorizing compilers, algorithm design and restructuring, automated deduction, three-dimensional scientific visualization, and graphics trace facilities.
Contributing Partner: UNT Libraries Government Documents Department
Parallel Programming with PCN. Revision 2

Parallel Programming with PCN. Revision 2

Date: January 1993
Creator: Foster, Ian & Tuecke, Steven
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 system. It includes both tutorial and reference material. It also presents the basic concepts that underlie PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools. This version of this document describes PCN version 2.0, a major revision of the PCN programming system. It supersedes earlier versions of this report.
Contributing Partner: UNT Libraries Government Documents Department
An Approach to Implementing State Space Searches on Heterogeneous Systems of Multiprocessors

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

Date: September 1987
Creator: Glickfeld, Barney & Overbeek, Ross A.
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 distributed over four distinct shared memory multiprocessors (2 Sequents and 2 Encores), reducing the time to perform the computation to slightly over 2 hours.
Contributing Partner: UNT Libraries Government Documents Department
Activities and Operations of the Advanced Computing Research Facility : October 1986-October 1987

Activities and Operations of the Advanced Computing Research Facility : October 1986-October 1987

Date: 1987?
Creator: Pieper, Gail W.
Description: This paper contains a description of the work being carried out at the advanced computing research facility at Argonne National Laboratory. Topics covered are upgrading of computers, networking changes, algorithms, parallel programming, programming languages, and user training.
Contributing Partner: UNT Libraries Government Documents Department
Practical Issues Relating to the Internal Database Predicates in an OR-Parallel Prolog : Extensions and Useful Hacks

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

Date: February 1988
Creator: Carlsson, Mats; Danhof, Kenneth J. & Overbeek, R.
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 environment. Then we show how these predicates can be used to implement AND-parallelism. Finally, we illustrate their use for implementing a limited notion of streams, and how such streams can be used to create a compiler that achieves excellent speedups for multiprocessors with a limited number of processors.
Contributing Partner: UNT Libraries Government Documents Department
Research in Mathematics and Computer Science at Argonne : July 1, 1986 - January 6, 1988

Research in Mathematics and Computer Science at Argonne : July 1, 1986 - January 6, 1988

Date: 1988
Creator: Pieper, Gail W.
Description: This report reviews the research activities in the Mathematics and Computer Science Division at Argonne National Laboratory for the period July 1, 1986, through January 6, 1988. The body of the report gives a brief look at the MCS staff and the research facilities, and discusses various projects carried out in two major areas of research: analytical and numerical methods and advanced computer systems concepts. Information on division staff, visitors, workshops, and seminars is found in the appendixes.
Contributing Partner: UNT Libraries Government Documents Department
Research in Mathematics and Computer Science at Argonne : January 1988 - August 1989

Research in Mathematics and Computer Science at Argonne : January 1988 - August 1989

Date: August 1989
Creator: Pieper, Gail W.
Description: This report, reviews the research activities in the Mathematics and Computer Science Division at Argonne National Laboratory for the period January 1988 - August 1989. The body of the report gives a brief look at the MCS staff an-d the research facilities, and discusses various projects carried out in two major areas of research: analytical and numerical methods and advanced computing concepts. Projects funded by non-DOE sources are also discussed, and new technology transfer activities are described. Further informant ion or division staff, visitors, workshops, and seminars is found in the appendices.
Contributing Partner: UNT Libraries Government Documents Department
Quasi-Automatic Parallelization : a Simplified Approach to Multiprocessing

Quasi-Automatic Parallelization : a Simplified Approach to Multiprocessing

Date: October 1985
Creator: Glickfeld, B. W.
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 a real simplification for the applications programmer. In this paper, we propose a straight-forward programming paradigm for describing schedulable units of computation that allows the description of many algorithms with very little effort.
Contributing Partner: UNT Libraries Government Documents Department
Programming in Fortran M

Programming in Fortran M

Date: August 1993
Creator: Foster, Ian; Olson, Robert & Tuecke, Steven
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 range of sequential, parallel, and networked computers. This report incorporates both a tutorial introduction to Fortran M and a users guide for the Fortran M compiler developed at Argonne National Laboratory. The Fortran M compiler, supporting software, and documentation are made available free of charge by Argonne National Laboratory, but are protected by a copyright which places certain restrictions on how they may be redistributed. See the software for details. The latest version of both the compiler and this manual can be obtained by anonymous ftp from Argonne National Laboratory in the directory pub/fortran-m at info.mcs.anl.gov.
Contributing Partner: UNT Libraries Government Documents Department
Parallel Solution of the Time-Dependent Ginzburg-Landau Equations and other Experiences using BlockComm-Chameleon and PCN on the IBM SP, Intel iPSC/860, and Clusters of Workstations

Parallel Solution of the Time-Dependent Ginzburg-Landau Equations and other Experiences using BlockComm-Chameleon and PCN on the IBM SP, Intel iPSC/860, and Clusters of Workstations

Date: September 1995
Creator: Coskun, Erhan & Kwong, Man Kam
Description: Time-dependent Ginzburg-Landau (TDGL) equations are considered for modeling a thin-film finite size superconductor placed under magnetic field. The problem then leads to the use of so-called natural boundary conditions. Computational domain is partitioned into subdomains and bond variables are used in obtaining the corresponding discrete system of equations. An efficient time-differencing method based on the Forward Euler method is developed. Finally, a variable strength magnetic field resulting in a vortex motion in Type II High-critical-temperature superconducting films is introduced. The authors tackled the problem using two different state-of-the-art parallel computing tools: BlockComm/Chameleon and PCN. They had access to two high-performance distributed memory supercomputers: the Intel iPSC/860 and IBM SP1. They also tested the codes using, as a parallel computing environment, a cluster of Sun Sparc workstations.
Contributing Partner: UNT Libraries Government Documents Department
Using a Transfer Function to Describe the Load-Balancing Problem

Using a Transfer Function to Describe the Load-Balancing Problem

Date: November 1993
Creator: Conley, Andrew J.
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.
Contributing Partner: UNT Libraries Government Documents Department
BlockSolve v1. 1: Scalable Library Software for the Parallel Solution of Sparse Linear Systems

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

Date: March 1993
Creator: Jones, Mark T. & Plassmann, Paul E.
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.
Contributing Partner: UNT Libraries Government Documents Department
A Test Implementation of the MPI Draft Message-Passing Standard

A Test Implementation of the MPI Draft Message-Passing Standard

Date: December 1992
Creator: Gropp, William & Lusk, Ewing L.
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, henceforth referred to as the MPI (Message-Passing Interface) draft standard. After review by a larger group, and significant changes in the document, a meeting was held in November to discuss the MPI draft standard. This document is a result of those discussions; it describes a running implementation of in most of the proposed standard, plus additional routines that were suggested by the discussions at the November meeting.
Contributing Partner: UNT Libraries Government Documents Department
FIRST PREV 1 2 NEXT LAST