SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 304 Weeks Ago, 6 Days Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 21 Nov 2017 My Price 10.00

Consider a computer that you have used or now use.

Hi need assistance with the attached file. Please provide clear solutions in word format.

Week 5 Discussion

 

Cache and Memory Mapping

 

 

Part I

Consider a computer that you have used or now use. (You may make an assumption on word size if needed.)

·          How large is the memory of the computer?

·          How long is a word in the computer above?

·          How many bits are required to address the bytes in that memory?

·          How many data lines are required to read data from the computer memory?

 

 

Part II

·          Does your computer have cache?

·          If so how big is it?

·          How does your cache size compare with the size of main memory?

·          Do you know what kind of cache it is?

·          How did you find out about your computer's cache?

 Make an assumption that your cache is either:

·          Fully associative

·          Direct mapped

·          Two-way set-associative

·          Four-way set-associative

 Using the relationships in Part I above, determine:

 the size of the Tag and Word for Associative cache;

 OR

 the size of the Tag, Line, and Word for Direct-Mapped Cache ;

 Or

 the size of Tag, Set, and Word for K-Way Set-Associative Cache.

 

You may make any assumptions necessary including the number of Words in each block (recommend 2 or 4 or 8)

 

 

Part III

Given the following:

·          Logical Memory size of 1000

·         Physical Memory size of 2000

·         Page (and frame) size of 100

·         Block A contains data for a program

Select Block A’s size and its starting point in both memories. Then write the page table for Block A based on your selections.  

See below for the layout of both memories and an example of Block A of size 200.

 

Logical Memory                               Physical Memory

location/ page                                    location/frame

0     to     99/ 0

 

0     to     99/ 0

100 to 199 /1     Block A

100 to 199/ 1

200 to 299/ 2     Block A

200 to 299/ 2

300 to 399/ 3

300 to 399/ 3

400 to 499/ 4

400 to 499/ 4

500 to 599/ 5

500 to 599/ 5

600 to 699/ 6

600 to 699/ 6

700 to 799/ 7

700 to 799/ 7

800 to 899/ 8

800 to 899/ 8

900 to 999/ 9

900 to 999/ 9

 

1000 to 1099/ 10

1100 to 1199/ 11

1200 to 1299/ 12

1300 to 1399/ 13         Block A

1400 to 1499/ 14        Block A

1500 to 1599/ 15

1600 to 1699/ 16

1700 to 1799/ 17

1800 to 1899/ 18

1900 to 1999/ 19

 

 

Page

Frame

1

13

2

14

 

 

 

Part IV

 

Discuss the pros and cons of paging.

 

Attachments:

Answers

(5)
Status NEW Posted 21 Nov 2017 02:11 PM My Price 10.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)