GitHub PushEvent at 2014-08-01 05:00:18
Repository: lge-kernel-lproj
Actor: 096-NET-UA
Payload: {"shas":[["f80eefae4945bb78595011fe290659278df6eff4","c7fa93ff364b50c0a977a853487528f982a1ac48@codeaurora.org","block: Adding ROW scheduling algorithm\n\nThis patch adds the implementation of a new scheduling algorithm - ROW.\nThe policy of this algorithm is to prioritize READ requests over WRITE\nas much as possible without starving the WRITE requests.\n\nChange-Id: I4ed52ea21d43b0e7c0769b2599779a3d3869c519\nSigned-off-by: Tatyana Brokhman <tlinder@codeaurora.org>","Tatyana Brokhman",true],["ed1b7dc16730664c9bee7adeb21507ca1bf6fe34","9ae2fff1e81f4043f3b3adb9ed5eedbbd34e3953@codeaurora.org","block: row-iosched idling triggered by readahead pages\nIn the current implementation idling is triggered only by request\ninsertion frequency. This heuristic is not very accurate and may hit\nrandom requests that shouldn't trigger idling. This patch uses the\nPG_readahead flag in struct page's flags, which indicates that the page\nis part of a readahead window, to start idling upon dispatch of a request\nassociated with a readahead page.\n\nThe above readehead flag is used together with the existing\ninsertion-frequency trigger. The frequency timer will catch read requests\nwhich are not part of a readahead window, but are still part of a\nsequential stream (and therefore dispatched in small time intervals).","Lee Susman",true]],"size":2,"ref":"refs/heads/cm-11.0","head":"ed1b7dc16730664c9bee7adeb21507ca1bf6fe34"}