Abstract Nowadays, the emergence of computation-intensive applications brings benefits to individuals and the commercial organization. However, it still faces many challenges due to the limited processing capacity of the local computing resources. Besides, the local computing resources require a lot of finance and human forces. This problem, fortunately, has been made less severe, thanks to the recent adoption of Cloud Computing (CC) platform. CC enables offloading heavy processing tasks up to the "cloud", leaving only simple jobs to the user-end capacity-limited clients. Conversely, as CC is a pay-as-you-go model, it is necessary to find out an approach that guarantees the highly efficient execution time of cloud systems as well as the monetary cost for cloud resource use. Heretofore, a lot of research studies have been carried out, trying to eradicate problems, but they have still proved to be trivial. In this paper, we present a novel architecture, which is a collaboration of the computing resources on cloud provider side and the local computing resources (thick clients) on client side. In addition, the main factor of this framework is the dynamic genetic task scheduling to globally minimize the completion time in cloud service, while taking into account network condition and cloud cost paid by customers. Our simulation and comparison with other scheduling approaches show that the proposal produces a reasonable performance together with a noteworthy cost saving for cloud customers.

References

[1] Ababneh M., Hassan S., and Bani-Ahmad S., “On Static Scheduling of Tasks in Real Time Multiprocessor Systems: An Improved GA- Based Approach,” The International Arab Journal of Information Technology, vol. 11, no. 6, pp. 560-572, 2013.

[2] Amazon Web Services. http://aws.amazon.com/ec2/, Last Visited, 2015.

[3] Bhattacharya A., Wu W., and Yang Z., “Quality of Experience Evaluation of Voice Communication: An Affect-Based Approach,” Human-centric Computing and Information Sciences, vol. 2, no. 7, pp. 1-18, 2012.

[4] Binh H., “Multi-objective Genetic Algorithm for Solving the Multilayer Survivable Optical Network Design Problem,” Journal of Convergence, vol. 5, no. 1, pp. 20-25, 2014.

[5] Bossche R., Vanmechelen K., and Broeckhove J., “Cost-Efficient Scheduling Heuristics for Deadline Constrained Workloads on Hybrid Clouds,” in Proceedings of IEEE 3rd International Conference on Cloud Computing Technology and Science, Athens, pp. 320-327, 2011.

[6] Canon L. and Jeannot E., “Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 4, pp. 532-546, 2010.

[7] Cloudsim, https://code.google.com/p/cloudsim/ downloads/list, Last Visited, 2014.

[8] Gopalakrishnan A., “A Subjective Job Scheduler Based on A Backpropagation Neural Network,” Human-centric Computing and Information Sciences, vol. 3, no. 17, 2013.

[9] Gotoda S., Ito M., and Shibata N., “Task Scheduling Algorithm For Multicore Processor System for Minimizing Recovery Time in Case of Single Node Fault,” in Proceedings of 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, Ottawa, pp. 260- 267, 2012.

[10] Jegede O., Kaiser T., Ferens K., and Ferens K., “A Genetic Algorithm for Multiprocessor Task Scheduling,” in Proceedings of International Conference on Genetic and Evolutionary Methods, Las Vegas, 2013.

[11] Kim B., Youn C., Park Y., Lee Y., and Choi W., “An Adaptive Workflow Scheduling Scheme Based on an Estimated Data Processing Rate for Next Generation Sequencing in Cloud Computing,” Journal of Information Processing Systems, vol. 8, no. 4, pp. 555-566, 2012.

[12] Lee Y. and Zamaga A., “A Novel State Transition Method for Metaheuristic-Based Scheduling in Heterogeneous Computing Systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 9, pp. 1215- 1223, 2008.

[13] Li J., Su S., Cheng X., Huang Q., and Zhang Z., “Cost-Conscious Scheduling for Large Graph Processing in the Cloud,” in Proceedings of IEEE International Conference on High Performance Computing and Communications, Banff, pp. 808- 813, 2011.

[14] Li Q. and Guo Y., “Optimization of Resource Scheduling in Cloud Computing,” in Proceedings of 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, pp. 315-320, 2010.

[15] Maguluri S., Srikant R., and Ying L., “Stochastic Models of Load Balancing and Scheduling in Cloud Computing Clusters,” IEEE Infocom, Orlando, pp. 702-710, 2012.

[16] Man N. and Huh E., “Cost and Efficiency-based Scheduling on a General Framework Combining between Cloud Computing and Local Thick Clients,” in Proceedings of International Conference on Computing, Management and Telecommunications, Ho Chi Minh City, pp. 258- 263, 2013. 642 The International Arab Journal of Information Technology, Vol. 16, No. 4, July 2019

[17] Munir E., Ijaz S., Anjum S., Khan A., Anwar W., and Nisar W., “Novel Approaches for Scheduling Task Graphs in Heterogeneous Distributed Computing Environment,” The International Arab Journal of Information Technology, vol. 12, no. 3, pp. 270-277, 2014.

[18] Omara F. and Arafa M., “Genetic Algorithms for Task Scheduling Problem,” Journal of Parallel and Distributed Computing, vol. 70, no. 1, pp. 13-22, 2010.

[19] Oprescu A. and Kielmann T., “Bag-of-tasks Scheduling under Budget Constraints,” in Proceedings of IEEE 2nd International Conference on Cloud Computing Technology and Science, Indianapolis, pp. 351-359, 2010.

[20] Pawar C. and Wagh R., “Priority Based Dynamic Resource Allocation in Cloud Computing,” in Proceedings of International Symposium on Cloud and Services Computing, Mangalore, pp. 1-6, 2012.

[21] Phuoc Hung P., Bui T., Morales M., Nguyen M., and Huh E., “Optimal Collaboration of Thin- Thick Clients and Resource Allocation in Cloud Computing,” Personal and Ubiquitous Computing, vol. 18, no. 3, pp. 563-572, 2014.

[22] Qi H. and Abdullah G., “Research on Mobile Cloud Computing: Review, Trend and Perspectives,” in Proceedings of International Conference on Digital Information and Communication Technology and its Applications, Bangkok, pp. 195-202, 2012.

[23] Sakellariou R. and Zhao H., “Scheduling Workflows with Budget Constraints,” in Proceedings of Integrated Research in Grid Computing, Boston, pp. 189-202, 2007.

[24] Sinnen O. and Sousa L., “Communication Contention in Task Scheduling,” IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 6, pp. 503-515, 2005.

[25] Srinivasan S., “Why Thick Clients Are Relevant in Cloud Computing,” http://cloudcomputing.sys- con.com/node/ 1694221, Last Visited, 2014.

[26] Su S., Li J., Huang Q., Huang X., Shuang K., and Wang J., “Cost-Efficient Task Scheduling for Executing Large Programs in the Cloud,” Parallel Computing Journal, vol. 39, no. 4-5, pp. 177-188, 2013.

[27] Tawfeek M., El-Sisi A., Keshk A., and Torkey F., “Cloud Task Scheduling Based on Ant Colony Optimization,” The International Arab Journal of Information Technology, vol. 12, no. 2, pp. 129-137, 2014.

[28] Topcuoglu H., Hariri S., and Wu M., “Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 3, pp. 260-274, 2002.

[29] Wolf J., Bansal N., Hildrum K., Parekh S., Rajan D., Wagle R., Wu K., and Fleischer L., “SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems,” in Proceedings of International Conference on Middleware, Berlin, pp. 306-325, 2008.

[30] Yu J. and Buyya R., “A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms,” in Proceedings of Workshop on Workflows in Support of Large- Scale Science, Paris, pp. 1-10, 2006.

[31] Zeng L., Veeravalli B., and Xiaorong L., “ScaleStar: Budget Conscious Scheduling Precedence-Constrained Many-task Workflow Applications in Cloud,” in Proceedings of IEEE 26th International Conference on Advanced Information Networking and Applications, Fukuoka, pp. 534-541, 2012.

[32] Zhu K., Song H., Liu L., Gao J., and Cheng G., “Hybrid Genetic Algorithm for Cloud Computing Applications,” in Proceedings of IEEE Asia- Pacific Services Computing Conference, Jeju Island, pp. 182-187, 2011. A Dynamic Scheduling Method for Collaborated Cloud with Thick Clients 643 Pham Phuoc Hung received the B.S. degree in Computer Engineering from Ho Chi Minh National University, University of Sciences, Vietnam, Master's degree in Computer Science from Dongguk University, Korea, Ph.D degree in Computer Engineering from KyungHee University, Korea. He used to be a director, a project manager in some software companies. At present, he is also working as a Postdoctoral Researcher in Department of Computer Science at Kent State University, USA where he has been working on several large-scale R&D funded projects, including their proposals. His research interests include Resource Allocation, Parallel and Distributing Computing, High Performance Computing, Data Analysis, Cluster and Grid Computing, Cloud Computing, Fog Computing, Sensor Network. Golam Alam received his B.S., M.S and Ph.D. degrees in Computer Science and Engineering, Information Technology, and Computer Engineering respectively. He is currently working as an Assistant Professor in Computer Science and Engineering department at BRAC University, Bangladesh. His research interest includes health informatics, mobile cloud computing, ambient intelligence and persuasive technology. Nguyen Hai is a PhD Student in the Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology (HCMUT), Vietnam. He received his B.Eng. degree in Information Technology from HCMUT in 2007 and received his Master degree in 2010 from Bordeaux I University, France. His current research areas include formal methods, program analysis/verification, malware analysis, security and dynamic scheduling. Quan Tho is an Associate Professor in the Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology (HCMUT), Vietnam. He received his B.Eng. degree in Information Technology from HCMUT in 1998 and received Ph.D degree in 2006 from Nanyang Technological University, Singapore. His current research interests include formal methods, program analysis/verification, the Semantic Web, machine learning/data mining and intelligent systems. Currently, he heads the Department of Software Engineering of the Faculty. He is also serving as the Chair of Computer Science Program (undergraduate level). Eui-Nam Huh has earned B.S. degree from Busan National University in Korea, Master's degree in Computer Science from University of Texas, USA in 1995 and Ph.D degree from the Ohio University, USA in 2002. He was a director of Computer Information Center and Assistant Professor in Sahmyook University, South Korea during the academic year 2001 and 2002. He has also served for the WPDRTS/IPDPS community as program chair in 2003. He has been an editor of Journal of Korean Society for Internet Information and Korea Grid Standard group chair since 2002. He was also an Assistant Professor in Seoul Women's University, South Korea. Now he is with Kyung Hee University, South Korea as Professor in Dept. of Computer Engineering. His interesting research areas are: High Performance Network, Sensor Network, Distributed Real Time System, Grid, Cloud Computing, and Network Security.