frequentblogger

In operating systems persitence refers to how content is written or copied to different registers in a computer. An example of this is accessing hard disk drives. Disks have an architecture that composed of multiple tracks that store data. This requires efficient scheduling mechanisms to access sectors on the track. Some scheduling mechanisms include short seek time first, which orders the I/O in a queue and picks request on the nearest track to complete first. Errors in bit storage can be managed via Redundant Array of Inexpensive Disks.  Persistence, meaning obstinate continuance in a course of action in spite of difficulty or opposition applies to a CST 334 SCD Online student. Because of the difficulty of the content and assignments in this course, persistence is needed. This was the case for me as I had to apply persistence in every module.

 This week I learned about operating system persistence. This mainly covered how content is written or copied to different registers in a computer. An example of this is accessing hard disk drives. Disks have an architecture that composed of multiple tracks that store data. This requires efficient scheduling mechanisms to access sectors on the track. Some scheduling mechanisms include short seek time first, which orders the I/O in a queue and picks request on the nearest track to complete first. Errors in bit storage can be managed via Redundant Array of Inexpensive Disks. 

      This week i learned about semaphores. Semaphores are atomic operations that allow processes to synchronize.  Semaphores can encounter non-deadlock bugs such as atomicity-violation bugs and order violation bugs. Atomicity can be solved by creating a lock around shared variable references, while order violation bugs can be enforced using condition variables. They can also encounter various deadlock bugs. Circular wait deadlocks can be prevented via a total ordering on lock acquisition. Hold-and-wait deadlocks can be prevented by acquiring all locks at once. Deadlocks can be avoided via scheduling if global knowledge of what multiple threads may grab during their execution. 

This week i learned about concurrency. Concurrency involves simultaneous execution of multiple threads within a program, allowing tasks to progress concurrently rather than sequentially. Threads in C share the same address space, enabling them to access global variables and dynamically allocated memory.