Sciweavers

340 search results - page 27 / 68
» Data Migration on Parallel Disks
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 9 days ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
BMCBI
2007
152views more  BMCBI 2007»
13 years 7 months ago
Recodon: Coalescent simulation of coding DNA sequences with recombination, migration and demography
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...
Miguel Arenas, David Posada
ASPLOS
2011
ACM
12 years 11 months ago
Inter-core prefetching for multicore processors using migrating helper threads
Multicore processors have become ubiquitous in today’s systems, but exploiting the parallelism they offer remains difficult, especially for legacy application and applications ...
Md Kamruzzaman, Steven Swanson, Dean M. Tullsen
LCN
2003
IEEE
14 years 1 months ago
Using a Gigabit Ethernet Cluster as a Distributed Disk Array with Multiple Fault Tolerance
A cluster of PCs can be seen as a collection of networked low cost disks; such a collection can be operated by proper so as to provide the abstraction of a single, larger block de...
Alessandro Di Marco, Giovanni Chiola, Giuseppe Cia...
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 1 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen