IPD, Fakultt fr Informatik, Universitt Karlsruhe, Germany
Abstract
In this paper we present a new method for achieving a higher cost-efficiency on parallel computers. We insert routines into a program which detect the amount of computa tional work without using problem - specific parameters and adapt the number of used CPUs at runtime under given speedup/efficiency constraints. Several user-tunable strategies for selecting the number of processors are presented and compared. The modularity of this approach and its application - independence permit a general use on parallel computers with a scalable degree of parallelism.
In "Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structure Problems"
Eds. Ferreira,A., Rolim,J., Saad,Y. and Yang, T., Springer
(1996) Lecture Notes in Computer Science, 1117, 313-318.