Sciweavers

2703 search results - page 95 / 541
» Optimizing memory transactions
Sort
View
IPPS
1998
IEEE
14 years 1 months ago
Optimizing Data Scheduling on Processor-in-Memory Arrays
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
Yi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapor...
ICML
1998
IEEE
14 years 9 months ago
Q2: Memory-Based Active Learning for Optimizing Noisy Continuous Functions
This paper introduces a new algorithm, Q2, foroptimizingthe expected output ofamultiinput noisy continuous function. Q2 is designed to need only a few experiments, it avoids stron...
Andrew W. Moore, Jeff G. Schneider, Justin A. Boya...
CISS
2008
IEEE
14 years 3 months ago
Achievable rates and training optimization for fading relay channels with memory
—In this paper, transmission over time-selective, flat fading relay channels is studied. It is assumed that channel fading coefficients are not known a priori. Transmission tak...
Sami Akin, Mustafa Cenk Gursoy
IPPS
1998
IEEE
14 years 1 months ago
Compiler-Optimization of Implicit Reductions for Distributed Memory Multiprocessors
This paper presents reduction recognition and parallel code generationstrategies for distributed-memorymultiprocessors. We describe techniques to recognize a broad range of implic...
Bo Lu, John M. Mellor-Crummey
EUROPAR
2007
Springer
14 years 3 months ago
Locality Optimized Shared-Memory Implementations of Iterated Runge-Kutta Methods
Iterated Runge-Kutta (IRK) methods are a class of explicit solution methods for initial value problems of ordinary differential equations (ODEs) which possess a considerable poten...
Matthias Korch, Thomas Rauber