Assignment No: 1
Read the map-reduce paper and note down the relevant concepts regarding map-reduce programming paradigm. Write a two page report on the paper based on the summary. You have to submit your report on or before April 8, 2016
Assignment No: 2
I) Read and understand the functioning of various CPU scheduling algorithms given below.
1) Round Robin
2) First Come First Serve (FCFS)
3) Shortest Job First
4) Earliest Deadline First
Implement Round Robin algorithm in any programming language and demonstrate it.
Create a report which contains the following sections:
1) Algorithm:
2) Purpose and Peculiarities:
3) An example with minimum of four processes with their arrival time, execution time etc.
II) Illustrate the example of fair queuing algorithm in your text book, by assuming arbitrary initial selection of thread a, instead of thread b. Draw the timing graphs between thread a and b and also with real time and virtual time.
This assignment is to be submitted on or before 14th May 2016 with out fail. Do your assignments by yourselves. This instruction has to be marked as a high priority one.