Mahesh Kumar
Phone: 9916616898
Address: Assistant Professor, Dept. of CSE, JSS Academy of Technical Education, Bengaluru - 560060
Address: Assistant Professor, Dept. of CSE, JSS Academy of Technical Education, Bengaluru - 560060
less
Related Authors
![International Journal of Advance Research in Computer Science and Management Studies [IJARCSMS] ijarcsms.com related author profile picture](https://0.academia-photos.com/4738535/2006887/71427192/s200_international_journal_of_advance_research_in_computer_science_and_management_studies_ijarcsms_.ijarcsms.com.jpg)
Interests
Uploads
Papers by Mahesh Kumar
In this research paper, we propose a new disk scheduling algorithm that will reduce the number of movement of head thereby reducing the seek time and it improves the disk bandwidth for modern storage devices. Our results and calculations show that, proposed disk scheduling algorithm will improve the performance of disk i/o by reducing average seek time compared to the existing disk scheduling algorithm. For few requests, the seek time and the total number of head movement is equal to SSTF or LOOK scheduling.
do not provide standardized and systematic network
management capabilities. Intelligence is not associated with
the sensors. In order to make a sensor network more dynamic
in nature, there is need to monitor the sensor network with
the elements of the network management like Fault,
Configuration, Security and Performance. This project is on
the demonstration of Plug and Play (PnP) enabled devices
(smart sensor node) in different levels to provide network and
sensor management in dynamic fashion using Simple
Network Management Protocol (SNMP) and Hyper Text
Transfer Protocol (HTTP).
memory to the process needed. These strategies require the entire process should be in the memory before execution and some of these strategies suffer from fragmentation. Virtual memory does not require entire process to be in memory before execution. It loads only those pages of the process in to the memory that are needed for execution. This can be achieved using paging scheme having number of frames in the memory to accommodate for each pages. Whenever one of the page in the memory need to be replaced, one of the page replacement algorithms are used. The performance of these page replacement algorithms depends on the total number of page faults achieved. In this paper, a new algorithm called Comparison Counting FIFO (CC-FIFO) and Distribution Counting FIFO (DC-FIFO) has been proposed using input enhancement technique. Our results and calculations show that the proposed algorithm minimizes the page fault rate compared to FIFO, LRU and Optimal page replacement algorithms.
scheduling algorithms concentrates more on to maximize CPU utilization, throughput, waiting time and turnaround time. In
particularly, the performance of round robin algorithm depends heavily on the size of the time quantum. To improve the performance of CPU and to minimize the overhead on the CPU, time quantum should be large with respect to the context switch time. Otherwise, context switching will be more. In this research paper, we propose a method to minimize the context switching and to break the fixed time quantum size in round robin scheduling algorithm using optimization techniques. Both results and calculations show that, our proposed method is more efficient than the existing round robin scheduling algorithm.
In this research paper, we propose a new disk scheduling algorithm that will reduce the number of movement of head thereby reducing the seek time and it improves the disk bandwidth for modern storage devices. Our results and calculations show that, proposed disk scheduling algorithm will improve the performance of disk i/o by reducing average seek time compared to the existing disk scheduling algorithm. For few requests, the seek time and the total number of head movement is equal to SSTF or LOOK scheduling.
do not provide standardized and systematic network
management capabilities. Intelligence is not associated with
the sensors. In order to make a sensor network more dynamic
in nature, there is need to monitor the sensor network with
the elements of the network management like Fault,
Configuration, Security and Performance. This project is on
the demonstration of Plug and Play (PnP) enabled devices
(smart sensor node) in different levels to provide network and
sensor management in dynamic fashion using Simple
Network Management Protocol (SNMP) and Hyper Text
Transfer Protocol (HTTP).
memory to the process needed. These strategies require the entire process should be in the memory before execution and some of these strategies suffer from fragmentation. Virtual memory does not require entire process to be in memory before execution. It loads only those pages of the process in to the memory that are needed for execution. This can be achieved using paging scheme having number of frames in the memory to accommodate for each pages. Whenever one of the page in the memory need to be replaced, one of the page replacement algorithms are used. The performance of these page replacement algorithms depends on the total number of page faults achieved. In this paper, a new algorithm called Comparison Counting FIFO (CC-FIFO) and Distribution Counting FIFO (DC-FIFO) has been proposed using input enhancement technique. Our results and calculations show that the proposed algorithm minimizes the page fault rate compared to FIFO, LRU and Optimal page replacement algorithms.
scheduling algorithms concentrates more on to maximize CPU utilization, throughput, waiting time and turnaround time. In
particularly, the performance of round robin algorithm depends heavily on the size of the time quantum. To improve the performance of CPU and to minimize the overhead on the CPU, time quantum should be large with respect to the context switch time. Otherwise, context switching will be more. In this research paper, we propose a method to minimize the context switching and to break the fixed time quantum size in round robin scheduling algorithm using optimization techniques. Both results and calculations show that, our proposed method is more efficient than the existing round robin scheduling algorithm.