Notes/fundamentals
1
0
Fork 0
mirror of https://github.com/robindhole/fundamentals.git synced 2025-03-15 20:40:11 +00:00
Code Issues Packages Projects Releases Wiki Activity

Adds notes.

Browse Source
This commit is contained in:
Tanmay 2022-10-18 16:26:23 +01:00
parent 6f4cf12180
commit 0b409433d0
4 changed files with 294 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
os/code/os/src/main/java/com/scaler/mergesort/Runner.java Normal file
View File

@ -0,0 +1,20 @@
package com.scaler.mergesort;
import java.util.List;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;
public class Runner {
public static void main(String[] args) throws Exception {
List<Integer> values = List.of(
10, 9, 8, 7, 1, 2, 3, 4);
ExecutorService executor = Executors.newCachedThreadPool();
Sorter sorter = new Sorter(values, executor);
Future<List<Integer>> sortedValues = executor.submit(sorter);
System.out.println(sortedValues.get());
}
}
// Assignment - Implement quick sort

93
os/code/os/src/main/java/com/scaler/mergesort/Sorter.java Normal file
View File

@ -0,0 +1,93 @@
package com.scaler.mergesort;
import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Future;
import lombok.AllArgsConstructor;
@AllArgsConstructor
public class Sorter implements Callable<List<Integer>> {
private List<Integer> values = new ArrayList<>();
private ExecutorService executorService;
@Override
public List<Integer> call() throws Exception {
// Base case - If size of array 1 is return
if (values.size() <= 1) {
return values;
}
// Split the array
int mid = values.size() / 2;
List<Integer> leftArray = values.subList(0, mid);
List<Integer> rightArray = values.subList(mid, values.size());
Sorter leftSorter = new Sorter(leftArray, executorService);
Sorter rightSorter = new Sorter(rightArray, executorService);
Future<List<Integer>> sortedLeft = executorService.submit(leftSorter);
Future<List<Integer>> sortedRight = executorService.submit(rightSorter);
// Merge the array
return merge(sortedLeft, sortedRight);
}
private List<Integer> merge(Future<List<Integer>> sortedLeftFuture, Future<List<Integer>> sortedRightFuture)
throws InterruptedException, ExecutionException {
List<Integer> sortedArray = new ArrayList<>();
int first = 0;
int second = 0;
List<Integer> sortedLeft = sortedLeftFuture.get();
List<Integer> sortedRight = sortedRightFuture.get();
// Compare values from both the arrays
while (first < sortedLeft.size() && second < sortedRight.size()) {
// If left is smaller, add to sorted array
// increment first
if (sortedLeft.get(first) < sortedRight.get(second)) {
sortedArray.add(sortedLeft.get(first));
++first;
} else {
// Add the right one to the sorted array
// increment second
sortedArray.add(sortedRight.get(second));
++second;
}
}
while (first < sortedLeft.size()) {
sortedArray.add(sortedLeft.get(first));
++first;
}
while (second < sortedRight.size()) {
sortedArray.add(sortedRight.get(second));
++second;
}
return sortedArray;
}
}
// Parallel - multiple tasks at same time instant
// 7:11 - Task 1
// 7:11 - Task 2
// Person 1 Done
// Person 2 IN PROCESS
// Person 3 NOT started
// Concurrency - Two tasks at different stages of execution
// Person 1 - Intro 10% IN PROCESS
// Person 2 - intro 10% IN PROCESS
// Person 3 - intro 10% IN PROCESS
// Person 1 - Query

BIN
os/notes/03-threads-synchronisation-hw.pdf Normal file
View File

Binary file not shown.

181
os/notes/04-synchronisation.md Normal file
View File

@ -0,0 +1,181 @@
# Synchronisation
- [Synchronisation](#synchronisation)
- [Adder and Subtractor problem](#adder-and-subtractor-problem)
- [Adder](#adder)
- [Subtractor](#subtractor)
- [Runner](#runner)
- [Synchronisation](#synchronisation-1)
- [Characteristics of synchronisation problems](#characteristics-of-synchronisation-problems)
- [Properties of a good solution](#properties-of-a-good-solution)
- [Solutions to synchronisation problems](#solutions-to-synchronisation-problems)
- [Mutex Locks](#mutex-locks)
- [Properties of a mutex lock](#properties-of-a-mutex-lock)
- [Syncronised keyword](#syncronised-keyword)
## Adder and Subtractor problem
The adder and subtractor problem is a problem that is used to demonstrate the need for synchronisation in a system.
The problem is as follows:
* Create a count class that has a count variable.
* Create two different classes `Adder` and `Subtractor`.
* Accept a count object in the constructor of both the classes.
* In `Adder`, iterate from 1 to 100 and increment the count variable by 1 on each iteration.
* In `Subtractor`, iterate from 1 to 100 and decrement the count variable by 1 on each iteration.
* Print the final value of the count variable.
* What would the ideal value of the count variable be?
* What is the actual value of the count variable?
* Try to add some delay in the `Adder` and `Subtractor` classes using inspiration from the code below. What is the value of the count variable now?
### Adder
```java
public class Adder implements Runnable {
private Count count;
public Adder(Count count) {
this.count = count;
}
@Override
public void run() {
for (int i = 0; i < 100; i++) {
count.increment();
}
}
}
```
### Subtractor
```java
public class Subtractor implements Runnable {
private Count count;
public Subtractor(Count count) {
this.count = count;
}
@Override
public void run() {
for (int i = 0; i < 100; i++) {
count.decrement();
}
}
}
```
### Runner
```java
public class Runner {
public static void main(String[] args) {
Count count = new Count();
Adder adder = new Adder(count);
Subtractor subtractor = new Subtractor(count);
Thread adderThread = new Thread(adder);
Thread subtractorThread = new Thread(subtractor);
adderThread.start();
subtractorThread.start();
adderThread.join();
subtractorThread.join();
System.out.println(count.getCount());
}
}
```
## Synchronisation
Running the above code should ideally result in the count variable being 0. However, if you increase the number of iterations in the `Adder` and `Subtractor` classes, you will see that the count variable is not 0. This is because the `Adder` and `Subtractor` classes are running in parallel and are not synchronised. This means that the `Adder` and `Subtractor` classes are not waiting for each other to finish before they start their own iterations. This results in the count variable being incremented and decremented at the same time, resulting in the count variable not being 0.
The major issue is that multiple threads are accessing a shared resource at the same time.
### Characteristics of synchronisation problems
* `Critical section` - A section of code that is accessed by multiple threads. When multiple threads access the same critical section, the result is a synchronisation problem that might yield wrong or inconsistent results.
```java
public void run() {
for (int i = 0; i < 100; i++) {
count.increment(); // Critical section
}
}
```
* `Race Conditions` - When more than one thread tries to enter the critical section at the same time.
* `Preemption` - When a thread is interrupted by another thread. It could be possible that the interrupted thread is in the middle of a critical section. This could result in the interrupted thread not being able to finish the critical section and yield inconsistent results.
### Properties of a good solution
* `Mutual Exclusion` - Only one thread can access the critical section at a time.
* `Progress` - If a thread wants to enter the critical section, it will eventually be able to do so.
* `Bounded Waiting` - If a thread wants to enter the critical section, it will eventually be able to do so, but only after a finite number of other threads have entered the critical section.
* `No busy Waiting` - If a thread wants to enter the critical section, it will not be able to do so until the critical section is free. It has to keep checking if the critical section is free. This is called busy waiting.
* `Notification` - If a thread is waiting to enter the critical section, it should be notified when the critical section is free.
## Solutions to synchronisation problems
### Mutex Locks
Mutex locks are a way to solve the synchronisation problem. Mutex locks are a way to ensure that only one thread can access a critical section at a time. Mutex locks are also known as `mutual exclusion locks`.
A thread can only access the critical section if it has the lock. If a thread does not have the lock, it cannot access the critical section. If a thread has the lock, it can access the critical section. If a thread has the lock, it can release the lock and allow another thread to access the critical section.
Think of a room with a lock. Only one person can enter the room at a time. If a person has the key, they can enter the room. If a person does not have the key, they cannot enter the room. If a person has the key, they can leave the room and give the key to another person. This is the same as a mutex lock.
#### Properties of a mutex lock
* `Lock` - A thread can only access the critical section if it has the lock.
* Only one thread can have the lock at a time.
* Other threads cannot access the critical section if a thread has the lock and thus have to wait.
* Lock will automatically be released when the thread exits the critical section.
### Syncronised keyword
The `synchronized` keyword is a way to solve the synchronisation problem. The `synchronized` keyword is a way to ensure that only one thread can access a critical section at a time.
A synchronized method or block can only be accessed by one thread at a time. If a thread is accessing a synchronized method or block, other threads cannot access the synchronized method or block. If a thread is accessing a synchronized method or block, other threads have to wait until the thread exits the synchronized method or block.
Following is an example of a synchronized method:
```java
public class Count {
private int count = 0;
public synchronized void increment() {
count++;
}
public synchronized void decrement() {
count--;
}
public int getCount() {
return count;
}
}
```
In the above example, the `increment()` and `decrement()` methods are synchronized. This means that only one thread can access the `increment()` and `decrement()` methods at a time. If a thread is accessing the `increment()` method, other threads cannot access the `increment()` method. If a thread is accessing the `decrement()` method, other threads cannot access the `decrement()` method. If a thread is accessing the `increment()` method, other threads have to wait until the thread exits the `increment()` method. If a thread is accessing the `decrement()` method, other threads have to wait until the thread exits the `decrement()` method.
Similarly, the `synchronized` keyword can be used to synchronize a block of code. Following is an example of a synchronized block:
```java
public class Count {
private int count = 0;
public void increment() {
synchronized (this) {
count++;
}
}
public void decrement() {
synchronized (this) {
count--;
}
}
public int getCount() {
return count;
}
}
```
If you declare a method as `synchronized`, only one thread will be able to access any `synchronized` method in the class. This is because the `synchronized` keyword is associated with the object.