1534 search results - page 95 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
ISORC
2002
IEEE
14 years 2 months ago
2002
IEEE
This paper presents a simple protocol that provides application processes with an approximate real-time notion. This time notion is very versatile. At one extreme, it behaves at l...
FSTTCS
1995
Springer
14 years 19 days ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
We propose a new parallel performance visualization scheme, based on a simple moment analysis of processor utilization data. This method combines the scalability advantages of sta...
PLDI
1990
ACM
14 years 1 months ago
1990
ACM
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...