From 6271b54f12c7fe50072efb3f724476185eb74c04 Mon Sep 17 00:00:00 2001 From: Tanmay Date: Thu, 13 Oct 2022 16:22:12 +0100 Subject: [PATCH] Adds table of contents. --- os/notes/02-round-robin-threads.md | 14 +++++++++++++- 1 file changed, 13 insertions(+), 1 deletion(-) diff --git a/os/notes/02-round-robin-threads.md b/os/notes/02-round-robin-threads.md index 0da8f45..aace82f 100644 --- a/os/notes/02-round-robin-threads.md +++ b/os/notes/02-round-robin-threads.md @@ -1,5 +1,17 @@ # Round Robin scheduling algorithm and threads - +- [Round Robin scheduling algorithm and threads](#round-robin-scheduling-algorithm-and-threads) + - [Round Robin](#round-robin) + - [Algorithm](#algorithm) + - [Example](#example) + - [Advantages](#advantages) + - [Disadvantages](#disadvantages) + - [Threads](#threads) + - [Thread vs Process](#thread-vs-process) + - [Concurrency vs Parallelism](#concurrency-vs-parallelism) + - [Using threads in Java](#using-threads-in-java) + - [Number printer](#number-printer) + - [Assignment](#assignment) + - [Reading List](#reading-list) ## Round Robin > Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin scheduling is simple, easy to implement, and starvation-free. Round-robin scheduling can be applied to other scheduling problems, such as data packet scheduling in computer networks.