ExampleLet Main Memory be 2MB as the most. Therefore L = 21.
With such a small memory lets keep granularity high, say 1 KB per frame, that is: F = 1024.
#Linear Address fields:
d = log2 (F) = 10
P = L - d = 21 - 10 = 11
#Matrix entry:
A = P = 11
We have 4 control bits so the entry would be: 11 + 4 = 15 bits. Since this is kind of odd, we round to 16 bits and tell programmers we have let a "reserved bit", which sounds very technical.
#Trans Table size:
N = 2^P = 2048
So we have 2K x 16 bits (4KB) per process.
#Matrix size:
Let say we want to allow up to 128 simultaneous processes.
M = N * S = 2048 * 128 = 262,144
That is 256 Kwords (512 KB).
If we can afford to build this Matrix, then our system can be described as following:
- Main memory : 2 MB max
- Sim. Processes : 128 max
- Matrix size : 256K x 16 bits (512 KB).
(not too bad...)
|
Homebuilt CPUs WebRing
JavaScript by Qirien Dhaela
Join the ring?
David Brooks, the designer of the Simplex-III homebrew computer, has founded the Homebuilt CPUs Web Ring. To join, drop David a line, mentioning your page's URL. He will then add it to the list.
You will need to copy this code fragment into your page.
Project start date: May 13 of 2009
|