Abstract
This paper presents a set of metrics for estimating the speedup achievable in static multiprocessor scheduling using a previously introduced Genetic Algorithm (GA) approach. This is of major importance because, although conventional wisdom suggests that metaheuristics such as GAs have the potential to improve over standard heuristics, little research has been conducted on characterizing the sorts of graphs that they should excel at. We describe several metrics and illustrate that four of them can predict the speed up with an accuracy of almost 90%.
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.
References
Khan, A.A., McCreary, C.L., Jones, M.S.: A comparison of Multiprocessor Scheduling Heuristics. In: International Conference on Parallel Processing, vol. 2, pp. 243–250 (1994)
Wu, A.S., Yu, H., Jin, S., Lin, K., Schiavone, G.: An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling. IEEE Transactions on Parallel and Distributed Systems 15(9) (2004)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for Visual Understanding of Hierarchical System Structures. IEEE Transactions on Systems, Man and Cybernatics 11(2), 109–125 (1981)
Kwok, Y., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys 31(4), 406–471 (1999)
Wu, M.-Y., Gajski, D.D.: Hypertool: A Programming Aid for Hypercube Architectures. The Journal of Supercomputing 2, 349–372 (1988/1987)
Yang, T., Gerasoulis, A.: A Fast Scheduling Algorithm for DAGs on an Unbounded Number of Processors. In: 5th ACM International Conference on Supercomputing, pp. 633–642. Association of Computing Machinery, New York (1991)
Sheahan, A., Ryan, C.: A Transformation-Based Approach to Static Multiprocessor Scheduling. In: Gecco 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 1041–1048. Association of Computing Machinery, New York (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sheahan, A., Ryan, C. (2011). Graph Metrics for Predicting Speedup in Static Multiprocessor Scheduling. In: Lee, G., Howard, D., Ślęzak, D. (eds) Convergence and Hybrid Information Technology. ICHIT 2011. Lecture Notes in Computer Science, vol 6935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24082-9_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-24082-9_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24081-2
Online ISBN: 978-3-642-24082-9
eBook Packages: Computer ScienceComputer Science (R0)