Waheed Iqbal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Waheed Iqbal has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Muhammad Abdullah
Faculty of Computing and Information Technology, University of the Punjab, Lahore, Pakistan
12 shared publications - Faisal Bukhari
Department of Data Science, University of the Punjab, Lahore, Pakistan
9 shared publications - Abdelkarim Erradi
Department of Computer Science and Engineering, College of Engineering, Qatar University, Doha, Qatar
7 shared publications - Arif Mahmood
Information Technology University
4 shared publications - David Carrera
Barcelona Supercomputing Center (BSC)
3 shared publications Faisal Bukhari
Punjab University College of Information Technology (PUCIT), University of the Punjab, Lahore, Pakistan
3 shared publications
Latest Publications
- 7 August 2025
- Published by Springer Nature in Computing
- Vol. 107 (9) , 1-26
Cost and performance-effective dynamic VM type selection in auto-scaling using reinforcement learning
- 7 August 2025
- Published by Springer Nature in Computing
- Vol. 107 (9) , 1-26
Cost and performance-effective dynamic VM type selection in auto-scaling using reinforcement learning
- 4 April 2025
- Published by Springer Nature
- p. 116-129
Automated Skin Cancer Segmentation and Classification Based on Deep Learning
- 4 April 2025
- Published by Springer Nature
- p. 116-129
Automated Skin Cancer Segmentation and Classification Based on Deep Learning
- 6 March 2025
- Published by Springer Nature in Computing
- Vol. 107 (3) , 1-30
DIMA: machine learning based dynamic infrastructure management for containerized applications
- 6 March 2025
- Published by Springer Nature in Computing
- Vol. 107 (3) , 1-30
DIMA: machine learning based dynamic infrastructure management for containerized applications
- 18 January 2024
- Published by Springer Nature in Cluster Computing
- Vol. 27 (4) , 5195-5215
Cdascaler: a cost-effective dynamic autoscaling approach for containerized microservices
- 18 January 2024
- Published by Springer Nature in Cluster Computing
- Vol. 27 (4) , 5195-5215
Cdascaler: a cost-effective dynamic autoscaling approach for containerized microservices
- 20 September 2022
- Published by Springer Nature in Cluster Computing
- Vol. 26 (6) , 3503-3521
Efficient job placement using two-way offloading technique over fog-cloud architectures
- 20 September 2022
- Published by Springer Nature in Cluster Computing
- Vol. 26 (6) , 3503-3521
Efficient job placement using two-way offloading technique over fog-cloud architectures
- 16 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (2) , 2378-2389
Automatic Migration-Enabled Dynamic Resource Management for Containerized Workload
Containerized workloads are gaining traction due to microservices architecture adaptation in many fields, including healthcare, finance, Internet of Things, and smart cities. Modern data centers are containerized to facilitate this growing demand. Most of the existing resource allocation methods for data centers used efficient scheduling algorithms to place the containers using static computing resources. These static resource allocation techniques are not energy efficient and do not help maximize data center utilization. Dynamic resource allocation and a migration-enabled placement method can reduce energy utilization while improving the utilization of the available computing infrastructure. This article presents and evaluates a novel dynamic resource management system that uses active migrations to minimize energy utilization to serve containerized workloads and improve data center utilization. Our approach uses a deep learning method to estimate the job execution time and then employs an unsupervised learning method to identify similar jobs. Similar jobs are placed and migrated to achieve energy efficiency and better utilization of the available data center infrastructure. Our proposed system is evaluated and compared with the existing state-of-the-art baseline methods. The proposed solution reduces the energy consumption from $\times 1.18$ to $\times 2.35$ compared to the baseline methods while maintaining similar performance.
- 16 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (2) , 2378-2389
Automatic Migration-Enabled Dynamic Resource Management for Containerized Workload
Containerized workloads are gaining traction due to microservices architecture adaptation in many fields, including healthcare, finance, Internet of Things, and smart cities. Modern data centers are containerized to facilitate this growing demand. Most of the existing resource allocation methods for data centers used efficient scheduling algorithms to place the containers using static computing resources. These static resource allocation techniques are not energy efficient and do not help maximize data center utilization. Dynamic resource allocation and a migration-enabled placement method can reduce energy utilization while improving the utilization of the available computing infrastructure. This article presents and evaluates a novel dynamic resource management system that uses active migrations to minimize energy utilization to serve containerized workloads and improve data center utilization. Our approach uses a deep learning method to estimate the job execution time and then employs an unsupervised learning method to identify similar jobs. Similar jobs are placed and migrated to achieve energy efficiency and better utilization of the available data center infrastructure. Our proposed system is evaluated and compared with the existing state-of-the-art baseline methods. The proposed solution reduces the energy consumption from $\times 1.18$ to $\times 2.35$ compared to the baseline methods while maintaining similar performance.
- 21 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (16) , 15018-15029
Automatic Distributed Deep Learning Using Resource-Constrained Edge Devices
Processing data generated at high volume and speed from the Internet of Things, smart cities, domotic, intelligent surveillance, and e-healthcare systems require efficient data processing and analytics services at the Edge to reduce the latency and response time of the applications. The fog computing edge infrastructure consists of devices with limited computing, memory, and bandwidth resources, which challenge the construction of predictive analytics solutions that require resource-intensive tasks for training machine learning models. In this work, we focus on the development of predictive analytics for urban traffic. Our solution is based on deep learning techniques localized in the Edge, where computing devices have very limited computational resources. We present an innovative method for efficiently training the gated recurrent-units (GRUs) across available resource-constrained CPU and GPU Edge devices. Our solution employs distributed GRU model learning and dynamically stops the training process to utilize the low-power and resource-constrained Edge devices while ensuring good estimation accuracy effectively. The proposed solution was extensively evaluated using low-powered ARM-based devices, including Raspberry Pi v3 and the low-powered GPU-enabled device NVIDIA Jetson Nano, and also compared them with Single-CPU Intel Xeon machines. For the evaluation experiments, we used real-world Floating Car Data. The experiments show that the proposed solution delivers excellent prediction accuracy and computational performance on the Edge when compared to the baseline methods.
- 21 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (16) , 15018-15029
Automatic Distributed Deep Learning Using Resource-Constrained Edge Devices
Processing data generated at high volume and speed from the Internet of Things, smart cities, domotic, intelligent surveillance, and e-healthcare systems require efficient data processing and analytics services at the Edge to reduce the latency and response time of the applications. The fog computing edge infrastructure consists of devices with limited computing, memory, and bandwidth resources, which challenge the construction of predictive analytics solutions that require resource-intensive tasks for training machine learning models. In this work, we focus on the development of predictive analytics for urban traffic. Our solution is based on deep learning techniques localized in the Edge, where computing devices have very limited computational resources. We present an innovative method for efficiently training the gated recurrent-units (GRUs) across available resource-constrained CPU and GPU Edge devices. Our solution employs distributed GRU model learning and dynamically stops the training process to utilize the low-power and resource-constrained Edge devices while ensuring good estimation accuracy effectively. The proposed solution was extensively evaluated using low-powered ARM-based devices, including Raspberry Pi v3 and the low-powered GPU-enabled device NVIDIA Jetson Nano, and also compared them with Single-CPU Intel Xeon machines. For the evaluation experiments, we used real-world Floating Car Data. The experiments show that the proposed solution delivers excellent prediction accuracy and computational performance on the Edge when compared to the baseline methods.
- 17 June 2021
- Published by Kaunas University of Technology (KTU) in Information Technology And Control
- Vol. 50 (2) , 375-389
Big Data Full-Text Search Index Minimization Using Text Summarization
An efficient full-text search is achieved by indexing the raw data with an additional 20 to 30 percent storagecost. In the context of Big Data, this additional storage space is huge and introduces challenges to entertainfull-text search queries with good performance. It also incurs overhead to store, manage, and update the largesize index. In this paper, we propose and evaluate a method to minimize the index size to offer full-text searchover Big Data using an automatic extractive-based text summarization method. To evaluate the effectivenessof the proposed approach, we used two real-world datasets. We indexed actual and summarized datasets usingApache Lucene and studied average simple overlapping, Spearman’s rho correlation, and average rankingscore measures of search results obtained using different search queries. Our experimental evaluation showsthat automatic text summarization is an effective method to reduce the index size significantly. We obtained amaximum of 82% reduction in index size with 42% higher relevance of the search results using the proposedsolution to minimize the full-text index size.
- 17 June 2021
- Published by Kaunas University of Technology (KTU) in Information Technology And Control
- Vol. 50 (2) , 375-389
Big Data Full-Text Search Index Minimization Using Text Summarization
An efficient full-text search is achieved by indexing the raw data with an additional 20 to 30 percent storagecost. In the context of Big Data, this additional storage space is huge and introduces challenges to entertainfull-text search queries with good performance. It also incurs overhead to store, manage, and update the largesize index. In this paper, we propose and evaluate a method to minimize the index size to offer full-text searchover Big Data using an automatic extractive-based text summarization method. To evaluate the effectivenessof the proposed approach, we used two real-world datasets. We indexed actual and summarized datasets usingApache Lucene and studied average simple overlapping, Spearman’s rho correlation, and average rankingscore measures of search results obtained using different search queries. Our experimental evaluation showsthat automatic text summarization is an effective method to reduce the index size significantly. We obtained amaximum of 82% reduction in index size with 42% higher relevance of the search results using the proposedsolution to minimize the full-text index size.
- 22 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 17 (4) , 2052-2063
Diminishing Returns and Deep Learning for Adaptive CPU Resource Allocation of Containers
Containers provide a lightweight runtime environment for microservices applications while enabling better server utilization. Automatic optimal allocation of CPU pins to the containers serving specific workloads can help to minimize the completion time of jobs. Most of the existing state-of-the-art focused on building new efficient scheduling algorithms for placing the containers on the infrastructure, and the resources to the containers are allocated manually and statically. An automatic method to identify and allocate optimal CPU resources to the containers can help to improve the efficiency of the scheduling algorithms. In this paper, we introduce a new deep learning-based approach to allocate optimal CPU resources to the containers automatically. Our approach uses the law of diminishing marginal returns to determine the optimal number of CPU pins for containers to gain maximum performance while maximizing the number of concurrent jobs. The proposed method is evaluated using real workloads on a Docker-based containerized infrastructure. The results demonstrate the effectiveness of the proposed solution in reducing the completion time of the jobs by 23% to 74% compared to commonly used static CPU allocation methods.
- 22 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 17 (4) , 2052-2063
Diminishing Returns and Deep Learning for Adaptive CPU Resource Allocation of Containers
Containers provide a lightweight runtime environment for microservices applications while enabling better server utilization. Automatic optimal allocation of CPU pins to the containers serving specific workloads can help to minimize the completion time of jobs. Most of the existing state-of-the-art focused on building new efficient scheduling algorithms for placing the containers on the infrastructure, and the resources to the containers are allocated manually and statically. An automatic method to identify and allocate optimal CPU resources to the containers can help to improve the efficiency of the scheduling algorithms. In this paper, we introduce a new deep learning-based approach to allocate optimal CPU resources to the containers automatically. Our approach uses the law of diminishing marginal returns to determine the optimal number of CPU pins for containers to gain maximum performance while maximizing the number of concurrent jobs. The proposed method is evaluated using real workloads on a Docker-based containerized infrastructure. The results demonstrate the effectiveness of the proposed solution in reducing the completion time of the jobs by 23% to 74% compared to commonly used static CPU allocation methods.
- Open Access
- 1 July 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-13
Automatic NoSQL to Relational Database Transformation with Dynamic Schema Mapping
Recently, the use of NoSQL databases has grown to manage unstructured data for applications to ensure performance and scalability. However, many organizations prefer to transfer data from an operational NoSQL database to a SQL-based relational database for using existing tools for business intelligence, analytics, decision making, and reporting. The existing methods of NoSQL to relational database transformation require manual schema mapping, which requires domain expertise and consumes noticeable time. Therefore, an efficient and automatic method is needed to transform an unstructured NoSQL database into a structured database. In this paper, we proposed and evaluated an efficient method to transform a NoSQL database into a relational database automatically. In our experimental evaluation, we used MongoDB as a NoSQL database, and MySQL and PostgreSQL as relational databases to perform transformation tasks for different dataset sizes. We observed excellent performance, compared to the existing state-of-the-art methods, in transforming data from a NoSQL database into a relational database.
- 1 July 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-13
Open AccessAutomatic NoSQL to Relational Database Transformation with Dynamic Schema Mapping
Recently, the use of NoSQL databases has grown to manage unstructured data for applications to ensure performance and scalability. However, many organizations prefer to transfer data from an operational NoSQL database to a SQL-based relational database for using existing tools for business intelligence, analytics, decision making, and reporting. The existing methods of NoSQL to relational database transformation require manual schema mapping, which requires domain expertise and consumes noticeable time. Therefore, an efficient and automatic method is needed to transform an unstructured NoSQL database into a structured database. In this paper, we proposed and evaluated an efficient method to transform a NoSQL database into a relational database automatically. In our experimental evaluation, we used MongoDB as a NoSQL database, and MySQL and PostgreSQL as relational databases to perform transformation tasks for different dataset sizes. We observed excellent performance, compared to the existing state-of-the-art methods, in transforming data from a NoSQL database into a relational database.