Sciweavers

5640 search results - page 627 / 1128
» Parallelizing the Data Cube
Sort
View
EUROPAR
2007
Springer
15 years 8 months ago
Distributed Computation of All Node Replacements of a Minimum Spanning Tree
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, ...
CCGRID
2004
IEEE
15 years 8 months ago
An interactive Grid for non-invasive vascular reconstruction
We conduct computer simulation experiments in pre-operative planning of vascular reconstruction with a physician in the experimental loop. We constructed a problem-solving environ...
Peter M. A. Sloot, Alfredo Tirado-Ramos, Alfons G....
144
Voted
CCGRID
2004
IEEE
15 years 8 months ago
Remote partial file access using compact pattern descriptions
We present a method for the efficient access to parts of remote files. The efficiency is achieved by using a file format independent compact pattern description, that allows to re...
Thorsten Schütt, André Merzky, Andrei ...
118
Voted
CLUSTER
2004
IEEE
15 years 8 months ago
Simplifying administration through dynamic reconfiguration. in a cooperative cluster storage system
Cluster Storage Systems where storage devices are distributed across a large number of nodes are able to reduce the I/O bottleneck problems present in most centralized storage sys...
Renaud Lachaize, Jorgen S. Hansen
CLUSTER
2004
IEEE
15 years 8 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...