121 search results - page 10 / 25 » Load-Balanced Parallel Merge Sort on Distributed Memory Para... |
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
CONCURRENCY
2000
13 years 8 months ago
2000
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...
ICDT
2001
ACM
14 years 1 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
HPDC
1999
IEEE
14 years 27 days ago
1999
IEEE
We describe our experience using PARED, an object oriented system for the adaptive solution of PDEs in a distributed computing environment. PARED handles selective mesh refinement...
ICPIA
1992
14 years 20 days ago
1992
Abstract. Octrees o er a powerful means for representing and manipulating 3-D objects. This paper presents an implementation of octree manipulations using a new approach on a share...