Messages in this thread | | | Subject | Re: Macintosh kernel out | Date | Tue, 28 May 1996 00:33:04 -0500 (CDT) | From | (Mike Castle) |
| |
Amazingly enough Linus Torvalds said: > it). It results in good context switch numbers, though, because you don't have > to switch the page tables or invalidate the TLB. It also means that you can
Can this be/ is this accomplished with linux and cloned processes?
One thing about light weight processes is the smaller context switching time between threads, compared to the larger context time needed between processes.
With cloned processes, can this be accomplished? Would it need redoing the scheduler to try to run cloned pids next to each other, and doing less work then (or would the code necessary to accomplish this out weigh smaller context switching time).
I don't remember seeing this discussed before, but I may have just missed it.
mrc -- Mike Castle .-=NEXUS=-. Life is like a clock: You can work constantly mcastle@cs.umr.edu and be right all the time, or not work at all mcastle@umr.edu and be right at least twice a day. -- mrc We are all of us living in the shadow of Manhattan. -- Watchmen
| |