13. In a process, both of the following lines execute in sequence. What will be size of shared memory ? Assume shmget() and shmctl) succeed. shmid = shmget((key_t)777, 6660, 0666 | IPC_CREAT); shmctl(shmid, IPC_RMID, 0); * Enter your answer

13. In a process, both of the following lines execute in sequence. What will be size of shared memory ? Assume shmget() and shmctl) succeed. shmid = shmget((key_t)777, 6660, 0666 | IPC_CREAT); shmctl(shmid, IPC_RMID, 0); * Enter your answer

Name: 13. In a process, both of the following lines execute in sequence. Wh
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 13. In a process, both of the following lines execute in sequence. What will be size of shared memory? Assume shmget() and shmctl) succeed.shmid = shmget((key_t)777, 6660, 0666| IPC_CREAT);shmctl(shmid, IPC_RMID, 0); *Enter your answer

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 21VE

See similar textbooks

Similar questions

Which fields in a log entry will the log processing function that has been specified have access to? Assuming 64-byte cache blocks and no prefetching, the following code calculates the average number of cache misses per entry.
Which fields inside an entry in a log file will be made available to be processed by the log processing function that has been specified? The following piece of code causes an average of how many cache misses per entry, assuming that cache blocks are 64 bytes in size and that no prefetching is performed.
32. Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes. Suppose each process P[i] executes the following: wait (m[i]);wait (m[(i+1) mode 4]); ......... release (m[i]); release (m[(i+1)mod 4]); This could cause a. Thrashing b. Deadlock c. Starvation, but not deadlock d. None of the above
Which of following is not true for virtual memory? a)In page table of virtual memory, if valid-invalid bit is invalid, then whether the page is in secondary storage or page is not in logical address space of that process b)A page fault occurs when a virtual adress that is referenced is not already loaded into physical address c)A program must be loaded to physical memory (RAM) completely for it to be executed d)Virtual memory makes it possible to execute programs that are larger than physical memory(RAM).
You have a virtual memory system with a two-entry TLB, a 2-way set associative cache and a page table for a process P. Assume cache blocks of 8 bytes and page size of 16 bytes. In the system below, main memory is divided up into blocks, where each block is represented by a letter. Two blocks equals one frame. A) Virtual address page 3, offset 7 results in a TLB hit or miss? If TLB hit, what’s the main memory frame? If TLB miss, would it result in a page fault? If not a page fault, what’s the main memory frame and what the physical address in binary? Explain your answers. B) Virtual address page 0, offset 1310 results in a TLB hit or miss? If TLB hit, what’s the main memory frame? If TLB miss, would it result in a page fault? If not a page fault, what’s the main memory frame? Explain your answers. C) Virtual address page 2, offset 3 results in a TLB hit or miss? If TLB hit, what’s the main memory frame? If TLB miss, would it result in a page fault? If not a page fault, what’s…
We use the concept "paging" to map logical address to physical address. If the process size is 9216 bytes, the page size is 2048 bytes, how many frames should be allocated to this process? Do we have fragment? If so, please indicate the size of fragment?
Assume the following scenario for multi-level paging used by a process that has following: a. Logical Address = 64 bits b. Page size = 1 M Byte c. Page table entry size = 4 Byte d. System is byte addressable. calculate the following. 1. Logical Address Space? 2. Maximum number of page table entries in a single page? 3. How many levels of page table entries will be used? 4. Compute the size of page tables at each level? 5. Compute the number of entries in a single page? 6. Compute the number of pages
Suppose a computer using direct mapped cache has 232 byte of byte-addressable main memory, and a cache of 1024 blocks, where each cache block contains 32 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag, block, and offset fields? c) To which cache block will the memory address 0x000063FA map?
Which fields within a log entry will the selected log processing function be able to access? The following code, which assumes 64-byte cache blocks and no prefetching, calculates the average number of cache misses per entry.
Which log input fields can the specified log processing function access? This code determines the average cache misses per entry for 64-byte cache blocks and no prefetching.
Draw a line between a cache that is fully associative and one that is directly mapped out.
Answer the following:I. Name any two interrupt/exceptions that can occur during IF and ID stagesII. Contrast superscalar and superpipelined modes of ILPIII. What is the role of write back buffers in write-through and write-back cachesIV. What is the impact of prefetcher on the different kinds of cache missesV. Illustrate why and what kind of hazards are addressed/not-addressed by registerrenaming