Sciweavers

CC
2010
Springer
282views System Software» more  CC 2010»
13 years 3 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
CC
2010
Springer
243views System Software» more  CC 2010»
14 years 4 days ago
Optimizing Matlab through Just-In-Time Specialization
Abstract. Scientists are increasingly using dynamic programming languages like Matlab for prototyping and implementation. Effectively compiling Matlab raises many challenges due t...
Maxime Chevalier-Boisvert, Laurie J. Hendren, Clar...
CC
2010
Springer
190views System Software» more  CC 2010»
14 years 4 days ago
Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?
On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further h...
Yunlian Jiang, Eddy Z. Zhang, Kai Tian, Xipeng She...
CC
2010
Springer
179views System Software» more  CC 2010»
14 years 4 days ago
Validating Register Allocation and Spilling
Abstract. Following the translation validation approach to highassurance compilation, we describe a new algorithm for validating a posteriori the results of a run of register alloc...
Silvain Rideau, Xavier Leroy
CC
2010
Springer
172views System Software» more  CC 2010»
14 years 4 days ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
System Software
Top of PageReset Settings