Sciweavers

3616 search results - page 529 / 724
» Conditional Memory Ordering
Sort
View
133
Voted
ISCA
2002
IEEE
104views Hardware» more  ISCA 2002»
15 years 2 months ago
Speculative Dynamic Vectorization
Traditional vector architectures have shown to be very effective for regular codes where the compiler can detect data-level parallelism. However, this SIMD parallelism is also pre...
Alex Pajuelo, Antonio González, Mateo Valer...
125
Voted
MP
2002
85views more  MP 2002»
15 years 2 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
156
Voted
TJS
2002
160views more  TJS 2002»
15 years 2 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
141
Voted
PAMI
2010
168views more  PAMI 2010»
15 years 1 months ago
Dynamic Hybrid Algorithms for MAP Inference in Discrete MRFs
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
129
Voted
PVLDB
2010
134views more  PVLDB 2010»
15 years 1 months ago
High-Performance Dynamic Pattern Matching over Disordered Streams
Current pattern-detection proposals for streaming data recognize the need to move beyond a simple regular-expression model over strictly ordered input. We continue in this directi...
Badrish Chandramouli, Jonathan Goldstein, David Ma...