<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Semaphore on Vishal Chovatiya</title>
    <link>https://vishalchovatiya.github.io/tags/semaphore/</link>
    <description>Recent content in Semaphore on Vishal Chovatiya</description>
    <image>
      <title>Vishal Chovatiya</title>
      <url>https://vishalchovatiya.github.io/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E</url>
      <link>https://vishalchovatiya.github.io/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E</link>
    </image>
    <generator>Hugo -- 0.128.0</generator>
    <language>en</language>
    <lastBuildDate>Sat, 10 Sep 2016 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://vishalchovatiya.github.io/tags/semaphore/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Binary semaphore example between threads in C</title>
      <link>https://vishalchovatiya.github.io/posts/binary-semaphore-example-between-threads-in-c/</link>
      <pubDate>Sat, 10 Sep 2016 00:00:00 +0000</pubDate>
      <guid>https://vishalchovatiya.github.io/posts/binary-semaphore-example-between-threads-in-c/</guid>
      <description>Semaphore is a synchronization mechanism. In more words, semaphores are a technique for coordinating or synchronizing activities in which multiple processes compete for the same resources. There are 2 types of semaphores: Binary semaphores &amp;amp; Counting semaphores. But our focus would be on binary semaphore only. That too binary semaphore example between threads in C language specifically. If you are in search of semaphore between processes then see this.
As its name suggest binary semaphore can have a value either 0 or 1.</description>
    </item>
    <item>
      <title>Semaphore between processes example in C</title>
      <link>https://vishalchovatiya.github.io/posts/semaphore-between-processes-example-in-c/</link>
      <pubDate>Sat, 10 Sep 2016 00:00:00 +0000</pubDate>
      <guid>https://vishalchovatiya.github.io/posts/semaphore-between-processes-example-in-c/</guid>
      <description>Semaphore is a synchronization mechanism. In more words, semaphores are a technique for coordinating or synchronizing activities in which multiple processes compete for the same resources. There are 2 types of semaphores: Binary semaphores &amp;amp; Counting semaphores. Binary Semaphores: Only two states 0 &amp;amp; 1, i.e., locked/unlocked or available/unavailable, Mutex implementation. Counting Semaphores: Semaphores which allow arbitrary resource count called counting semaphores. Here, we will see the POSIX style semaphore. POSIX semaphore calls are much simpler than the System V semaphore calls.</description>
    </item>
  </channel>
</rss>
