EDBT 2026 Demo / reviewers in the wild / expert
Manikandan Nanjappan
dblp:286/7649
· DBLP profile ↗
7ranked-venue papers
2as first author
7since 2021 · last 2026
0000-0001-7406-1242ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Computer networks · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Scalable task scheduling in internet of things networks: Integrating coati optimization with distributed reinforcement learning
L. Javid Ali, Raman Chidambaram Janaki, Chinnasamy Ambayiram, Manikandan Nanjappan |
Knowl. Based Syst. | 4 |
| 2023 | Task scheduling based on minimization of makespan and energy consumption using binary GWO algorithm in cloud environment
Gobalakrishnan Natesan, Manikandan Nanjappan, Pradeep Krishnadoss, L. Sherly Puspha Annabel |
Peer Peer Netw. Appl. | 2 |
| 2022 | CWOA: Hybrid Approach for Task Scheduling in Cloud EnvironmentabstractAbstract A cloud computing system typically comprises of a huge number of interconnected servers that are organized in a datacentre. Such servers dynamically cater to the on-demand requests put forward by the clients seeking solutions to their applications through an interface. The scheduling activity concerned with scientific applications is designated under the NP hard problem category since they make use of heterogeneous resources of dynamic capabilities. Recently cloud computing researchers had developed numerous meta-heuristic approaches for providing solutions to the challenges arising in the task scheduling activities. Scheduling of tasks poses a major concern in cloud computing environment. This decreases the efficiency of the system considerably, if not handled properly. Hence, an improvised task scheduling algorithm that enhances the performance of the cloud is needed. There are two factors that affect the cloud environment: service quality and energy usage. To increase the performance in above suggested factors (memory, makespan and energy efficiency), an efficient hybridized algorithm, obtained by integrating the Cuckoo Search Algorithm (CSA) and Whale Optimization Algorithm (WOA), called the CWOA had been proposed in this work. The performance of our proposed CWOA algorithm had been compared with Ant Colony Optimization, CSA and WOA and it was found to produce an improvement of 5.62%, 4.36% and 2.27% with respect to makespan, 16.36%, 19.19% and 13.13% with respect to memory utilization and 19.08%, 19.34% and 16.75% with respect to energy consumption parameters, respectively. Comprehensive results have been tabulated in the result section of this article. Pradeep Krishnadoss, L. Javid Ali, Gobalakrishnan Natesan, C. J. Raman, Manikandan Nanjappan |
Comput. J. | 5 |
| 2022 | Bee optimization based random double adaptive whale optimization model for task scheduling in cloud computing environment
Manikandan Nanjappan, Gobalakrishnan Natesan, Pradeep Krishnadoss |
Comput. Commun. | 1 |
| 2022 | Hybrid-based novel approach for resource scheduling using MCFCM and PSO in cloud computing environmentabstractSummary Cloud computing is a growing environment. Many of the users are interested to outsource their data in cloud; however, load balancing in cloud is still at risk. Resource allocation plays a major role in load balancing. In this scheduling problem, independent task in cloud computing can allocate resource by the summary of modified canopy fuzzy c‐means algorithm (MCFCMA). To allocate task to their corresponding resource, particle swarm‐based optimization algorithm (PSO) is used. In proposed scheme, first independent task selected based on load feed‐back, cluster the requested task using MCFCMA and schedule task to each virtual machine. VM selects parallel execution in virtual machine manager. Calculate feature value using PSO algorithm. Allocate resource to the task. Since our proposed system selects resource based on parallel execution, it reduces load balancing in Cloud Quantum Computation (CQC). The proposed system overcomes issues in load balancing and load scheduling; this can be proved by its precision and privacy calculation. Manikandan Nanjappan, Albert Pravin |
Concurr. Comput. Pract. Exp. | 1 |
| 2022 | Optimization techniques for task scheduling criteria in IaaS cloud computing atmosphere using nature inspired hybrid spotted hyena optimization algorithmabstractSummary Cloud computing has garnered unprecedented growth in recent years in the field of Information Technology. It has emerged as a high‐performance computing option owing to its infrastructure that comprises of heterogeneous collection of autonomous computers and adaptable network architecture. The tasks that are scheduled in an optimized manner for their execution could be classified under NP‐hard problems. Though meta‐heuristic scheduling algorithms emerge as scheduling options, they need to be much more consistent while dealing with the dynamic set up of the cloud environment. In this paper, we had proposed a multi‐objective meta‐heuristic scheduling algorithm namely Quasi Oppositional Genetic Spotted Hyena Optimization (QOGSHO) algorithm that globally optimizes the makespan, resource consumption and SLA violation QoS parameters, thereby improving the performance. The algorithm proposed is an amalgamated product of meta‐heuristic algorithms like Quasi Oppositional Based Learning (QOBL), Spotted Hyena Optimization (SHO), and Genetic Algorithm (GA). The performance efficiency of the proposed QOGSHO algorithm had been compared with various scheduling algorithms using uniform datasets by varying the data instance sizes in a simulated cloud environment. The obtained results clearly justify the task scheduling efficiency of the proposed algorithm with respect to the QoS parameters namely makespan, resource utilization and SLA violation. Gobalakrishnan Natesan, L. Javid Ali, Pradeep Krishnadoss, Raman Chidambaram, Manikandan Nanjappan |
Concurr. Comput. Pract. Exp. | 5 |
| 2022 | Electro search optimization based long short-term memory network for mobile malware detectionabstractAbstract Mobile malware is malicious software designed specifically for targeting various mobile gadgets like tablets, smartphones, and so forth, in which any type of malicious code affecting the mobile devices without the knowledge of the user. The increasing number of users encourages the hacker for generating various malware applications. Therefore, in this paper, we utilized three vital phases namely the pre‐processing process, Feature extraction process as well as classification process in which the malicious data are detected. In the pre‐processing phase, an Androguard tool is used for decompiling and disassembling the android applications. The API call features are extracted in the feature extraction phase and in the classification phase, long short term memory based electro search optimization (LSTM‐ESO) is employed to detect the unknown mobile applications as benign or malicious. The malicious mobile detecting accuracy deals in requesting permission and exhibiting malicious code applications. In order to enhance the identification of various malware applications, this paper utilized frequency analysis and permissions of API calls. Finally, the experimental analysis is performed by evaluating the performance measures like accuracy, precision, recall, and F‐measure. From the evaluation outcome, it is observed that the classification accuracy obtained is 97.69%. Padmapriya Shanmugam, BalajiVijayan Venkateswarulu, Rajalakshmi Dharmadurai, Thiagarajan Ranganathan, Mohan Indiran, Manikandan Nanjappan |
Concurr. Comput. Pract. Exp. | 6 |