* Query about the realtime processes scheduling.
@ 2011-08-18 6:48 nilesh
2011-08-18 7:21 ` nilesh
0 siblings, 1 reply; 3+ messages in thread
From: nilesh @ 2011-08-18 6:48 UTC (permalink / raw)
To: kernelnewbies
Hi,
I am not too familiar with Linux scheduler. What I could understand
theoretically is - the interactive processes get advantage (-5) in priority.
And hence the effective priority is higher.
Query:
Is this true for realtime processes ( with SCHED_FIFO/SCHED_RR policy)
as well? Could the realtime processes be I/O bound or interactive?
--
Thanks,
Nilesh
^ permalink raw reply [flat|nested] 3+ messages in thread
* Query about the realtime processes scheduling.
2011-08-18 6:48 Query about the realtime processes scheduling nilesh
@ 2011-08-18 7:21 ` nilesh
2011-08-18 16:39 ` Mulyadi Santosa
0 siblings, 1 reply; 3+ messages in thread
From: nilesh @ 2011-08-18 7:21 UTC (permalink / raw)
To: kernelnewbies
On Thursday 18 August 2011 12:18 PM, nilesh wrote:
> Hi,
>
> I am not too familiar with Linux scheduler. What I could understand
> theoretically is - the interactive processes get advantage (-5) in priority.
> And hence the effective priority is higher.
>
> Query:
> Is this true for realtime processes ( with SCHED_FIFO/SCHED_RR policy)
> as well? Could the realtime processes be I/O bound or interactive?
>
Please ignore the post.
I should have looked into the code before posting the query. It looks
like the bonus/penalty is only for non-realtime tasks.
2101static int effective_prio(struct task_struct *p)
2102{
2103 p->normal_prio = normal_prio(p);
2104 /*
2105 * If we are RT tasks or we were boosted to RT priority,
2106 * keep the priority unchanged. Otherwise, update priority
2107 * to the normal priority:
2108 */
2109 if (!rt_prio(p->prio))
2110 return p->normal_prio;
2111 return p->prio;
2112}
2113
--
Thanks,
Nilesh
^ permalink raw reply [flat|nested] 3+ messages in thread* Query about the realtime processes scheduling.
2011-08-18 7:21 ` nilesh
@ 2011-08-18 16:39 ` Mulyadi Santosa
0 siblings, 0 replies; 3+ messages in thread
From: Mulyadi Santosa @ 2011-08-18 16:39 UTC (permalink / raw)
To: kernelnewbies
On Thu, Aug 18, 2011 at 14:21, nilesh <nilesh.tayade@netscout.com> wrote:
> Please ignore the post.
> I should have looked into the code before posting the query. It looks
> like the bonus/penalty is only for non-realtime tasks.
Correct. Most (if not all) realtime priority scheduling is done in
FIFO style and their priority is static.
--
regards,
Mulyadi Santosa
Freelance Linux trainer and consultant
blog: the-hydra.blogspot.com
training: mulyaditraining.blogspot.com
^ permalink raw reply [flat|nested] 3+ messages in thread
end of thread, other threads:[~2011-08-18 16:39 UTC | newest]
Thread overview: 3+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2011-08-18 6:48 Query about the realtime processes scheduling nilesh
2011-08-18 7:21 ` nilesh
2011-08-18 16:39 ` Mulyadi Santosa
This is an external index of several public inboxes,
see mirroring instructions on how to clone and mirror
all data and code used by this external index.