Sciweavers

1855 search results - page 65 / 371
» A coding theorem for distributed computation
Sort
View
72
Voted
PPAM
2005
Springer
15 years 6 months ago
Adapting Linear Algebra Codes to the Memory Hierarchy Using a Hypermatrix Scheme
Abstract. We present the way in which we adapt data and computations to the underlying memory hierarchy by means of a hierarchical data structure known as hypermatrix. The applicat...
José R. Herrero, Juan J. Navarro
ICCS
2007
Springer
15 years 4 months ago
Distributed Applications from Scratch: Using GridMD Workflow Patterns
A new approach is proposed to generate workflow scenarios of scientific applications such as Molecular Dynamics and Monte-Carlo simulations in a distributed environment. The approa...
I. Morozov, Ilya Valuev
112
Voted
ARTS
1999
Springer
15 years 4 months ago
A Formal Model of Real-Time Program Compilation
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
Karl Lermer, Colin J. Fidge
IPPS
1996
IEEE
15 years 4 months ago
Resource Placement in Torus-Based Networks
This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost / performance tradeoffs in a torus p...
Myung M. Bae, Bella Bose
PPOPP
2012
ACM
13 years 8 months ago
Mechanizing the expert dense linear algebra developer
The efforts of an expert to parallelize and optimize a dense linear algebra algorithm for distributed-memory targets are largely mechanical and repetitive. We demonstrate that the...
Bryan Marker, Andy Terrel, Jack Poulson, Don S. Ba...