Learn More
In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context(More)
In this paper, a high dimensional chaotic systems based mixed keystream generator is proposed to secure the voice data. As the voice-based communication becomes extensively vital in the application areas of military, voice over IP, voice-conferencing, phone banking, news telecasting etc. It greatly demands to preserve sensitive voice signals from the(More)
The aim is to achieve schedulability of tasks in a real time system with fault tolerance and energy minimization. The fault tolerance can be achieved by maintaining enough time redundancy so that task can be re-executed in presence of fault. During re-execution, check pointing policy gives reliability in a system. First, calculate an optimal number of(More)
There are several CPU scheduling algorithms like FCFS, SRTN,RR , priority etc. Scheduling decision of these algorithms are based on parameters which are assumed to be crisp. However, in many circumstances these parameters are vague. The vagueness of these parameters suggests that scheduler should use fuzzy logic in scheduling the jobs. A fuzzy priority CPU(More)
Process scheduling using Round Robin Algorithm makes use of a fixed amount of time quantum that is assigned to each process to complete its execution. If the process is able to complete its execution within this time period, it is discarded from the ready queue otherwise it goes back to the rear of the ready queue and waits for its next turn. In this paper(More)
In Fair Share scheduling shares of CPU time for each group of processes is fixed and then accordingly processes from each group are allocated CPU for their execution. We have proposed a FIS using which CPU share of group of Processes will be decided dynamically. FIS has also been constructed for scheduling within the group to minimize the overheads. For(More)
Cloud Database Management is the probable candidate for Cloud Services. There are many barriers for the growth of Cloud Services. Security, one of the main barrier is the main concern of Cloud. In the previous paper, we have proposed the cloud database layers. Cloud database layers suffers from data related security issues. In this Paper we have analyzed(More)
A fault in a real time system can cause a system failure if it is not detected and tolerated in time. Fault tolerance is an approach used to allow a system to continue the work properly in the presence of fault. Time is an important aspect in real time system to perform an operation. Fault tolerance can be achieved by checkpointing approach to tolerate(More)