Dr. N. Neelima Priyanka
COMPUTER SCIENCE AND ENGINEERING Distributed and Parallel Computing Systems Real-Time Systems Scheduling Rate-monotonic scheduling Single-machine scheduling Dynamic priority scheduling Fair-share scheduling Scheduling and Optimization Algorithms Security in Wireless Sensor Networks Energy Efficient Wireless Sensor Networks Key distribution in wireless sensor networks Round-robin scheduling Machine Learning in Healthcare Adversarial machine learning Artificial Intelligence Computer Networks and Communications Hardware and Architecture Industrial and Manufacturing Engineering

Bio

Dr. Sukumar Babu Bandarupalli, also known as Dr. N. Neelima Priyanka, is a dedicated researcher and academic in the field of Computer Science and Engineering. He holds a Ph.D. in Computer Science and Engineering from JNTUK and is currently affiliated with Vijaya Institute of Technology for Women, JNTUK. His research interests span a wide range of topics including wireless sensor networks, operating systems, machine learning, cybersecurity, and cryptography. He has authored several papers on QoS routing protocols, CPU scheduling algorithms, malware detection, disease prediction, and encryption. With a growing publication record, his work has been cited by peers, contributing to the advancement of his field. He also serves as a fellow member, actively reviewing and contributing to the academic community.

Educational Journey

Jawaharlal Nehru Technological University, Kakinada

B.Tech, M.TECH, Ph.D • COMPUTER SCIENCE AND ENGINEERING

Experience

Vijaya Institute of Technology for Women

0 - 0

Research

Optimized Round Robin CPU Scheduling Algorithm

Article December 31, 2012

One of the fundamental function of an operating system is scheduling. There are 2 types of uni-processor operating system in general. Those are uni-programming and multi-programming. Uni-programming operating system execute only single job at a time while multiprogramming operating system is capable of executing multiple jobs concurrently. Resource utilization is the basic aim of multiprogramming operating system. There are many scheduling algorithms available for multi-programming operating system. But our work focuses on design and development aspect of new and novel scheduling algorithm for multi-programming operating system in the view of optimization. We developed a tool which gives output in the form of experimental results with respect to some standard and new scheduling algorithms e.g. First come first serve, shortest job first, round robin, optimal and a novel cpu scheduling algorithm etc.