Concurrent Programming, JAVA Programming

Assignment Help:
Problem 1
A savings account object holds a non-negative balance, and provides deposit(k )
and withdraw(k ) methods, where deposit(k ) adds k to the balance, and
withdraw(k ) subtracts k, if the balance is at least k, and otherwise blocks until
the balance becomes k or greater. getbalance() gives the current balance.
1. Implement this savings account using locks and conditions (use
java.util.concurrent.locks.ReentrantLock). Test by using the 3
functions.
2. Now suppose there are two kinds of withdrawals: ordinary and preferred.
Devise an implementation that ensures that no ordinary withdrawal occurs
if there is a preferred withdrawal waiting to occur.
Problem 2
Consider the following conditions: An enqueuer waiting on a full-queue or
a dequeuer waiting on an empty queue sleep indefinitely, unless woken up by
another thread. A thread must send a signal ONLY when it adds an element
to an empty queue or removes an element from a full-queue.
1. Implement a bounded partial queue using a signaling mechanism that
signals to all waiting dequeuers.
2. Implement the bounded partial queue by using a signaling mechanism
(your own scheme) that signals to only one waiting dequeuer or enqueuer,
and ensure that the lost-wake-up problem does not happen.
1
Problem 3
We have n threads, each of which executes method foo() followed by bar().
We want to add synchronization to ensure that no thread starts executing bar()
until all threads have finished executing foo(). To achieve this, we will insert
some barrier code between the two methods. Implement the following two
schemes for barrier code:
• Use a shared counter protected by test-and-test-and-set lock. Each thread
locks the counter, increments it, releases the lock, and repeatedly reads
the counter until it reaches n.
• Use an n-element Boolean array A. Initially all entries are 0. When thread
0 executes its barrier, it sets b[0] to 1, and repeatedly reads b[n - 1]
until it becomes 1. Every other thread i, repeatedly reads b[i - 1] until
it becomes 1, then it sets b[i] to 1, and repeatedly reads b[n - 1] until
it becomes 1.
Implement both these schemes in Java. Each of the methods foo() and
bar() just sleeps for 20 milliseconds. Test the two schemes for n = 16. Run
each scheme at least ten times, measure the total runtime in each test run,
discard the highest and lowest values, take the average, and use it to compare
the two schemes. Which performs better? Can you explain the reason? You
can run the experiments on ecen5033.colorado.edu. Submit the code as well as
experimental results.

Related Discussions:- Concurrent Programming

Develop a graphical display framework, Develop a Graphical Display Framewor...

Develop a Graphical Display Framework Project Description: The intent of this project is to prepare a web based graphical display framework that will display many data points

Cryonic labs, Cryonic Labs Project Description: Seeking people to col...

Cryonic Labs Project Description: Seeking people to collaborate with in designing gaming apps and mobile apps for the Android Market. I'm presently a student in Computer Engi

The fancy new French restaurant La Food is very popu, The fancy new French ...

The fancy new French restaurant La Food is very popular for its authentic cuisine and high prices. This restaurant does not take reservations. To help improve the efficiency of the

How can we include images in a web page using html and java, How can we inc...

How can we include images in a web page using HTML and Java script?2011 Images in HTML It is quite straight forward to include gif and jpg images in an HTML webpage using the

Myfirstprogram in java, The purpose of this assignment is to help you learn...

The purpose of this assignment is to help you learn the Java environment and practice I/O instructions, assignment, and simple arithmetic operators. Teams: The assignment can

Project, Prog. Concepts - Project The objective is to implement a menu - ba...

Prog. Concepts - Project The objective is to implement a menu - based system for Bank Accounts in order to simulate a very simple banking system. Many structures have to be declare

What are the services in rmi, An RMI "service" could well be any Java metho...

An RMI "service" could well be any Java method that can be invoked remotely. The other service is the JRMP RMI naming service which is a lookup service.

Need simple desktop software, Need Simple Desktop Software I am seeking ...

Need Simple Desktop Software I am seeking a software that can do the subsequent: 1. Check position for a URL in Google, Yahoo, Bing. 2. Check position for a YouTube video

Send input to different command prompt, I am supposed to call an external a...

I am supposed to call an external application (which is command-line based) and send input to the application from java. I created a batch file to call the application. It successf

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