<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "https://jats.nlm.nih.gov/publishing/1.3/JATS-journalpublishing1-3.dtd"><article xml:lang="en" dtd-version="1.3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article"><front><journal-meta><journal-id journal-id-type="issn">2583-6250</journal-id><journal-title-group><journal-title>International Journal of Data Informatics and Intelligent Computing</journal-title><abbrev-journal-title>International Journal of Data Informatics and Intelligent Computing</abbrev-journal-title></journal-title-group><issn pub-type="epub">2583-6250</issn><publisher><publisher-name>Prisma Publications</publisher-name><publisher-loc>India</publisher-loc></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.59461/ijdiic.v5i2.273</article-id><article-categories><subj-group><subject>Cloud Computing and Big Data Analytics</subject></subj-group></article-categories><title-group><article-title>Optimized Large-Scale Data Analytics Using Advanced Computational Methods in Cloud Computing Frameworks</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Gupta</surname><given-names>Aditya</given-names></name><address><country>Malaysia</country><email>gupta.aditya56@gmail.com</email></address><xref ref-type="aff" rid="AFF-1"></xref><xref ref-type="corresp" rid="cor-0"></xref></contrib><contrib contrib-type="author"><name><surname>Oruganti</surname><given-names>Sai Kiran</given-names></name><address><country>Malaysia</country></address><xref ref-type="aff" rid="AFF-2"></xref></contrib></contrib-group><contrib-group><contrib contrib-type="editor"><name><surname>Editor</surname></name><address><country>India</country></address></contrib><contrib contrib-type="editor"><name><surname>Natarajan</surname><given-names>Rajesh</given-names></name><address><country>Oman</country></address><xref ref-type="aff" rid="EDITOR-AFF-1"></xref></contrib></contrib-group><aff id="AFF-1"><institution content-type="dept">Department of Computer Science and Engineering</institution><institution-wrap><institution>Lincoln University College</institution><institution-id institution-id-type="ror">https://ror.org/02yd50j87</institution-id></institution-wrap><addr-line>Petaling Jaya, Selangor Darul Ehsan, 47301</addr-line><country country="MY">Malaysia</country></aff><aff id="AFF-2"><institution content-type="dept">Faculty of Engineering and Built Science</institution><institution-wrap><institution>Lincoln University College</institution><institution-id institution-id-type="ror">https://ror.org/02yd50j87</institution-id></institution-wrap><addr-line>Petaling Jaya, Selangor Darul Ehsan, 47301</addr-line><country country="MY">Malaysia</country></aff><aff id="EDITOR-AFF-1">UTAS-shinas</aff><author-notes><fn fn-type="coi-statement"><label>Conflict of Interest</label><p>The authors declare that they have no conflicts of interest to this work.</p></fn><corresp id="cor-0">Corresponding author: Aditya Gupta, Department of Computer Science and Engineering, Lincoln University College, Petaling Jaya, Selangor Darul Ehsan, 47301, Malaysia.  Email: <email>gupta.aditya56@gmail.com</email></corresp></author-notes><pub-date date-type="pub" iso-8601-date="2026-6-16" publication-format="electronic"><day>16</day><month>6</month><year>2026</year></pub-date><pub-date date-type="collection" iso-8601-date="2026-6-26" publication-format="electronic"><day>26</day><month>6</month><year>2026</year></pub-date><volume>5</volume><issue>2</issue><fpage>50</fpage><lpage>61</lpage><history><date date-type="received" iso-8601-date="2026-3-30"><day>30</day><month>3</month><year>2026</year></date><date date-type="rev-recd" iso-8601-date="2026-5-28"><day>28</day><month>5</month><year>2026</year></date><date date-type="accepted" iso-8601-date="2026-6-9"><day>9</day><month>6</month><year>2026</year></date></history><permissions><copyright-statement>Copyright (c) 2026 Aditya Gupta, Sai Kiran Oruganti</copyright-statement><copyright-year>2026</copyright-year><copyright-holder>Aditya Gupta, Sai Kiran Oruganti</copyright-holder><license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by-sa/4.0/"><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-sa/4.0/</ali:license_ref><license-p>This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.</license-p></license></permissions><self-uri xlink:href="https://ijdiic.com/research/article/view/273" xlink:title="Optimized Large-Scale Data Analytics Using Advanced Computational Methods in Cloud Computing Frameworks">Optimized Large-Scale Data Analytics Using Advanced Computational Methods in Cloud Computing Frameworks</self-uri><abstract><p>In today's data-driven world, the exponential growth of information from diverse sources necessitates robust, scalable, and efficient computational solutions. Large-scale data analytics is pivotal in extracting valuable insights from massive datasets, facilitating informed decision-making across industries. This research proposes an advanced computational framework that integrates Deep Learning (DL) techniques to optimize large-scale data analytics in cloud computing environments. The proposed system leverages the Adaptive Satin Bowerbird Optimizer-driven Dynamic Capsule Network (ASB-Dynamic-CapsNet) to automate workload distribution while minimizing execution time and resource utilization. The data collection process involves gathering large-scale datasets from multiple sources, including cloud platforms, Internet of Things (IoT) devices, transactional systems, social media, and enterprise databases. Preprocessing steps like handling missing values and standardizing data ensure data quality and consistency. The framework is evaluated using key performance metrics like Central Processing Unit (CPU) utilization (86%), Random Access Memory (RAM) utilization (68%), and training accuracy (95.9%). Experimental results demonstrate that the ASB-Dynamic-CapsNet model outperforms alternative scheduling approaches and significantly improves the performance of CPU, RAM, and training accuracy compared to traditional algorithms. Overall, the findings highlight the efficacy of DL-driven scheduling in optimizing cloud-based data analytics, providing a scalable and efficient solution for high-volume workloads in modern computing environments.</p></abstract><kwd-group><kwd>Large-Scale Data Analytics</kwd><kwd>Computational Methods</kwd><kwd>Cloud Computing</kwd><kwd>Workload Distribution</kwd><kwd>Capsule Networks for Cloud Analytics</kwd></kwd-group><custom-meta-group><custom-meta><meta-name>File created by JATS Editor</meta-name><meta-value><ext-link ext-link-type="uri" xlink:href="https://jatseditor.com" xlink:title="JATS Editor">JATS Editor</ext-link></meta-value></custom-meta><custom-meta><meta-name>issue-created-year</meta-name><meta-value>2026</meta-value></custom-meta></custom-meta-group></article-meta></front><body><sec><title>1. INTRODUCTION</title><p>Most monitoring systems were produced for a specific kind of equipment in the early stages of condition monitoring technology development, and each system was dispersed and isolated. The information lacked connectivity and data exchange, making it difficult to manage and effectively evaluate monitoring data <xref ref-type="bibr" rid="BIBR-1">[1]</xref>. Organizations are filled with enormous volumes of data produced by a variety of sources, including social media, IoT devices, and transactional systems, in the age of big data. For strategic planning and well-informed decision-making, it is essential to be able to gather valuable insights from the data. Accordingly, effective query processing has become essential to large-scale database administration <xref ref-type="bibr" rid="BIBR-2">[2]</xref>. Technology has always been seen positively, from the introduction of personal computers to the use of radio and television. The potential to transform education was present in every breakthrough. However, the real potential of technology resides in its capacity to enhance and supplement current teaching approaches rather than essentially replacing them <xref ref-type="bibr" rid="BIBR-3">[3]</xref>. For cloud-based infrastructures to perform reliably and efficiently, cloud monitoring is essential. The many components of cloud services, including resource use, network latency, and security incidents, require methodical data collection, evaluation, and visualization. From a third-party perspective, cloud monitoring solutions are essential for businesses that depend on key information on the efficacy and condition of cloud-based services and apps <xref ref-type="bibr" rid="BIBR-4">[4]</xref>. The IoT relies heavily on cloud and edge infrastructures to deliver particular services and practical applications across many application domains. IoT makes all physical items sentient so they can connect, interact, and make intelligent decisions from their perspective. It also automates all areas of life that are considered to be in the public domain <xref ref-type="bibr" rid="BIBR-5">[5]</xref>. The IoT, edge computing, and smart cities are some of the recent innovations made possible by cloud computing, one of the biggest changes in contemporary Information and Communication Technology (ICT) services. Cloud computing models transform computing from a product that can be purchased to a service that can be delivered via the Internet <xref ref-type="bibr" rid="BIBR-6">[6]</xref>.</p><sec><title>1.1. Research Objective</title><p>The research aims to optimize large-scale data analytics in cloud computing by incorporating DL techniques for proficient workload distribution. The implemented model minimizes execution time and resource utilization, improving scalability and performance in high-volume cloud applications.</p></sec></sec><sec><title>2. LITERATURE REVIEW</title><p>A Hybrid Harris Hawks Optimization (HHHO) with K-means and MapReduce was proposed for large-scale data clustering. K-means initialized solutions, while HHO refined them for better optimization. MapReduce ensured parallelization, fault tolerance, and load balancing. The method, implemented in Python, outperformed existing clustering techniques. Numerical evaluations confirm its efficiency in accuracy and error reduction. Future research included DL integration and real-time processing <xref ref-type="bibr" rid="BIBR-7">[7]</xref>. The objective was to optimize big data processing pipelines in cloud environments by reducing latency, cost, and resource consumption. The research explored AI-driven adaptability, parallelism, and self-scheduling to enhance throughput and operational efficiency. The proposed strategies reduce processing delays, improve scalability, and optimize resource utilization. Comparative evaluation and year-wise performance evaluations confirm their effectiveness in real-world cloud environments. Further research should focus on enhancing resilience, scalability, and real-time adaptability in cloud-based data processing <xref ref-type="bibr" rid="BIBR-8">[8]</xref>. The role of cloud computing in covering its evolution, service models, deployment strategies, and key platforms was explored. It systematically examined cloud service and deployment models. It helped stakeholders make informed decisions and effectively leverage cloud computing for optimized data processing.</p><p>Future research should focus on advancing multi-cloud strategies and optimizing cloud platforms for scalable, real-time data analytics <xref ref-type="bibr" rid="BIBR-9">[9]</xref>. IoT applications generate vast sensor data, requiring high-speed computation beyond device capabilities. Computation offloading to nearby devices, fog, or cloud helped meet performance needs like time sensitivity and energy efficiency. The research explored context-aware offloading for optimizing IoT services. Various frameworks were evaluated and compared. The research highlighted their strengths and limitations in gathering computation demands. Future directions focus on enhancing offloading strategies for efficient IoT performance <xref rid="BIBR-10" ref-type="bibr">[10]</xref>. Protein interactions were crucial for understanding protein functions but posed challenges in large-scale analysis. The approach re-employed the Co-Fex algorithm using MapReduce for efficient prediction. A tree-based data structure reduced memory consumption, and distributed processing enhanced scalability. Experiments show a two-order magnitude improvement in efficiency while maintaining accuracy. The framework proved effective for large-scale analysis <xref ref-type="bibr" rid="BIBR-11">[11]</xref>. Cloud deployment architectures were a preferred model for large data operations. However, data was rarely controlled by users, and security issues surfaced.</p><p>The research presented a security-by-design framework for secure large data deployment in cloud environments. It integrated systematic security analysis and automated security assessment to enhance protection. The framework was validated through an Apache Hadoop use case, demonstrating improved security awareness and reduced design time. Open challenges in Big Cloud security and optimization can be addressed in further research <xref ref-type="bibr" rid="BIBR-12">[12]</xref>. While cloud computing supports the reproducibility of computational experiments, challenges related to automation and interoperability across different cloud platforms were encountered. The research leveraged serverless computing, containerization, and an adapter design pattern to address these issues. An open-source toolkit enabled automated execution, data storage, and seamless reproduction across cloud environments. Experiments on Amazon Web Service (AWS) and Azure confirm its efficiency, scalability, and reproducibility. Results show improved execution performance for Big Data analytics. The adaptability and optimized performance can be enhanced in further research <xref ref-type="bibr" rid="BIBR-13">[13]</xref>.</p><sec><title>2.1. Research Gap</title><p>The exponential growth of big data, cloud computing, and IoT demands competent, scalable, and protected processing frameworks. Traditional clustering and workload distribution methods resist optimization and real-time compliance. Security vulnerabilities in cloud-based data environments delay widespread implementation. Cross-cloud reproducibility remains a challenge, resisting seamless interoperability. The research improves scalability, effectiveness, and security through AI-driven optimization and security-by-design frameworks for real-time data analytics. The implemented approach overcomes the limitations of the research and provides better performance than traditional methods.</p></sec><sec><title>2.2. Key Contributions</title><list list-type="bullet"><list-item><p>The research proposed the ASB-Dynamic-CapsNet Framework: Introduced a DL-driven approach to optimize workload distribution in cloud computing.</p></list-item><list-item><p>Enhanced Computational Efficiency: Improved CPU and memory utilization while ensuring higher model training accuracy compared to traditional scheduling methods.</p></list-item><list-item><p>Improved Scalability and Performance: Reduced execution delays and optimized resource allocation for efficient processing of large-scale cloud workloads.</p></list-item></list></sec></sec><sec><title>3. METHODOLOGY</title><p>The research integrates ASB-Dynamic-CapsNet to optimize workload distributions in cloud computing. Large-scale data is collected from an open source and preprocessed using Z-score normalization to ensure quality. The proposed model efficiently allocates resources, reducing execution time and system bottlenecks. Performance is evaluated using CPU utilization, RAM utilization, and training accuracy over various epochs. Figure <xref ref-type="fig" rid="figure-1">1</xref> represents the entire flow of the proposed approach.</p><list list-type="bullet"><list-item><p>Data collection: The dataset from Kaggle replicates real-world cloud environments, enabling workload scheduling analysis and optimization.</p></list-item><list-item><p>Data Preprocessing: Z-score standardization enhances data reliability and computational efficiency, while handling missing values improves data quality and ensures consistent performance.</p></list-item><list-item><p>ASB-Dynamic-CapsNet: A hybrid model comprising ASB for optimization and CapsNet for spatial feature learning in workload scheduling. ASB ensures well-organized resource allocation, while CapsNet increases feature extraction and decision-making in cloud-based data analytics.</p></list-item></list><fig id="figure-1" ignoredToc=""><label>Figure 1</label><caption><p>Flow of the proposed method</p></caption><graphic mime-subtype="png" mimetype="image" xlink:href="https://ijdiic.com/research/article/download/273/version/273/217/2100/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-2-50-g1.png"><alt-text>Image</alt-text></graphic></fig><sec><title>3.1. Data Collection</title><p>The cloud workload dataset for scheduling analysis was collected from the open-source Kaggle website: <ext-link ext-link-type="uri" xlink:href="https://www.kaggle.com/datasets/zoya77/cloud-workload-dataset-for-scheduling-analysis" xlink:title="https://www.kaggle.com/datasets/zoya77/cloud-workload-dataset-for-scheduling-analysis">https://www.kaggle.com/datasets/zoya77/cloud-workload-dataset-for-scheduling-analysis</ext-link>. The dataset is intended for use in DL-based computational techniques for workload scheduling optimization and large-scale cloud workload analytics. By recording job execution data, resource use, and scheduling tactics, it replicates real-world cloud settings. In cloud computing frameworks, the dataset might be used to assess scheduling efficiency, optimize task allocation, and reduce execution delays.</p></sec><sec><title>3.2. Data preprocessing</title><p>The procedure of cleaning, transforming, and organizing raw data to improve its value and usability is data preprocessing. In cloud computing, intelligent preprocessing techniques handle missing values and apply Z-score standardization to ensure reliability. The steps improve workload distribution and avoid resource allocation. Feature selection and dimensionality reduction promote optimized computational effectiveness. By incorporating the techniques, the implemented model guarantees increased system performance and resource utilization.</p></sec><sec><title>3.3. Z-Score Standardization</title><p>The extensively utilized data standardization technique was Z-score standardization <xref ref-type="bibr" rid="BIBR-14">[14]</xref>. In the context of the research, Z-score standardization is applied to preprocess large-scale datasets collected from cloud platforms, IoT devices, and enterprise databases. Standardizing features before feeding into the proposed model ensures consistent data scaling, preventing dominant features from skewing workload distribution. This contributes to optimizing computational resources, reducing CPU and memory consumption, and enhancing overall system throughput in high-volume cloud computing environments. Equation (1) presents the z-score standardization for a feature  x′.</p><p><inline-formula><tex-math id="math-1"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x^{'} = \frac{x - mean\left( x \right)}{std(x)} \end{document} ]]></tex-math></inline-formula> (1)</p><p>The original value is denoted by x, the normalized value by x′, the mean value of the feature x by mean(x), and the standard deviation of x by std(x). Compared to other standardization techniques, Z-score standardization has the notable benefit of being resilient against outliers. Extreme values that deviate greatly from the majority of data points are known as outliers, and the values have the potential to skew statistical characteristics and impact how workload is distributed in cloud computing. Applying Z-score normalization ensures balanced scaling, preventing such distortions and enhancing the efficiency of the proposed technique.</p></sec><sec><title>3.4. Handling Missing Values</title><p>Ensuring data completeness is vital for accuracy and reliability in large-scale data analytics. Missing data, caused by factors like manual errors, sensor failures, or inconsistent collection from cloud and IoT sources, can reduce computational efficiency. The proposed model addresses the limits through robust preprocessing, categorizing missing data into three types to enhance DL-driven scheduling in a cloud environment.</p><list list-type="bullet"><list-item><p>Missing Completely at Random (MCAR): The absence of data occurs independently of other variables, meaning the probability of missingness is uniform across the dataset. While MCAR data does not introduce systematic bias, its unpredictability can impact model training in large-scale analytics.</p></list-item><list-item><p>Missing At Random (MAR): Missing values in a variable depend on observed data from other variables but are not influenced by the missing values themselves. The characteristic permits imputation techniques to approximate and improve lost data based on the relationships between observed features in the dataset.</p></list-item><list-item><p>Not Missing at Random (NMAR): Missing values are scientifically related to unobserved variables, making the values challenging to estimate using available data. NMAR scenarios need advanced techniques, such as DL-based imputation or adaptive models, to reduce data loss effects.</p></list-item></list><p>By incorporating strong preprocessing techniques in the implemented technique, the framework ensures high-quality data input, thus enhancing the evaluated metrics. The capability to handle missing values efficiently improves model performance, supporting scalable and adaptive workload scheduling in cloud computing environments.</p></sec><sec><title>3.5. Adaptive Satin Bowerbird Optimizer-driven Dynamic Capsule Network (ASB-Dynamic-CapsNet)</title><p>The proposed ASB-Dynamic-CapsNet integrates the ASB with a Dynamic CapsNet to improve workload distribution in cloud computing. The ASB efficiently searches for optimal scheduling solutions, reducing resource consumption, while the Dynamic CapsNet conserves spatial relationships in compound data patterns for precise task execution. The hybrid approach guarantees adaptive learning, dynamically adjusting to workload deviations. By leveraging the included strengths of DL, the framework achieves better scalability, efficiency, and task prioritization in cloud-based data analytics.</p></sec><sec><title>3.6. Capsule Network: Evaluation and Optimization</title><p>CapsNet was intended to encode spatial hierarchies by utilizing vector-based neurons called capsules. The concept started with Transforming Auto Encoders (TAEs), which need external transformation matrices. Later, Dynamic Routing CapsNet was introduced for internal pose estimation, followed by matrix capsules that improved accuracy while reducing computational complexity. CapsNet <xref ref-type="bibr" rid="BIBR-15">[15]</xref> optimization focuses on enhancing efficiency and scalability. Dynamic routing mechanisms develop how capsules interrelate, while metaheuristic algorithms enhance routing decisions and workload circulation. The optimizations help in running large-scale data analytics while reducing execution time and resource consumption. Figure <xref ref-type="fig" rid="figure-2">2</xref> shows the general architecture of CapsNet.</p><fig ignoredToc="" id="figure-2"><label>Figure 2</label><caption><p>Capsule Network Architecture</p></caption><graphic mime-subtype="png" mimetype="image" xlink:href="https://ijdiic.com/research/article/download/273/version/273/217/2101/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-2-50-g2.png"><alt-text>Image</alt-text></graphic></fig></sec><sec><title>3.7. Dynamic Capsule Network (CapsNet)</title><p>CapsNet with dynamic routing provides a viable option to perform large-scale data analytics while preserving spatial relations in data. Unlike traditional approaches, CapsNet uses vector-based representations to encode information hierarchically for better feature extraction and classification accuracy. The activation function applied to capsules is a non-linear squashing function, ensuring that the output vector maintains an interpretable magnitude normalized in the range of [0, 1], as represented in equation (2).</p><p><inline-formula><tex-math id="math-2"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u_{i} = \ \frac{{|\left| T_{i} \right||}^{2}}{1 + {|\left| T_{i} \right||}^{2}}\text{\ .\ }\frac{T_{i}}{|\left| T_{i} \right||} \end{document} ]]></tex-math></inline-formula> (2)</p><p>Where T<sub>i </sub> represents the total input to capsule i; it guarantees that greater vector magnitudes relate to an increased probability that specific features in the data were present, which enhances the prediction accuracy made by computation models in the cloud. The dynamic routing mechanism connects the lower-layer capsules with those at higher layers and adjusts weights utilizing an iteratively derived consensus process, as stated in equation (3).</p><p><inline-formula><tex-math id="math-3"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle T_{i} = \sum_{j}^{}{d_{\text{ji}}\text{\ .\ }{\widehat{v}}_{\text{ij}}}\ ,\ {\widehat{v}}_{\text{ij}} = \ X_{\text{ji}}.v_{j} \end{document} ]]></tex-math></inline-formula> (3)</p><p>Where d<sub>ji</sub> presents coupling coefficients, and X<sub>ji </sub>is a transformation matrix that ensures optimal feature alignment. The adaptability of any cloud-based analytics system is hence greatly enhanced by this mechanism, especially in those considered real-time data-processing and hierarchical feature-learning setups. Dynamic routing mechanisms based on CapsNet provide an influx of feature retention, minimal redundancy in computation, and realistic prediction accuracy development to the large-scale data analytics workflows running on cloud computing frameworks. It lends itself to computationally intensive optimization schemes in a cloud paradigm to enable feasible data-driven decision-making across distributed systems.</p></sec><sec><title>3.8. Adaptive Satin Bowerbird Optimizer (ASB)</title><p>The ASB optimizer is an evolutionary computation technique inspired by the nesting activities of satin bowerbirds. In the context of cloud-based large-scale data analytics, ASB is engaged in task scheduling and resource optimization. The effectiveness of a cloud computing system relies on effective workload distribution. The attractiveness of each solution is assessed using a fitness function, which quantifies its efficacy in optimizing cloud performance. The probability of selecting a solution was represented in equation (4).</p><p><inline-formula><tex-math id="math-4"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle probi = \frac{\text{fiti}}{\sum_{j = 1}^{\text{NP}}\text{fiti}} \end{document} ]]></tex-math></inline-formula> (4)</p><p>Where fiti  represents the efficiency scores of the j th scheduling strategy, and the total number of persons was denoted by NP. The fitness function is computed using equation (5).</p><p>fiti={(1/(1+f(w<sub>j</sub>))  if  f(w_j) ≥0, 1+|f(w<sub>j</sub>)|  if  f(w<sub>j</sub>) &lt; 0) (5)</p><p>Where f(w<sub>j</sub>) represents the execution time and resource utilization associated with the</p><p><tex-math>jth scheduling strategy. Integrating ASB with CapsNet enhances the load-balancing and task-execution efficiency of the framework. ASB employs dynamic resource allocation for scheduling, while CapsNet maintains spatial data relationships for better feature learning. The fusion of metaheuristic optimization and DL yields a scalable, efficient cloud computing model, which outperforms traditional scheduling methods and provides superior advantages to large-scale data analytics.</tex-math></p></sec></sec><sec><title>4. PERFORMANCE EVALUATION</title><p>Evaluating the performance of cloud-based computational models is essential to ensure efficiency, scalability, and resource optimization. The proposed approach adopted several performance parameters. The experimental setup used primarily Python-based DL frameworks for its model training and optimization. The metrics compared were training accuracies, CPU utilization, and RAM retention against conventional methods like Reinforcement Learning (RL) <xref ref-type="bibr" rid="BIBR-16">[16]</xref>, Recurrent Neural Network – Long Short-Term Memory (RNN-LSTM) <xref ref-type="bibr" rid="BIBR-16">[16]</xref>, Deep Q-Network (DQN) <xref ref-type="bibr" rid="BIBR-16">[16]</xref>, and Deep Reinforcement Learning (DRL-LSTM) <xref ref-type="bibr" rid="BIBR-16">[16]</xref>. The performance evaluation results validate the model's capability to optimize cloud resources while simultaneously performing at a high standard and being scalable.</p><sec><title>4.1. Experimental setup</title><p>Python 3.8 on a Windows 11 system was used to implement the proposed method, which is operational with an Intel Core i7 processor. DL frameworks, such as TensorFlow and PyTorch, were used for training and optimization of the ASB-Dynamic-CapsNet model. Data preprocessing, which includes handling missing values, feature extraction, and transformation, was accomplished using NumPy and Pandas. Performance evaluation and visualization of the experimental results were done with Matplotlib and Seaborn.</p></sec><sec><title>4.2. Correlation Matrix</title><p>The correlation matrix is used to quantify the relationships between the metrics and provide insight into the mutual influence. The research eventually enables better decision-making for dynamic scheduling and resource allocation strategies to maximize system performance and efficiency. Figure <xref ref-type="fig" rid="figure-3">3</xref> represents the correlation matrix, where the strength and direction of relationships between different metrics such as CPU_Utilization (%), Memory Consumption (MB), Schedular_Type, and Job_Priority are visually represented using a heat map.</p><fig id="figure-3" ignoredToc=""><label>Figure 3</label><caption><p>Correlation matrix in cloud-based data analytics.</p></caption><graphic xlink:href="https://ijdiic.com/research/article/download/273/version/273/217/2102/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-2-50-g3.png" mime-subtype="png" mimetype="image"><alt-text>Image</alt-text></graphic></fig></sec><sec><title>4.3. CPU usage fluctuations</title><p>Efficient CPU utilization is an essential factor in optimizing workload execution and resource management in cloud environments. Monitoring CPU usage patterns over time provides insights into task execution efficiency and system performance. Figure <xref ref-type="fig" rid="figure-4">4</xref> presents a time-series analysis of CPU utilization, illustrating fluctuations in processing demand across various tasks.</p><fig id="figure-4" ignoredToc=""><label>Figure 4</label><caption><p>CPU Utilization over time in cloud environments.</p></caption><graphic mime-subtype="png" mimetype="image" xlink:href="https://ijdiic.com/research/article/download/273/version/273/217/2103/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-2-50-g4.png"><alt-text>Image</alt-text></graphic></fig></sec><sec><title>4.4. Evaluation Metrics</title><p>The performance of ASB-Dynamic-CapsNet was evaluated using key evaluation metrics. Training accuracy measures learning efficiency across epochs. CPU utilization evaluates workload distribution, ensuring optimal processing. RAM utilization analyzes memory efficiency for large-scale task management. These metrics collectively exhibit the model’s scalability and resource optimization in cloud computing.</p><sec><title>4.4.1. Training Accuracy</title><p>To assess the efficiency of the proposed model in optimizing workload distribution in cloud computing environments, the training accuracy was compared with existing methods over multiple epochs. Table <xref ref-type="table" rid="table-1">1</xref> presents the performance trends of ASB-Dynamic-CapsNet over traditional models, and Figure <xref ref-type="fig" rid="figure-5">5</xref> depicts the graphical illustration of the performance.</p><table-wrap id="table-1" ignoredToc=""><label>Table 1</label><caption><p>Training Accuracy comparison over various epochs.</p></caption><table frame="box" rules="all"><thead><tr><th colspan="1" valign="top" align="left"><bold>Epochs</bold></th><th colspan="1" valign="top" align="left"><bold>RL </bold><xref rid="BIBR-16" ref-type="bibr">[16]</xref></th><th align="left" colspan="1" valign="top"><bold>RNN-LSTM </bold><xref rid="BIBR-16" ref-type="bibr">[16]</xref></th><th valign="top" align="left" colspan="1"><bold>DQN </bold><xref ref-type="bibr" rid="BIBR-16">[16]</xref></th><th align="left" colspan="1" valign="top"><bold>DRL-LSTM </bold><xref ref-type="bibr" rid="BIBR-16">[16]</xref></th><th valign="top" align="left" colspan="1"><bold>ASB-Dynamic-CapsNet [Proposed]</bold></th></tr></thead><tbody><tr><td align="left" colspan="1" valign="top">10</td><td valign="top" align="left" colspan="1">92.0</td><td valign="top" align="left" colspan="1">96.0</td><td valign="top" align="left" colspan="1">96.0</td><td align="left" colspan="1" valign="top">96.0</td><td valign="top" align="left" colspan="1"><bold>97.3</bold></td></tr><tr><td valign="top" align="left" colspan="1">20</td><td colspan="1" valign="top" align="left">89.0</td><td valign="top" align="left" colspan="1">94.8</td><td align="left" colspan="1" valign="top">95.0</td><td valign="top" align="left" colspan="1">96.0</td><td align="left" colspan="1" valign="top"><bold>96.8</bold></td></tr><tr><td align="left" colspan="1" valign="top">30</td><td align="left" colspan="1" valign="top">88.0</td><td valign="top" align="left" colspan="1">94.0</td><td colspan="1" valign="top" align="left">94.5</td><td align="left" colspan="1" valign="top">96.0</td><td valign="top" align="left" colspan="1"><bold>96.9</bold></td></tr><tr><td colspan="1" valign="top" align="left">40</td><td valign="top" align="left" colspan="1">87.5</td><td valign="top" align="left" colspan="1">93.0</td><td align="left" colspan="1" valign="top">94.0</td><td align="left" colspan="1" valign="top">96.0</td><td colspan="1" valign="top" align="left"><bold>97.0</bold></td></tr><tr><td align="left" colspan="1" valign="top">50</td><td align="left" colspan="1" valign="top">87.0</td><td colspan="1" valign="top" align="left">92.0</td><td valign="top" align="left" colspan="1">93.5</td><td valign="top" align="left" colspan="1">96.0</td><td valign="top" align="left" colspan="1"><bold>96.7</bold></td></tr><tr><td align="left" colspan="1" valign="top">60</td><td align="left" colspan="1" valign="top">86.0</td><td valign="top" align="left" colspan="1">90.5</td><td align="left" colspan="1" valign="top">93.2</td><td valign="top" align="left" colspan="1">95.8</td><td valign="top" align="left" colspan="1"><bold>96.2</bold></td></tr><tr><td align="left" colspan="1" valign="top">70</td><td align="left" colspan="1" valign="top">85.2</td><td colspan="1" valign="top" align="left">89.5</td><td valign="top" align="left" colspan="1">92.8</td><td align="left" colspan="1" valign="top">95.7</td><td valign="top" align="left" colspan="1"><bold>96.5</bold></td></tr><tr><td valign="top" align="left" colspan="1">80</td><td valign="top" align="left" colspan="1">84.5</td><td align="left" colspan="1" valign="top">89.0</td><td valign="top" align="left" colspan="1">92.5</td><td colspan="1" valign="top" align="left">95.5</td><td valign="top" align="left" colspan="1"><bold>96.3</bold></td></tr><tr><td valign="top" align="left" colspan="1">90</td><td align="left" colspan="1" valign="top">83.0</td><td valign="top" align="left" colspan="1">88.5</td><td align="left" colspan="1" valign="top">92.2</td><td align="left" colspan="1" valign="top">95.3</td><td align="left" colspan="1" valign="top"><bold>96.0</bold></td></tr><tr><td valign="top" align="left" colspan="1">100</td><td valign="top" align="left" colspan="1">82.0</td><td valign="top" align="left" colspan="1">88.0</td><td valign="top" align="left" colspan="1">92.0</td><td align="left" colspan="1" valign="top">95.2</td><td colspan="1" valign="top" align="left"><bold>95.9</bold></td></tr></tbody></table></table-wrap><fig id="figure-5" ignoredToc=""><label>Figure 5</label><caption><p>Graphical representation of training accuracy.</p></caption><graphic mime-subtype="png" mimetype="image" xlink:href="https://ijdiic.com/research/article/download/273/version/273/217/2104/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-2-50-g5.png"><alt-text>Image</alt-text></graphic></fig><p>Figure <xref ref-type="fig" rid="figure-5">5</xref> illustrates the training accuracy over epochs for different models. The ASB-Dynamic-CapsNet consistently achieves greater accuracy, reaching around 95.9% at 100 epochs.</p></sec><sec><title>4.4.2. CPU Utilization Analysis</title><p>Efficient CPU utilization is a critical factor in optimizing workload distribution in cloud computing environments. To evaluate the performance of the proposed approach, its CPU utilization was compared to traditional models across various numbers of tasks. Table <xref ref-type="table" rid="table-2">2</xref> represents the comparison of CPU utilization, demonstrating the efficiency in handling increasing workloads.</p><table-wrap id="table-2" ignoredToc=""><label>Table 2</label><caption><p>Comparative Analysis of CPU utilization across different numbers of tasks.</p></caption><table frame="box" rules="all"><thead><tr><th valign="top" align="left" colspan="1"><bold>Number of Tasks (×10⁴)</bold></th><th align="left" colspan="1" valign="top"><bold>RL </bold><xref ref-type="bibr" rid="BIBR-16">[16]</xref></th><th valign="top" align="left" colspan="1"><bold>RNN-LSTM </bold><xref ref-type="bibr" rid="BIBR-16">[16]</xref></th><th align="left" colspan="1" valign="top"><bold>DQN </bold><xref rid="BIBR-16" ref-type="bibr">[16]</xref></th><th valign="top" align="left" colspan="1"><bold>DRL-LSTM </bold><xref ref-type="bibr" rid="BIBR-16">[16]</xref></th><th colspan="1" valign="top" align="left"><bold>ASB-Dynamic-CapsNet [Proposed]</bold></th></tr></thead><tbody><tr><td align="left" colspan="1" valign="top">1</td><td valign="top" align="left" colspan="1">11</td><td valign="top" align="left" colspan="1">10</td><td valign="top" align="left" colspan="1">11</td><td valign="top" align="left" colspan="1">10</td><td valign="top" align="left" colspan="1">12</td></tr><tr><td align="left" colspan="1" valign="top">2</td><td align="left" colspan="1" valign="top">19</td><td align="left" colspan="1" valign="top">18</td><td align="left" colspan="1" valign="top">19</td><td valign="top" align="left" colspan="1">17</td><td colspan="1" valign="top" align="left">21</td></tr><tr><td align="left" colspan="1" valign="top">3</td><td valign="top" align="left" colspan="1">26</td><td valign="top" align="left" colspan="1">24</td><td colspan="1" valign="top" align="left">25</td><td valign="top" align="left" colspan="1">24</td><td valign="top" align="left" colspan="1">27</td></tr><tr><td valign="top" align="left" colspan="1">4</td><td valign="top" align="left" colspan="1">33</td><td valign="top" align="left" colspan="1">31</td><td align="left" colspan="1" valign="top">32</td><td align="left" colspan="1" valign="top">31</td><td valign="top" align="left" colspan="1">33</td></tr><tr><td valign="top" align="left" colspan="1">5</td><td valign="top" align="left" colspan="1">40</td><td valign="top" align="left" colspan="1">38</td><td valign="top" align="left" colspan="1">39</td><td valign="top" align="left" colspan="1">37</td><td align="left" colspan="1" valign="top">39</td></tr><tr><td align="left" colspan="1" valign="top">6</td><td align="left" colspan="1" valign="top">47</td><td align="left" colspan="1" valign="top">45</td><td valign="top" align="left" colspan="1">46</td><td valign="top" align="left" colspan="1">44</td><td valign="top" align="left" colspan="1">48</td></tr><tr><td align="left" colspan="1" valign="top">7</td><td valign="top" align="left" colspan="1">55</td><td align="left" colspan="1" valign="top">53</td><td align="left" colspan="1" valign="top">54</td><td valign="top" align="left" colspan="1">52</td><td align="left" colspan="1" valign="top">55</td></tr><tr><td valign="top" align="left" colspan="1">8</td><td colspan="1" valign="top" align="left">62</td><td colspan="1" valign="top" align="left">60</td><td align="left" colspan="1" valign="top">61</td><td align="left" colspan="1" valign="top">58</td><td valign="top" align="left" colspan="1">63</td></tr><tr><td align="left" colspan="1" valign="top">9</td><td colspan="1" valign="top" align="left">72</td><td align="left" colspan="1" valign="top">69</td><td valign="top" align="left" colspan="1">70</td><td colspan="1" valign="top" align="left">67</td><td colspan="1" valign="top" align="left">72</td></tr><tr><td valign="top" align="left" colspan="1">10</td><td valign="top" align="left" colspan="1">87</td><td valign="top" align="left" colspan="1">83</td><td align="left" colspan="1" valign="top">84</td><td align="left" colspan="1" valign="top">81</td><td align="left" colspan="1" valign="top">86</td></tr></tbody></table></table-wrap><fig id="figure-6" ignoredToc=""><label>Figure 6</label><caption><p>Graphical illustration of CPU utilization</p></caption><graphic xlink:href="https://ijdiic.com/research/article/download/273/version/273/217/2105/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-2-50-g6.png" mime-subtype="png" mimetype="image"><alt-text>Image</alt-text></graphic></fig><p>Figure <xref ref-type="fig" rid="figure-6">6</xref> compares CPU utilization across various scheduling models as the number of tasks increases. The proposed model demonstrates enhanced efficiency in workload distribution compared to traditional models. As the workload scales up, CPU utilization rises diagonally in all models, with the present approach achieving the most efficient utilization (86%) compared to DRL-LSTM and DQN. RL and RNN-LSTM demonstrate lower CPU efficiency, respectively.</p></sec><sec><title>4.4.3. RAM utilization</title><p>Memory efficiency plays an essential role in optimizing workload distribution in cloud computing environments. To evaluate the performance of ASB-Dynamic CapsNet, its RAM usage was compared against existing models across different task volumes. Table <xref ref-type="table" rid="table-3">3</xref> presents the RAM usage trends, highlighting the efficiency of the proposed model in managing memory resources.</p><table-wrap id="table-3" ignoredToc=""><label>Table 3</label><caption><p>RAM Usage Comparison: ASB-Dynamic-CapsNet vs. Existing Methods</p></caption><table frame="box" rules="all"><thead><tr><th valign="top" align="left" colspan="1"><bold>Number of Tasks (×10⁴)</bold></th><th valign="top" align="left" colspan="1"><bold>RL </bold><xref rid="BIBR-16" ref-type="bibr">[16]</xref></th><th align="left" colspan="1" valign="top"><bold>RNN-LSTM </bold><xref ref-type="bibr" rid="BIBR-16">[16]</xref></th><th valign="top" align="left" colspan="1"><bold>DQN </bold><xref ref-type="bibr" rid="BIBR-16">[16]</xref></th><th valign="top" align="left" colspan="1"><bold>DRL-LSTM </bold><xref ref-type="bibr" rid="BIBR-16">[16]</xref></th><th colspan="1" valign="top" align="left"><bold>ASB-Dynamic-CapsNet [Proposed]</bold></th></tr></thead><tbody><tr><td align="left" colspan="1" valign="top">1</td><td valign="top" align="left" colspan="1">10</td><td valign="top" align="left" colspan="1">9</td><td valign="top" align="left" colspan="1">10</td><td align="left" colspan="1" valign="top">9</td><td valign="top" align="left" colspan="1">11</td></tr><tr><td valign="top" align="left" colspan="1">2</td><td align="left" colspan="1" valign="top">17</td><td align="left" colspan="1" valign="top">16</td><td valign="top" align="left" colspan="1">17</td><td valign="top" align="left" colspan="1">15</td><td valign="top" align="left" colspan="1">16</td></tr><tr><td valign="top" align="left" colspan="1">3</td><td valign="top" align="left" colspan="1">24</td><td valign="top" align="left" colspan="1">23</td><td align="left" colspan="1" valign="top">25</td><td align="left" colspan="1" valign="top">22</td><td valign="top" align="left" colspan="1">26</td></tr><tr><td valign="top" align="left" colspan="1">4</td><td align="left" colspan="1" valign="top">30</td><td align="left" colspan="1" valign="top">29</td><td valign="top" align="left" colspan="1">31</td><td valign="top" align="left" colspan="1">28</td><td valign="top" align="left" colspan="1">32</td></tr><tr><td align="left" colspan="1" valign="top">5</td><td valign="top" align="left" colspan="1">38</td><td colspan="1" valign="top" align="left">37</td><td valign="top" align="left" colspan="1">39</td><td colspan="1" valign="top" align="left">35</td><td valign="top" align="left" colspan="1">39</td></tr><tr><td valign="top" align="left" colspan="1">6</td><td valign="top" align="left" colspan="1">45</td><td valign="top" align="left" colspan="1">44</td><td align="left" colspan="1" valign="top">46</td><td align="left" colspan="1" valign="top">42</td><td align="left" colspan="1" valign="top">47</td></tr><tr><td valign="top" align="left" colspan="1">7</td><td valign="top" align="left" colspan="1">53</td><td valign="top" align="left" colspan="1">50</td><td align="left" colspan="1" valign="top">54</td><td align="left" colspan="1" valign="top">48</td><td align="left" colspan="1" valign="top">55</td></tr><tr><td valign="top" align="left" colspan="1">8</td><td valign="top" align="left" colspan="1">60</td><td align="left" colspan="1" valign="top">56</td><td valign="top" align="left" colspan="1">61</td><td align="left" colspan="1" valign="top">54</td><td align="left" colspan="1" valign="top">62</td></tr><tr><td align="left" colspan="1" valign="top">9</td><td valign="top" align="left" colspan="1">68</td><td valign="top" align="left" colspan="1">63</td><td align="left" colspan="1" valign="top">66</td><td align="left" colspan="1" valign="top">59</td><td colspan="1" valign="top" align="left">64</td></tr><tr><td align="left" colspan="1" valign="top">10</td><td colspan="1" valign="top" align="left">72</td><td valign="top" align="left" colspan="1">67</td><td align="left" colspan="1" valign="top">70</td><td colspan="1" valign="top" align="left">63</td><td align="left" colspan="1" valign="top">68</td></tr></tbody></table></table-wrap><fig id="figure-7" ignoredToc=""><label>Figure 7</label><caption><p>Graphical illustration of RAM utilization.</p></caption><graphic xlink:href="https://ijdiic.com/research/article/download/273/version/273/217/2106/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-2-50-g7.png" mime-subtype="png" mimetype="image"><alt-text>Image</alt-text></graphic></fig><p>Figure <xref ref-type="fig" rid="figure-7">7</xref> illustrates the utilization of RAM for various numbers of tasks. The proposed ASB-Dynamic-CapsNet attains the most proficient RAM usage (68%), outperforming DRL-LSTM RL, RNN-LSTM, and DQN in terms of elevated memory.</p></sec></sec><sec><title>4.5. Discussion</title><p>Optimizing large-scale data analytics in cloud computing requires efficient workload distribution and adaptive scheduling strategies. The implemented ASB-Dynamic-CapsNet model improves scheduling performance by combining DL with metaheuristic optimization, outperforming existing models <xref ref-type="bibr" rid="BIBR-16">[16]</xref>, such as RL, RNN-LSTM, DQN, and DRL-LSTM, in adaptability and resource efficiency. Unlike these approaches, which can struggle with dynamic workload variations and higher computational overhead, ASB-Dynamic-CapsNet ensures optimal resource utilization while maintaining task execution efficiency. The findings highlight its potential for improving cloud-based analytics and minimizing system bottlenecks. However, challenges such as computational complexity and scalability remain. Future research should focus on reducing processing overhead, integrating federated learning for decentralized cloud environments, and strengthening security to enhance real-time applicability in large-scale cloud computing.</p></sec></sec><sec><title>5. CONCLUSIONS</title><p>The research aims to develop an efficient workload distribution and scheduling strategy to optimize large-scale data analytics in cloud environments. By leveraging DL techniques, the proposed ASB-Dynamic-CapsNet model capably automates workload distribution, reducing execution time and resource utilization. Experimental results exhibit enhanced CPU utilization (86%), RAM consumption (68%), and training accuracy (95.9%), outperforming traditional scheduling methods. The findings highlight the efficiency of DL-driven scheduling in increasing scalability, optimizing resource management, and enhancing the overall performance of cloud-based data analytics. However, the framework has certain limitations, including increased computational complexity and potential scalability challenges in real-time environments. Additionally, workload variations might impact performance, involving further adaptive mechanisms. Future research can focus on optimizing the model for real-time analytics, reducing computational overhead, incorporating associated learning for decentralized cloud environments, and increasing security and privacy in workload scheduling.</p></sec></body><back><sec sec-type="data-availability"><title>Data Availability</title><p>The original data presented in the study are openly available in Kaggle at https://www.kaggle.com/datasets/zoya77/cloud-workload-dataset-for-scheduling-analysis</p></sec><bio><title>Biography</title><p><bold>Aditya Gupta</bold> is working as a Research associate in computer science and engineering at Lincoln University College, Malaysia, and as a Senior Software Developer in a reputed organization in Lucknow, UP, India. He can be contacted at email: gupta.aditya56@gmail.com</p><p><bold>Sai Kiran Oruganti </bold>is a professor specializing in wireless power transfer and IoT security, currently affiliated with Jiangxi University of Science and Technology in China and Lincoln University College in Malaysia. His career includes research at the Ulsan National Institute of Science and Technology, developing wireless systems for Hyundai and Samsung, a faculty position at the Indian Institute of Technology, and a recognized history of innovation, including pioneering work on Zenneck Wave WPT and over 16 granted patents. He can be contacted at email: saisharma@lincoln.edu.my</p></bio><ref-list><title>References</title><ref id="BIBR-1"><element-citation publication-type="article-journal"><article-title>Big Data Analytics Using Cloud Computing Based Frameworks for Power Management Systems: Status, Constraints, and Future Recommendations</article-title><source>Sensors</source><volume>23</volume><issue>6</issue><person-group person-group-type="author"><name><surname>AL-Jumaili</surname><given-names>A.H.A.</given-names></name><name><surname>Muniyandi</surname><given-names>R.C.</given-names></name><name><surname>Hasan</surname><given-names>M.K.</given-names></name><name><surname>Paw</surname><given-names>J.K.S.</given-names></name><name><surname>Singh</surname><given-names>M.J.</given-names></name></person-group><year>2023</year><page-range>2952,</page-range><pub-id pub-id-type="doi">10.3390/s23062952</pub-id></element-citation></ref><ref id="BIBR-2"><element-citation publication-type="article-journal"><article-title>The AI-Powered Evolution of Big Data</article-title><source>Appl Sci</source><volume>14</volume><issue>22</issue><person-group person-group-type="author"><name><surname>Kumar</surname><given-names>Y.</given-names></name><name><surname>Marchena</surname><given-names>J.</given-names></name><name><surname>Awlla</surname><given-names>A.H.</given-names></name><name><surname>Li</surname><given-names>J.J.</given-names></name><name><surname>Abdalla</surname><given-names>H.B.</given-names></name></person-group><year>2024</year><page-range>10176,</page-range><pub-id pub-id-type="doi">10.3390/app142210176</pub-id></element-citation></ref><ref id="BIBR-3"><element-citation publication-type="article-journal"><article-title>Optimization and Scalability of Educational Platforms: Integration of Artificial Intelligence and Cloud Computing</article-title><source>Computers</source><volume>12</volume><issue>11</issue><person-group person-group-type="author"><name><surname>Govea</surname><given-names>J.</given-names></name><name><surname>Edye</surname><given-names>E.Ocampo</given-names></name><name><surname>Revelo-Tapia</surname><given-names>S.</given-names></name><name><surname>Villegas-Ch</surname><given-names>W.</given-names></name></person-group><year>2023</year><page-range>223,</page-range><pub-id pub-id-type="doi">10.3390/computers12110223</pub-id></element-citation></ref><ref id="BIBR-4"><element-citation publication-type="article-journal"><article-title>Efficient Resource Utilization in IoT and Cloud Computing</article-title><source>Information</source><volume>14</volume><issue>11</issue><person-group person-group-type="author"><name><surname>Prasad</surname><given-names>V.K.</given-names></name><name><surname>Dansana</surname><given-names>D.</given-names></name><name><surname>Bhavsar</surname><given-names>M.D.</given-names></name><name><surname>Acharya</surname><given-names>B.</given-names></name><name><surname>Gerogiannis</surname><given-names>V.C.</given-names></name><name><surname>Kanavos</surname><given-names>A.</given-names></name></person-group><year>2023</year><page-range>619,</page-range><pub-id pub-id-type="doi">10.3390/info14110619</pub-id></element-citation></ref><ref id="BIBR-5"><element-citation publication-type="article-journal"><article-title>Implementation analysis of IoT-based offloading frameworks on cloud/edge computing for sensor generated big data</article-title><source>Complex Intell Syst</source><volume>8</volume><issue>5</issue><person-group person-group-type="author"><name><surname>Bajaj</surname><given-names>K.</given-names></name><name><surname>Sharma</surname><given-names>B.</given-names></name><name><surname>Singh</surname><given-names>R.</given-names></name></person-group><year>2022</year><page-range>3641-3658,</page-range><pub-id pub-id-type="doi">10.1007/s40747-021-00434-6</pub-id></element-citation></ref><ref id="BIBR-6"><element-citation publication-type="article-journal"><article-title>Virtual Machine Placement Optimization for Big Data Applications in Cloud Computing</article-title><source>IEEE Access</source><volume>10</volume><person-group person-group-type="author"><name><surname>Seyyedsalehi</surname><given-names>S.M.</given-names></name><name><surname>Khansari</surname><given-names>M.</given-names></name></person-group><year>2022</year><page-range>96112-96127,</page-range><pub-id pub-id-type="doi">10.1109/ACCESS.2022.3203057</pub-id></element-citation></ref><ref id="BIBR-7"><element-citation publication-type="journal"><article-title>Big Data Analysis Using Hybrid Meta-Heuristic Optimization Algorithm and MapReduce Framework</article-title><person-group person-group-type="author"><name><surname>Bashabsheh</surname><given-names>M.Q.</given-names></name><name><surname>Abualigah</surname><given-names>L.</given-names></name><name><surname>Alshinwan</surname><given-names>M.</given-names></name></person-group><year>2022</year><fpage>181</fpage><lpage>223</lpage><page-range>181-223</page-range><pub-id pub-id-type="doi">10.1007/978-3-030-99079-4_8</pub-id></element-citation></ref><ref id="BIBR-8"><element-citation publication-type="article-journal"><article-title>Optimizing data pipelines in advanced cloud computing: Innovative approaches to large-scale data processing, analytics, and real-time optimization</article-title><source>Int J Res Anal Rev</source><volume>10</volume><person-group person-group-type="author"><name><surname>Sresth</surname><given-names>S.T.V.</given-names></name><name><surname>Nagavalli</surname><given-names>S.P.</given-names></name></person-group><year>2023</year><fpage>478</fpage><lpage>496</lpage><page-range>478-496</page-range></element-citation></ref><ref id="BIBR-9"><element-citation publication-type="chapter"><article-title>Cloud Computing for Big Data Analytics</article-title><source>Big Data Analytics</source><person-group person-group-type="author"><name><surname>Demirbaga</surname><given-names>Ü.</given-names></name><name><surname>Aujla</surname><given-names>G.S.</given-names></name><name><surname>Jindal</surname><given-names>A.</given-names></name><name><surname>Kalyon</surname><given-names>O.</given-names></name></person-group><year>2024</year><fpage>43</fpage><lpage>77</lpage><page-range>43-77</page-range><publisher-name>Springer Nature Switzerland</publisher-name><publisher-loc>Cham</publisher-loc><pub-id pub-id-type="doi">10.1007/978-3-031-55639-5_4</pub-id></element-citation></ref><ref id="BIBR-10"><element-citation publication-type="article-journal"><article-title>A Distributed Framework for Large-scale Protein-protein Interaction Data Analysis and Prediction Using MapReduce</article-title><source>IEEE/CAA J Autom Sin</source><volume>9</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Hu</surname><given-names>L.</given-names></name><name><surname>Yang</surname><given-names>S.</given-names></name><name><surname>Luo</surname><given-names>X.</given-names></name><name><surname>Yuan</surname><given-names>H.</given-names></name><name><surname>Sedraoui</surname><given-names>K.</given-names></name><name><surname>Zhou</surname><given-names>M.</given-names></name></person-group><year>2022</year><page-range>160-172,</page-range><pub-id pub-id-type="doi">10.1109/JAS.2021.1004198</pub-id></element-citation></ref><ref id="BIBR-11"><element-citation publication-type="article-journal"><article-title>Energy efficient offloading strategy in fog-cloud environment for IoT applications</article-title><source>Internet of Things</source><volume>6</volume><person-group person-group-type="author"><name><surname>Adhikari</surname><given-names>M.</given-names></name><name><surname>Gianey</surname><given-names>H.</given-names></name></person-group><year>2019</year><page-range>100053,</page-range><pub-id pub-id-type="doi">10.1016/j.iot.2019.100053</pub-id></element-citation></ref><ref id="BIBR-12"><element-citation publication-type="article-journal"><article-title>Security by Design for Big Data Frameworks Over Cloud Computing</article-title><source>IEEE Trans Eng Manag</source><volume>69</volume><issue>6</issue><person-group person-group-type="author"><name><surname>Awaysheh</surname><given-names>F.M.</given-names></name><name><surname>Aladwan</surname><given-names>M.N.</given-names></name><name><surname>Alazab</surname><given-names>M.</given-names></name><name><surname>Alawadi</surname><given-names>S.</given-names></name><name><surname>Cabaleiro</surname><given-names>J.C.</given-names></name><name><surname>Pena</surname><given-names>T.F.</given-names></name></person-group><year>2022</year><page-range>3676-3693,</page-range><pub-id pub-id-type="doi">10.1109/TEM.2020.3045661</pub-id></element-citation></ref><ref id="BIBR-13"><element-citation publication-type="article-journal"><article-title>Reproducible and Portable Big Data Analytics in the Cloud</article-title><source>IEEE Trans Cloud Comput</source><volume>11</volume><issue>3</issue><person-group person-group-type="author"><name><surname>Wang</surname><given-names>X.</given-names></name><etal/></person-group><year>2023</year><page-range>2966-2982,</page-range><pub-id pub-id-type="doi">10.1109/TCC.2023.3245081</pub-id></element-citation></ref><ref id="BIBR-14"><element-citation publication-type="article-journal"><article-title>Hybrid dung beetle optimization based dimensionality reduction with deep learning based cybersecurity solution on IoT environment</article-title><source>Alexandria Eng J</source><volume>111</volume><person-group person-group-type="author"><name><surname>Alkhalifa</surname><given-names>A.K.</given-names></name><etal/></person-group><year>2025</year><page-range>148-159,</page-range><pub-id pub-id-type="doi">10.1016/j.aej.2024.10.053</pub-id></element-citation></ref><ref id="BIBR-15"><element-citation publication-type="article-journal"><article-title>Shifting Capsule Networks from the Cloud to the Deep Edge</article-title><source>ACM Trans Intell Syst Technol</source><volume>13</volume><issue>6</issue><person-group person-group-type="author"><name><surname>Costa</surname><given-names>M.</given-names></name><name><surname>Costa</surname><given-names>D.</given-names></name><name><surname>Gomes</surname><given-names>T.</given-names></name><name><surname>Pinto</surname><given-names>S.</given-names></name></person-group><year>2022</year><page-range>1-25,</page-range><pub-id pub-id-type="doi">10.1145/3544562</pub-id></element-citation></ref><ref id="BIBR-16"><element-citation publication-type="article-journal"><article-title>Deep and reinforcement learning for automated task scheduling in large‐scale cloud computing systems</article-title><source>Concurr Comput Pract Exp</source><volume>33</volume><issue>23</issue><person-group person-group-type="author"><name><surname>Rjoub</surname><given-names>G.</given-names></name><name><surname>Bentahar</surname><given-names>J.</given-names></name><name><surname>Wahab</surname><given-names>O.Abdel</given-names></name><name><surname>Bataineh</surname><given-names>A.Saleh</given-names></name></person-group><year>2021</year><pub-id pub-id-type="doi">10.1002/cpe.5919</pub-id></element-citation></ref></ref-list></back></article>