[Sony Ericsson XPERIA X10 Mini] matmutant:
Benchmarks, screenshots and thklist

to start with, some screenshots :)

MiniCM10 theme:

MiniCM10 Crystal2:

benchmarks :

MiniCM10-4.0.2-nightly, using .32 kernel :

all has been done at 729MHz, on robyn

on .32-02:

antutu :

fps2D:​

I/O performance on miniCM10-4.0.2-20130120/nAaJB03 (2.6.29.6) :

conclude what you want :)

NOOP:- The NOOP scheduler inserts all incoming I/O requests into a simple, unordered FIFO queue and implements request merging.

The scheduler assumes I/O performance optimization will be handled at some other layer of the I/O hierarchy; e.g., at the block device; by an intelligent HBA such as a Serial Attached SCSI (SAS) RAID controller or by an externally attached controller such as a storage subsystem accessed through a switched Storage Area Network.​

ANTICIPATORY:- Anticipatory scheduling is an algorithm for scheduling hard disk input/output.

It seeks to increase the efficiency of disk utilization by "anticipating" synchronous read operations.​

CFQ:-CFQ, also known as "Completely Fair Queuing", is an I/O scheduler for the

Linux kernel which was written in 2003 by Jens Axboe.

CFQ works by placing synchronous requests submitted by processes into a number of per-process queues and then allocating timeslices for each of the queues to access the disk. The length of the time slice and the number of requests a queue is allowed to submit depends on the IO priority of the given process. Asynchronous requests for all processes are batched together in fewer queues, one per priority.​

BFQ:- BFQ is a proportional share disk scheduling algorithm based on the slice-by-slice service scheme of CFQ. But BFQ assigns budgets, measured in number of sectors, to tasks instead of time slices. The disk is not granted to the active task for a given time slice, but until it has exahusted its assigned budget. This change from the time to the service domain allows BFQ to distribute the disk bandwidth among tasks as desired, without any distortion due to ZBR, workload fluctuations or other factors. BFQ uses an ad hoc internal scheduler, called B-WF2Q , to schedule tasks according to their budgets. Thanks to this accurate scheduler, BFQ can afford to assign high budgets to disk-bound non-seeky tasks (to boost the throughput), and yet guarantee low latencies to interactive and soft real-time applications.​

I/O performances on MiniCM10-4.1.0 /w 2.6.32.60 nAa-JB-05 :

here is a chart showing scheduler specific results,

the benchmarks were based on Antutu, regarding IO and SDcard R/W

my settings are :

122~729MHz

smartassH3

undervolted

KSM

zram 18%

swap file 128MB​

all i can say for now, is that SIO is the more balanced scheduler, and CFQ/VR are the worst ;)

here are the results

what does the chart shows us?

SIO is the more balanced scheduler, it has a good IO, and a good read/write

Anticipatory has the best IO, but a bad SDwrite

Deadline has the best SDwrite, but is quite average for IO and SDread

NOOP, CFQ and VR are a bit behind

for people using swap, i would say that they should use SIO or deadline, for others, Anticipatory or BFQ might be better

i ran the benchmark 4 times for each scheduler.​

source

Benchmarks history since stock rom here

MORE BENCHMARKS HERE

thanks to Heronger and some others helping to build this FAQ :)