Concurrency and interleaving

Problem: a concurrent program with two processes, p and q,defined as follows, A,B,C,D, and E are arbitrary atomic (indivisible) statements. Assume that the main program (not shown) does a parbegin of the two processes. void p() { A; B; C; } void q() { D; E; } Show all the possible interleavings of the execution of the preceding two processes(show this by giving execution “traces” in terms of the atomic statements).

memory protection

Why is it not possible to enforce memory protection at compile time?

Compute the size of pointer to a partition in the process table, under fixed partitioning scheme.

Consider a fixed partitioning scheme with equal-size partitions of 2^16 bytes and a total main memory size of 2^24 bytes. A process table is maintained that includes a pointer to a partition for each resident process. How many bits are required for the pointer?

Consider a simple paging system with 2^32 bytes of physical memory, page size of 2^10 bytes, and 2^16 pages of logical address space. Answer the given questions on page table, and physical and logical addresses for this system.

Consider a simple paging system with the following parameters: 2^32 bytes of physical memory, page size of 2^10 bytes, and 2^16 pages of logical address space. a. How many bits are in a logical address? b. How many bytes in a frame? c. How many bits in the physical address specify the frame? d. How many entries in the page table? e. How many bits in each page table entry? Assume that each page table entry includes a valid/invalid bit.

Why is the principle of locality crucial to the use of virtual memory?

Why is the principle of locality crucial to the use of virtual memory?