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

Inheritance and interfaces to construct type hierarchies, Objectives 1. To...

Objectives 1. To help you become comfortable with using inheritance and interfaces to construct type hierarchies. 2. To familiarize you with programming from specifications. A

What are the components of struts, Struts components can be classify into M...

Struts components can be classify into Model, View and Controller: ? Model: Components like business logic /business processes and data are the type of model. ? View: HTML, J

Custom website technical specification document, Custom Website Technical S...

Custom Website Technical Specification Document A Solution provider / System Architect to interpret and speak with me and build business functional needs and a set of research d

Create a new project in eclipse , Task 1 Create a new project in Eclips...

Task 1 Create a new project in Eclipse called Assignment 1. Within this project create a package called task01. 1/ Download the class Date (you must use this class - no

Connect 4 game application, This assignment is a good project for working w...

This assignment is a good project for working with 2 dimensional arrays. In this program, you will implement an ascii version of the classic game "Connect 4". Connect 4 is a 2 p

Different messaging paradigms jms supports, What are the different messagin...

What are the different messaging paradigms JMS supports? Ans) Publish and Subscribe i.e. pub/suc and Point to Point i.e. p2p.

Test phases and cycles? , 1. Unit tests :There are two popular processe...

1. Unit tests :There are two popular processes to testing server-side classes: mock objects, which test classes by checking the server container, and in-container testing, which

Describe importing classes in java, Describe Importing Classes in java? ...

Describe Importing Classes in java? Fully qualified names such as java.net.URL are not the most convenient thing to have to type. You can use the shorter class names like URL w

Describe the superclass in inheritance, Describe the Superclass in Inherita...

Describe the Superclass in Inheritance ? In this example you start through defining a more common MotorVehicle class. public class MotorVehicle { private String licensePlat

Android App Clone, Hello, My friend Roshan from India told me that you pro...

Hello, My friend Roshan from India told me that you provide a high quality programming service which is why I''m here. I would like you to make a clone of an android app the app

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