Multiprocessor scheduling using mean-field annealing
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.
Keywordstask scheduling mean-field annealing and graph partitioning
Unable to display preview. Download preview PDF.
- M. R Garey and D.S.Johnson, “Computers and intractability: a guide to the theory of NP-completeness”, WH.Freeman and Co., 1979.Google Scholar
- S.Kirkpatrick, C.D.Gelatt and M.P.Vecchi, “Optimization by simulated annealing”, Science, vol.220, no.4598, 1983, pp.671–678.Google Scholar
- 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.Google Scholar
- C.Peterson and J.R.Anderson, “A mean-field theory learning algorithm for neural networks”, Complex Systems, vol. 1, 1987, pp. 995–1019.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- S.Salleh, “Task scheduling for parallel processing systems using neural network models”, Ph.D Thesis, Dept of Mathematics, University of Technology Malaysia, 1998 (submitted).Google Scholar
- H.El-Rewini, “Task partitioning and scheduling on arbitrary parallel processing systems”, Ph.D Thesis, Dept of Computer Science, Oregon State University, 1990.Google Scholar