Sciweavers

611 search results - page 10 / 123
» Highly scalable parallel sorting
Sort
View
ICCS
2001
Springer
14 years 1 months ago
Parallel High-Dimensional Integration: Quasi-Monte Carlo versus Adaptive Cubature Rules
Abstract Parallel algorithms for the approximation of a multi-dimensional integral over an hyper-rectangular region are discussed. Algorithms based on quasi-Monte Carlo techniques ...
Rudolf Schürer
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
14 years 5 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
SC
2009
ACM
14 years 3 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...
HPCC
2007
Springer
14 years 2 months ago
Towards Scalable and High Performance I/O Virtualization - A Case Study
I/O Virtualization provides a convenient way of device sharing among guest domains in a virtualized platform (e.g. Xen). However, with the ever-increasing number and variety of dev...
Jinpeng Wei, Jeffrey R. Jackson, John A. Wiegert
CLUSTER
2002
IEEE
14 years 1 months ago
Scalable Resource Management in High Performance Computers
Clusters of workstations have emerged as an important platform for building cost-effective, scalable, and highlyavailable computers. Although many hardware solutions are available...
Eitan Frachtenberg, Fabrizio Petrini, Juan Fern&aa...