2609 search results - page 14 / 522 » Optimizing for parallelism and data locality |
133
click to vote
EUROPAR
2007
Springer
15 years 11 months ago
2007
Springer
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...
166
click to vote
VLDB
1989
ACM
15 years 9 months ago
1989
ACM
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
139
click to vote
LCR
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We present two new compiler optimizations for explicitly parallel programs based on the CSSAME form: Lock-Independent Code Motion (LICM) and Mutex Body Localization (MBL)...
137
click to vote
ICS
2003
Tsinghua U.
15 years 10 months ago
2003
Tsinghua U.
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
115
click to vote
MICRO
2003
IEEE
15 years 10 months ago
2003
IEEE
The physical register file is an important component of a dynamically-scheduled processor. Increasing the amount of parallelism places increasing demands on the physical register...