🚀 go-pugleaf

Hi.  Well, here is my two bits:

Virtual memory:
--------------

Since messages are non-replicating, it will be necessary to have
shared segments.  All private allocations should be read only.
Somebody mentioned something about paging of CHIP mem.  No good.
Blitter DMA would trash stuff.  As for virtual memory scheme overall:
Please keep a dirty list and try to keep a few segments free.  In
practice it seems that it is better to try to keep a few pages free,
rather than trying to allocate everything possible.  This helps when a
new process is forked, and it is looking for pages.

Resource tracking:
-----------------
Why not create a list.  Each node could have a pointer to its corresponding
task/process.  Each node would also contain a list of all things allocated
to that process.  This method would not necessitate as many drastic changes
in current system structures.

Of course, I may be completely off.  If so, somebody please put me in my
place.
	

			See ya, Ralph

 
gilgalad@caen.engin.umich.edu     gilgalad@dip.eecs.umich.edu
gilgalad@goliath.eecs.umich.edu   Ralph_Seguin@ub.cc.umich.edu
gilgalad@sparky.eecs.umich.edu    USER6TUN@UMICHUB.BITNET

Ralph Seguin               |  In order to get infinitely many monkeys to type
11010 Lighthouse Dr. #234  | something that actually makes sense, you need to
Belleville, MI 48111       | have infinitely many monkey editors as well.
(313) 697-1048