Abstract
This paper presents an experimental validation of makespan improvements of two scheduling algorithms: a greedy construction algorithm and a tabu search based algorithm. Synthetic parallel executions were performed using the scheduled graph costs. These synthetic executions were performed on a real parallel machine (IBM SP). The estimated and observed response times improvements are very similar, representing the low impact of system overhead on makespan improvement estimation. This guarantees a reliable cost function for static scheduling algorithms and confirms the actual better results of the tabu search meta-heuristic applied to scheduling problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Glover, F., Laguna, M.: Tabu Search. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems. ch. 3, pp. 70–150. Blackwell Scientific Publications, Oxford (1992)
Glover, F., Taillard, E., de Werra, D.: A User’s Guide to Tabu Search. Annals of Operations Research 41, 3–28 (1993)
Kitajima, J.P., Plateau, B., Bouvry, P., Trystram, D.: A method and a tool for performance evaluation. A case study: Evaluating mapping strategies. In: Proceedings of the 1994 Cray Users Group Meeting, Tours (1994)
Menascé, D.A., Porto, S.C.S.: Processor Assignment in Heterogeneous Parallel Architectures. In: Proceedings of the IEEE International Parallel Processing Symposium, Beverly Hills, pp. 186–191 (1992)
Miguel, J., Arruabarrena, A., Beivide, R., Gregorio, J.A.: Assessing the performance of the new IBM SP2 communication subsystem. IEEE Parallel & Distributed Technology 4, 12–22 (1996)
Porto, S.C.S., Ribeiro, C.C.: A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints. International Journal of High-Speed Computing 7, 45–71 (1995)
Porto, S.C.S., Ribeiro, C.C.: Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling under Precedence Constraints. Journal of Heuristics 1, 207–233 (1996)
Porto, S.C.S., Kitajima, J.P.W., Ribeiro, C.C.: Performance Evaluation of a Parallel Tabu Search Scheduling Algorithm. In: Solving Combinatorial Problems in Parallel (joint workshop with the International Parallel Processing Symposium 1997), Geneva, April 1-5 (1997)
Sunderam, V.S., Geist, G.A., Dongarra, J., Manchek, R.: The PVM concurrent computing system: evolution, experiences, and trends. Parallel Computing 20, 531–546 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kitajima, J.P., Porto, S. (1999). Using Synthetic Workloads for Parallel Task Scheduling Improvement Analysis. In: Hernández, V., Palma, J.M.L.M., Dongarra, J.J. (eds) Vector and Parallel Processing – VECPAR’98. VECPAR 1998. Lecture Notes in Computer Science, vol 1573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703040_36
Download citation
DOI: https://doi.org/10.1007/10703040_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66228-0
Online ISBN: 978-3-540-48516-2
eBook Packages: Springer Book Archive