Sciweavers

3171 search results - page 7 / 635
» Application of Reduce Order Modeling to Time Parallelization
Sort
View
SCANGIS
2003
13 years 9 months ago
Parallel Distributed Application Framework for Earth Science Data Processing
The management and the processing of Earth science data has been gaining importance over the last decade due to higher data volumes generated by a larger number of instruments and ...
Petr Votava, Rama Nemani, Keith Golden, Daniel E. ...
IEEEPACT
2008
IEEE
14 years 2 months ago
Mars: a MapReduce framework on graphics processors
We design and implement Mars, a MapReduce framework, on graphics processors (GPUs). MapReduce is a distributed programming framework originally proposed by Google for the ease of ...
Bingsheng He, Wenbin Fang, Qiong Luo, Naga K. Govi...
IPPS
2006
IEEE
14 years 1 months ago
Seekable sockets: a mechanism to reduce copy overheads in TCP-based messaging
This paper extends the traditional socket interface to TCP/IP communication with the ability to seek rather than simply receive data in order. Seeking on a TCP socket allows a use...
Chase Douglas, Vijay S. Pai
IPPS
1999
IEEE
13 years 12 months ago
Reducing Parallel Overheads Through Dynamic Serialization
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...
Michael Voss, Rudolf Eigenmann
ICS
2004
Tsinghua U.
14 years 1 months ago
A dynamic application-driven data communication strategy
The use of semi-Lagrangian formulations in numerical weather predication models (NWP) allows for an increase in time step size. Use of this method can increase performance of thes...
Paul van der Mark, Lex Wolters, Gerard Cats