riented programming, design patterns, and frameworks are abstraction techniques that have been used to reduce the complexity of sequential programming. This paper describes our ap...
Steve MacDonald, John Anvik, Steven Bromling, Jona...
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
: The Logistical Computing and Internetworking (LoCI) project is a reflection of the way that the next generation internetworking fundamentally changes our definition of high perfo...
Micah Beck, Dorian C. Arnold, Alessandro Bassi, Fr...
An emerging class of data-intensive applications involve the geographically dispersed extraction of complex scientific information from very large collections of measured or compu...
William E. Allcock, Joseph Bester, John Bresnahan,...
We describe Javaflow and Paraflow, the client and server parts of a digital library, providing high-performance data-retrieval and data-mining services, with emphasis on user in...
In this paper, we analyze the efficiency of three local enumeration and three storage compression schemes for cyclic(m) data distributions in High Performance Fortran (HPF). We sh...