Aaron Carroll ha scritto:Just a note about that table. The lower aggregate throughput of bfq is due to the fact that, because of the higher number of movies being read, a higher percentage of not-that-profitable accesses is being performed under bfq wrt to cfq. As shown in the complete logs of the aggregate throughput in the raw results, the aggregate throughput with bfq and cfq is practically the same when the number of movies is the same. The figure in the "Aggregate throughput" subsection is probably best suited for a comparison of the performance of the two schedulers with sequential accesses under the same conditions (the figure refers to the 2, 128 MB long, files, but we got virtually the same results in all the other tests). I do agree on that these experiments should be repeated with different (faster) devices. Paolo --
| Alan | Re: [RFC] Heads up on sys_fallocate() |
| Tarkan Erimer | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Greg Kroah-Hartman | [PATCH 001/196] Chinese: Add the known_regression URI to the HOWTO |
| Paul Mundt | Re: 2.6.22-rc4-mm2 |
git: | |
| Gerrit Renker | [PATCH 15/37] dccp: Set per-connection CCIDs via socket options |
| Jarek Poplawski | [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| David Miller | Re: [GIT]: Networking |
| Frans Pop | svc: failed to register lockdv1 RPC service (errno 97). |
