Sciweavers

2479 search results - page 207 / 496
» A Computational Theory of Working Memory
Sort
View
ISVC
2009
Springer
14 years 3 months ago
Parallel Poisson Surface Reconstruction
In this work we describe a parallel implementation of the Poisson Surface Reconstruction algorithm based on multigrid domain decomposition. We compare implementations using differ...
Matthew Bolitho, Michael M. Kazhdan, Randal C. Bur...
IPPS
2007
IEEE
14 years 3 months ago
Analyzing the Scalability of Graph Algorithms on Eldorado
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
Keith D. Underwood, Megan Vance, Jonathan W. Berry...
SASO
2007
IEEE
14 years 3 months ago
Adaptive Self-optimization in Distributed Dynamic Environments
Grid and ubiquitous computing systems generally consist of a large number of networked nodes with applications implemented as distributed services or processes, respectively. A cr...
Wolfgang Trumler, Andreas Pietzowski, Benjamin Sat...
DATE
2003
IEEE
118views Hardware» more  DATE 2003»
14 years 2 months ago
Multi-Granularity Metrics for the Era of Strongly Personalized SOCs
This paper details the first step of the Design Trotter framework for design space exploration applied to dedicated SOCs. The aim of this step is to provide metrics in order to gu...
Yannick Le Moullec, Nahla Ben Amor, Jean-Philippe ...
HPCN
1994
Springer
14 years 1 months ago
Experiments with HPF Compilation for a Network of Workstations
Abstract. High Performance Fortran (hpf) is a data-parallel Fortran for Distributed Memory Multiprocessors. Hpf provides an interesting programming model but compilers are yet to c...
Fabien Coelho