linux-kernel - [ANNOUNCE][PATCH] Rotary Interactivity Favor Scheduler V2 Releaae

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-next>] [day] [month] [year] [list]

Date:	Sat, 12 May 2012 01:06:57 +0800
From:	mou Chen <hi3766691@...il.com>
To:	linux-kernel@...r.kernel.org
Cc:	Peter Zijlstra <a.p.zijlstra@...llo.nl>,
	Ingo Molnar <mingo@...nel.org>,
	Juri Lelli <juri.lelli@...il.com>,
	Con Kolivas <con@...ivas.org>
Subject: [ANNOUNCE][PATCH] Rotary Interactivity Favor Scheduler V2 Releaae

Hmm. The new version is released.;-)

The RIFS SCHEDULER is a scheduler for a low latency desktop. It is
implemented base on the concept of simple.It lets the interactive task
run first than the cpu bound task.

First , RIFS is based on the multiple feedback queue algorithm. That
means it will let the high priority process run first. After the task
has run out of timeslice or it sleeps for waiting something RIFS will
determine whether we should increase the prio or not.For.preemption we
just need to compare the prio to determine whether it can preempt or
not.

If a task run out of time_sluce we.will.decrease it 's prio.
If a task run half of the time_slice and sleep we will increase it's prio
In the other case we will save the time_slice.
If a task that has a higher prio than his static_prio run out of
time_slice, we will drop it's priority to the static_prio.
If a task run out of time_slice and it's prio has become 140 already,
we will raise it's prio to static_prio.

                             Chen

Download attachment "rifs-patch-v2.tar.xz" of type "application/octet-stream" (135184 bytes)