QuestionQuestion

Transcribed TextTranscribed Text

1. Suppose a computer using direct mapped cache has 2°2 byte of byte-addressable main memory, and a cache of 1024 blocks, where each cache block contains 32 bytes. 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, block, and offset fields? c) To which cache block will the memory address 0x000063FA map? 2. Suppose a computer using fully associative cache has 224 bytes of byte-addressable main memory and a cache of 128 blocks, where each cache block contains 64 bytes. 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 address 0x01 D872map? 3. Suppose a byte-addressable computer using set associative cache has 2² byes of main memory and a cache of 64 blocks, where each cache block contains 4bytes. 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? 4. Suppose we have 210 bytes of virtual memory and 2 bytes of physical main memory. Suppose the page size is 24bytes. a) How many pages are there in virtual memory? b) How many page frames are there in main memory? c) How many entries are in the page table for a process that uses all of virtual memory? 5. For the system in problem 4, suppose a main memory access requires 30ns, the page fault rate is .01%, it costs 12ms to access a page not in memory (this time includes the time necessary to transfer the page into memory, update the page table, and access the data) Also suppose a TLB hit requires 7ns, the cache miss rate is 3%, the TLB hit rate is 95%, a cache hit requires 15 ns. On a TLB or cache miss, the time required for access includes a TLB and/or cache update, but the access is not restarted. On a page fault, the page is fetched from disk, all updates are performed but the access is restarted. All references are sequential (no overlap, nothing done in parallel) a) Calculate the time for a TLB hit and a cache hit. b) Calculate the EAT (effective access time) for a TLB hit. 6. A system implements a paged virtual address space for each process using a one- level page table. The maximum size of virtual address space is 32MB. The page table for the running process includes the following valid entries (the - notation indicates that a virtual page maps to the given page frame, that is, it is located in that frame): Virtual page 3 - page frame 6 Virtual page 5 - page frame 10 Virtual page 8 - page frame 5 Virtual page 4 - page frame 2 Virtual page 0 - page frame 1 The page size is 2048 bytes and the maximum physical memory size of the machine is 4MB. a) How many bits are required for each virtual address? b) How many bits are required for each physical address? c) What is the maximum number of entries in a page table? d) To which physical address will the virtual address Ox37F translate? e) Which virtual address will translate to physical address Ox1203?

Solution PreviewSolution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

    By purchasing this solution you'll be able to access the following files:
    Solution.docx.

    $83.00
    for this solution

    PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

    Find A Tutor

    View available Systems Architecture Tutors

    Get College Homework Help.

    Are you sure you don't want to upload any files?

    Fast tutor response requires as much info as possible.

    Decision:
    Upload a file
    Continue without uploading

    SUBMIT YOUR HOMEWORK
    We couldn't find that subject.
    Please select the best match from the list below.

    We'll send you an email right away. If it's not in your inbox, check your spam folder.

    • 1
    • 2
    • 3
    Live Chats