Top 10 List of Week 08

1. AnimOS CPU-Scheduling
   A CPU-Scheduling simulator where we can input processes with their arrivals and bursts. It will simulate the operations. I found this interesting and helped me understand CPU scheduling because of the illustration it gives.

2. What is meant by CPU Burst and I/O Burst?
   A discussion about what CPU Burst and I/O Burst means. I chose this link because the answers are easy to understand and used more familiar terms. Also there’s more than one answer as well.

3. Prediction of CPU Burst Time for a process in SJF
   An explanation about approximating CPU burst time for a process in SJF (there’s more than one technique). It’s interesting for me about how SJF algorithm is one of the best scheduling algorithm and its problem can be approximated.

4. Difference between Asymmetric and Symmetric Multiprocessing
   A brief explanation about asymmetric and symmetric multiprocessing plus their differences. There’s a lot of sites explaining about roughly the same thing but I chose this one because it’s easier to understand with the illustrations.

5. Program for Round Robin scheduling | Set 1
   An explanation about round robin scheduling with example. It’s brief but covers a lot of things including the advantages, disadvantages, and example so I chose this link.

6. Relation between Preemptive Priority and Round Robin Scheduling Algorithm
   This article explains about how round robin is a preemptive scheduling. It’s a complement and provides more explanation for the previous link.

7. Preemptive and Non-Preemptive Scheduling
   I chose this link because it gives another links to articles about algorithms for both preemptive and non-preemptive scheduling.

8. Shortest Job First (or SJF) CPU Scheduling Non-preemptive algorithm using Segment Tree
   An explanation about SJF scheduling an implementation of it using segment tree. I was interested in this article because it gives an example of it using a segment tree (there’s another link to other implementation as well).

9. Starvation and Aging in Operating Systems
   Starvation is a problem that might occur in scheduling and aging is a solution to it. In the midst of the explanation it also explains about differences between deadlock and starvation as well.

10. pthreads(7) — Linux manual page
    A Linux programmer manual about POSIX threads. Didn’t seem interesting at the first glance, but after I read thoroughly, there’s something about “thread-safe functions” that actually interested me hence I chose this link.