Add pthreads lock profiling and lock ordering task to ideas list.
Submitted by: jeff, kris
This commit is contained in:
parent
2f8fa76581
commit
c61235ec86
Notes:
svn2git
2020-12-08 03:00:23 +00:00
svn path=/www/; revision=31716
1 changed files with 29 additions and 1 deletions
|
@ -15,7 +15,7 @@ Ideas//EN"
|
|||
<ideas>
|
||||
<cvs:keywords xmlns:cvs="http://www.FreeBSD.org/XML/CVS" version="1.0">
|
||||
<cvs:keyword name="freebsd">
|
||||
$FreeBSD: www/en/projects/ideas/ideas.xml,v 1.72 2008/03/22 16:32:40 rwatson Exp $
|
||||
$FreeBSD: www/en/projects/ideas/ideas.xml,v 1.73 2008/03/22 17:48:27 rwatson Exp $
|
||||
</cvs:keyword>
|
||||
</cvs:keywords>
|
||||
|
||||
|
@ -2153,5 +2153,33 @@ SMP features.</p>
|
|||
</desc>
|
||||
</idea>
|
||||
|
||||
<idea class="soc" id="pthread-profile">
|
||||
<title>Userspace pthread mutex lock contention profiling and lock
|
||||
order verification tool</title>
|
||||
|
||||
<desc><p><strong>Technical contact</strong>: <a
|
||||
href="mailto:jeff@FreeBSD.org">Jeff Roberson</a></p>
|
||||
|
||||
<p>This task would create an extension to the threading library
|
||||
that would allow application developers to measure and locate lock
|
||||
ordering and lock contention problems within their application.
|
||||
Such a tool is invaluable in debugging application deadlocks and
|
||||
creating high-performance multithreaded software. Existing lock
|
||||
ordering and profiling tools exist in the FreeBSD kernel, and
|
||||
could be used as the model for the userspace implementation. We
|
||||
would recommend beginning with profiling due to its immediate
|
||||
usefulness in optimizing performance, and to allow improvements
|
||||
in kernel scheduling to better manage user application lock
|
||||
contention.</p>
|
||||
|
||||
<p><strong>Requirements</strong>:</p>
|
||||
<ul>
|
||||
<li>Strong knowledge of C.</li>
|
||||
<li>Threading experience.</li>
|
||||
<li>Strong debugging skills.</li>
|
||||
</ul>
|
||||
</desc>
|
||||
</idea>
|
||||
|
||||
</category>
|
||||
</ideas>
|
||||
|
|
Loading…
Reference in a new issue