Week 30 - Concurrency Continued

-

This week we explored concepts in concurrency and focused on synchronization and common problems in multi-threading. I learned that problems can arise when a system tries to process multiples tasks or in overlapping time periods. We were introduced to semaphores which are an important synchronization primitive. These can be used to manage access to shared resources in concurrent programming environments. 

The lab this week focused on synchronization using semaphores. The aim was to get familiar with solving synchronization issues like the producer-consumer problem. Using semaphores, we were able to implement thread-safe operations to ensure mutual exclusion and prevent race conditions. This lab reinforced the importance of using synchronization techniques to avoid unpredictable and inconsistent behavior caused by allowing access to shared resources.

Comments

Post a Comment

Popular posts from this blog

The End of the Byte Trail

-
Image
Time really does fly. This will be my final journal entry, and it marks the end of Gerek’s “byte trail” and undergraduate journey in Computer Science at CSUMB. Looking back, I can see how much I’ve grown both technically and professionally. I’m glad I was encouraged to keep a journal because now I’m able to look back on my past entries to reflect on my growth. Throughout the program, I’ve developed a strong foundation in core computer science concepts like algorithms, data structures, databases, operating systems, networking, and software engineering. I learned important concepts for being a competent software engineer like documentation, testing, and clean code habits. I plan to carry these forward into my career. As I close out my chapter at Cal State Monterey Bay, I’m excited about the opportunity to step into the tech workforce. It seems learning in this field never truly stops, and I expect my education to continue evolving throughout my career as technology advances. I’m partic...
Read more

Reflections on Algorithms

-
On this week’s exam, I felt confident with core topics like merge sort’s Θ(n log n), and dense graph adjacency matrices. I know I'm able to apply some foundational techniques under pressure. However, I also made some mistakes that came from missing small but important details like carefully identifying the basic operation or following traversal conventions. I need to take a step back and think about both the big picture strategy and the fine details of implementation. This week also marks the halfway point of Algorithms, and I feel like my thinking has grown. It's been both challenging and rewarding because it pushes me to break problems down logically instead of leaning on my intuition - which I often do. I need to strategize more on how I analyze loops, recurrences, and data structures. It also helps to find solutions using precise mathematical notation. Even when I get questions wrong, I view it as an opportunity to sharpen my reasoning and improve my problem solving.
Read more

Refining Documentation and Planning Final Deliverables

-
This week, our team met with our clients Tian & Shuhe to go over the remaining parts of the project as we move toward final submission. During the meeting, we discussed the two different types of tests that will be conducted: a user test performed by Shuhe and a deployment test conducted by Tian himself. This meeting helped us understand what each evaluation will focus on and what we need to prepare for. Tian also requested that we create documentation for the project, specifically a README with a developer-oriented quickstart guide. I contributed to planning the structure and content of that documentation and began outlining what developers will need to quickly understand and run our system. Next week, our main focus will be making the README file, including setting up clear quickstart instructions. I will help consolidate our existing notes, scripts, and architecture explanations into a clean and easy-to-follow document. At the same time, we will begin preparing material for the ...
Read more