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

Explain the relational operator precedence, Explain the Relational Operator...

Explain the Relational Operator Precedence ? Whenever a new operator is introduced you have to ask yourself whereas it fits in the precedence tree. If you seem back at the ins

Java script, var temp =14; var y = 2; temp document.write(temp);

var temp =14; var y = 2; temp document.write(temp);

Student, need help in assignment

need help in assignment

Explain testing objects for equality in java, Explain Testing Objects for E...

Explain Testing Objects for Equality in java? , = can only be used with numbers and characters. They cannot be used with Strings, booleans, arrays or other compound types sin

Write a program to add integer value, Write a program to add integer value?...

Write a program to add integer value? class AddInts { public static void main (String args[]) { int i = 1; int j = 2; System.out.println("i is " + i); System.out.println("

What is a portal?, A portal is a service or a Web site that gives broad ran...

A portal is a service or a Web site that gives broad range of services and resources like e-mail, forums, search engines, weather information, news, on-line shopping, stock quotes.

Intro to Programming, Overall Requirements Every phone number is broken up ...

Overall Requirements Every phone number is broken up into sections as shown below: Country Code Area Code Prefix Line Number 1 919 882 5000 Write a program to separate out a ph

COMPRE METHOD, Implement the compare method of the following class Rectangl...

Implement the compare method of the following class RectangleComparator. The method compares two rectangles. The method should return: A positive integer if the area of the first r

Waving two numbers into each other, I have to weave two positive integers t...

I have to weave two positive integers together. For example, if the numbers are 137 and 064, the output integer would be 103647. This has to be done using integer arithmetic (not s

Write code in a java for automaton distributed in class, Write a code in a ...

Write a code in a c++/java  for the automaton distributed in the class that accepts keywords(cat,bat,cab). Create an input file along with these words may be two or three copies of

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