Task scheduling problem (TSP) is huge challenge in cloud computing paradigm as number of tasks comes to cloud application platform vary from time to time and all the tasks consists of variable length, runtime capacities. All these tasks may generated from various heterogeneous resources which comes onto cloud console directly effects the performance of cloud paradigm with increase in makespan, energy consumption, resource costs. Traditional task scheduling algorithms cannot handle these type of complex workloads in cloud paradigm. Many authors developed Task Scheduling algorithms by using metaheuristic techniques, hybrid approaches but all these algorithms give near optimal solutions but still TSP is a highly challenging and dynamic scenario as it resembles NP hard problem. Therefore, to tackle the TSP in cloud computing paradigm and schedule the tasks in an effective way in cloud paradigm, we formulated Adaptive Task scheduler which segments all the tasks comes to cloud console as sub tasks and fed these to the scheduler which is modeled by Improved Asynchronous Advantage Actor Critic Algorithm(IA3C) to generate schedules. This scheduling process is carried out in two stages. In first stage, all incoming tasks are segmented as sub tasks. After segmentation, all these sub tasks according to their size, execution time, communication time are grouped together and fed to the (ATSIA3C) scheduler. In the second stage, it checks for the above said constraints and disperse them onto the corresponding suitable processing capacity VMs resided in datacenters. Proposed ATSIA3C is simulated on Cloudsim. Extensive simulations are conducted using both fabricated worklogs and as well as realtime supercomputing worklogs. Our proposed mechanism evaluated over baseline algorithms i.e. RATS-HM, AINN-BPSO, MOABCQ. From results it is evident that our proposed ATSIA3C outperforms existing task schedulers by improving makespan by 70.49%. Resource cost is improved by 77.42%. Energy Consumption is improved over compared algorithms 74.24% in multi cloud environment by proposed ATSIA3C.
Task scheduling is a crucial challenge in cloud computing paradigm as variety of tasks with different runtime processing capacities generated from various heterogeneous devices are coming up to cloud application console which effects system performance in terms of makespan, resource utilization, resource cost. Therefore, traditional scheduling algorithms may not adapt to this paradigm efficiently. Many existing authors developed various task schedulers by using metaheuristic approaches to solve Task scheduling problem(TSP) to get near optimal solutions but still TSP is a highly dynamic challenging scenario as it is a NP hard problem. To tackle this challenge, this paper introduces a multi objective prioritized task scheduler using improved asynchronous advantage actor critic(a3c) algorithm which uses priorities of tasks based on length of tasks, runtime processing capacities and priorities of VMs based on electricity unit cost using multi cloud environment. Scheduling process carried out in two stages. In the first stage, all incoming tasks, VM priorities are calculated at the task manager level and in the second stage, Priorities are fed to (MOPTSA3C) scheduler to generate scheduling decisions to map tasks effectively onto VMs by considering priorities and schedule tasks based on cost, resource utilization, makespan in the available multi cloud environment. Extensive simulations are conducted on Cloudsim toolkit by giving input trace different fabricated data distributions and real time worklogs of HPC2N, NASA datasets to the scheduler. For evaluating the efficacy of proposed MOPTSA3C, it compared against existing techniques i.e. DQN, A2C, MOABCQ. From the results, it is evident that proposed MOPTSA3C outperforms existing algorithms for makespan, resource utilization, resource cost, reliability.
Cloud Computing model provides on demand delivery of seamless services to customers around the world yet single point of failures occurs in cloud model due to improper assignment of tasks to precise virtual machines which leads to increase in rate of failures which effects SLA based trust parameters (Availability, success rate, turnaround efficiency) upon which impacts trust on cloud provider. In this paper, we proposed a task scheduling algorithm which captures priorities of all tasks, virtual resources from task manager which comes onto cloud application console are fed to task scheduler which takes scheduling decisions based on hybridization of both Harris hawk optimization and ML based reinforcement algorithms to enhance the scheduling process. Task scheduling in this research performed in two phases i.e. Task selection and task mapping phases. In task selection phase, all incoming priorities of tasks, VMs are captured and generates schedules using Harris hawks optimization. In task mapping phase, generated schedules are optimized using a DQN model which is based on deep reinforcement learning. In this research, we used multi cloud environment to tackle availability of VMs if there is an increase in upcoming tasks dynamically and migrate tasks to one cloud to another to mitigate migration time. Extensive simulations are conducted in Cloudsim and workload generated by fabricated datasets and realtime synthetic workloads from NASA, HPC2N are used to check efficacy of our proposed scheduler (FTTHDRL). It compared against existing task schedulers i.e. MOABCQ, RATS-HM, AINN-BPSO approaches and our proposed FTTHDRL outperforms existing mechanisms by minimizing rate of failures, resource cost, improved SLA based trust parameters.
In the realm of computer vision, image transformations play a pivotal role across various domains such as healthcare, image enhancement, artist painting identification, genome sequencing, and more. While supervised learning demands a substantial volume of annotated images for training models, Cycle-GAN emerges as a potent solution for training models with fewer paired sources and target images in an unsupervised manner. This study introduces a novel system aimed at generating Monet-style paintings from realistic images, leveraging the Cycle-GAN methodology. Given the scarcity of Monet paintings, our system employs a combination of generator and discriminator neural networks to produce new Monet-style artworks. The model is trained using Cycle-GAN in conjunction with deep learning optimizers like RMSprop, ADAM, and SGD. The training dataset, Monet2Photo, comprises two distinct image categories: Monet paintings (300 samples) and natural photographs (7028 samples). The Monet-style images are utilized for training the model, while the raw photo images serve as the test set. Notably, the proposed model exhibits commendable performance, particularly when utilizing the SGD optimizer, as evidenced by favorable outcomes in terms of generator and discriminator losses.
Task Scheduling is a crucial challenge in cloud computing as diversified tasks come rapidly onto cloud console dynamically from heterogeneous resources which consists of different task lengths, processing capacities. Generating schedules for these type of tasks is a challenge for Cloud Service Provider(CSP).Therefore, to generate task schedules in cloud paradigm effectively by considering type of task arising to cloud console and match it with respective Virtual Machine (VM), a task scheduler is formulated by using Deep Deterministic Policy Gradient (DDPG) algorithm which is used as methodology to design scheduler. This scheduler works in three stages. In the initial stage, tasks are classified based on length and processing capacity to identify them whether they are High Performance Computing (HPC) tasks or High Throughput Computing (HTC) tasks. After classification, in the second stage, resources are to be tracked which matches the corresponding nature of tasks. Finally, in the third stage, according to the VM priorities calculated based on electricity unit cost and tasks are mapped according to the priorities to the corresponding VMs. Simulations are conducted using Cloudsim with fabricated workload distributions and realtime worklogs. Finally, our proposed Hybrid workload Deep Deterministic Policy Gradient Task scheduler(HDDPGTS) evaluated over DQN, A2C algorithms. From results, it proved that our proposed HDDPGTS significantly improved makespan, Energy consumption, scheduling overhead, scalability over baseline approaches.