Abstract
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that takes the statistical properties of particles as its learning paradigm. It combines good features from the Hopfield neural network and simulated annealing, to overcome their weaknesses and improve on their performances. Our MFA model for task scheduling is derived from its prototype, namely, the graph partitioning problem. MFA is deterministic in nature and this gives the advantage of faster convergence to the equilibrium temperature, compared to simulated annealing. Our experimental work verifies this finding on various network and task graph sizes. Our work also includes the simulation of the MFA model on several network topologies and parameters.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. R Garey and D.S.Johnson, “Computers and intractability: a guide to the theory of NP-completeness”, WH.Freeman and Co., 1979.
S.Kirkpatrick, C.D.Gelatt and M.P.Vecchi, “Optimization by simulated annealing”, Science, vol.220, no.4598, 1983, pp.671–678.
J.J.Hopfield and D.W.Tank, “Neural computation of decisions in optimization problems”, Biological Cybernetics, vol.52, 1985, pp. 141–152.
A.Y.Zomaya and R.Kazman, “Simulated annealing techniques”, to appear in Handbook of Algorithms and the Theory of Computation, M.J.Atallah (ed.), CRC Press, Florida.
C.Peterson and J.R.Anderson, “A mean-field theory learning algorithm for neural networks”, Complex Systems, vol. 1, 1987, pp. 995–1019.
C.Peterson and J.R.Anderson, “Neural networks and NP-complete optimization problems; a performance study on the graph bisection problem”, Complex Systems, vol.2, 1988, pp. 59–89.
D.E.Van den Bout and T.K.Miller, “Graph partitioning using neural network”, IEEE Trans. Neural Networks, vol. 1, no.2, 1990, pp. 192–202.
T.Bultan and C.Aykanat, “A new mapping heuristic based on mean field annealing”, Journal of Parallel and Distributed Computing, vol. 16, pp. 292–305.
S.Salleh, “Task scheduling for parallel processing systems using neural network models”, Ph.D Thesis, Dept of Mathematics, University of Technology Malaysia, 1998 (submitted).
H.El-Rewini, “Task partitioning and scheduling on arbitrary parallel processing systems”, Ph.D Thesis, Dept of Computer Science, Oregon State University, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salleh, S., Zomaya, A.Y. (1998). Multiprocessor scheduling using mean-field annealing. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_699
Download citation
DOI: https://doi.org/10.1007/3-540-64359-1_699
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64359-3
Online ISBN: 978-3-540-69756-5
eBook Packages: Springer Book Archive