Question 1 (Processes) a. A multi-programmed system with a single CPU has a very large number of CPU bound processes running on it that all have the same priority. Could you think of a CPU scheduling algorithm that would combine the lowest possible response times with the highest possible throughput and no starvation? Briefly explain your answer. b. Some operating systems force a context switch when a mutex (or spinlock) has been spin- ning for too long. List two reasons why this approach may be useful. c. This question relates to threads. Assume two user threads that increment a shared counter. The code runs on a multi-core system. Is it possible to obtain a concurrent implementation that is free of race conditions without using mutexes or semaphores (yes / no)? Briefly explain your answer. d. Figure 1 illustrates the times at which 10 different processes run on a single core of a single CPU. Every "row" represents a different process. The times increase towards the right, and processes with a higher priority are shown on top of the figure, processes with a lower

Question 1 (Processes) a. A multi-programmed system with a single CPU has a very large number of CPU bound processes running on it that all have the same priority. Could you think of a CPU scheduling algorithm that would combine the lowest possible response times with the highest possible throughput and no starvation? Briefly explain your answer. b. Some operating systems force a context switch when a mutex (or spinlock) has been spin- ning for too long. List two reasons why this approach may be useful. c. This question relates to threads. Assume two user threads that increment a shared counter. The code runs on a multi-core system. Is it possible to obtain a concurrent implementation that is free of race conditions without using mutexes or semaphores (yes / no)? Briefly explain your answer. d. Figure 1 illustrates the times at which 10 different processes run on a single core of a single CPU. Every "row" represents a different process. The times increase towards the right, and processes with a higher priority are shown on top of the figure, processes with a lower

Name: Question 1 (Processes)a. A multi-programmed system with a single CPU
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Question 1 (Processes)a. A multi-programmed system with a single CPU has a very large number of CPU boundprocesses running on it that all have the same priority. Could you think of a CPU schedulingalgorithm that would combine the lowest possible res

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Explain why implementing synchronization primitives by disabling interrupts is not appropriate in a single-processor system if the synchronization primitives are to be used in user-level programs.
assuming that there are two processes in secondary memory that are prepared to run. The first process is the most crucial, whilst the second is the least crucial, in terms of the processes. One process can only be active at once in the main memory. Describe how the CPU carries it out. You have the choice to describe the procedure utilizing any part of the CPU.
assuming that there are two processes in secondary memory that are prepared to run. The first process is the most crucial, whilst the second is the least crucial, in terms of the processes. One process can only be active at once in the main memory. Describe how the CPU carries it out. You have the choice to describe the procedure utilizing any part of the CPU.
Indicate whether each of the following statements is true or false and justify your answer with reasoning and supportive or counter examples: (a) The CPU computations and I/O operations cannot be overlapped in a multipro- grammed computer. (b) Synchronization of all PEs in an SIMD computer is done by hardware rather than by software as is often done in most MIMD computers. (c) As far as programmability is concerned, shared-memory multiprocessors offer sim- pler interprocessor communication support than that offered by a message-passing multicomputer.
Explain why implementing synchronization primitives by disabling interrupts is not appropriate in a single-processor system if the synchronization primitives are to be used in user-level programs.
Indicate whether each of the following statements is true or false and justify your answer with reasoning and supportive or counter examples: (a) The CPU computations and I/O operations cannot be overlapped in a multipro- grammed computer. (b) Synchronization of all PEs in an SIMD computer is done by hardware rather than by software as is often done in most MIMD computers. (c) As far as programmability is concerned, shared-memory multiprocessors offer sim- pler interprocessor communication support than that offered by a message-passing multicomputer.
Is it still feasible to accomplish pipelined execution even if the time it takes to execute pipeline instructions is not balanced? Where can you perceive the inefficiencies in this situation?
18 What is speculation as it relates to parallelization? It is the set of instructions that issues together in one clock cycle and the packet may be determined statically by the compiler or dynamically by the processor. It is a style of instruction set architecture that launches many operations that are defined to be independent in a single wide instruction, typically with many separate opcode fields. It is the number of clock cycles between a load instruction and an instruction that can use the result of the load without stalling the pipeline. O It is an approach whereby the compiler or processor guesses the outcome of an instruction to remove it as a dependence in executing other instructions.
Suppose two secondary memory processes exist; wait to execute. In view of phase 1, the priority is high and the other priority is lowest. Just one process will simultaneously fit into the main memory. Explain how CPU is running on it? Can you describe the mechanism among all CPU components?
Under what circumstances does Round Robin Scheduling provide the lowest CPU usage rate?
In the software event-based system (with cooperative multithreading): b) What are the tasks of interrupt service routines in this system?
Assume two secondary memory processes exist. In light of phase 1, one priority is higher than the other. Only one process can fit in main memory. How does the CPU work on it? Can you explain the whole CPU mechanism?