Sciweavers

283 search results - page 44 / 57
» Effective Program Verification for Relaxed Memory Models
Sort
View
PLDI
1995
ACM
15 years 3 months ago
Improving Balanced Scheduling with Compiler Optimizations that Increase Instruction-Level Parallelism
Traditional list schedulers order instructions based on an optimistic estimate of the load latency imposed by the hardware and therefore cannot respond to variations in memory lat...
Jack L. Lo, Susan J. Eggers
OOPSLA
2009
Springer
15 years 6 months ago
Parallel programming with object assemblies
We present Chorus, a high-level parallel programming model suitable for irregular, heap-manipulating applications like mesh refinement and epidemic simulations, and JChorus, an i...
Roberto Lublinerman, Swarat Chaudhuri, Pavol Cern&...
BMCBI
2006
240views more  BMCBI 2006»
14 years 11 months ago
Statistical analysis of real-time PCR data
Background: Even though real-time PCR has been broadly applied in biomedical sciences, data processing procedures for the analysis of quantitative real-time PCR are still lacking;...
Joshua S. Yuan, Ann Reed, Feng Chen, C. Neal Stewa...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 11 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
APLAS
2008
ACM
15 years 1 months ago
Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito O...