Lolz i thought this an year before... n i ended up loosing all my information
I got all my games deletedI don't knw y but this is what happened to my card
Defragmenting only helps in pc not much in cellphones![]()
Phone:Sony X1i Silver Limited Edition running @ 710mhz
Rom: Dynamics GTX 2.2.0 W7U Edition(21689)
DualBoot: Android 2.1 ,2.2, and 2.3
Nice! This greatly improves performance and battery life
Now, you have to pick the right SSDs, random small write(< 1 erase block) speed is the slowest operation and major factor when deciding for a branch, take a look at this blog post, it may help you to decide.. The author is very respected.
Linus' blog: .. so I got one of the new Intel SSD's
If you use OpenEZX and want to support it, please click on "I USE THIS" on our ohloh project page: https://www.ohloh.net/projects/openezx
Last edited by Viper89; 01-29-2009 at 03:29 AM.
Phone:Sony X1i Silver Limited Edition running @ 710mhz
Rom: Dynamics GTX 2.2.0 W7U Edition(21689)
DualBoot: Android 2.1 ,2.2, and 2.3
It's debatable that there is not performance gain at all. Moving parts are not there; given.
But the access time should theoritically change if say
1. 1gig of data is all in a continuous stream
2. 1gig of data is strewn across the whole card in 200kb pieces. There still needs to be a resolution of the address of the next 200kb part, over 5000 times. All that logic takes time.
Hope i'm making sense.
Last edited by xetaman; 01-29-2009 at 08:43 AM.
yes its not gonna increase d speed but its just help in optimizing...
no, you are not
Specifically in the case of TF/SD cards, where the card does wear levelling on hardware, "continuous" is not continuous at all.
Also, with FAT filesystem, access is per block, not per stream, makes no difference if the data is contiguous, you will still read (file_size/block_size) blocks.
Anyway, you can test this yourself, mount a FAT filesystem with syncronous access (to disable fs cache), and:
Code:#change /tmp to your card mount point #create a contiguous file dd if=/dev/zero bs=1k count=1048572 of=/tmp/foo #measure reading time time dd=/tmp/foo of=/dev/null rm -f /tmp/foo #create a _very_ fragmented file dd if=/dev/zero bs=1k count=1048572 of=/tmp/foo & dd if=/dev/zero bs=1k count=1048572 of=/tmp/bar #measure reading time time dd=/tmp/foo of=/dev/null rm -f /tmp/foo /tmp/bar
If you use OpenEZX and want to support it, please click on "I USE THIS" on our ohloh project page: https://www.ohloh.net/projects/openezx
I get what your are saying and it makes sense. But you are not considering the logic calculation bit. That the same number of blocks have to be read is given. It is the calculation of the address of those respective blocks that i'm talking about.
In the case of a stream, it's always the next block. In the case of fragmented data, there is a pointer somewhere (either at the end of that block, or in a address table, fat, i guess), which needs to be referred and the destination calculated. This is what i think takes more time.
Last edited by Konig; 01-30-2009 at 09:14 AM.
-Remember me and smile, for it's better to forget than remember me and cry.-
motomaster™
*Gone forever to come Back*