Search
Now showing items 1-10 of 64
Pointwise Bias Error Bounds for Response Surface Approximations and Min-Max Bias Design
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2004), TR-04-03
Two approaches addressing response surface approximation errors due to model inadequacy (bias error) are presented, and a design of experiments minimizing the maximal bias error is proposed. Both approaches assume that the ...
The Green500 List: Escapades to Exascale
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2011), TR-11-26
Energy efficiency is now a top priority. The first four years of the Green500 have seen the importance of en- ergy efficiency in supercomputing grow from an afterthought to the forefront of innovation as we near a point where ...
CoreTSAR: Task Scheduling for Accelerator-aware Runtimes
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2012), TR-12-20
Heterogeneous supercomputers that incorporate computational accelerators such as GPUs are increasingly popular due to their high peak performance, energy efficiency and comparatively low cost. Unfortunately, the programming ...
Performance Modeling and Analysis of a Massively Parallel DIRECT— Part 1
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2007), TR-07-01
Modeling and analysis techniques are used to investigate the performance of a massively parallel version of DIRECT, a global search algorithm widely used in multidisciplinary design optimization applications. Several ...
Architectural Refactoring for Fast and Modular Bioinformatics Sequence Search
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2006-09-01), TR-06-20
Bioinformaticists use the Basic Local Alignment Search Tool (BLAST) to characterize an unknown sequence by comparing it against a database of known sequences, thus detecting evolutionary relationships and biological ...
On the Robust Mapping of Dynamic Programming onto a Graphics Processing Unit
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2009), TR-09-20
Graphics processing units (GPUs) have been widely used to accelerate algorithms that exhibit massive data parallelism or task parallelism. When such parallelism is not inherent in an algorithm, computational scientists ...
Theory of Globally Convergent Probability-one Homotopies for Non-linear Programming
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2000), TR-00-04
For many years globally convergent probability-one homotopy methods have been remarkably successful on difficult realistic engineering optimization problems,most of which were attacked by homotopy methods because other ...
System Resource Sharing for Synchronous Collaboration
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1999-09-01), TR-99-11
We describe problems associated with accessing data resources external to the application, which we term externalities, in replicated synchronous collaborative applications (e.g., a multiuser text editor). Accessing ...
Structural Design using Cellular Automata
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2001), TR-01-02
Traditional parallel methods for structural design do not scale well. This paper discusses the application of massively scalable cellular automata (CA) techniques to structural design. There are two sets of CA rules, one ...
A Framework to Analyze the Performance of Load Balancing Schemes for Ensembles of Stochastic Simulations
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2012), TR-12-06
Ensembles of simulations are employed to estimate the statistics of possible future states of a system, and are widely used in important applications such as climate change and biological modeling. Ensembles of runs can ...