linux-kernel - Re: [Fwd: Re: RFC for a new Scheduling policy/class in the Linux-kernel]

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Message-ID: <4A5F91F4.5070505@ece.cmu.edu>
Date:	Thu, 16 Jul 2009 16:47:48 -0400
From:	Raj Rajkumar <raj@....cmu.edu>
To:	"James H. Anderson" <anderson@...unc.edu>
CC:	Ted Baker <baker@...fsu.edu>, Noah Watkins <jayhawk@....ucsc.edu>,
	Peter Zijlstra <a.p.zijlstra@...llo.nl>,
	Raistlin <raistlin@...ux.it>,
	Douglas Niehaus <niehaus@...c.ku.edu>,
	Henrik Austad <henrik@...tad.us>,
	LKML <linux-kernel@...r.kernel.org>, Ingo Molnar <mingo@...e.hu>,
	Bill Huey <billh@...ppy.monkey.org>,
	"Linux RT <linux-rt-users@...r.kernel.org> Fabio Checconi" 
	<fabio@...dalf.sssup.it>, Thomas Gleixner <tglx@...utronix.de>,
	Dhaval Giani <dhaval.giani@...il.com>,
	Tommaso Cucinotta <cucinotta@...up.it>,
	Giuseppe Lipari <lipari@...is.sssup.it>,
	Bjoern Brandenburg <bbb@...unc.edu>,
	Karthik Singaram Lakshmanan <lakshmanan@....edu>,
	Dionisio de Niz <dionisio@....cmu.edu>
Subject: Re: [Fwd: Re: RFC for a new Scheduling policy/class in the Linux-kernel]

Jim:

Good discussion.   THanks for taking the time to educate me on past 
exchanges.

 > We didn't talk about the low processor utlization (Dhall effect)
 > mentioned in your last email.  However, that applies to hard real-time
 > workloads, not soft real-time workloads.  This discussion has been
 > touching on both.

For hard real-time workloads, partitioning (static binding to specific 
processors) works well, with developer control over where tasks run and 
their contenders.  For soft real-time workloads, global scheduling 
(dynamic binding to available processors) should do well.   The 
situation is analogous to what we see in banks and airports.  There is a 
common global queue serviced by multiple counters for "soft" real-time 
customers, and for those (business or first-class/special) customers 
needing higher QoS,  separate queues are provided.  In the OS context, 
we need to ensure that the two queues/servers do not interfere.  
Ceilings would help even when the hard and soft real-time tasks use the 
same processors.

However, the question of dealing with mutexes shared by processes 
allocated to different processors remains.  As Ted has pointed out, 
avoiding them would be best!  In practice, moving them to a 
synchronization processor (as was pointed out by Peter? and also 
discussed in one of my earlier papers on synchronization on 
multi-processors) ought to be considered.  I think the first-order 
improvements are
from

(1) ensuring that task waiting times are bounded as a function of 
critical sections only (i.e. avoiding the "unbounded" priority inversion 
problem) - this is accomplished by having critical sections execute at 
ceiling priorities (or higher) in the multiprocessor case,
(2) avoiding the wait from very long critical sections used only by 
lower-priority tasks - using priority ceilings instead of higher 
priority values for long critical sections mitigates this problem.

---
Raj

--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/