On Thu, May 29, 2014 at 11:05:37AM +0200, Paolo Valente wrote:
> @@ -281,7 +323,8 @@ static inline unsigned long bfq_serv_to_charge(struct
> request *rq,
> struct bfq_queue *bfqq)
> {
> return blk_rq_sectors(rq) *
> - (1 +
On Thu, May 29, 2014 at 11:05:37AM +0200, Paolo Valente wrote:
@@ -281,7 +323,8 @@ static inline unsigned long bfq_serv_to_charge(struct
request *rq,
struct bfq_queue *bfqq)
{
return blk_rq_sectors(rq) *
- (1 +
This patch introduces a simple heuristic to load applications quickly,
and to perform the I/O requested by interactive applications just as
quickly. To this purpose, both a newly-created queue and a queue
associated with an interactive application (we explain in a moment how
BFQ decides whether
This patch introduces a simple heuristic to load applications quickly,
and to perform the I/O requested by interactive applications just as
quickly. To this purpose, both a newly-created queue and a queue
associated with an interactive application (we explain in a moment how
BFQ decides whether
4 matches
Mail list logo
