1534 search results - page 34 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
IEEEPACT
1998
IEEE
13 years 12 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
ISHPC
2003
Springer
14 years 27 days ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
ENTCS
2008
13 years 7 months ago
2008
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
ISOLA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
CIKM
2010
Springer
13 years 5 months ago
2010
Springer
A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those...