Sciweavers

2609 search results - page 2 / 522
» Optimizing for parallelism and data locality
Sort
View
IPPS
2007
IEEE
14 years 16 days ago
Optimizing Inter-Nest Data Locality Using Loop Splitting and Reordering
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
Sofiane Naci
EUROPAR
1998
Springer
13 years 10 months ago
Enhancing Spatial Locality via Data Layout Optimizations
This paper aims to improve locality of references by suitably choosing array layouts. We use a new definition of spatial reuse vectors that takes into account memory layout of arra...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
IPPS
1999
IEEE
13 years 10 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
ICPADS
2006
IEEE
14 years 8 days ago
Optimal Placement of Replicas in Data Grid Environments with Locality Assurance
Data replications is a typical strategy for increasing access performance and data availability in Data Grid systems. Current work on data replication in Grid systems focuses on i...
Yi-Fang Lin, Pangfeng Liu, Jan-Jan Wu
IPPS
2006
IEEE
14 years 7 days ago
Parallel multiple sequence alignment with local phylogeny search by simulated annealing
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...
Jaroslaw Zola, Denis Trystram, Andrei Tchernykh, C...