1534 search results - page 86 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
OPODIS
2010
13 years 7 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
PADS
2005
ACM
14 years 2 months ago
2005
ACM
Parallel and distributed simulations enable the analysis of complex systems by concurrently exploiting the aggregate computation power and memory of clusters of execution units. I...
ASAP
2009
IEEE
14 years 6 months ago
2009
IEEE
—Molecular dynamics simulation based on discrete event simulation (DMD) is emerging as an alternative to time-step driven molecular dynamics (MD). DMD uses simplified discretize...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
We have developed an instrumentation scheme that enables programs written in multithreaded languages to compute a critical path at run time.Our scheme gives not only the length (ex...