Sciweavers

1611 search results - page 188 / 323
» A Library for Self-Adjusting Computation
Sort
View
PLDI
2010
ACM
16 years 4 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
CNHPCA
2009
Springer
16 years 1 months ago
Benchmarking Parallel I/O Performance for a Large Scale Scientific Application on the TeraGrid
This paper is a report on experiences in benchmarking I/O performance on leading computational facilities on the NSF TeraGrid network with a large scale scientific application. In...
Frank Löffler, Jian Tao, Gabrielle Allen, Eri...
HIPC
2005
Springer
16 years 2 days ago
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
David A. Bader, Kamesh Madduri
HIPC
2004
Springer
15 years 12 months ago
Performance Characteristics of a Cosmology Package on Leading HPC Architectures
Abstract. The Cosmic Microwave Background (CMB) is a snapshot of the Universe some 400,000 years after the Big Bang. The pattern of anisotropies in the CMB carries a wealth of info...
Jonathan Carter, Julian Borrill, Leonid Oliker
IPPS
2003
IEEE
15 years 12 months ago
Wrapping Legacy Codes for Grid-Based Applications
This paper describes a process for the semi-automatic conversion of numerical and scientific routines written in the C programming language into Triana-based computational servic...
Yan Huang, Ian Taylor, David W. Walker, Robert Dav...