Optimistic Locking - What, When, Why, and How?

Подписаться 109 тыс.

Просмотров 12 тыс.

50% 1

System Design for SDE-2 and above: arpitbhayani.me/masterclass
System Design for Beginners: arpitbhayani.me/sys-design
Redis Internals: arpitbhayani.me/redis
Build Your Own Redis / DNS / BitTorrent / SQLite - with CodeCrafters.
Sign up and get 40% off - app.codecrafters.io/join?via=...
In the video, I explained how optimistic locking can be used as an alternative to pessimistic locking in multi-threaded programs to improve performance. By utilizing the compare and swap semantic, optimistic locking allows one thread to succeed while another fails, reducing contention and improving throughput. I demonstrated the implementation of optimistic locking using a simple C code example and discussed its advantages and disadvantages. Leveraging the underlying CPU architecture for atomic operations is key to efficient optimistic locking. Overall, understanding and implementing optimistic locking can significantly enhance system performance.
Recommended videos and playlists
If you liked this video, you will find the following videos and playlists helpful
System Design: • PostgreSQL connection ...
Designing Microservices: • Advantages of adopting...
Database Engineering: • How nested loop, hash,...
Concurrency In-depth: • How to write efficient...
Research paper dissections: • The Google File System...
Outage Dissections: • Dissecting GitHub Outa...
Hash Table Internals: • Internal Structure of ...
Bittorrent Internals: • Introduction to BitTor...
Things you will find amusing
Knowledge Base: arpitbhayani.me/knowledge-base
Bookshelf: arpitbhayani.me/bookshelf
Papershelf: arpitbhayani.me/papershelf
Other socials
I keep writing and sharing my practical experience and learnings every day, so if you resonate then follow along. I keep it no fluff.
LinkedIn: / arpitbhayani
Twitter: / arpit_bhayani
Weekly Newsletter: arpit.substack.com
Thank you for watching and supporting! it means a ton.
I am on a mission to bring out the best engineering stories from around the world and make you all fall in
love with engineering. If you resonate with this then follow along, I always keep it no-fluff.

Наука

Опубликовано:

2 авг 2023

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 24

@abdulwakeel6363 11 месяцев назад

This channel has enough content to become a senior backend engineer who are at beginner or mid senior level. Thank you Arpit so much

@cooldudecs 10 месяцев назад

My goal is Staff is so this has been great , even for references to modeling what already is out there rather than re inventng the wheel. Thanks!

@thegreekgoat98 10 месяцев назад

Hey Abdul, can you please tell me where to start. Right now I have just passed out in 2023, and joined a company as a backend developer.

@sandy4799 2 месяца назад

This is really awesome. Got satisfying answers for the doubts I had on contention for CAS operation by two threads. If one wants to be like him your thinking should be like DFS graph traversal, keep digging the problem deeper until all your doubts are resolved.

@jaimalad2902 10 месяцев назад

Great teaching technique. Awesome videos. There lot of senior engineers but very few of them has such great teaching skill like arpit

@LeoLeo-nx5gi 11 месяцев назад

Thanks a ton, it was quite clear!!

@advaitpundlik8797 11 месяцев назад

Great Video !!! I wonder how do you choose your content and what resources you used to learn fundamental concepts in multithreading ? Really Great Work and I look forward to every new video.

@prashantgupta6160 10 месяцев назад

Amazing bro, learned a lot

@ashishsinghchauhan6304 11 месяцев назад

Good tutorial Arpit sir.

@bhanuarora4504 3 месяца назад

Amazing content, these internals are very interesting, thank you so much arpit

@rahulkapoor7305 5 месяцев назад

In optimistic locking there is a concept of Time-of-check to time-of-use when we are checking the old value to be old value => so that we can write it to the new value. there can be another thread which will actually update it in the time being of this checking and updating. and current thread might be a case of also picking up old value = old value. here the race condition might occur

@samworldpk 2 месяца назад

Please help me in this scenario, If my app is load balanced and I have 2 nodes running under it. When 2 requests arrived to update the same resouce. How can Optimistic Locking works? There will be 2 machines and each can execute compare_and_swap or (TOC and TOU) same time.

@shishirchaurasiya7374 9 месяцев назад

Today, I realised going through the content only once is not enough, as a human we loses many important points, finally completing this series for the 2nd time 😍😍 and what I am feeling right now I can't even express, feeling like I can be a TEAM LEAD 😅 at this time by knowing these little little minute details

@aditya7955 11 месяцев назад

Quick question around cpu context switch. Most CPU’s have multiple cores and this comparison function would be running on a single core. Does that mean other cores are also at halt for the time being or they can execute a parallel thread?

@AsliEngineering 11 месяцев назад

It depends on the architecture. Some block the cores, while other block the memory location.

@joobis.b4568 11 месяцев назад

@@AsliEngineering had this question in mind, thanks for clarifying

@sachinpandhare5143 9 месяцев назад

Nice! But example is misleading, if goal is to just increase the count, then atomic increment is a better choice, better example for compare and exchange would be implementing mutex itself or spinlock, correct me if I am wrong :)

@akhilpandey9054 10 месяцев назад

I have one question, you mentioned pessimistic locking might become a bottleneck in your multithreaded application if the number of cofilicts (threads) to aquire a lock is very high. How does optimistic locking help here in increasing the throughput, as you mentioned during the same situation optimistic locking will also not perform well?