linux-kernel - Re: BFS 420: cleanup in tick handling

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 for Android: free password hash cracker in your pocket

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

Message-ID: <CAJd=RBDbqMHcmKdFVJEEq8LSQP1+Dfo7ancWhTV4uR2fO9k+Jg@mail.gmail.com>
Date:	Tue, 22 May 2012 21:50:24 +0800
From:	Hillf Danton <dhillf@...il.com>
To:	Chen <hi3766691@...il.com>, LKML <linux-kernel@...r.kernel.org>
Subject: Re: BFS 420: cleanup in tick handling

On Tue, May 22, 2012 at 9:45 PM, Chen <hi3766691@...il.com> wrote:
> Actually the lowest deadline task selection algorithm now BFS used is O(n).
> I have already had an idea to enhance the lowest deadline task selection
> algorithm to O(1)

Would you please announce it on LKML?
--
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/