🚀 go-pugleaf

It is possible to do BITBLT very fast indeed using an interleaved memory
and a very smart addressing/organisation scheme.  This is described in

B. Chor, C.E. Leiserson, R.L. Rivest, J.B. Shearer,
An application of number theory to the organisation of raster-graphics
memory.
JACM V33 N1 Jan 86 pp 86-104.

"The memory organisation is based on a doubly-periodic assignment of pixels
to M memory chips according to a 'fibonacci' lattice.  The memory
organisation guarantees that, if a rectilinearly oriented rectangle 
contains fewer than M/sqrt(5) pixles then all pixels will reside in 
different memory chips and can thus be accessed simultaneously."

This would seem to provide a neat attack on the problems of overheads in
small BITBLTs.

Has anyone actually done this?

I don't really understand the scheme.  I would be very grateful if someone
could give me a words-of-one-syllable account.

It does seem to use some vary interesting ideas.

Yours in fascination,

Paul Kelly.