Results 1 
4 of
4
Monitors, Messages, and Clusters: the p4 Parallel Programming System
"... p4 is a portable library of C and Fortran subroutines for programming parallel computers. It is the current version of a system that has been in use since 1984. It includes features for explicit parallel programming of sharedmemory machines, distributedmemory machines (including heterogeneous netw ..."
Abstract

Cited by 123 (15 self)
 Add to MetaCart
p4 is a portable library of C and Fortran subroutines for programming parallel computers. It is the current version of a system that has been in use since 1984. It includes features for explicit parallel programming of sharedmemory machines, distributedmemory machines (including heterogeneous networks of workstations), and clusters, by which we mean sharedmemory multiprocessors communicating via message passing. We discuss here the design goals, history, and system architecture of p4 and describe briefly a diverse collection of applications that have demonstrated the utility of p4. 1 Introduction p4 is a library of routines designed to express a wide variety of parallel algorithms portably, efficiently and simply. The goal of portability requires it to use widely accepted models of computation rather than specific vendor implementations of those models. The goal of efficiency requires it to use models of computation relatively close to those provided by the machines themselves and t...
Parallel Heuristics for Improved, Balanced Graph Colorings
 Journal of Parallel and Distributed Computing
, 1996
"... : The computation of good, balanced graph colorings is an essential part of many algorithms required in scientific and engineering applications. Motivated by an effective sequential heuristic, we introduce a new parallel heuristic, PLF, and show that this heuristic has the same expected runtime unde ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
: The computation of good, balanced graph colorings is an essential part of many algorithms required in scientific and engineering applications. Motivated by an effective sequential heuristic, we introduce a new parallel heuristic, PLF, and show that this heuristic has the same expected runtime under the PRAM computational model as the scalable coloring heuristic introduced by Jones and Plassmann (JP). We present experimental results performed on the Intel DELTA that demonstrate that this new heuristic consistently generates better colorings and requires only slightly more time than the JP heuristic. In the second part of the paper we introduce two new parallel colorbalancing heuristics, PDR(k) and PLF(k). We show that these heuristics have the desirable property that they do not increase the number of colors used by an initial coloring during the balancing process. We present experimental results that show that these heuristics are very effective in obtaining balanced colorings and, ...
Finite Element Analysis of the Piezoelectric Vibrations of Quartz Plate Resonators With Higherorder Plate Theory
, 1997
"... A finite element formulation of the vibrations of piezoelectric quartz resonators based on Mindlin plate theory is derived. The higherorder plate theory is employed for the development of a collection of successively higherorder plate elements which can be effective for a broad frequency range inc ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
A finite element formulation of the vibrations of piezoelectric quartz resonators based on Mindlin plate theory is derived. The higherorder plate theory is employed for the development of a collection of successively higherorder plate elements which can be effective for a broad frequency range including the fundamental and overtone modes of thicknessshear vibrations. The presence of electrodes is also considered for its mechanical effects. The mechanical displacements and electric potential are combined into a generalized displacement field, and the subsequent derivations are carried out with all the generalized equations. Through standard finite element procedure, the vibration frequency and vibration mode shapes include the electric potential distribution are obtained. The frequency spectra is compared with some wellknown experimental results with good agreement. Our previous experience with finite element analysis of high frequency quartz plate vibrations leads us to believe tha...
Software For The Generalized Eigenproblem On Distributed Memory Architectures
"... . The generalized eigenproblem is of significant importance in several fields. Generalized eigenproblems can be very large with matrices of order greater than one million for problems arising from threedimensional finite element models. To solve such problems we are proposing a flexible software sy ..."
Abstract
 Add to MetaCart
(Show Context)
. The generalized eigenproblem is of significant importance in several fields. Generalized eigenproblems can be very large with matrices of order greater than one million for problems arising from threedimensional finite element models. To solve such problems we are proposing a flexible software system for parallel distributed memory architectures. This software is based on the Lanczos algorithm with a shiftandinvert transformation. In this paper we briefly describe the prototype version of the software, present computational results, and indicate the status of the project. 1. Introduction. The solution of the symmetric generalized eigenvalue problem, Kx = Mx; (1) where K and M are real, symmetric matrices, and either K or M is positive semidefinite, is of significant practical importance, especially in structural engineering as the vibration problem and the buckling problem [1]. The matrices K and M are either banded or sparse. Usually m !! n of the smallest eigenvalues of Equat...