Abstract | ||
---|---|---|
A major feature of Computer Algebra, and more generally of non-numerical computa- tions, is the dynamical and non-predictable behaviour of the executions. We then understand that statical analysis should imperatively be completed by dynamical analysis in order to reach the best distribution of the tasks among the processors. In this paper, we present a new load-balancing system for parallel architectures with gre at numbers of processors. Being well suited for Computer Algebra and based on the notion of granularity, it is original in the sense that it takes into account the tasks complexity as a consistent information in order to achieve efficiency. |
Year | DOI | Venue |
---|---|---|
1992 | 10.1007/3-540-55895-0_444 | CONPAR |
Keywords | Field | DocType |
algebraic computations,cost prediction,load balancing,computer algebra,load balance,dynamic analysis,static analysis | Algebraic number,Load balancing (computing),Cost prediction,Computer science,Parallel computing,Symbolic computation,Granularity,Computation | Conference |
ISBN | Citations | PageRank |
3-540-55895-0 | 2 | 0.41 |
References | Authors | |
7 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jean-Louis Roch | 1 | 211 | 26.40 |
A. Vermeerbergen | 2 | 4 | 1.38 |
Gilles Villard | 3 | 565 | 48.04 |