Sujet : Re: (Almost) Rock-n-Roll - "The Bunny Hop" (1953)
De : 186283 (at) *nospam* ud0s4.net (186282@ud0s4.net)
Groupes : comp.os.linux.miscDate : 10. Jan 2025, 08:58:46
Autres entêtes
Organisation : wokiesux
Message-ID : <s8mdnU91-9aqTh36nZ2dnZfqnPudnZ2d@earthlink.com>
References : 1 2 3 4
User-Agent : Mozilla/5.0 (X11; Linux x86_64; rv:78.0) Gecko/20100101 Thunderbird/78.13.0
On 1/10/25 2:11 AM, The Natural Philosopher wrote:
On 10/01/2025 00:33, 186282@ud0s4.net wrote:
I've been trying to find out
if with modern 'flat address space' CPUs there's
any speed advantage in setting functions and
data blocks at specific addresses - what in the
old days would have been 'page boundaries' or
such. In short does an i7 or ARM and/or popular
mem-management chips have less work to do setting
up reading/writing at some memory addresses ?
Maybe a critical app could run ten percent faster
if, even 'wasting' memory, you put some stuff in
kind of exact places. Older chips with banked
memory and even mag HDDs, the answer was Yes.
Mm.
I don't think so. About the only thing that is proximity sensitive is cacheing. That is you want to try and ensure that you are operating out of cache, but the algorithms for what part of the instructions are cached and what are not is beyond my ability to identify, let alone code in...
I did a lot of searching but never found a
good answer. IF you can do stuff entirely
within CPU cache then it WILL be faster.
Alas not MUCH stuff will be adaptable to
that strategy - esp with today's bloatware.
We MAY be talking maker/sub-brand specifics ...
intel i3/i5/i7/i9 may all be different. Different
gens different yet. ARMs too.
Seems that CPUs and MMUs can do certain register
ops faster/easier than others - fewer calx and
switching settings. Therein my quest. If you want
some code to run AS FAST AS POSSIBLE it's worth
thinking about.