Asystem with two dual-core processors has four processors available for scheduling. A CPU-intensive application is running on this system. All input is performed at program start-up, when a single file must be opened. Similarly, all output is performed just before the program terminates, when the program results must be written to a single file. Between start-up and termination, the program is entirely CPU-bound. Your task is to improve the performance of this application by multi-threading it. The application runs on a system that uses the one-to-one threading model (each user thread maps to a kernel thread). 1. How many threads will you create to perform the input and output? Explain shortly. 2 How many threads will you create for the CPU-intensive portion of the application? Explain shortly.

Asystem with two dual-core processors has four processors available for scheduling. A CPU-intensive application is running on this system. All input is performed at program start-up, when a single file must be opened. Similarly, all output is performed just before the program terminates, when the program results must be written to a single file. Between start-up and termination, the program is entirely CPU-bound. Your task is to improve the performance of this application by multi-threading it. The application runs on a system that uses the one-to-one threading model (each user thread maps to a kernel thread). 1. How many threads will you create to perform the input and output? Explain shortly. 2 How many threads will you create for the CPU-intensive portion of the application? Explain shortly.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Consider the following processes and their associated threads running on a multiprocessor system: Process Thread Arrival Time CPU Burst I/O Burst Total CPU Time X X1 0 4 2 11 X2 3 2 4 5 X3 3 2 4 5 Y Y1 5 6 2 14 Y2 5 3 5 7 Z Z1 7 1 1 6 Z2 7 3 2 10 Create a scheduling simulation for these threads on a system with two (2) processors using the First Come First Served (FCFS) algorithm. A thread may migrate from one processor to another if it returns from blocked waiting time and 1) the processor it was running on previously is occupied with other work; and 2) and the other processor is available to execute the thread. If both processors are available when a thread becomes unblocked, it will remain on the processor it was most recently running on. In this simulation, you will be managing a single ready queue that schedules all processes. When two processes arrive in the ready queue at…
2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 i) Does this algorithm give higher priority to any queue over the others and any processes…
Consider a problem that might arise when the operating system of a computer employs many threads to do the same work.
With virtual memory, when a program requests memory,the memory management system does which of the following? Select one: A. It grants the request as long as there is enough physical memory to accommodate B. It looks up the address in the page table. If the address is in memory, then it grants the request. C. It looks up the address in the page table. If the address is in memory, it grants the request. If the address is stored to disk, it writes a section of memory to disk and then transfers the requested virtual memory address from disk to main memory. D. It causes a deadlock to occur.
Think about a problem that might arise when the operating system of a computer employs many threads to do the same operation.
Is utilising user-level threads better than using kernel-level threads? What distinguishes user-level threads from kernel-level threads? Is there ever a time when one kind is better than the other?