5
votes
Accepted
Question about Context Switching
What I think is meant by "kernel registers" in this context is any values that are stored in registers within the kernel itself.
Note: In what follows, I'm going to talk about what happens ...
3
votes
Accepted
How does caching, paging, virtual memory, and OS all tie together for UNIX copy-on-write?
It seems like your understanding of the matter is pretty good. You are just missing one tiny trick: Make the pages read-only.
When the OS forks the process, it maps ...
2
votes
Is communication between processes really important for a OS or is it just a convenience?
Here are some examples of communication between processes that may not have occurred to you:
Terminal I/O. Any text-based program needs to communicate with a terminal program somehow.
Application ...
1
vote
Is communication between processes really important for a OS or is it just a convenience?
Am I missing something here
Yes, you are.
However how much important is that?
It is one of the most important problems when you write a multi-process program. It is quite complicated topic in ...
1
vote
What does the data field store?
"Data field" is not the usual term. The usual term that we use is "segment".
There are essentially five kinds of "data" that a process can use:
Stack. You know what the ...
1
vote
Page allocation for a program
It depends on the operating system, in general. Some don't load the first code page, but let the load-on-demand system handle that!
The ABI does determine the state of the user program at the point ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
process-scheduling × 153operating-systems × 98
scheduling × 32
algorithms × 17
threads × 15
os-kernel × 12
concurrency × 11
terminology × 8
computer-architecture × 8
cpu × 8
optimization × 7
synchronization × 7
multi-tasking × 7
memory-management × 6
virtual-memory × 6
real-time × 6
paging × 5
parallel-computing × 4
deadlocks × 3
distributed-systems × 2
greedy-algorithms × 2
computer-networks × 2
memory-hardware × 2
mutual-exclusion × 2
graphs × 1