4889 search results - page 675 / 978 » A Refactoring Approach to Parallelism |
195
click to vote
HPCA
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper focuses on generating efficient software pipelined schedules for in-order machines, which we call Converged Trace Schedules. For a candidate loop, we form a string of t...
178
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
154
Voted
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
139
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Building robust low and mid-level image representations, beyond edge primitives, is a long-standing goal in vision. Many existing feature detectors spatially pool edge information...
148
click to vote
CISIS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. We focus on discrete event systems with a structure of parallel processing, synchronization, and noconcurrency. We use max-plus algebra, which is an effective approach fo...