Bret A. Marsolf

Learn More
1 I n t r o d u c t i o n The deve lopmen t of efficient numer ica l p r o g r a m s and l i b r a ry rou t ines for highpe r fo rmance para l l e l compu te r s is a complex task requi r ing not only an unders t a n d i n g of the a lgo r i t hms to be imp lemen ted , bu t also de ta i l ed knowledge of the t a rge t mach ine and the sof tware env i(More)
In this paper, the methods and implementation techniques used for the nonsymmetric sparse linear system solver, MCSPARSE, on the Cedar system are described. A novel reordering scheme (H*) upon which the solver is based is presented. The tradeoffs discussed include stability and fill-in control, hierarchical parallelism, and load balancing. Experimental(More)
The eeciency of solving sparse linear systems on parallel processors and more complex multicluster architectures such as Cedar is greatly enhanced if relatively large grain computational tasks can be assigned to each cluster or processor. The ordering of a system into a bordered block upper triangular form facilitates a reasonable large-grain partitioning.(More)
In this paper a tool is presented for the development of numerical libraries for an object-oriented environment. The development of libraries has become more complicated as libraries have become larger and the subroutines have become more complex. In the object{oriented environment this development is further complicated by the object interface which(More)
The development of efficient numerical programs and library routines for high-performance parallel computers is a complex task requiring not only an understanding of the algorithms to be implemented, but also detailed knowledge of the target machine and the software environment. In this paper, we describe a programming environment that can utilize such(More)
The development of e cient numerical programs and library routines for high-performance parallel computers is a complex task requiring not only an understanding of the algorithms to be implemented, but also detailed knowledge of the target machine and the software environment. In this paper, we describe a programming environment that can utilize such(More)
In this paper we consider techniques for improving the performance of codes for general sparse problems by extracting both local and global structure information from a sparse matrix instance. This information can be used to improve the performance of the primitives through the utilization of specialized methods for the component parts which result from the(More)