{"push_id":796340161,"size":2,"distinct_size":2,"ref":"refs/heads/cm-12.1","head":"911ac62c10af596b7bf81b22d74f1713c413edf4","before":"ff8f044b1f0552da9bfcac56f530472bf6d0397b","commits":[{"sha":"d99504ba28be05afc8ccb7e28d724a5e7ccd3ea5","author":{"email":"20b1b82ea87150022f6495522a9f5e355ea8b305@gmail.com","name":"Arianna Avanzini"},"message":"block: cgroups, kconfig, build bits for BFQ-v7r8-3.4\n\nUpdate Kconfig.iosched and do the related Makefile changes to include\nkernel configuration options for BFQ. Also add the bfqio controller\nto the cgroups subsystem.\n\nSigned-off-by: Paolo Valente <paolo.valente@unimore.it>\nSigned-off-by: Arianna Avanzini <avanzini.arianna@gmail.com>\n\nChange-Id: Ie3a4fb5160bfb91a591d6e7dbf10a67abddc61af","distinct":true,"url":"https://api.github.com/repos/CyanogenMod/android_kernel_xiaomi_cancro/commits/d99504ba28be05afc8ccb7e28d724a5e7ccd3ea5"},{"sha":"911ac62c10af596b7bf81b22d74f1713c413edf4","author":{"email":"77843028b8f8419c9977951e271784ccf7804be9@unimore.it","name":"Paolo Valente"},"message":"block: introduce the BFQ-v7r8 I/O sched for 3.4\n\nAdd the BFQ-v7r8 I/O scheduler to 3.4.\nThe general structure is borrowed from CFQ, as much of the code for\nhandling I/O contexts. Over time, several useful features have been\nported from CFQ as well (details in the changelog in README.BFQ). A\n(bfq_)queue is associated to each task doing I/O on a device, and each\ntime a scheduling decision has to be made a queue is selected and served\nuntil it expires.\n\n    - Slices are given in the service domain: tasks are assigned\n      budgets, measured in number of sectors. Once got the disk, a task\n      must however consume its assigned budget within a configurable\n      maximum time (by default, the maximum possible value of the\n      budgets is automatically computed to comply with this timeout).\n      This allows the desired latency vs \"throughput boosting\" tradeoff\n      to be set.\n\n    - Budgets are scheduled according to a variant of WF2Q+, implemented\n      using an augmented rb-tree to take eligibility into account while\n      preserving an O(log N) overall complexity.\n\n    - A low-latency tunable is provided; if enabled, both interactive\n      and soft real-time applications are guaranteed a very low latency.\n\n    - Latency guarantees are preserved also in the presence of NCQ.\n\n    - Also with flash-based devices, a high throughput is achieved\n      while still preserving latency guarantees.\n\n    - BFQ features Early Queue Merge (EQM), a sort of fusion of the\n      cooperating-queue-merging and the preemption mechanisms present\n      in CFQ. EQM is in fact a unified mechanism that tries to get a\n      sequential read pattern, and hence a high throughput, with any\n      set of processes performing interleaved I/O over a contiguous\n      sequence of sectors.\n\n    - BFQ supports full hierarchical scheduling, exporting a cgroups\n      interface.  Since each node has a full scheduler, each group can\n      be assigned its own weight.\n\n    - If the cgroups interface is not used, only I/O priorities can be\n      assigned to processes, with ioprio values mapped to weights\n      with the relation weight = IOPRIO_BE_NR - ioprio.\n\n    - ioprio classes are served in strict priority order, i.e., lower\n      priority queues are not served as long as there are higher\n      priority queues.  Among queues in the same class the bandwidth is\n      distributed in proportion to the weight of each queue. A very\n      thin extra bandwidth is however guaranteed to the Idle class, to\n      prevent it from starving.\n\nChange-Id: I94fbf4c6aaa63b574b523b26c6a3bff2ab9f380c\nSigned-off-by: Paolo Valente <paolo.valente@unimore.it>\nSigned-off-by: Arianna Avanzini <avanzini.arianna@gmail.com>","distinct":true,"url":"https://api.github.com/repos/CyanogenMod/android_kernel_xiaomi_cancro/commits/911ac62c10af596b7bf81b22d74f1713c413edf4"}]}