User Account

All Pages

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

What is an exceptions, What is an Exceptions ? • What is an exception?...

What is an Exceptions ? • What is an exception? • try-catch • finally • The different kinds of exceptions • Multiple catch clauses • The throws clause • Throwing excepti

what is meant by binding in rmi, Binding is a method of associating or re...

Binding is a method of associating or registering a name for a remote object that can be used at a later time to look up that remote object. A remote object can be linked with a na

Give the details of xml files used in validator framework, Two XML configur...

Two XML configuration files are uses by The Validator Framework validator-rules.xml and validation.xml. The validator-rules.xml shows the standard validation routines, these are re

I want java web developer, Project Description: A web developer is requi...

Project Description: A web developer is required to finish a webcam site with basic account management and voting functionality. The website can make use of a third party fla

Describe exception handling in java, Question A What are the difference be...

Question A What are the difference between an interface and an abstract class? Question B Describe Exception Handling in JAVA Question C Describe the following with resp

What are wrapper classes, What are wrapper classes? Java gives speciali...

What are wrapper classes? Java gives specialized classes corresponding to every of the primitive data types. These are known as wrapper classes. They are example: Integer, C

Define about the super() constructer, Super() Constructer: It is used t...

Super() Constructer: It is used to call constructor of parent class. Should be the first statement in the body of constructor. Using this we can access private variables

I need crime management, I need Crime Management Project Description: ...

I need Crime Management Project Description: It is a web based project build in Oracle(back end) and J2EE(front end)  for peoples so they will register complaints online.

What are the parts of website design, What are the parts of website design?...

What are the parts of website design? Parts of web design: There are in 3 types of elements for web design and below are there names: 1. Navigation scheme 2. Overall look and

Explain the difference between hash map and hash table, Difference between ...

Difference between Hash Map and Hash Table? The HashMap class is roughly equivalent to Hashtable, except that it is unsynchronized and allows nulls. (HashMap allows null values

Write Your Message!

Captcha
Order Assignment

Featured Services

Order Now

Popular Subjects

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!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +91-977-207-8620

Phone: +91-977-207-8620

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd