On 6 Jan 1999, Michael Hohmuth wrote:
"Adam 'WeirdArms' Wiggins" awiggins@cse.unsw.edu.au writes:
Can anyone explain whats different/new about the planned next-generation mapping tree for fiasco? I'd appreciate a detailed explination if anyones got the time.
The new thing about the new mapping database is that its data structures are much smaller. It uses compact linear arrays of fixed sizes, instead of elements linked in binary trees, to store the mapping trees for a given physical page frame.
Would an assembler based L4 benifit from this new mapping tree data base too? It certainly sounds easier to handle memory for. I'm trying to work out my dynamic data structures now. So far i have TCB's (512 bytes), 1st level page table entries 16K, 2nd level page table entries 1K, mapping tree nodes ??? no idea yet. I got Lukas's paper but i failed german in my high school years :( I'm trying to get it translated. It there any code somewhere i can look at which would illistraight it? Or does lukas have the time to give me an english run down?
Cheers Adam