Re: [patch] Real-Time Preemption, -RT-2.6.9-rc4-mm1-U8

From: john cooper (john.cooper_at_timesys.com)
Date: 10/21/04

  • Next message: Lee Revell: "Re: IA32 (2.6.9 - 2004-10-20.21.30) - 11 New warnings (gcc 3.2.2)" 
    Date:	Thu, 21 Oct 2004 16:18:12 -0400
To: Scott Wood <scott@timesys.com>

    Scott Wood wrote:

    >On Thu, Oct 21, 2004 at 02:09:19PM -0400, john cooper wrote:
    >
    >>That's true for the case where the current priority is
    >>somewhere else handy (likely) and we don't need to traverse
    >>the list for other reasons such as allowing/disallowing
    >>recursive acquisition of a mutex by a given task.
    >>
    >
    >How would maintaining priority order make it faster to check for
    >recursive usage?
    >
    It wouldn't. My point was an exhaustive traversal may be
    needed for other reasons with an insertion sort being
    near free.

    Yet considering the cost to maintain these lists in priority
    order with multiple spinlock acquisition sequences due to how
    the aggregate data structure must be traversed/ordered,
    I haven't yet convinced myself either way.

    >On uniprocessor, one may wish to turn rwlocks into recursive non-rw
    >mutexes, where recursion checking would use a single owner field.
    >
    It isn't obvious to me how this would address the case of a
    task holding a reader lock on mx-A then blocking on mx-B.
    Another task attempting to acquire a reader lock on mx-A would
    block rather than immediately acquiring the lock.

    -john 

    -- 
john.cooper@timesys.com
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/
  • Next message: Lee Revell: "Re: IA32 (2.6.9 - 2004-10-20.21.30) - 11 New warnings (gcc 3.2.2)"

    Relevant Pages

    • Re: Count all nodes in a treeview
      ... Which suggests that the TTreeNodes type exposes the entire tree as a flat hierarchy via its "Item" member. ... Pedro's code does this via recursion, returning for each node the sum of the number of direct descendants and the calculated value of nodes from each of those descendants. ... child I traverse the childnode and get all of it's settings too. ...
      (microsoft.public.dotnet.languages.csharp)
    • Re: [patch] Real-Time Preemption, -RT-2.6.9-rc4-mm1-U8
      ... You can implement the full scheduler structure in each mutex. ... machine no lower priority task will run when higher priority tasks runs. ... > mutexes, where recursion checking would use a single owner field. ...
      (Linux-Kernel)
    • Re: Depth First Search traversal of this list
      ... I am trying to traverse the list C)) in a way that the ... works by iterating over the items at one level in the tree. ... are deferred into a queue, which is processed after the atoms are visited. ... After collecting both the queue and current level items, we do the recursion to ...
      (comp.lang.lisp)
    • Re: Code problem
      ... > Your code portion is incomplete, so you leave us to guess. ... > Thus, when traverse call itself, the previous value of files is wiped out. ... the programmer is free to change implementation details more easily. ... little detail only creates a single List no matter how deep the recursion ...
      (comp.lang.java.help)
    • Re: Regarding JTree
      ... Then you use recursion ... to traverse the tree. ... http://mindprod.com Again taking new Java programming contracts. ... Prev by Date: ...
      (comp.lang.java.gui)