Server thread, Operating System

Assignment Help:

Extend task 1 so that the requests are issued by the clients instead of the server. The server now do not use the "all_requests.dat" file. Instead every client thread reads from a different input file called "client_requests_n.dat", where n is the thread id. Note this is not the thread id that is assigned by the system. Note thread id goes from 0 to N-1.
The client request files have the following format:


Apart from request no. field the other fields have the same meaning as in the "all_requests.dat" file in task 1.

Note request no. is a number starting from 1 2 3 ... to the total number of requests. You can assume that when you combine all the client request files that all request number starting from 1 to the total number of requests exists. Your job is to process all the requests in ascending request number order. Also note the request numbers within each client request file are always sorted in ascending order.
Here is a sample pair of client request files. In this example there are 2 clients.

client_requests_0.dat file:
1 read 20
4 write 21 hellohowareyou
5 read 21

client_requests_1.dat file:
2 read 21
3 write 20 petermaryjohn


The program should do the following:


1) The server thread starts and reads in the init_buffer_pages.dat file to initialise the memory buffer.

2) Create N client threads, where the number N is taken from the command line.

3) Each thread reads from its own client_request_n.dat file to get the page read or write requests. The requests are sent to the server in the order that they appear in the file. The server must process these requests in ascending request number order.

4) The requests are blocking requests, that is if a request from client x is to read a page client x should not send the next request until the server has provided the requested page to the client x. Similarly for a write request the client x should not issue the next request until it has received confirmation from the server that its write has completed. Requests from different clients can be issued concurrently.

5) Each client thread should keep a log of the pages that it has read inside a file called "client_log_n" where n is its thread id. The pages read must be written into the log file in the order that they are received from the server.

6)

a) The server must process the requests in ascending order according to request number specified in the client_requests_n.dat files. For example request number 2 must be processed before request number 3, although request number 3 arrived at the server before request number 2. This can happen since the thread issuing request number 3 may have executed before the thread issuing request number 2.

a) The server is NOT allowed to open the client_requests_n.dat file or the all_requests.dat file. The server must get the request number and all other request information from the client when the client sends its read or write request.

b) The clients are NOT allowed to send all their requests at once at the beginning. The client can only send a new request after its previous request has been processed. See point 4 for more details.

c) Not following the above rules will result in very significant reductions in your mark (you may loose up to 100% of the marks for task


Related Discussions:- Server thread

Task decomposition and data decomposition, Discuss the concepts of  task de...

Discuss the concepts of  task decomposition  and  data decomposition  within the context of parallel programming. Parallel programming or parrelel computing is the simultaneo

Keeping track of free memory, How do we keep track of where the free pieces...

How do we keep track of where the free pieces of memory are? One idea is to maintain a set of linked-lists of free space; each linked-list will store free chunks of some given size

What do you mean by first fit, What do you mean by first fit? First fit...

What do you mean by first fit? First fit allocates the first hole that is big sufficient .Searching can either start at the starting of the set of holes or where the previous f

Queing theory, how to solve queing theory step by step

how to solve queing theory step by step

Operating system structure, Problem: (a) Modern operating systems are i...

Problem: (a) Modern operating systems are interrupt driven. If there are no processes to execute, no I/O devices to service, and no users to whom to respond, an operating syste

What is thrashing, What is thrashing? It is a method in virtual memory...

What is thrashing? It is a method in virtual memory schemes when the processor spends most of its time swapping pages, rather than implementing instructions. This is because o

Designing issues in a network -transparency, Transparency Users mus...

Transparency Users must be able to access remote resources as though these resources were local. Transparency should as well promote user mobility. Users must be allowed

Explain optimal page replacement, Optimal page replacement An optimal ...

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that a 'replace the page that will not be

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