How to resolve the algorithm Synchronous concurrency step by step in the Elixir programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Synchronous concurrency step by step in the Elixir programming language

Table of Contents

Problem Statement

The goal of this task is to create two concurrent activities ("Threads" or "Tasks", not processes.) that share data synchronously. Your language may provide syntax or libraries to perform concurrency. Different languages provide different implementations of concurrency, often with different names. Some languages use the term threads, others use the term tasks, while others use co-processes. This task should not be implemented using fork, spawn, or the Linux/UNIX/Win32 pipe command, as communication should be between threads, not processes. One of the concurrent units will read from a file named "input.txt" and send the contents of that file, one line at a time, to the other concurrent unit, which will print the line it receives to standard output. The printing unit must count the number of lines it prints. After the concurrent unit reading the file sends its last line to the printing unit, the reading unit will request the number of lines printed by the printing unit. The reading unit will then print the number of lines printed by the printing unit. This task requires two-way communication between the concurrent units. All concurrent units must cleanly terminate at the end of the program.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Synchronous concurrency step by step in the Elixir programming language

Source code in the elixir programming language

defmodule RC do
  def start do
     my_pid = self
     pid = spawn( fn -> reader(my_pid, 0) end )
     File.open( "input.txt", [:read], fn io ->
       process( IO.gets(io, ""), io, pid )
     end )
  end
  
  defp process( :eof, _io, pid ) do
    send( pid, :count )
    receive do
      i -> IO.puts "Count:#{i}"
    end
  end
  defp process( any, io, pid ) do
    send( pid, any )
    process( IO.gets(io, ""), io, pid )
  end
  
  defp reader( pid, c ) do
    receive do
      :count -> send( pid, c )
      any ->
        IO.write any
        reader( pid, c+1 )
    end
  end
end

RC.start


  

You may also check:How to resolve the algorithm URL encoding step by step in the BBC BASIC programming language
You may also check:How to resolve the algorithm Inheritance/Multiple step by step in the Raku programming language
You may also check:How to resolve the algorithm Price fraction step by step in the Oz programming language
You may also check:How to resolve the algorithm MD5/Implementation step by step in the Lingo programming language
You may also check:How to resolve the algorithm 24 game/Solve step by step in the Euler Math Toolbox programming language