Abstract
Task Scheduling is one of the thrust areas of the research in parallel computing where tasks are allocated in the available processors. The objective of the task scheduling method is to minimize the overall execution time in multiprocessor environment. A new task scheduling technique is presented in the paper that is extended version of previous developed method: Static Task Scheduling Algorithm with Minimum Distance for multiprocessor system (STMD). The proposed algorithm modified the priority attribute method of STMD algorithm and omitted the communication delay among the tasks during the allocation of the tasks and also excluded duplication of an entry task among the all processors. This method also gives better results as compare to STMD and heuristics algorithms such as HLFET and MCP algorithms. The performance study has been done on the basis of some metrics such as efficiency, load balancing, scheduling length, speedup, and normalized scheduling length
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Rajaraman, V., Ram Murthy, C.S.: Parallel Computers Architecture and Programming. PHI Publication (2012)
Pinedo, M.L.: Scheduling: Theory, Algorithms and Systems, 3rd edn. Springer, Berlin (2008). https://doi.org/10.1007/978-1-4614-2361-4
Singh, J.: Improved task scheduling on parallel system using genetic algorithm. Int. J. Comput. Appl. 39(17) (2012)
Sinnen, O.: Task Scheduling for Parallel Systems. Wiley-Interscience Publication (2007)
Rajak, R., Katti, C.P.: Static task scheduling algorithm with minimum distance for multiprocessor system (STMD). J. Smart Comput. Rev. South Korea 5(2), 113–125 (2015)
Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31(4) (1999)
Rajak, R.: Comparison of BNP class of scheduling algorithms based on metrics. GESJ Comput. Sci. Telecomun. 34(2), 35–44 (2012)
Rajak, R., Shukla, D., Alim, A.: Modified critical path and top-level attributes (MCPTL)-based task scheduling algorithm in parallel computing. In: Pant, M., Ray, K., Sharma, T.K., Rawat, S., Bandyopadhyay, A. (eds.) Soft Computing: Theories and Applications. AISC, vol. 583, pp. 1–13. Springer, Singapore (2018). https://doi.org/10.1007/978-981-10-5687-1_1
Zhou, G., Xu, Y., Tian, S., Zhao, H.: A genetic-based task scheduling algorithms on heterogeneous computing systems to minimize makespan. J. Converg. Inf. Technol. (JCIT) 8(5), 547–555 (2013)
Quinn, M.J.: Parallel Programming in C with MPI and Open MP. Tata McGraw-Hill (2003)
Topcuoglu, H., Wu, M.Y.: Performance effective and low complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Comput. 13(3), 260–274 (2002)
Omara, F.A., Arafa, M.M.: Genetic algorithm for task scheduling problem. J. Parallel Distrib. Comput. 70, 13–22 (2010)
Zhou, L., Shi-xin, S.: A genetic scheduling algorithm based on knowledge for multiprocessor system. In: Proceedings of International Conference on Communications, Circuits and Systems, Kokura, pp. 900–904 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Rajak, R. (2018). Deterministic Task Scheduling Method in Multiprocessor Environment. In: Singh, M., Gupta, P., Tyagi, V., Flusser, J., Ören, T. (eds) Advances in Computing and Data Sciences. ICACDS 2018. Communications in Computer and Information Science, vol 905. Springer, Singapore. https://doi.org/10.1007/978-981-13-1810-8_33
Download citation
DOI: https://doi.org/10.1007/978-981-13-1810-8_33
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1809-2
Online ISBN: 978-981-13-1810-8
eBook Packages: Computer ScienceComputer Science (R0)