Sciweavers

500 search results - page 88 / 100
» Compiling SA-C Programs to FPGAs: Performance Results
Sort
View
IPPS
2009
IEEE
15 years 6 months ago
Work-first and help-first scheduling policies for async-finish task parallelism
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
Yi Guo, Rajkishore Barik, Raghavan Raman, Vivek Sa...
MICRO
2007
IEEE
184views Hardware» more  MICRO 2007»
15 years 6 months ago
Data Access Partitioning for Fine-grain Parallelism on Multicore Architectures
The recent design shift towards multicore processors has spawned a significant amount of research in the area of program parallelization. The future abundance of cores on a singl...
Michael L. Chu, Rajiv A. Ravindran, Scott A. Mahlk...
CF
2006
ACM
15 years 1 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander
123
Voted
EUROPAR
2010
Springer
15 years 24 days ago
Optimized Dense Matrix Multiplication on a Many-Core Architecture
Abstract. Traditional parallel programming methodologies for improving performance assume cache-based parallel systems. However, new architectures, like the IBM Cyclops-64 (C64), b...
Elkin Garcia, Ioannis E. Venetis, Rishi Khan, Guan...
BMCBI
2007
102views more  BMCBI 2007»
14 years 11 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...