Assume a CUDA device's SM (streaming multiprocessor) can take up to 2,048 threads and up to 4 thread blocks. Which of the following block configuration would result in the greatest number of threads in each SM? (More than one correct answer is possible, select all correct answers.) a. 256 threads per block b: 512 threads per block c: 2048 threads per block d: 1,024 threads per block

Assume a CUDA device's SM (streaming multiprocessor) can take up to 2,048 threads and up to 4 thread blocks. Which of the following block configuration would result in the greatest number of threads in each SM? (More than one correct answer is possible, select all correct answers.) a. 256 threads per block b: 512 threads per block c: 2048 threads per block d: 1,024 threads per block

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 26VE

See similar textbooks

Similar questions

Suppose a computer using set associative cache has 216 words of main memory and a cache of 128 blocks, and each cache block contains 8 words. If this cache is 2-way set associative, what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, set, and offset fields?
A cache is set up with a block size of 32 words. There are 64 blocks in cache and set up to be 4-way set associative. You have byte address 0x8923. Show the word address, block address, tag, and index Show each access being filled in with a note of hit or miss. You are given word address and the access are: 0xff, 0x08, 0x22, 0x00, 0x39, 0xF3, 0x07, 0xc0.
Suppose a computer using direct mapped cache has 232 words of main memory, and a cache of 1024 blocks, where each cache block contains 32 words. How many blocks of main memory are there? 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? To which cache block will the memory reference 0003101A16 map?
A cache memory has a line size of eight 64-bit words and a capacity of 4K words. The main memory size that is cacheable is 1024 Mbits. Assuming 4-way set associative mapping and that the addressing is done at the byte level. What is the format of the main memory addresses (i.e s-d, d, and w)? For the hexadecimal main memory location 2BFACEDH, find the corresponding 4-way set-associative memory format
Suppose a byte-addressable computer using set associative cache has 2^24 bytes of main memory and a cache size of 64K bytes, and each cache block contains 32 bytes. a) If this cache is 2-way set associative, what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, set, and offset fields? b) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache?
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 a certain computer, the virtual addresses are 32 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 16 kB and the word size is 2 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 64 valid entries. Hit ratio of TLB is 100% then maximum number of distinct virtual addresses that can be translated is K.
A processor uses 2-level page tables for virtal to physical address translation. Page tables for hoth levels are stored in the main memory, Virtual and physical addreses are both 12 bits wide. The memory is byte adressable. For virtual to physical address translation, the 10 most significant bits for the virmal address are used as index into the first level poge table while the next 10 bits are used as index into the second level page table. The 12 least significant bits of the virtual address are used as offset within the page. Assume that the page table entries in both levels of page tables are 4 bytes wide. Further, the processor has a translation look-aside a buffer (TLB), with a hit a rate of 96% The TLB caches recently used virtual page numbers and the corresponding physical page numbers The processor also has a physically addressed cache with a hit rate of 90%. Main memory access time is 10 ns, cache access time is 1 ns, and TLB access time is also 10 ns. 26. Assuming that no…
Suppose a computer using fully associative cache has 224 words of main memory and a cache of 128 blocks, where each cache block contains 64 words. How many blocks of main memory are there? What is the format of a memory address as seen by the cache, that is, what are the sizes of the tag and word fields? To which cache block will the memory reference 01D87216 map?
Task: Given two matrices X and Y, multiply them in parallel to store the result in matrix Z You should write an openMP program with the following points in consideration: Analyze the speedup and efficiency of the parallelized code. Vary the size of your matrices from 100,1000, and 2000 and measure the runtime with one thread. For each matrix size, change the number of threads from 2,4,8., and plot the speedup versus the number of threads. Compute the efficiency. Explain whether or not the scaling behavior is as expected.
Two threads (A and B) are concurrently running on a dual-core processor that implements a sequentially consis- tent memory model. Assume that the value at address (R10) is initialized to 0. The instruction st immediate, (R10) writes an immediate number into the memory address stored in R10. Thread A (core 1) 1: st 0x1, (R10) 2: ld R1, (R10) 3: st 0x2, ld R2, (R10) 4: (R10) Thread B (core 2) 1: st 0x3, (R10) 2: ld R3, (R10) 3: st 0x4, (R10) 4: ld R4, (R10) After both threads have finished executing, you find that (R1, R2, R3, R4) = (1, 2, 3, 4). How many different instruction interleavings of the two threads produce this result (please show all possible interleavings)?
Suppose a computer using fully associative cache has 224224 words of main memory and a cache of 512 blocks, where each cache block contains 16 words. 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 and offset fields? c. To which cache block will the memory reference 1604181616041816 map? Also... Suppose a computer using set associative cache has 216216 words of main memory and a cache of 128 blocks, and each cache block contains 8 words. a. If this cache is 2-way set associative, what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, set, and offset fields? b. If this cache is 4-way set associative, what is the format of a memory address as seen by the cache?