Answer / sravan reddy

1)Pre-emptive:- forcibly removing a process from its running
state to avoid starvation so that shorter jobs also get a
time slice for execution.
2)Non-Preemptive:-
jobs cannot be pre-empted unless they complete their job.
3)Priority based:-
suppose we have more than one job and each job is having its
own priority then the job having highest priority gets
executed first..
4)Priority Inversion:-
In this method we can change the priority of the current
executing process
5)Round-robin:-round-robin policy is a method in which every
process gets its time slice..
after executing a process for certain time slice..if the job
is not completed in that time it will be thrown into waiting
state and the next job gets the timeslice and will be
executed..and the process that was in waiting state will get
processor time after the remaining processes are completed..
6)First In First Out(FIFO)
or
First Cum First Serviced(FCFS):-Name itself indicates that
whatever the job came first will be executed first..
there is a queue called Job queue which has a record of all
the jobs to be executed and using FIFO each job gets out of
that queue and executed as a queue..
7)Interrupt based:-
Interrupts have high prority than any other process..
so they will be executed first..

inorder to understand all the things i explained..First get
the information about the process states..How jobs will be
Executed?what is ready queue?what is context switching? etc
etc..

Answer / kwrtos

First the rationale to have a sophisticated job scheduling
mechanism is a demand of multi-tasking system where multiple
jobs compete for their execution time-slots. Each of
job-scheduling policies then also shines with particular
scenarios depending on what the goal the system attempts to
achieve. Priority-based scheduling is to give a process CPU
usage upon its prioirty at any given time. First-Come-First
Serve, aka FIFO, scheduling operates as it means.
Round-robin then allows each process receive frequent time
slots of CPU usage. Dynamic priority adjusts its priority
upon the resource use and type of operations, allowing
frequent priority and time-quantum modifications.
Shortest-remaining-time scheduling then utilizes the
feedback among processes to give the shortest task more
chances to complete its task than others.

Answer / neil

the different types of Scheduling Algorithms are
1). Priority Based
- Preemptive
- Non Preemptive
2). Shortest Job First
- Preemptive
- Non Premmptive
3). First Come First Served

Answer / senthil

Non preemptive
Preemptive
Round robin

Answer / sushil

it's like many part
1:-first come, first- served scheduling.
2:-shortest-job- first scheduling.
Tn+1=&Tn+(1-&)Tn this fomula define an exponential average.
3:-priority scheduling
4:-round-robin scheduling.
5:-mutlilevel queue scheduling
6:-multilevel feedback-queue scheduling.

Answer / manoj k gupta

Ans4 looks close. There has to be one more type..4)Round
Robin.
Non-Preemptive and Preemptive are the types of kernel.

Answer / shikha gangwar

Scheduling is the activity of the deciding when process
will receive the resources they request.
FCFS: --- FCSFS stands for First Come First Served. In FCFS
the job that has been waiting the longest is served next.
Round Robin Scheduling: ---Round Robin scheduling is a
scheduling method where each process gets a small quantity
of time to run and then it is preempted and the next
process gets to run. This is called time-sharing and gives
the effect of all the processes running at the same time
Shortest Job First: -- The Shortest job First scheduling
algorithm is a nonpreemptive scheduling algorithm that
chooses the job that will execute the shortest amount of
time.
Priority Scheduling: ---Priority scheduling is a scheduling
method where at all times the highest priority process is
assigned the resource.

Answer / veeru

1.End less loop-
the code is executes continuesly and is imilar to a end
less while loop like while(1).
2. Continues polling
This is similar to the end less loop and the difference
is that end loop loop will have small code and this will
have a huge code or tasks
3. Timer Continues scheduling
this is consists of different tasks and the RTOS uses a
timer interrupt which will be rised witha particular
interval of time. the disadvantage is the precesion
4. different rate timer continues scheduling
this is similar to the timer continues scheduling, but
it will have timer interrupts with different rates .
5. Premeptive scheduling
6. Priority based scheduling
7.

Answer / karthik

First Come First Serve(FCFS)
Round Roubin scheduling

What is the difference between Hard and Soft real-time systems ?

11 Answers   Google, Hella, Satyam,

If two processes which shares same system memory and system clock in a distributed system, What is it called?

7 Answers  

What is the important aspect of a real-time system ?

6 Answers  

What is the state of the processor, when a process is waiting for some event to occur?

14 Answers   MTS,

What is a Real-Time System ?

5 Answers  

When would you choose top down methodology?

3 Answers   CTS,

What is the difference b/n any GPOS and RTOS?Give suitable examples or characteristic of RTOS to support your answer. What changes can be done in a GPOS to make it work like a RTOS? What basic features will you support, if you have to design a RTOS?

8 Answers   Bosch, Emulogic, L&T, Qualcomm,

What do you mean by deadlock?

8 Answers   Bosch,

What is a mission critical system ?

3 Answers  

I have been working on one thread which manage and control a couple of circular buffers. It has api for other thread to access. As the thread grows bigger and bigger, I split it as 3 to 4 threads which need to share common buffers, and also their api could be used by other threads, (not these three threads). Inside api, I also allow other threads to access these three threads' common buffers(more than one buffer). SO I have to use mutex to avoid race condition . But I found mutex will be everwhere in all the threads when they update the common buffer. I am wondering whether I could reduce mutex usage(more mutex will hure my system performance). any ideas for how to reduce mutex usage meanwhile to avoid race condition. Thanks

2 Answers  

Explain the difference between microkernel and macro kernel.

5 Answers   Infosys, Tech Mahindra,

what is difference between IRQ and FRQ ?

4 Answers   Bosch,