How to resolve the algorithm Synchronous concurrency step by step in the D programming language
How to resolve the algorithm Synchronous concurrency step by step in the D 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 D programming language
Source code in the d programming language
import std.algorithm, std.concurrency, std.stdio;
void main() {
auto printer = spawn(&printTask, thisTid);
auto f = File("input.txt","r");
foreach (string line; lines(f))
send(printer, line);
send(printer, true); //EOF
auto n = receiveOnly!(int)();
stdout.writefln("\n%d lines printed.", n);
}
void printTask(Tid reader) {
int n = 0;
for (bool eof = false; !eof;)
receive(
(string line) {stdout.write(line); n++;},
(bool) {send(reader, n); eof = true;}
);
}
You may also check:How to resolve the algorithm Binary strings step by step in the Forth programming language
You may also check:How to resolve the algorithm Higher-order functions step by step in the Ol programming language
You may also check:How to resolve the algorithm Nonoblock step by step in the Go programming language
You may also check:How to resolve the algorithm Associative array/Creation step by step in the Groovy programming language
You may also check:How to resolve the algorithm Integer overflow step by step in the Groovy programming language