search for: busy_data

This patchset expands traditional CFQ scheduler in order to support cgroups, and improves old version. Improvements are as following. * Modularizing our new CFQ scheduler. The expanded CFQ scheduler is registered/unregistered as new I/O elevator scheduler called "cfq-cgroups". By this, the traditional CFQ scheduler, which does not handle cgroups, and our new CFQ

This patchset expands traditional CFQ scheduler in order to support cgroups, and improves old version. Improvements are as following. * Modularizing our new CFQ scheduler. The expanded CFQ scheduler is registered/unregistered as new I/O elevator scheduler called "cfq-cgroups". By this, the traditional CFQ scheduler, which does not handle cgroups, and our new CFQ

...->rb_left; else n = &(*p)->rb_right; @@ -542,6 +579,14 @@ int cfq_cgroup_dispatch_requests(struct request_queue *q, int force) if (cfqd) dispatched = cfq_queue_dispatch_requests(cfqd, force); + /* + * idle cfq_data always expire after 1 dispatch round. + */ + if (cfqdd->busy_data > 1 && cfq_data_class_idle(cfqd)) { + cfqd->slice_end = jiffies + 1; + cfq_cgroup_slice_expired(cfqdd, 0); + } + return dispatched; } @@ -699,149 +744,164 @@ param_separate(const char *master, char *valbuf, char *pathbuf, int size) *pc2 = '\0'; } -static ssize_t c...

...->rb_left; else n = &(*p)->rb_right; @@ -542,6 +579,14 @@ int cfq_cgroup_dispatch_requests(struct request_queue *q, int force) if (cfqd) dispatched = cfq_queue_dispatch_requests(cfqd, force); + /* + * idle cfq_data always expire after 1 dispatch round. + */ + if (cfqdd->busy_data > 1 && cfq_data_class_idle(cfqd)) { + cfqd->slice_end = jiffies + 1; + cfq_cgroup_slice_expired(cfqdd, 0); + } + return dispatched; } @@ -699,149 +744,164 @@ param_separate(const char *master, char *valbuf, char *pathbuf, int size) *pc2 = '\0'; } -static ssize_t c...