Sciweavers

2609 search results - page 47 / 522
» Optimizing for parallelism and data locality
Sort
View
SC
2003
ACM
15 years 3 months ago
Identifying and Exploiting Spatial Regularity in Data Memory References
The growing processor/memory performance gap causes the performance of many codes to be limited by memory accesses. If known to exist in an application, strided memory accesses fo...
Tushar Mohan, Bronis R. de Supinski, Sally A. McKe...
ICPP
1993
IEEE
15 years 2 months ago
Automatic Parallelization Techniques for the EM-4
: This paper presents a Data-Distributed Execution approach that exploits interation-level parallelism in loops operating over arrays. It performs data-dependency analysis, based o...
Lubomir Bic, Mayez A. Al-Mouhamed
ICDM
2005
IEEE
187views Data Mining» more  ICDM 2005»
15 years 3 months ago
Parallel Algorithms for Distance-Based and Density-Based Outliers
An outlier is an observation that deviates so much from other observations as to arouse suspicion that it was generated by a different mechanism. Outlier detection has many applic...
Elio Lozano, Edgar Acuña
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
15 years 2 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
ICS
2001
Tsinghua U.
15 years 2 months ago
Computer aided hand tuning (CAHT): "applying case-based reasoning to performance tuning"
For most parallel and high performance systems, tuning guides provide the users with advices to optimize the execution time of their programs. Execution time may be very sensitive...
Antoine Monsifrot, François Bodin