Sciweavers

241 search results - page 16 / 49
» Advanced Loop Optimizations for Parallel Computers
Sort
View
CLUSTER
2004
IEEE
13 years 11 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
ICS
1995
Tsinghua U.
13 years 11 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...
ISORC
2005
IEEE
14 years 29 days ago
On Recent Advances in Time/Utility Function Real-Time Scheduling and Resource Management
We argue that the key underpinning of the current state-of-the real-time practice — the priority artifact — and that of the current state-of-the real-time art — deadline-bas...
Binoy Ravindran, E. Douglas Jensen, Peng Li
ARC
2008
Springer
112views Hardware» more  ARC 2008»
13 years 9 months ago
Optimal Unroll Factor for Reconfigurable Architectures
Abstract. Loops are an important source of optimization. In this paper, we address such optimizations for those cases when loops contain kernels mapped on reconfigurable fabric. We...
Ozana Silvia Dragomir, Elena Moscu Panainte, Koen ...
PPOPP
2005
ACM
14 years 28 days ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber