Sciweavers

Share
CC
2011
Springer
270views System Software» more  CC 2011»
8 years 10 months ago
Subregion Analysis and Bounds Check Elimination for High Level Arrays
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
Mackale Joyner, Zoran Budimlic, Vivek Sarkar
CC
2011
Springer
283views System Software» more  CC 2011»
8 years 10 months ago
A Static Task Partitioning Approach for Heterogeneous Systems Using OpenCL
Abstract. Heterogeneous multi-core platforms are increasingly prevalent due to their perceived superior performance over homogeneous systems. The best performance, however, can onl...
Dominik Grewe, Michael F. P. O'Boyle
CC
2011
Springer
267views System Software» more  CC 2011»
8 years 10 months ago
Using Disjoint Reachability for Parallelization
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
CC
2010
Springer
112views System Software» more  CC 2010»
9 years 1 months ago
Random Cnf's are Hard for the Polynomial Calculus
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
Eli Ben-Sasson, Russell Impagliazzo
CASES
2010
ACM
9 years 3 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
CC
2010
Springer
120views System Software» more  CC 2010»
9 years 4 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
CC
2010
Springer
109views System Software» more  CC 2010»
9 years 4 months ago
The Complexity of the Inertia
The inertia of an n
Thanh Minh Hoang, Thomas Thierauf
CC
2010
Springer
117views System Software» more  CC 2010»
9 years 4 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
CASES
2010
ACM
9 years 4 months ago
Hardware trust implications of 3-D integration
3-D circuit-level integration is a chip fabrication technique in which two or more dies are stacked and combined into a single circuit through the use of vertical electroconductiv...
Ted Huffmire, Timothy E. Levin, Michael Bilzor, Cy...
CC
2009
Springer
153views System Software» more  CC 2009»
9 years 4 months ago
From Specification to Optimisation: An Architecture for Optimisation of Java Bytecode
We present the architecture of the Rosser toolkit that allows optimisations to be specified in a domain specific language, then compiled and deployed towards optimising object prog...
Richard Warburton, Sara Kalvala
books