Sciweavers

5640 search results - page 496 / 1128
» Parallelizing the Data Cube
Sort
View
137
Voted
JPDC
2006
100views more  JPDC 2006»
15 years 5 months ago
Dyn-MPI: Supporting MPI on medium-scale, non-dedicated clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
144
Voted
PPOPP
1997
ACM
15 years 9 months ago
Performance Implications of Communication Mechanisms in All-Software Global Address Space Systems
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
Beng-Hong Lim, Chi-Chao Chang, Grzegorz Czajkowski...
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
15 years 11 months ago
Mining in a mobile environment
Distributed PRocessing in Mobile Environments (DPRiME) is a framework for processing large data sets across an ad-hoc network. Developed to address the shortcomings of Google’s ...
Sean McRoskey, James Notwell, Nitesh V. Chawla, Ch...
IPPS
2007
IEEE
15 years 11 months ago
Online Grid Replication Optimizers to Improve System Reliability
In a data intensive Grid system, many data replica schemes and models have been proposed to improve the system response time or data consistency, but little attention has been pai...
Ming Lei, Susan V. Vrbsky, Zijie Qi
108
Voted
IPPS
2006
IEEE
15 years 11 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