CST 334 - Week 7

 Hey everyone,

    This week in CST 334, I studied the concept of persistence and explored how operating systems manage data storage reliably over time. The readings from OSTEP Chapters 36 to 40 and the accompanying lectures focused on key topics such as I/O devices, hard disk drives, RAIDs (Redundant Arrays of Inexpensive Disks), files and directories, and file system implementation. I learned how I/O devices interact with the operating system to transfer data between the system and storage devices. Chapter 37 provided a detailed explanation of how hard disk drives operate, including their physical structure and the challenges in optimizing performance for data access. Chapter 38 introduced RAIDs, which use multiple drives to improve reliability, performance, or both, through techniques like mirroring and striping.

    The lectures and slides on persistence and file system implementation explained how operating systems organize data into files and directories and manage storage using a well-defined layout. I learned about the structure of file systems, including metadata, data blocks, and the importance of keeping this information consistent. The discussions also covered file system reliability, such as using journaling or copy-on-write techniques to prevent data loss in case of a crash. Performance optimization techniques, such as reducing seek time on hard disks and leveraging caching, were also emphasized. These topics helped me understand the critical role of persistence in ensuring data is stored securely, accessed efficiently, and remains intact even during unexpected failures. This week's content gave me a deeper appreciation for the complexity and importance of file systems in computer systems.

Comments

Post a Comment

Popular posts from this blog

CST 334 - Week 6

 Hey everyone!      This week we submitted our research collab project. It was quite interesting and fun. I learned a lot and our team bonded more as well. We also learned many new things through our lectures and labs.       Concurrency is a critical concept in computer systems, enabling multiple processes to execute simultaneously. However, with great power comes great complexity.       A semaphore is a synchronization primitive that helps manage access to shared resources in a concurrent environment. Semaphores can be thought of as counters that control the number of processes allowed to access a resource. They come in two main types :             - Counting Semaphores : These can have values greater than one and are often used to manage a   pool of resources, such as threads or connections.           - Binary Semaphores : These function like locks and c...
Read more

CST 334 - Week 4

Hey everyone!       This week, I learned about how operating systems manage memory, which is one of their most important jobs. One topic was free space management , where the system keeps track of memory or storage that isn’t being used. Two common methods are bitmaps (using bits to mark if memory is free or taken) and linked lists (connecting free memory blocks together). Each method has its pros and cons, like how much space they use or how fast they work.      I also studied paging , which splits memory into small chunks called pages. These pages are mapped to physical memory, keeping processes separate and organized. However, this mapping can slow things down because the computer has to translate addresses often. To make it faster, Translation Lookaside Buffers (TLBs) store recent translations in a small, quick cache. I also learned about advanced page tables , which are smarter ways of organizing these mappings to save memory.    ...
Read more

CST 370 - Week 1

 Hey everyone, This week, we learned several important topics that form the foundation of computer science and programming. We started with GitHub and practiced using manual commands like git init, git add, git commit, and git push to manage our code. This helped us understand version control and how to keep track of changes when working on projects, especially when collaborating with others. We were also introduced to algorithms and learned what they are—step-by-step methods for solving problems. One example we focused on was Euclid’s Algorithm for finding the greatest common divisor (GCD) of two numbers. It uses a simple but powerful idea: repeatedly replace the numbers with GCD(b, a % b) until the second number becomes zero. We also practiced writing pseudocode, which helped us plan out algorithms in plain language before coding. We also had a homework assignment to help us further understand GitHub commands. Later in the week, we learned about graphs, both weighted and unweight...
Read more