] Erm nope. There are two types of action. (1) Searching memory. This has to
] be done only once, so speed it not really an issue here. (2) Switching
] memory. This has to be done quite often, but not that often, so speed is
] interesting here. But not really for a copier... Anyway, Memman is slightly
] slower now but hardly.
The main problem with memman is that you can get memory from different slots.
And you do not know in advance in which order the memory will be allocated.
So, in the worst case scenario, each and every memory switch is a slotswitch
between memory in different subslots. Not just a memorymapper switch.
Switching memory between subslots is even too slow for a copier. The gap
between two consecutive sectors will be passed completely by the time that
the memoryswitch is done. Hence, you have to wait an entire track rotation
when that happens.
The only thing you can do about this, is first allocating all memory via
memman and then examining how the memory is divided over the different slots.
Then you can make sure that you keep the slotswitching to a bare minimum.
Kind regards,
Alex Wulms
--
Alex Wulms/XelaSoft - MSX of anders NIX - Linux 4 ever
See my homepage for info on the *** XSA *** format
http://www.inter.nl.net/users/A.P.Wulms
****
MSX Mailinglist. To unsubscribe, send an email to [EMAIL PROTECTED] and put
in the body (not subject) "unsubscribe msx [EMAIL PROTECTED]" (without the
quotes :-) Problems? contact [EMAIL PROTECTED] (www.stack.nl/~wiebe/mailinglist/)
****
