Multi-threaded concurrency programming with threads, Computer Engineering

Assignment Help:

Your task is to implement a memory manager that manages page reads and writes from multiple client threads. In the first programming task the memory manager keeps all the pages in a memory buffer large enough to fit all the pages and the server processes a list of requests and sends them to clients to log. In the second programming task a user is allowed to specify a memory buffer size limit. The memory manager needs to place some of the pages on disk in order to cope with the buffer size limit. To do this the memory manager uses the least recently used (LRU) page replacement algorithm in order to choose which page to evict from memory when the memory is full. In the third task you extend the solution for task 1 so that requests are sent from the client to the server instead of all the requests originating in the server.

Please look at the AssignmentDiagram.ppt file in the assignment folder to gain a better understanding of the assignment requirements. Sample input and output files are also provided in the SampleFilesForTasks1to3.zip file.

Please do not use sleep anywhere inside your code. Or something that simulates a sleep system call. Eg. while (1) { }. However you are allowed to use the pause(), pthread_cond_wait() or pthread_cond_timedwait() system calls and their Java equivalents to block a thread or process.

Please submit separate source files for each of the three tasks.


Related Discussions:- Multi-threaded concurrency programming with threads

C programming, There is a pebble merchant. He sells the pebbles, that are u...

There is a pebble merchant. He sells the pebbles, that are used for shining the floor. His main duty is to take the length of the room’s sides. But he sometimes mistakes doing that

Recursion, Ask qurecurrion for short noteestion

Ask qurecurrion for short noteestion

What is sap dispatcher, What is SAP dispatcher? SAP dispatcher is the co...

What is SAP dispatcher? SAP dispatcher is the control agent that handles the resources for the R/3 applications.

Determine the odd parity bit for f, Q. Determine the odd parity bit for F. ...

Q. Determine the odd parity bit for F. Q. Convert the following from binary to decimal, hexadecimal, BCD and octal. a) 1000000011   b) 0001010110101  c) 1 Q. Convert the f

How will you reuse a plan, How will you reuse a plan? Reuse is an benef...

How will you reuse a plan? Reuse is an benefit of OO technology. Two aspects of reuse: Using existing things and making reusable new things It is simpler to reus

What are the characteristics of sram, What are the characteristics of SRAM?...

What are the characteristics of SRAM? SRAM are fast They are volatile They are of high cost Less density

Data rate limitations in PSTN's by using nyquist theorem, Explain with the ...

Explain with the help of Nyquist theorem, the data rate limitations in PSTN's. Data rates in PSTNs : A voice channel in a public switched telephone network is band restricted

Reference table and a reference field, A field containing currency amounts ...

A field containing currency amounts (data type CURR) must be assigned to a reference table and a reference field. Explain. As a reference table, a system having all the valid

Flow charts, n=(x*2)/(1=0) the value x=0 and is used to stop the algerithin...

n=(x*2)/(1=0) the value x=0 and is used to stop the algerithin.The calculation is repeated using values of x=0 is input. There is only a need to check for error positions. The va

Add the equation by using 648 and 487 in bcd code, Add 648 and 487 in BCD c...

Add 648 and 487 in BCD code. Ans. In BCD Code, addition of 648 and 487: 6 4 8  =  0 1 1 0   0 1 0 0      1 0 0 0 4 8 7  =  0 1 0 0   1 0 0 0      0 1 1 1 ---------------------

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