What is the relationship between the working set of processes and thrashing? Group of answer choices A large working set can lead to less thrashing. The working set has no impact on thrashing. A large working set can lead to more thrashing. A small working set can lead to more thrashing.
Added by Amanda S.
Step 1
The working set of a process refers to the set of pages that a process is currently using or is likely to use in the near future. It is a dynamic collection of pages that reflects the process's recent memory access patterns. Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 87 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Consider the working set model with working set window ∆ = 3. Given the reference string of a process p: RS = y x x x x x x y y u x x y z y z w w z x x w w. What are the largest and smallest working set size and its corresponding working set that process p will ever have? If there are more than one working set, list them all.
Akash M.
'Why is chunking important for a good memory? One can encode more knowledge in sensory memory with smaller chunks. One can encode more knowledge in working memory with smaller chunks One can encode more knowledge in working memory with larger chunks. Chunking promotes retrieval of sensory memories.'
Nicole S.
Simulation Project 2: Influence of the Cache Size in Multiprocessor Purpose: Study the influence of the cache size on the miss rate during the execution of a parallel program in a SMP (symmetric multiprocessor). Development: Configure a system with the following architectural characteristics: Processors in SMP = 8. Cache coherence protocol = MESI. Scheme for bus arbitration = LRU. Word wide (bits) = 16. Words by block = 32 (block size = 64 bytes). Blocks in main memory = 524288 (main memory size = 32 MB). Mapping = Set-Associative. Cache sets = They will vary depending on the number of blocks in cache, but you must always have four-way set associative caches (remember: Number_of_ways = Number_of_blocks_in_cache / Number_of_cache_sets). Replacement policy = LRU. Configure the blocks in cache using the following configurations: 16 (cache size = 1 KB), 32, 64, 128, 256, 512, 1024, and 2048 (cache size = 128 KB). For each of the configurations, obtain the global miss rate for the system using the trace files: FFT. Discussion: Does the global miss rate increase or decrease as the cache size increases? Why? Does this increment or decrement happen for all the trace files? What does it happen with the capacity and conflict (collision) misses when you enlarge the caches? And, what does it happen with the compulsory and coherence misses when you enlarge the caches? Are there conflict misses in these experiments? Why? In these experiments, it may be observed that for great cache sizes, the miss rate is stabilized. Why? We can also see great differences of miss rate for a concrete increment of cache size. What do these great differences indicate? Do these great differences of miss rate appear at the same point for all the programs? Why? In conclusion, does the increase of cache size improve the multiprocessor system performance?
Aarya B.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD