Sciweavers

311 search results - page 2 / 63
» Compiler Algorithms for Optimizing Locality and Parallelism ...
Sort
View
ICPP
1999
IEEE
13 years 10 months ago
Access Descriptor Based Locality Analysis for Distributed-Shared Memory Multiprocessors
Most of today's multiprocessors have a DistributedShared Memory (DSM) organization, which enables scalability while retaining the convenience of the shared-memory programming...
Angeles G. Navarro, Rafael Asenjo, Emilio L. Zapat...
VLDB
1989
ACM
155views Database» more  VLDB 1989»
13 years 9 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
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...
Guy Hulin
IPPS
2003
IEEE
13 years 11 months ago
A Compilation Framework for Distributed Memory Parallelization of Data Mining Algorithms
With the availability of large datasets in a variety of scientific and commercial domains, data mining has emerged as an important area within the last decade. Data mining techni...
Xiaogang Li, Ruoming Jin, Gagan Agrawal
IEEEPACT
1999
IEEE
13 years 10 months ago
On Reducing False Sharing while Improving Locality on Shared Memory Multiprocessors
The performance of applications on large shared-memory multiprocessors with coherent caches depends on the interaction between the granularity of data sharing, the size of the coh...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
AE
2003
Springer
13 years 9 months ago
ParaDisEO-Based Design of Parallel and Distributed Evolutionary Algorithms
ParaDisEO is a framework dedicated to the design of parallel and distributed metaheuristics including local search methods and evolutionary algorithms. This paper focuses on the la...
Sébastien Cahon, Nordine Melab, El-Ghazali ...