1534 search results - page 222 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
ESCIENCE
2007
IEEE
14 years 3 months ago
2007
IEEE
The emergence of computational grids has lead to an increased reliance on task schedulers that can guarantee the completion of tasks that are executed on unreliable systems. There...
JSSPP
2004
Springer
14 years 2 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
When investigating the performance of running scientific/ commercial workflows in parallel and distributed systems, we often take into account only the resources allocated to the ...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
ISCA
1992
IEEE
14 years 1 months ago
1992
IEEE
As multiprocessor sizes scale and computer architects turn to interconnection networks with non-uniform communication latencies, the lure of exploiting communication locality to i...