Sciweavers

822 search results - page 106 / 165
» Contention in shared memory algorithms
Sort
View
IPPS
2010
IEEE
15 years 14 days ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé
139
Voted
ISPDC
2010
IEEE
15 years 1 months ago
Resource-Aware Compiler Prefetching for Many-Cores
—Super-scalar, out-of-order processors that can have tens of read and write requests in the execution window place significant demands on Memory Level Parallelism (MLP). Multi- ...
George C. Caragea, Alexandros Tzannes, Fuat Keceli...
112
Voted
DAC
2003
ACM
16 years 3 months ago
Symbolic representation with ordered function templates
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
Amit Goel, Gagan Hasteer, Randal E. Bryant
CODES
2005
IEEE
15 years 8 months ago
Conflict analysis in multiprocess synthesis for optimized system integration
This paper presents a novel approach for multiprocess synthesis supporting well-tailored module integration at system level. The goal is to extend the local scope of existing arch...
Oliver Bringmann, Wolfgang Rosenstiel, Axel Sieben...
119
Voted
HPCS
2005
IEEE
15 years 8 months ago
Parallel Lattice Implementation for Option Pricing under Mixed State-Dependent Volatility Models
— With the principal goal of developing an alternative, relatively simple and tractable pricing framework for accurately reproducing a market implied volatility surface, this pap...
Giuseppe Campolieti, Roman Makarov