Calculate the communication time

Assignment Help Operating System
Reference no: EM133028053

Question 1 A 2-processor system uses the Illinois (MESI) cache coherency protocol, and is powered-on with its caches initially empty. Each processor has enough local cache to fit the variables B and C simultaneously. The bus operation BusRdX requires 3 bytes of bus transfer, whereas all others require 16 bytes. After completing the following sequence of actions, give the total number of bytes transferred for each bus operation.
a. P1 loads variable B.
b. P2 loads variable C.
c. P1 loads variable C.
d. P2 modifies variable C.
e. P1 modifies variable B.

Question 2 For a machine with the communication overhead and network delay (message start-up time) of 200 ns and the asymptotic peak bandwidth of 5 GB/s, calculate the communication time as a function of the number of bytes sent n.
Considering a program that runs 100 times an operation sending each time 2.5MB, assuming that 10% of operation communication time is during other useful work of processor, calculate the communication cost.

Question 3 An uniprocessor application is parallelized for 4 processors, yielding a 3.8x speedup. Given the time breakdown of the various functions seen in the graph, what is the minimum total time that the uniprocessor application spent while Busy and in performing Data Access?

132_figure.jpg

Question 4 a) What is the difference between a write-through cache and a write-back cache? Why does using write-through caches in a shared memory multiprocessor not scale well to a large number of processors?

b) An alternative to the snooping cache coherence protocol is a directory-based scheme by which a table is maintained that shows where in the system is each cache line. Describe briefly the advantages and disadvantages of each system.

Question 5 Express a Test&Set instruction using LL and SC instruction using a pseudo-assembler code.

Question 6 Consider a bus-based shared memory multiprocessor system with write-through caches. It is constructed using 1.6 GHz processors, and a bus with a peak band- width of 50 Mega fetches/s. The caches are designed to support a hit rate of 90%. Only 15 % of program execution time is related to Read and Write commands. Assuming that each Read/Write instruction takes 2 clock cycles on average, what is the maximum number of processors that can be supported by this system?

Question 7 A uniprocessor application is parallelized for 3 processors, with time breakdowns of various functions seen in the table below. Find the maximum total speedup that is achieved through the parallelization.

Question 8 Given the following code segments, what results are possible (or not possible) under sequential consistency for cases a and b below? Assume that all variables are initialized to 0 before this code is reached.

c. In the following sequence, first consider the operations within a dashed box to be part of the same instruction, say a fetch&increment. Then, suppose they are separate instructions. Answer the above questions for both cases.

Question 9 The figure below shows network transactions assuming the simple directory based cache coherency protocoL

a) Use this figure to produce the sequence of events in a generic write-through invalidate directory-based machine for a write operation by a processor i, in the case when the dirty bit is ON.

b) Describe what happens with all the required transactions when considering the update protocol.

Question 10. Consider a bus-based shared memory multiprocessor system with write-back caches using the basic MSI cache coherence protocoL It is constructed using 1.6 GHz processors, and a bus with a peak band- width of 50 Mega fetches/s. The caches are designed to support a hit rate of 90%. Only 15 % of program execution time is related to Read and Write commands, and 5% cache operations result in writebacks. Assuming that each Read/Write instruction takes 2 clock cycles on average, what is the maximum number of processors that can be supported by this system?

Reference no: EM133028053

Questions Cloud

What nominal rate compounded semi-annually : If RRSP contributions of $3430.02 at the end of every six months are projected to generate a plan worth $540,000. What nominal rate compounded semi-annually
Evaluate the change in productivity for aztec : Evaluate the change in productivity for Aztec using the new assembly process. (Round answer to 1 decimal place, e.g. 25.3%.)
What is the npv ofthe purchase : The new monitor would save $460,000 per year before taxes and operating costs. What is the NPV ofthe purchase
What are the hrm problems faced by hotel quarantine staff : What are the HRM problems faced by hotel quarantine staff and aged care organisations during covid-19? and what are the recommendations to overcome these issues
Calculate the communication time : Describe what happens with all the required transactions when considering the update protocol - what is the maximum number of processors that can be supported
Comprehensive job evaluation program : Do you believe that wagws should be based on a comprehensive job evaluation program? justify your answer.
What is the instrumentation of the symphony : In what ways does the orchestra create variations of the opening theme?
What is the selection ratio : TailorMade makes custom business suits for men and women. Items are made within 24 hours of the order being received, and this rapid turnaround is due to their
Determine amount of us dollars that new york co will need : Assume that interest rate parity exists. Determine the amount of U.S. dollars that New York Co. will need in two years to make its payment

Reviews

len3028053

11/12/2021 9:50:51 PM

HIS IS A PARALLEL PROGRAMMING COURSE ASSIGNMENT NOT OS. SO PLEASE TAKE THE ASSIGNMENT ACCORDINGLY

Write a Review

Operating System Questions & Answers

  Implementation of algorithms for process management

The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that use the shortest CPU cycle will be selected for running rst.

  Develop a user mode command interpreter

Develop a user mode command interpreter which support list-short.

  Memory allocation in operating system

Analysis and implementation of algorithms for memory allocation in operating system, Explain First- t and best- t methods are used in memory allocation in operating systems.

  Stand alone child process

Forking the child process

  Write a multi-threaded program

Write a multi-threaded program to solve producer and consumer problem

  Marginal and average cost curves

n a competitive market place (pure competition) is it possible to continually sell your product at a price above the average cost of production.

  Simulating operating systems scheduling

Simulate the long-term scheduler, the short-term scheduler and the I/O scheduler of the computer using the First-Come-First-Serve algorithm.

  Issues with trusted platform module

Research paper discussing the issues with Trusted Platform Module (TPM)

  Threads

Explain a complication that concurrent processing adds to an operating system.

  Design and programming

Use the semaphore methods to control the concurrency of the solution

  Virtual machines

Virtual machines supported by a host operating system

  Discuss an application that benefits barrier synchronization

Discuss an application that would benefit from the use of barrier synchronization

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