About OTC CatchUp
OTC CatchUps are weekly informal sessions involving project showcases and technical discussions. They are held every Saturday from 10:30 PM IST. Join in!. For all summaries, please visit catchup.ourtech.community/summary. |
OTC CatchUp #174
Date: 09-03-2024
Duration: 2 hrs 50 mins
Topics Discussed
-
General Introduction
-
Bhavesh Kukreja talked about Scratch and a simple visual application that he built as a part of CS 50.
-
Ramyak Mehra mentioned that he built his first app using App Inventor.
-
-
Ramyak Mehra and Darshan Rander had a contention about a beginner using Rust or C for development.
-
C teaches you about memory management whereas Rust abstracts it away and from the POV of a beginner, they won’t be able to learn things without actually experimenting.
-
Ramyak Mehra mentioned that Rust gives warnings and directions to the developer while compiling whereas C doesn’t.
-
jaden furtado tried to pitch in with a new perspective by talking about the intent behind learning a language and how it should be based on the problem that the developer wants to solve.
-
-
Building on the previous discussion, Harsh Kapadia shared an example of structure packing and caching.
-
We talked about the recent Linux kernel patch that improved the TCP performance by 40% as discussed in this youtube video: Google Patches Linux kernel with 40% TCP performance.
-
Harsh Kapadia shared a few links:
-
Anil Harwani and jaden furtado had a discussion about the paper: Creating Trust by Abolishing Hierarchies.
-
Anil Harwani mentioned SNP (Secure Nested Paging) and how it’s a hardware feature that’s being used to secure the hypervisor.
-
-
Pranav Dani and Anil Harwani talked about The Multikernel: A new OS architecture for scalable multicore systems.
-
The paper talks about using message passing between cores and how it’s a better approach than shared memory/cache coherency.
-
Anil Harwani said that the thing about research is that the ideas are good but one needs to evaluate them in the real world and suggest how much performance can improve, which is the main reason behind why most chip makers stick to cache coherency.
-
-
Rishit Dagli and Anil Harwani talked about formal verification and how it’s used to verify the correctness of a program.
-
There’s nothing like fully secure programs and the best that we can do is to make it as secure as possible.
-
Securing something should be less than 10% of the cost of the thing that’s being secured.
-
-
Pranav Dani talked about Cache Hierarchy, set associative cache, and how it’s used to reduce the latency of memory access.
-
L1 cache is parallel and L2 cache is serial, which is why L1 cache is faster than L2 cache due to more cycles required for accessing requisite data.
-
He also talked about the TLB (Translation Lookaside Buffer) and how it’s used to reduce the latency of page table access.
-
We also talked about speculative execution, branch prediction and potential pitfalls.
-
We discussed Linearizability, Sequential Consistency, and how they’re used to reason about concurrent programs.
-
We also discussed how Serializability and sequential consistency are different. Some database terminologies are also used to reason about concurrent programs.
-
-
Attendees
-
Adithyan
-
Akhil Sahu
-
Anil Harwani
-
Atharva Jadhav
-
AtharvaJ
-
Gauri Khanolkar
-
Jash Malhotra
-
Kartik Patel
-
Krishana Dave
-
Raghav Rathi
-
Rishi Setpal
-
Vishal Dubey
Meet Screenshot
For all summaries, please visit catchup.ourtech.community/summary. |
Want to improve the content of this page?
Want to get more involved? Learn how to contribute.
We rise by lifting others.
Kindness always wins.
Alone we can do so little; together we can do so much.