Sciweavers

2954 search results - page 278 / 591
» Beyond
Sort
View
PLDI
2010
ACM
16 years 4 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
VMCAI
2010
Springer
16 years 4 months ago
Shape Analysis in the Absence of Pointers and Structure
Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, "Is there an equivalent to shape analysis for purely fu...
Matthew Might
EUROSYS
2010
ACM
16 years 3 months ago
Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Scheduling
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
Matei Zaharia, Dhruba Borthakur, Joydeep Sen Sarma...
ICCD
2007
IEEE
111views Hardware» more  ICCD 2007»
16 years 3 months ago
On modeling impact of sub-wavelength lithography on transistors
As the VLSI technology marches beyond 65 and 45nm process technologies, variation in gate length has a direct impact on leakage and performance of CMOS transistors. Due to sub-wav...
Aswin Sreedhar, Sandip Kundu
ICCD
2006
IEEE
124views Hardware» more  ICCD 2006»
16 years 3 months ago
Customizable Fault Tolerant Caches for Embedded Processors
Abstract— The continuing divergence of processor and memory speeds has led to the increasing reliance on larger caches which have become major consumers of area and power in embe...
Subramanian Ramaswamy, Sudhakar Yalamanchili