Sciweavers

98 search results - page 16 / 20
» Large data visualization on distributed memory multi-GPU clu...
Sort
View
SC
2009
ACM
14 years 2 months ago
Highly scalable genome assembly on campus grids
Bioinformatics researchers need efficient means to process large collections of sequence data. One application of interest, genome assembly, has great potential for parallelizati...
Christopher Moretti, Michael Olson, Scott J. Emric...
CLUSTER
2004
IEEE
13 years 11 months ago
FTC-Charm++: an in-memory checkpoint-based fault tolerant runtime for Charm++ and MPI
As high performance clusters continue to grow in size, the mean time between failure shrinks. Thus, the issues of fault tolerance and reliability are becoming one of the challengi...
Gengbin Zheng, Lixia Shi, Laxmikant V. Kalé
CLUSTER
2004
IEEE
13 years 11 months ago
RFS: efficient and flexible remote file access for MPI-IO
Scientific applications often need to access remote file systems. Because of slow networks and large data size, however, remote I/O can become an even more serious performance bot...
Jonghyun Lee, Robert B. Ross, Rajeev Thakur, Xiaos...
CF
2006
ACM
13 years 9 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander
CLUSTER
2002
IEEE
14 years 13 days ago
Noncontiguous I/O through PVFS
With the tremendous advances in processor and memory technology, I/O has risen to become the bottleneck in high-performance computing for many applications. The development of par...
Avery Ching, Alok N. Choudhary, Wei-keng Liao, Rob...