Sciweavers

25 search results - page 4 / 5
» An Automated C Code and Data Partitioning Framework for Da...
Sort
View
CIKM
2006
Springer
13 years 7 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
CCGRID
2010
IEEE
13 years 6 months ago
Streamflow Programming Model for Data Streaming in Scientific Workflows
Geo-sciences involve large-scale parallel models, high resolution real time data from highly asynchronous and heterogeneous sensor networks and instruments, and complex analysis a...
Chathura Herath, Beth Plale
IJHPCA
2007
114views more  IJHPCA 2007»
13 years 5 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima
PPOPP
2009
ACM
14 years 6 months ago
A comparison of programming models for multiprocessors with explicitly managed memory hierarchies
On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and...
Scott Schneider, Jae-Seung Yeom, Benjamin Rose, Jo...
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 5 months ago
A Peer-to-Peer Middleware Framework for Resilient Persistent Programming
The persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be eng...
Alan Dearle, Graham N. C. Kirby, Stuart J. Norcros...