The implementation of a shared


The purpose of this lab is to introduce you to the layout and structure of the MarsIDE development tool in addition to Array programming and console commands. In this lab, Fibonacci numbers are generated and printed in the console of the MIPS environment.

1. The implementation of a shared memory can be done by three main methods:

I. A multiplexed uniprocessor in which the runtime system and/or OS occasionally preempt and swap threads and there are interleaved with no parallelism mechanism

II. Hardware multithreading where tolerate pipeline latencies and higher efficiency can happen.

III. Multiprocessing where multiply execution resources and higher peak performance happen.

Discuss two possible problems that may occur when using multiprocessors with a shared memory. Propose two different solutions to these problems.

Consider the hardware and the software needed in your proposed solutions. Don't try to find an existing solution in the market. The goal here is to think and propose your own solution.

2. Think of a topology as a network's virtual shape or structure. This shape does not necessarily correspond to the actual physical layout of the devices on the network. For example, the computers on a home LAN may be arranged in a circle in a family room, but it would be highly unlikely to find a ring topology there.

What are the advantages and disadvantages of the processor network topologies? Identify the different applications and environments that are suitable for each physical topology. Is there a relationship between the computer network topologies and processor network topologies? Explain.


Attachment:- csa_lab_0.docx

Solution Preview :

Prepared by a verified Expert
Basic Computer Science: The implementation of a shared
Reference No:- TGS01182694

Now Priced at $35 (50% Discount)

Recommended (92%)

Rated (4.4/5)

A

Anonymous user

4/6/2016 3:36:17 AM

The reason of this lab is to begin you to the layout and structure of the MarsIDE development tool in addition to Array programming and console commands. In this lab, Fibonacci numbers are produced and printed in the console of the MIPS environment. 1. The implementation of a shared memory can be done via 3 major techniques: I. A multiplexed uniprocessor in which the runtime system and/or OS occasionally preempt and swap threads and there are interleaved with no parallelism mechanism II. Hardware multithreading where tolerate pipeline latencies and higher efficiency can take place. III. Multiprocessing where multiply implementation resources and elevated peak performance happen. Converse 2 possible issues which might happen when using multiprocessors through a shared memory.