Cloud computing is one of the most commonly used infrastructures for carrying out activities using virtual machines known as processing units. One of the most fundamental issues with cloud computing is task scheduling. The optimal determination of scheduling criteria in cloud computing is a non-deterministic polynomial-time (NP)-complete optimization problem, and several procedures to manage this problem have been suggested by researchers in the past. Among these methods, the Heterogeneous Earliest Finish Time (HEFT) algorithm is recognized to produce optimal outcomes in a shorter time period for scheduling tasks in a heterogeneous environment. Literature shows that HEFT gives extraordinary results in terms of quality of schedule and execution time. However, in some cases, the average computation cost and selection of the first idle slot may not produce a good solution. Therefore, here we propose modified versions of the HEFT algorithm that can obtain improved results. In the rank generation phase, we implement different methodologies for calculating ranks, while in the processor selection phase, we modify the way of selecting idle slots for scheduling the tasks. This paper suggests enhanced versions of the HEFT algorithm under user-required financial constraints to minimize the makespan of a specified workflow submission on virtual machines. Our findings also suggest that enhanced versions of the HEFT algorithm perform better than the basic HEFT method in terms of lesser schedule length of the workflow problems running on various virtual machines.

This research is done based on the identification and thorough analyzing musical data that is extracted by the various method. This extracted information can be utilized in the deep learning algorithm to identify the emotion, based on the hidden features of the dataset. Deep learning-based convolutional neural network (CNN) and long short-term memory-gated recurrent unit (LSTM-GRU) models were developed to predict the information from the musical information. The musical dataset is extracted using the fast Fourier transform (FFT) models. The three deep learning models were developed in this work the first model was based on the information of extracted information such as zero-crossing rate, and spectral roll-off. Another model was developed on the information of Mel frequencybased cepstral coefficient (MFCC) features, the deep and wide CNN algorithm with LSTM-GRU bidirectional model was developed. The third model was developed on the extracted information from Mel-spectrographs and untied these graphs based on two-dimensional (2D) data information to the 2D CNN model alongside LSTM models. Proposed model performance on the information from Mel-spectrographs is compared on the F1 score, precision, and classification report of the models. Which shows better accuracy with improved F1 and recall values as compared with existing approaches.