Abstract
A major feature of Computer Algebra, and more generally of non-numerical computations, 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 great 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.
This article was processed using the LaTEX macro package with LLNCS style
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. Bernard, D. Steve, and M. Simatic. Placement et migration de processus dans les systèmes reépartis faiblement couplés. TSI, 10 (5):375–392,1991.
D.P. Bertsekas and J.N. Tsitsiklis. Parallel and distributed computation. Prentice-Hall, 1989.
G. Booch. Software engineering with Ada. Benjamin-Cummings Publishing Company, 1983.
T. Casavant and J. G. Kuhl. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Transactions on Software Engineering, 14(2):141–154, February 1988.
K. Clark and S. Gregory. Parlog: Parallel programming in logic. In J.S. Kowalik, editor, Parallel Compulation and Computers for Artificial Intelligence, pages 109–130. Kluwer Academic Publishers, 1988.
A. Beaumont et al. Flexible Scheduling of OR-Parallelism in Aurora: The Bristol Scheduler. In PARLE'91, pages 403–420, Eindhoven, The Netherlands, 1991. Springer-Verlag, LNCS 506.
D. Ferrari andS. Zhou. An empirical investigation of load indices for load-balancing applications. In PJ. Courtois and G. Latouche, editors, PERFORMANCE '87. Elsevier Science Publishers B.V. (North-Holland), 1988.
Ph. Flajolet and J.S. Vitter. Average-case analysis of algorithms and data structures. In J. van Leuwen, editor, Handbook of Theoretical Computer Science, pages 431–524. Elsevier, 1990.
G. Fox and al. Solving problems on concurrent processors. Prentice-Hall, 1988.
R.H. Halstead. Parallel computing using multilisp. In J.S. Kowalik, editor. Parallel Computation and Computers for Artificial Intelligence, pages 21–49. Kluwer Academic Publishers, 1988.
J.L. Roch. The PAC System and its Implementation on Distributed Architectures. In Computer with Parallel Architectures: T. Node, ed. D. Gassilloud, J.C. Grossetie, Kluwer Ac. Pub., 1991.
J.L. Roch, F. Siebert, P. Sénéchaud, and G. Villard. Computer Algebra on a MIMD machine. ISSAC88, LNCS 358 and in SIGSAM Bulletin, ACM, 23/11, p.16–32,1989.
F. Siebert and G. Villard. PAC: First experiments on a 128 transputers Meganode. In International Symposium on Symbolic and Algebraic Computation, Bonn Germany, 1991.
Telmat. TNode Overview. Technical Report Doc-1.02-3.2, Telmat Informatique, 1990.
M.C. Wikstrom, J.L. Gustafson, and G.M. Prabhu. A meta-balancer for dynamic load balancers. Technical Report TR91-04, Iowa State University/Ames, Iowa 50011, January 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roch, J.L., Vermeerbergen, A., Villard, G. (1992). Cost prediction for load-balancing: Application to algebraic computations. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_444
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_444
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive