Sciweavers

2372 search results - page 398 / 475
» is 2012
Sort
View
PLDI
2012
ACM
12 years 15 days ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
PLDI
2012
ACM
12 years 15 days ago
The implicit calculus: a new foundation for generic programming
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...
Bruno C. d. S. Oliveira, Tom Schrijvers, Wontae Ch...
PLDI
2012
ACM
12 years 15 days ago
Adaptive input-aware compilation for graphics engines
While graphics processing units (GPUs) provide low-cost and efficient platforms for accelerating high performance computations, the tedious process of performance tuning required...
Mehrzad Samadi, Amir Hormati, Mojtaba Mehrara, Jan...
PLDI
2012
ACM
12 years 15 days ago
Effective parallelization of loops in the presence of I/O operations
Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors...
Min Feng, Rajiv Gupta, Iulian Neamtiu
PLDI
2012
ACM
12 years 15 days ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...