Compute the effective instruction time on the system, Operating System

Assignment Help:

Q. An operating system sustains a paged virtual memory using a central processor with a cycle time of 1 microsecond. It costs an additional one microsecond to access a page other than the current one. Pages have 1000 words as well as the paging device is a drum that rotates at 3000 revolutions per minute and transfers one million words per second. The subsequent statistical measurements were obtained from the system:

  • One percent of all instructions implemented accessed a page other than the current page.
  • An instructions that accessed another page 80 percent accessed a page already in memory.
  • When a fresh page was required the replaced page was modified 50 percent of the time.

Compute the effective instruction time on this system assuming that the system is running one process only in addition to that the processor is idle during drum transfers.

Answer:

Effective access time                                                  = 0.99 × (1 μ sec + 0.008 × (2 μ sec)

+ 0.002 × (10,000 μ sec + 1,000 μ sec)

+ 0.001 × (10,000 μ sec + 1,000 μ sec)

= (0.99 + 0.016 + 22.0 + 11.0) μ sec

= 34.0 μ sec


Related Discussions:- Compute the effective instruction time on the system

Explain beladys anomaly, Explain Belady's Anomaly? Also called FIFO ano...

Explain Belady's Anomaly? Also called FIFO anomaly. Usually, on enhancing the number of frames allocated to a process virtual memory, the process implementation is faster, beca

Describe the main architectural layers of windows xp, Q. Describe the three...

Q. Describe the three main architectural layers of Windows XP? Answer: (1) The HAL (Hardware Abstraction Layer) creates operating system portability by hiding hardware differ

Determine the minimum number of units of resource, An operating system invo...

An operating system involves 3 user processes each one requiring 2 units of resource R .The minimum number of units of R like no deadlocks will ever take place is The minimum

Define lazy swapper, Define lazy swapper. Rather than swapping the enti...

Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne

Solve a generalized dining philosopher problem, In this project, you will i...

In this project, you will implement the Chandy and Misra's (CM) algorithm using POSIX Threads (Pthreads).   The algorithm  is a distributed algorithm to solve a generalized dining

Assignment, i need the job to be done within 3 days

i need the job to be done within 3 days

Explain direct sequence-analog signal, 1. A digitized voice channel is made...

1. A digitized voice channel is made by digitizing a 7 KHz bandwidth analog signal. The signal is to be sampled twice the highest frequency (two samples per hertz) . Assume each sa

Define deadlock, Define deadlock. A process requests resources; if the ...

Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd