Scheduling of Algorithms Based on Elimination Trees on NUMA Systems

Authors:
María J. Martín;Inmaculada Pardines;Francisco F. Rivera
Affiliations:
-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 4
Cited 0

The role of elimination trees in sparse factorization

SIAM Journal on Matrix Analysis and Applications
The SPLASH-2 programs: characterization and methodological considerations

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Portable Programs for Parallel Processors

Portable Programs for Parallel Processors
SPLASH: Stanford parallel applications for shared-memory*

SPLASH: Stanford parallel applications for shared-memory*

Quantified Score

Hi-index	0.00

Visualization

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.