Sciweavers

2609 search results - page 61 / 522
» Optimizing for parallelism and data locality
Sort
View
JIDM
2010
131views more  JIDM 2010»
14 years 5 months ago
Processing Queries over Distributed XML Databases
The increasing volume of data stored as XML documents makes fragmentation techniques an alternative to the performance issues in query processing. Fragmented databases are feasible...
Guilherme Figueiredo, Vanessa P. Braganholo, Marta...
IPPS
1998
IEEE
15 years 2 months ago
Memory Hierarchy Management for Iterative Graph Structures
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications...
Ibraheem Al-Furaih, Sanjay Ranka
99
Voted
PPSN
2004
Springer
15 years 3 months ago
Coupling of Evolution and Learning to Optimize a Hierarchical Object Recognition Model
Abstract. A key problem in designing artificial neural networks for visual object recognition tasks is the proper choice of the network architecture. Evolutionary optimization met...
Georg Schneider, Heiko Wersing, Bernhard Sendhoff,...
ISPAN
1997
IEEE
15 years 2 months ago
A method for estimating optimal unrolling times for nested loops
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not...
Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa
129
Voted
HPCA
2007
IEEE
15 years 4 months ago
An Adaptive Cache Coherence Protocol Optimized for Producer-Consumer Sharing
Shared memory multiprocessors play an increasingly important role in enterprise and scientific computing facilities. Remote misses limit the performance of shared memory applicat...
Liqun Cheng, John B. Carter, Donglai Dai