Sciweavers

628 search results - page 29 / 126
» Tying Memory Management to Parallel Programming Models
Sort
View
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
15 years 10 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
ISHPC
2000
Springer
15 years 1 months ago
Automatic Generation of OpenMP Directives and Its Application to Computational Fluid Dynamics Codes
The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technolo...
Haoqiang Jin, Michael A. Frumkin, Jerry C. Yan
APN
1994
Springer
15 years 2 months ago
Modelling the Work Flow of a Nuclear Waste Management Program
In this paper we describe a modelling project to improve a nuclear waste management program in charge of the creation of a new system for the permanent disposal of nuclear waste. S...
Kjeld Høyer Mortensen, Valerio O. Pinci
ICS
2009
Tsinghua U.
15 years 4 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
IPPS
2005
IEEE
15 years 3 months ago
EMPS: An Environment for Memory Performance Studies
This paper describes an overview of Environment for Memory Performance Studies (EMPS). EMPS is a framework to allow different data gathering and simulation tools to be composed to...
Jeffrey K. Hollingsworth, Allan Snavely, Simone Sb...