6105 search results - page 434 / 1221 » A Parallel Algorithm for Bound-Smoothing |
249
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
167
click to vote
CCGRID
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
158
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
175
click to vote
SPAA
2005
ACM
16 years 13 days ago
2005
ACM
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
177
click to vote
PDCAT
2005
Springer
16 years 11 days ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...