602 search results - page 64 / 121 » Automatic Optimization for MapReduce Programs |
POPL
2007
ACM
14 years 11 months ago
2007
ACM
We introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assig...
WSC
2008
14 years 1 months ago
2008
In this paper, an automation concept is proposed to facilitate the simulation model building for port design problem. Currently, this process, which includes drawing the terminal ...
CC
2012
Springer
12 years 6 months ago
2012
Springer
Abstract. How can we exploit a microprocessor as efficiently as possible? The “classic” approach is static optimization at compile-time, optimizing a program for all possible u...
CP
2003
Springer
14 years 4 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
PLDI
1996
ACM
14 years 3 months ago
1996
ACM
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...