Cloud computing is the revenue gain and most advanced technology that has tremendous advantages over other technologies. It can be used as a utility for executing large size of real-time programs. These programs are decomposed into multiple inter-dependent tasks and executed on the multiple virtual processors where the open research issue is to be minimized make-span of the scheduling tasks. Our research aims to address this issue and degenerate the schedule length approximately equal to the available number of virtual processors. We proposed a real-time workload scheduling algorithm that does very well in reducing the number of initial clusters. The experimental results show that the execution times for various kinds of the DAGs can be reduced as much as possible and improves the performance of the early load scheduling algorithms for distributed cloud environment.
D. Warneke and N. Kao, O., "Efficient parallel data processing in the cloud," in Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers, ACM, 2009.
G. Malewicz, M. Austern, A. Bik, J. Dehnert, I. Horn, N. Leiser, and G. Czajkowski Pregel, "A system for large-scale graph processing," in Proceedings of the 2010 International Conference on Management of Data, ACM, 2010, pp. 135-146.
W. Paul, "A multi-level security model for partitioning workflows over federated clouds," Journal of Cloud Computing: Advances, Systems and Applications, vol. 1, pp. 1-15, 2012.
A. Amit and K. Padam, "Economical duplication based task scheduling for heterogeneous and homogeneous computing systems," presented at the WEE International Advance Computing Conference (LACC 2009) Patiala, India 6-7 March 2009, 2009.
M. Karthikeya, P. Gajjala, and B. Dinesh, "Temporal partitioning and scheduling data flow graphs for reconfigurable computers," IEEE Transactions on Computers, vol. 48, pp. 579-590, 1999.
B. Sharma, V. Chudnovsky, J. L. Hellerstein, R. Rifaat, and C. R. Das, "Modeling and synthesizing task placement constraints in google compute clusters," in Proc. 2011 ACM Symposium on Cloud Computing, n.d, pp. 1–3:14.
L. Xiao Cheng, W. Chen, Z. Bing Bing, C. Junliang, Y. Ting, and Y. Albert Zomaya, "Priority-based consolidation of parallel workloads in the cloud," IEEE Transactions on Parallel and Distributed Systems, vol. 24, pp. 1874-1883, 2013.
A. Nitin and P. Dharma Agrawal, "Enhancing the schedulability of real-time heterogeneous networks of workstations (NOWs)," IEEE Transactions on Parallel and Distributed Systems, vol. 20, pp. 1586-1599, 2009.
S. Sen, "Cost-efficient task scheduling for executing large programs in the cloud," Parallel Computing, vol. 39, pp. 177-188, 2013.
B. Rashmi and P. Dharma Agrawal, "Improving scheduling of tasks in a heterogeneous environment," IEEE Transactions on Parallel and Distributed Systems, vol. 15, pp. 107-118, 2004.
H. Hung-Chang, C. Hsueh-Yi, S. Haiying, and C. Yu-Chang, "Load rebalancing for distributed file systems in clouds," IEEE Transactions on Parallel and Distributed Systems, vol. 24, pp. 951-962, 2013.
M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly, "Dryad, distributed data-parallel programs from sequential building blocks," ACM SIGOPS Operating Systems Review, vol. 41, pp. 59-72, 2007.
N. Rodrigo Calheiros, R. Rajiv, B. Anton, A. F. C´esar De Rose, and B. Rajkumar, CloudSim: A toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms: Wiley Online Library. Available: wileyonlinelibrary.com [Accessed 24 August 2010], 2010.
R. Dick, D. Rhodes, and W. Wolf, "TGFF: Task graphs for free," in Proc. Sixth Int’l Workshop Hardware/Software Co-Design (CODES/CASHE ’98), 1998.