Question 11) Assume there are four threads T1, T2, T3 and T4 with 100 instructions each. The instructions in each thread are dependent on the previous instruction, (for example in thread TI, 12 is dependent on n, 13 on 12.. so on) so that if Il is issued in cycle x, 12 can be issued earliest at cycle x+2. The threads do not have any inter- thread dependency. Assume that each instruction takes one cycle to complete, and that the thread switching overhead is 2 cycles. a) Consider a single cycle MIPS processor with 1 PC and 1 Register File. If there is no interleaving of threads, meaning one thread completes before the start of the next thread, how many cycles are required for the completion of all four threads? b) For the same proocessor configuration, if there is a fine-grained multithreading of 1 instruction, what will be execution time in cycles for completion of all the four threads? Hint: 11 of T1 executes followed by a context switch to execute Il of T2... so on. If I1 of T1 is issued in cycdle 1, the 11 of T2 is issued in cycle 4 c) For the same processor configuration, if there is a coarse-grained multithreading of 10 instructions, how many cycles are required for the completion of all four threads?

Question 11) Assume there are four threads T1, T2, T3 and T4 with 100 instructions each. The instructions in each thread are dependent on the previous instruction, (for example in thread TI, 12 is dependent on n, 13 on 12.. so on) so that if Il is issued in cycle x, 12 can be issued earliest at cycle x+2. The threads do not have any inter- thread dependency. Assume that each instruction takes one cycle to complete, and that the thread switching overhead is 2 cycles. a) Consider a single cycle MIPS processor with 1 PC and 1 Register File. If there is no interleaving of threads, meaning one thread completes before the start of the next thread, how many cycles are required for the completion of all four threads? b) For the same proocessor configuration, if there is a fine-grained multithreading of 1 instruction, what will be execution time in cycles for completion of all the four threads? Hint: 11 of T1 executes followed by a context switch to execute Il of T2... so on. If I1 of T1 is issued in cycdle 1, the 11 of T2 is issued in cycle 4 c) For the same processor configuration, if there is a coarse-grained multithreading of 10 instructions, how many cycles are required for the completion of all four threads?

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

Consider a computation running on a machine with a 1 GHz clock, 4-word cache line, single cycle access to the cache, and 100 ns latency to DRAM. The computation has a cache hit ratio at 1 KB of 25% and at 32 KB of 90%. Consider two cases: first, a single threaded execution in which the entire cache is available to the serial context, and second, a multithreaded execution with 32 threads where each thread has a cache residency of 1 KB. If the computation makes one data request in every cycle of 1 ns, you may notice that the first scenario requires 400MB/s of memory bandwidth and the second, 3GB/s. How do we get these conclusions? If the computation makes one data request in every cycle of 1 ns, you may notice that the first scenario requires 400MB/s of memory bandwidth and the second, 3GB/s. How do we get these conclusions? Please type answer note write by hend.
In the discussion of ULTs versus KLTs, it was pointed out that a disadvantage of ULTs is that when a ULT executes a system call, not only is that thread blocked, but also all of the threads within the process are blocked. Why is that so?
In the four diagrams illustrated below, show which of them result in deadlock? For those situations that will result in deadlock, provide the cycle of resources and threads. For those situations which are not in deadlock, show by illustration the order in which the threads may complete their executions Consider a logical address of 128 pages of 1024 words each, mapped onto a physical memory of 64 frames. How many bits are there in the logical address? How many bits are there in the physical address? iii. What is the size of the page table?
Suppose that when run using a single thread, a particular program spends 20 seconds executing code that cannot be parallelized, and 280 seconds executing code that is highly parallelizable. Using Amdahl’s law, give an upper bound on the speedup (ratio of old to new execution time) that might be achieved for this program by exploiting parallel execution on a highly-parallel computer with thousands of processors/cores.
(Exercise 4.3) Which of the following components of program state are shared across threads in a multithreaded process? a. Register values b. Heap memory c. Global variables d. Stack memory (Exercise 4.4) Can a multithreaded solution using multiple user-level threads achieve better performance on a multiprocessor system than on a single processor system? Explain. (Exercise 4.6) Is it possible to have concurrency but not parallelism? Explain. (Exercise 4.9) A system 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 startup and termination, the program is entirely CPU-bound. Your task is to improve the performance of this application by multithreading it. The application runs on a system that…
a) Suppose two threads T1 and T2 are running concurrently in the same process with a single CPU. Suppose T1 does “Load X into register R1” machine instruction. Then the CPU scheduler switches the CPU to T2. Will T2 see the same vaue of R1 as loaded here by T1? (YES or NO)? Explain in less than 50 words. Be specific. (b) Suppose two threads T1 and T2 are running concurrently in the same process with a single CPU. Is it possible to have a moment (time instant) where both threads have made a request to Memory Unit to read some data (ex. as part of a “Load … into register …” instruction) and Memory Unit has not yet completed either of these two requests? Explain in less than 50 words.
in logical concurrency, the same instructions are executed concurrently on different processors instructions form different threads are actually executed on the same processor, but in interleaved order there can only be one thread instructions from different threads are executed on different processors
1. Consider a multi-threaded process with 10 threads. Thread 3 invokes an execlp() system call. Describe what will happen to each of the threads. 2. Suppose in a multithreaded process a thread makes a blocking system call. In which threading model(s) will this certainly result in a process blocking?
Suppose a double is in memory, and multiple threads are executing concurrently and contain code that changes the value. The final value of the double may depend on the order in which the concurrent threads accessed it, which is unpredictable to the programmer because it depends on very complicated decisions by the OS. This situation is called the instruction set problem type erasure a race condition competitive concurrency
Would you agree that suspended processes will always hold a zero (0) value for both read and write I/O operations? Is the number of threads directly proportional to the number of bytes written by the process in I/O operation?
Computer Science Consider a computation running on a machine with a 1 GHz clock, 8-word cache line, single cycle access to the cache, and 100 ns latency to DRAM. The computation has a cache hit ratio at 1 KB of 40% and at 32 KB of 70%. Consider three cases: (1) a single threaded execution without caches, (2) a single threaded execution in which the entire cache is available to the serial context, and (3) a multithreaded execution with 32 threads where each thread has a cache residency of 1 KB. Calculate the required bandwidths for all the three cases respectively.
Assume that you are now in possession of two SS CPUs. What is the total number of cycles that will be required for these two threads to finish executing? How much of the available issue slots are lost due to the presence of hazards?