Sciweavers

76 search results - page 11 / 16
» Achieving Load Balancing in Structured Peer-to-Peer Grids
Sort
View
SSDBM
2005
IEEE
132views Database» more  SSDBM 2005»
15 years 3 months ago
Co-Scheduling of Computation and Data on Computer Clusters
Scientific investigations have to deal with rapidly growing amounts of data from simulations and experiments. During data analysis, scientists typically want to extract subsets o...
Alexandru Romosan, Doron Rotem, Arie Shoshani, Der...
BMCBI
2007
166views more  BMCBI 2007»
14 years 9 months ago
Data handling strategies for high throughput pyrosequencers
Background: New high throughput pyrosequencers such as the 454 Life Sciences GS 20 are capable of massively parallelizing DNA sequencing providing an unprecedented rate of output ...
Gabriele A. Trombetti, Raoul J. P. Bonnal, Ermanno...
IJPP
2010
156views more  IJPP 2010»
14 years 7 months ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...
ICPIA
1992
15 years 1 months ago
Parallel Manipulations of Octrees and Quadtrees
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...
Vipin Chaudhary, K. Kamath, Prakash Arunachalam, J...
SAC
2008
ACM
14 years 9 months ago
A self-balancing striping scheme for NAND-flash storage systems
To use multiple memory banks in parallel is a nature approach to boost the performance of flash-memory storage systems. However, realistic data-access localities unevenly load eac...
Yu-Bin Chang, Li-Pin Chang