Name
Abstract | ||
|---|---|---|
An important issue in the execution of programs on multiprocessor systems with non-uniform memory access times is data locality. Most of the dynamic scheduling algorithms deal well with load balance, but fail to take locality into account and, therefore, behave poorly on NUMA systems. In this paper we present a scheduling algorithm which has as its objective to increase data locality, and therefore performance, in problems based on elimination trees. We applied this scheduling to the modified Cholesky factorization as a case study. Experimental results on the SGI O2000 are shown. |
Year | Venue | Keywords |
|---|---|---|
1999 | Euro-Par | sgi o2000,important issue,numa system,data locality,dynamic scheduling algorithm,scheduling algorithm,elimination trees,load balance,elimination tree,case study,numa systems,non uniform memory access,dynamic scheduling,cholesky factorization |
Field | DocType | Volume |
Locality,Fair-share scheduling,Load balancing (computing),Scheduling (computing),Computer science,Parallel computing,Algorithm,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Cholesky decomposition,Distributed computing | Conference | 1685 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-66443-2 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| María J. Martín | 1 | 174 | 27.68 |
| inmaculada pardines | 2 | 20 | 3.12 |
| Francisco F. Rivera | 3 | 177 | 26.17 |