Sciweavers

7456 search results - page 1306 / 1492
» Parallelism in Logic Programming
Sort
View
127
Voted
BMCBI
2005
104views more  BMCBI 2005»
15 years 3 months ago
Wildfire: distributed, Grid-enabled workflow construction and execution
Background: We observe two trends in bioinformatics: (i) analyses are increasing in complexity, often requiring several applications to be run as a workflow; and (ii) multiple CPU...
Francis Tang, Ching Lian Chua, Liang-Yoong Ho, Yun...
146
Voted
SP
2010
IEEE
190views Security Privacy» more  SP 2010»
15 years 1 months ago
Noninterference through Secure Multi-execution
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
Dominique Devriese, Frank Piessens
164
Voted
ASPLOS
2011
ACM
14 years 7 months ago
Inter-core prefetching for multicore processors using migrating helper threads
Multicore processors have become ubiquitous in today’s systems, but exploiting the parallelism they offer remains difficult, especially for legacy application and applications ...
Md Kamruzzaman, Steven Swanson, Dean M. Tullsen
SPAA
2009
ACM
16 years 4 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
MICRO
2009
IEEE
147views Hardware» more  MICRO 2009»
15 years 10 months ago
Complexity effective memory access scheduling for many-core accelerator architectures
Modern DRAM systems rely on memory controllers that employ out-of-order scheduling to maximize row access locality and bank-level parallelism, which in turn maximizes DRAM bandwid...
George L. Yuan, Ali Bakhoda, Tor M. Aamodt
« Prev « First page 1306 / 1492 Last » Next »