Sciweavers

741 search results - page 25 / 149
» Memory Dependence Prediction Using Store Sets
Sort
View
ISSS
1995
IEEE
100views Hardware» more  ISSS 1995»
15 years 5 months ago
Optimal code generation for embedded memory non-homogeneous register architectures
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
Guido Araujo, Sharad Malik
IWOMP
2007
Springer
15 years 8 months ago
Support for Fine Grained Dependent Tasks in OpenMP
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
Oliver Sinnen, Jsun Pe, Alexander Vladimirovich Ko...
100
Voted
BMCBI
2007
102views more  BMCBI 2007»
15 years 1 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...
ICWS
2009
IEEE
15 years 11 months ago
Adaptive Prefetching Scheme Using Web Log Mining in Cluster-Based Web Systems
The main memory management has been a critical issue to provide high performance in web cluster systems. To overcome the speed gap between processors and disks, many prefetch sche...
Heung Ki Lee, Baik Song An, Eun Jung Kim
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
15 years 8 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...