Semaphore Explained C#

[@MiTaReX]

Thanks for the tutorial! One note: when talking about semaphores, I think you missed the intended metaphor. Semaphore means "apparatus for signaling" and in this context it means railway semaphores, which you can think of "traffic lights for trains". There are two states for a railway semaphore: open and closed, so this is the intentional metaphor for the naming, it functions the same as your "gate" idea. =)

[@RawCoding]

thank you, I didn't know

[@BrendonParker]

Great tutorial, thanks! I imagine you’d want to move the release of the Semaphore to a “finally” block, otherwise those “gates” are permanently closed on an exception.

[@RawCoding]

Yes, thank you for pointing out. :)

[@Gmaniacuk1]

Fantastically simple explanation, with both Hello World and real world examples. Short, sweet and simple - thank you.

[@RawCoding]

Glad you liked it!

[@nuevoaioria]

My God!! You are the man!!! I had tried with many videos,codes,etc. Until I see your video and I did it succesfully in my first attempt!! Thank u man!!

[@RawCoding]

Glad to hear )

[@salamioluwapelumi]

This channels needs more than a million subscribers ; wish i could subscribe a million times

[@RawCoding]

Haha thanks man, we’ll get there ;)

[@dougstanley8942]

Well done young man - great stuff, and no edits. Impressive

[@DedicatedManagers]

At around 7:32 I don’t understand how your calls aren’t blocking... the CallGoogle function awaits the _client call to google, then prints the result. So doesn’t that complete the call to google before returning? I would think each call to CallGoogle would be blocking. Is it because it returns a “task” that each “yield return” in CreateCalls doesn’t get blocked by that await? (I’m not even sure I’m asking my question correctly. I’m a JavaScript programmer trying to learn C#. Is a task like a promise in JavaScript?)

[@RawCoding]

That’s a good question. Yes Task is almost exactly like a promise. The reason they are not blocking is when I invoke CallGoogle it creates the Task and I don’t await on it, so the loop never stops and it quickly creates 200 tasks for me which all run asynchronously. All the 200 Tasks are awaited in a blocking manner by Task.WaitAll (there is a async version of this which is non blocking) in JavaScript you have the Promise.all function which is the non blocking version. Think of this like this we would take a list of strings and map them all to axios get requests, and the use Promise.all to await on them all so all requests are running asynchronously however in the “then” callback we just print the status code, internally between when the promise is resolved and the status code is printed the thread is awaiting, outside of the promise execution continues

[@NillKitty]

It's not that your network card is too slow to connect to Google 200 times at once, it's that your TCP/IP stack (and Google's too) has a set limit on how many unestablished connections can be buffered at once. In effect you're seeing this because Windows has its own "gate" and your socket requests start to block. The reason for this is to avoid allocating huge amounts of RAM to the TCP/IP driver in the event a program is stuck in a tight loop trying and failing to connect to something. Your actual NIC driver only knows about frames, not socket connections, and can blast data at upwards of 10Gbps. You're using HttpClient so the back-up may even be one layer higher (in http.sys) rather than in the native TCP stack itself.

[@NillKitty]

Also you have 65535 theoretical TCP ports so you're also not running out of that.

[@RawCoding]

I’ll take your word for it :D

[@sadhat75]

Best semaphore tutorial ever! I always struggled to understand it. After watching this, its crystal clear now! Thank you! The only thing I need to remember is the magic word - (Bill) GATEs!!!

[@RawCoding]

Haha glad I could help :)

[@ahmedlshubaky7336]

thx from egypt, u saved my project because previously i was using deprecated thread methods such : suspend and resume which are have a lot of issues and not working properly. thx again

[@RawCoding]

Glad to hear!

[@mrjamiebowman1337]

This is excellent. A great way of explaining this. I struggled to understand Semaphores until now

[@RawCoding]

Glad you like it )

[@taraspelenio8259]

Good and brief description. Excellent work. I like such format.

[@RawCoding]

Cheers )

[@guillermoarroyo9465]

Excellent, just what I needed. Great job

[@RawCoding]

Glad I could help

[@mohdnasir7023]

Finally the tutorial which resolved my issue. Thanks man😊

[@RawCoding]

Thank you for watching

[@oganovdavid]

This is the best channel! Thanks you so much for teaching all the stuff in an easy way!

[@RawCoding]

Thank you for watching)

[@LucasMarinoElementh]

Thank you for the video. It is always nice to revisit some knowledge when you don't use it fairly often.

[@RawCoding]

Thank you for watching))

[@enesyapmaz7053]

Explains and sample are so good. Thanks for everything

[@RawCoding]

Cheers :)

[@ИгорьГарбуз-з4б]

Great tutorial. Thanks a lot!

[@RawCoding]

Cheers )

[@kopilkaiser8991]

Awesome tutorial. I've now a better understanding about this topic Thank you for your hard work and effort. I can see you enjoy teaching and I really enjoy learning. I hope to be as intelligent as you are and understand c# logic as the way you understand.

[@iliyanangelov]

Amazing video! Short, clean to the point. Subscribed :)

[@RawCoding]

Glad you liked it!

[@salehdanbous6783]

Thank you Anton, as always you discuss subjects that not a lot of people explain. If you are updating a financial account would it be better to use a semaphore or to use Rowversion and optimistic concurrency?

[@RawCoding]

If you have 2 machines, semaphore is inside your app, at that point you would need a "distributed lock". Row version and retries is better.

[@raghavendransrinivasan7496]

Clear explanation, thanks.

[@RawCoding]

Thank you for watching!

[@aliveGR]

Great tutorial! Thank you for taking the time to explain this so well.

[@RawCoding]

Thank you for watching

[@KrishnaList]

Anton fantastic explanation👍🏼👍🏼👍🏼👍🏼

[@RawCoding]

Thank you ))

[@mohammedabozobida8580]

I have question in another topic which is AsNoTracking and Tracking in entity core what is the difference ?

[@RawCoding]

Not sure why you can’t google this question but here you go docs.microsoft.com/en-us/ef/core/querying/tracking

[@seccisec]

Nice little video :) Thx for sharing.

[@RawCoding]

Cheers

[@Vptkvc]

very concise and well explained! thanks brother!

[@RawCoding]

Cheers))

[@sujitraul1097]

thanks for this tutorial. how have you coded the dump() method?

[@RawCoding]

It’s a method only available in LinqPad

[@sujitraul1097]

@@RawCoding thanks !! I thought you have written an extension method.

[@RawCoding]

Nope, that’s just LinqPad

[@mubashirsoomro6]

Would this approach work if I have a limited number of connections that I can make with an sftp client? The way I see it, this can also help control concurrency. I don't know if there is a better approach.

[@eshika1336]

actually, I am working on my friends project it on c# and I want to popup a website from that software but we don't know how to change website links from server or database, ​we just need to change website link daily

[@RawCoding]

Semaphore can't help with this sorry

[@asagiai4965]

Are you asking how to get the data from server or how to create links automatically

[@evrame.microwize]

Great video! Simple and elegant real-world scenario, thank you for the video! I have came across a rather interesting problem where a block of code can't be allowed access by more than one thread, and that seemed like a perfect example for implementing the usage of the SemaphoreSlim class, however, I have an additional problem, my app will work on three nodes under a load-balancer and all three connect to the same database (the block of code checks and updates some data), and that will cause problems, this way the SemaphoreSlim will not help me in that situation. What do you suggest?

[@RawCoding]

You need a distributed lock or message passing

[@rajas7841]

Nice explanation 👌

[@RawCoding]

Cheers

[@LetsLearnWithA.R]

Great tutorial !!!! Thanks buddy !!!

[@RawCoding]

Thank you for watching)

[@ayoubdkhissi]

Great explanation, the http requests example was very accurate

[@zealtypedcode3119]

Self taught here your instructions are outstanding , I will be Grateful if you do tutorials about massaging concepts like rabbit MQ or apache kafka

[@RawCoding]

At some point!!

[@uniquename2386]

What is Dump function and how to implement this?

[@RawCoding]

It’s LinqPad specific

[@dariodusper7068]

Does semaphore slim work also between more assemblys, like mutex did?

[@RawCoding]

Never used Mutex

[@yawar110]

nice one! - just a side note that SemaphoreSlim is a disposable object. so may be its a good idea to dispose it once used to save the resources.

[@RawCoding]

If you need to dispose of it, dispose of it :)

[@HoangIT21]

Thanks for sharing! Great video. Thanks bro!

[@RawCoding]

Thank you for watching;)

[@squidward66]

nice clear explanation and demo

[@RawCoding]

Cheers

[@anatoliytkachenko1498]

Thank you for the clarification. Like!

[@RawCoding]

Thank you for watching

[@MikhailGolnoshchekov]

You are using the initialCount parameter, but there is also a maxCount parameter. Please explain what happens if you add maxCount?

[@RawCoding]

I never used it tbf, but I’d imagine it’s the upper bound that you can go up to if you release more than you await

[@MikhailGolnoshchekov]

@@RawCoding That is, if, for example, initialCount = 5, maxCount = 10: This means that when 7 requests are executed simultaneously, 5 of them will be executed immediately, and two - a little later. But if there are 11 requests, then 5 will be executed immediately, 5 a little later, and 1 will not be executed?

[@RawCoding]

If you lock and release for each request you’ll never end up past 5, so maximum 5 requests. I don’t actually know of any use cases for having a max count so can’t help with an example sorry.

[@dhanyajoy7043]

Thanks for the tutorial! Is there a default timeout on WaitAsync() or will that wait indefinitely?

[@vivek.tiwary]

Is there anyway to know gate is occupied?

[@RawCoding]

You can check the available count

[@noraholmberg2303]

so is semaphore and semaphore slim the same thing?

[@RawCoding]

They do the same thing as in they are a semaphore, performance wise semaphores lim is better

[@poornimanayar8647]

Really love your videos! Very informative and well explained

[@RawCoding]

Thank you for watching :)

[@rgbetanco604]

Thanks, highly appreciated

[@RawCoding]

Cheers

[@samsal073]

Thanks for the video ....i like how you keep things simple. Im carious how this compare to other thread pool concepts for example the use of Parallel.Foreach where you specify Max # of threads? Also not sure about the yield use here, is it possible if we return each task at a time and the task finishes (hypothetically) before returning the next is possible the waitall will exit?

[@RawCoding]

Sorry I don’t understand neither of your questions, I can’t compare it to Parallel.Foreach they are completely different, and the last part just confuses me

[@samsal073]

@@RawCoding sorry for the confusion. I guess my comparison to parallel.Foreach comes from the fact that like semaphoreslim you can limit how many threads can run asynchronously but maybe semaphore is how you can do it with async await concept. Regarding 2ed question i was trying to understand the use of keyword yield in "yield return callGoogle", doesnt that return each task one at a time to the Task.WaitAll in the Main function?

[@RawCoding]

Oh for the 2nd question watch my generator video

[@clearlyunwell]

Beautiful 🤩

[@RawCoding]

Cheers

[@claucometa]

Probably then if I wanna have a gate at all endpoints I do some sort of midleware? nO CLUE how to do so.

[@RawCoding]

I’d advise against middleware because that could pause your server. You want to bring this to your business logic level rather.

[@NguyenNguyen-ly2yt]

Your explaination very clear. thank you for your video. BTW, I really really miss LINQPad since I change to the Mac M1 :(

[@RawCoding]

Mee too brother

[@uttamsuthar9940]

Awesome explanation...

[@RawCoding]

Cheers

[@uttamsuthar9940]

@@RawCoding even others videos are too informative

[@DeadPool-c1o]

What is the difference between Semaphore and Semaphore Slim ? Can Semaphore Slim work with internal and external threads ?

[@cfndiaye]

Good 👍, what tools you use for this coding?

[@RawCoding]

LinqPad

[@cfndiaye]

@@RawCoding thank you

[@dholloway543]

Wouldn't it be so much easier to just make that method not async so the call doesn't continue past and loop back for the result. Ending up with the the same outcome and less processing?

[@dholloway543]

I guess if you use more than 1 it would make since this way to utilize more than 1 thread Now that i think about it and like he says as the developer you would need to tune it

[@RawCoding]

Today most environments are multithreaded, blocking threads is a waste of resource. If we make the method non async that means we would have to block the thread, we want to avoid this.

[@oleksiy1752]

Thanks!

[@RawCoding]

Thank you for watching)

[@neilvermeulen5283]

Thank you.

[@RawCoding]

No thank you

[@becomingweleteeyesus6735]

Oh wow. I LOVE YOU.

[@RawCoding]

Cheers

[@abdulmoiz3348]

Please, can you do one video on AutoResetEvent & ManualResetEvent ? Thank you.

[@TheJessejunior]

this was good!

[@RawCoding]

Thank you for watching

[@fredrikfehre]

Well played sir! :)

[@RawCoding]

Ta

[@parsalotfy]

thanks for your gr8 video

[@huyvole9724]

thank you so much

[@RawCoding]

Thank you for watching

[@ahmetsse]

Thanks for sharing . Nice to know this. Is it possible to make such implementation; lets say semaphoreslim sm.=new semaphoreslim(20) I want to put some sleep/timebreake after 20 request.

[@RawCoding]

There’s no need to put sleep or break the semaphore is the break/sleep when you AwaitAync it will free the thread until the semaphore has more space.

[@ahmetsse]

@@RawCoding I want 5 seconds breake, between first 20 peope and second 20 people

[@RawCoding]

You will need to do batch releases then.

[@User_Masuri]

I wish I could give you 1,000 likes!

[@RawCoding]

Thank you))

[@IMateme]

Genius

[@RawCoding]

cheers :)

[@ultramasculine]

I love you dude

[@vetald1979]

Great. Statement that SemaphoreSlim is a newer version of Semaphore and it needs to be used in all the cases is incorrect, Semaphore is OS kernel mode object can be used for interprocess sync, SemaphoreSlim is a pretty much perpetual loop while(true) { if (!bResourceIsFree) continue; return; } => it's fast, but the cost is CPU usage

[@RawCoding]

From what I see in the source code , waitAsync will create a task and store it in semaphore state as well as return it, release will queue that task to complete it on the thread pool. I don’t see any loop.

[@vetald1979]

@@RawCoding Right. The loop is implemented in sync version. My bad

[@RawCoding]

No worries, didn’t know the Semaphore was working on the kernel level tho thanks for that ;)

[@ahmerkhan7479]

Great

[@RawCoding]

Thanks

[@clearlyunwell]

👍🏽

[@RawCoding]

👍

[@Kitulous]

500 запросов в гугл - верный способ, чтобы тебя реально "в гугле забанили" XD

[@RawCoding]

Не там надо немного побольше постараться))

[@dvdrelin]

'Try catch finally' would be more safely here with semafore releasing in finally section.

[@zlatkoherzl1314]

I'm not gonna subscribe to this channel...No, I'm not...Damn it.

[@RawCoding]

Welcome:D

[@zlatkoherzl1314]

Thx, nicely explained and demonstrated.

[@RawCoding]

Thank you for watching!

[@yasser2768]

I don't see the point having your face in a programming video. That's not watchable.

[@RawCoding]

Wow dude

[@MikhailGolnoshchekov]

Normal face)) I don't know English well, but thanks to facial expressions and gestures, everything is clear!

[@emmanueladebiyi2109]

Nice explanation👍

[@RawCoding]

Cheers