1534 search results - page 13 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
Both inherently sequential code and limitations of analysis techniques prevent full parallelization of many applications by parallelizing compilers. Amdahl's Law tells us tha...
ISORC
2005
IEEE
14 years 1 months ago
2005
IEEE
One of the problems with Java for real-time systems is the unpredictable behavior of garbage collection (GC). GC introduces unexpected load and causes undesirable delays for real-...
DDECS
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. The algorithms build on the Korat algorithm for constraint-based generation o...
UC
2005
Springer
14 years 1 months ago
2005
Springer
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...