Sciweavers

2609 search results - page 107 / 522
» Optimizing for parallelism and data locality
Sort
View
CCE
2005
15 years 4 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen
HPCC
2007
Springer
15 years 11 months ago
Online Algorithms for Single Machine Schedulers to Support Advance Reservations from Grid Jobs
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
Bo Li, Dongfeng Zhao
EUROPAR
2007
Springer
15 years 6 months ago
Nested Parallelism in the OMPi OpenMP/C Compiler
This paper presents a new version of the OMPi OpenMP C compiler, enhanced by lightweight runtime support based on user-level multithreading. A large number of threads can be spawne...
Panagiotis E. Hadjidoukas, Vassilios V. Dimakopoul...
HPCA
2008
IEEE
16 years 5 months ago
Address-branch correlation: A novel locality for long-latency hard-to-predict branches
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
Hongliang Gao, Yi Ma, Martin Dimitrov, Huiyang Zho...
EUROPAR
2008
Springer
15 years 6 months ago
Parallel Lattice Boltzmann Flow Simulation on Emerging Multi-core Platforms
Abstract. A parallel Lattice Boltzmann Method (pLBM), which is based on hierarchical spatial decomposition, is designed to perform large-scale flow simulations. The algorithm uses ...
Liu Peng, Ken-ichi Nomura, Takehiro Oyakawa, Rajiv...