Abstract
It is the need of an era to store and process big data and its applications. To process these applications, it is inevitable to use heterogeneous distributed computing systems (HeDCS). The heterogeneous distributed systems facilitate scalability, an essential characteristic for big data processing. However, to implement the scalable model, it is essential to handle performance, efficiency, optimal resource utilization and several other key constraints. Scheduling algorithms play a vital role in achieving better performance and high throughput in heterogeneous distributed computing systems. Hence, selection of a proper scheduling algorithm, for the specific application, becomes a critical task. Selection of an appropriate scheduling algorithm in heterogeneous distributed computing systems require the consideration of various parameters like scheduling type, multi-core processors, and heterogeneity. The paper discusses broadly the hierarchical classification of scheduling algorithms implemented in heterogeneous distributed computing systems and presents a comparative study of these algorithms, thus providing an insight into the significance of various parameters that play a role in the selection of a scheduling algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Topcuoglu, H., Hariri, S., Wu, Min-You: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13, 260–274 (2002)
Padole, M.: Distributed computing for structured storage, retrieval and processing of DNA sequencing data. Int. J. Internet Web Technol. 38, 1113–1118 (2013)
Foster, I., Kesselman, C.: The Grid. Morgan Kaufmann, Amsterdam (2004)
Yuxiong, H., Liu, J., Hongyang, S.: Scheduling functionally heterogeneous systems with utilization balancing. IEEE Int. Parallel Distrib. Process. Symp. 1187–1198 (2011)
Zhu, Y: A survey on grid scheduling systems, Department of Computer Science, Hong Kong University of science and Technology (2003)
EL-Rewini, H., Lewis, T., Ali, H.: Task scheduling in parallel and distributed systems. Prentice Hall, Englewood Cliffs, N.J. (1994)
Casavant, T., Kuhl, J.: A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans. Softw. Eng. 14, 141–154 (1988)
Zheng, W., Sakellariou, R.: Stochastic DAG scheduling using a Monte Carlo approach. J. Parallel Distrib. Comput. 73, 1673–1689 (2013)
Munir, E., Mohsin, S., Hussain, A., Nisar, M., Ali, S.: SDBATS: a Novel algorithm for Task scheduling in heterogeneous computing systems. Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2013 IEEE 27th International. 43–53 (2013)
Kwok, Y., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31, 406–471 (1999)
Kanemitsu, H., Hanada, M., Nakazato, H.: Clustering-based task scheduling in a large number of heterogeneous processors. IEEE Trans. Parallel Distrib. Syst. 27, 3144–3157 (2016)
Abdelkader, D., Omara, F.: Dynamic task scheduling algorithm with load balancing for heterogeneous computing system. Egypt. Inform. J. 13, 135–145 (2012)
Wang, G., Wang, Y., Liu, H., Guo, H.: HSIP: a novel task scheduling algorithm for heterogeneous computing. Sci. Progr. 2016, 1–11 (2016)
Munir, E., Ahmad, S., Nisar, W.: PEGA: a performance effective genetic algorithm for task scheduling in heterogeneous systems. In: High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems (HPCC-ICESS), 2012 IEEE 14th International Conference. 1082–1087 (2013)
Ahmad, S., Liew, C., Munir, E., Ang, T., Khan, S.: A hybrid genetic algorithm for optimization of scheduling workflow applications in heterogeneous computing systems. J. Parallel Distrib. Comput. 87, 80–90 (2016)
Cardellini, V., Grassi, V., Presti, F., Nardelli, M.: Distributed QoS-aware scheduling in storm. DEBS’15 Proceedings of the 9th ACM International Conference on Distributed Event-Based Systems. 344–347 (2015)
Arabnejad, H., Barbosa, J.: List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans. Parallel Distrib. Syst. 25, 682–694 (2014)
Khaldi, D., Jouvelot, P., Ancourt, C.: Parallelizing with BDSC, a resource-constrained scheduling algorithm for shared and distributed memory systems. Parallel Comput. 41, 66–89 (2015)
Li, K., Tang, X., Veeravalli, B., Li, K.: Scheduling precedence constrained stochastic tasks on heterogeneous cluster systems. IEEE Trans. Comput. 64, 191–204 (2015)
Barbosa, J., Moreira, B.: Dynamic scheduling of a batch of parallel task jobs on heterogeneous clusters. Parallel Comput. 37, 428–438 (2011)
Choudhury, P., Chakrabarti, P., Kumar, R.: Online scheduling of dynamic task graphs with communication and contention for multiprocessors. IEEE Trans. Parallel Distrib. Syst. 23, 126–133 (2012)
Tang, Z., Jiang, L., Zhou, J., Li, K., Li, K.: A self-adaptive scheduling algorithm for reduce start time. Future Generation Computer Systems 43–44, 51–60 (2015)
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
Padole, M., Shah, A. (2018). Comparative Study of Scheduling Algorithms in Heterogeneous Distributed Computing Systems. In: Choudhary, R., Mandal, J., Bhattacharyya, D. (eds) Advanced Computing and Communication Technologies. Advances in Intelligent Systems and Computing, vol 562. Springer, Singapore. https://doi.org/10.1007/978-981-10-4603-2_12
Download citation
DOI: https://doi.org/10.1007/978-981-10-4603-2_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-4602-5
Online ISBN: 978-981-10-4603-2
eBook Packages: EngineeringEngineering (R0)