Abstract
We present a new task scheduling problem in which tasks have a non-preemptive processing time and a rigid deadline for completion. For the solution to the problem, we propose a mathematical formulation and a two-phased algorithm to minimize total transition cost between tasks. In the first phase, the algorithm generates feasible allocations satisfying the deadline constraint using dynamic programming, and then in the second phase it finds optimal solution through a matching procedure. Performance evaluation shows that the proposed algorithm has good execution time efficiency for parallel and distributed systems composed of large quantity of processors.
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
Lee, H., Kim, J., Lee, S.: Processor allocation and Task Scheduling of Matrix Chain Products on Parallel Systems. IEEE Transaction on Parallel and Distributed Systems 14(4), 394–407 (2003)
Yoo, B., Das, C.: A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers. IEEE Transactions on Computers, 46–60 (2002)
Cambazard, H., Hladik, P., Deplanche, A., Jussien, N., Trinquest, Y.: Decomposition and Learning for a Hard Real Time Task Allocation Problem. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 153–167. Springer, Heidelberg (2004)
Franklin, A., Joshi, V.: SimplePipe: A Simulation Tool for Task Allocation and Design of Processor Pipelines with Application to network Processors. In: 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, pp. 59–66 (2004)
Ruan, Y., Liu, G., Li, Q., Jiang, T.: An Efficient Scheduling Algorithm for Dependent Tasks. In: The fourth International Conference on Computer and Information Technology, pp. 456–461 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, YJ., Lee, DW., Chang, DJ. (2006). Optimal Task Scheduling Algorithm for Non-preemptive Processing System. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds) Frontiers of WWW Research and Development - APWeb 2006. APWeb 2006. Lecture Notes in Computer Science, vol 3841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610113_93
Download citation
DOI: https://doi.org/10.1007/11610113_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31142-3
Online ISBN: 978-3-540-32437-9
eBook Packages: Computer ScienceComputer Science (R0)