4171 search results - page 607 / 835 » Distributed Data Structure Design for Scientific Computation |
179
click to vote
CCGRID
2010
IEEE
15 years 8 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
199
click to vote
IPPS
2005
IEEE
16 years 20 days ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
186
Voted
CIKM
2008
Springer
15 years 9 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
202
click to vote
CGF
2010
15 years 7 months ago
2010
In this paper, we introduce the concept of isosurface similarity maps for the visualization of volume data. Isosurface similarity maps present structural information of a volume d...
193
click to vote
DAC
2002
ACM
16 years 8 months ago
2002
ACM
In this paper, we present a compiler strategy to optimize data accesses in regular array-intensive applications running on embedded multiprocessor environments. Specifically, we p...