GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing en.wikipedia.org — Channel (programming) - Wikipedia This article is about software inter-thread communication; not to be confused with Channel (communications) or I/O channel.
In computing, a channel is a model for inter-thread communication and synchronization via message passing. A message may be sent over a channel, and another process or thread is able to receive messages sent over a channel it has a reference to, as a stream. Different implementations of channels may be buffered or not, and either synchronous or asynchronous. ExamplesClibthread, a multithreading library for C, which was first created for the operating system Plan 9, offers inter-thread communication based on fixed-size channels. C with ClassesIn Bjarne Stroustrup's "C with Classes" language (which would later become C++), inter-task communication was done through queue classes provided by C#In C#, the using System; using System.Threading.Channels; using System.Threading.Tasks; Channel<string> channel = Channel.CreateBounded<string>(capacity: 10); // Producer task Task producer = Task.Run(async () => { for (int i = 0; i < 20; i++) { await channel.Writer.WriteAsync($"Message {i}"); } channel.Writer.Complete(); }); // Consumer task Task consumer = Task.Run(async () => { await foreach (string message in channel.Reader.ReadAllAsync()) { Console.WriteLine(message); } }); await Task.WhenAll(producer, consumer); C++C++ has no standardised channel class in the standard library, but C++29 has a proposal for a concurrent queue class, import std; using std::bounded_queue; using std::jthread; using std::string; bounded_queue<string> q(10); // Producer thread jthread producer([&q] -> void { for (int i = 0; i < 20; ++i) { q.push_wait(std::format("Message {}", i)); } q.close(); // Signals consumer to finish }); // Consumer thread jthread consumer([&q] -> void { string message; while (q.pop_wait(message) { // Blocks if empty std::println("{}", message); } }); GoThis snippet of Go code performs similarly to the XC code. First the channel c is created, then a goroutine is spawned which sends 42 through the channel. When the number is put in the channel x is set to 42. Go allows channels to buffer contents, as well as non blocking receiving through the use of a select block.[3] c := make(chan int) go func() {c <- 42}() x := <- c JavaIn Java, the
import java.util.concurrent.ArrayBlockingQueue; import java.util.concurrent.BlockingQueue; BlockingQueue<String> q = new ArrayBlockingQueue<>(10); // capacity of 10 // Producer thread Thread producer = new Thread(() -> { try { for (int i = 0; i < 20; i++) { q.put("Message " + i); // Blocks safely until consumer makes space } q.put("DONE"); // Poison pill to signal completion } catch (InterruptedException e) { Thread.currentThread().interrupt(); } }); // Consumer thread Thread consumer = new Thread(() -> { try { while (true) { String message = q.take(); // Blocks safely until item arrives if (message.equals("DONE")) { break; } System.out.println(message); } } catch (InterruptedException e) { Thread.currentThread().interrupt(); } }); producer.start(); consumer.start(); The package KotlinThe Kotlin Channel API provides channels; while a
import kotlinx.coroutines.* import kotlinx.coroutines.channels.ReceiveChannel import kotlinx.coroutines.channels.produce fun main() = runBlocking { val channel: ReceiveChannel<String> = produce(Dispatchers.Default, capacity = 10) { for (i in 0 until 20) { channel.send("Message $i") } } // Consumer coroutine launch(Dispatchers.Default) { for (message in channel) { println(message) } } } Lua Love2DThe Love2D library which uses the Lua programming language implements channels with push and pop operations similar to stacks. The pop operation will block so as long as there is data resident on the stack. A demand operation is equivalent to pop, except it will block until there is data on the stack -- A string containing code which will be interpreted by a function such as loadstring(), -- but on the C side to start a native thread. local threadCode = [[ love.thread.getChannel("test"):push("Hello world!") ]] function love.load() -- Start the thread. thread = love.thread.newThread(threadCode) thread:start() -- The thread will block until "Hello world!" is popped off channel test's stack. -- Because the channel can be popped from before the thread first executes, there may not be data on the stack. -- in that case use :demand() instead of :pop() because :demand() will block until there is data on the stack and then return the data. print(love.thread.getChannel("test"):demand()) -- The thread can now finish. end OCamlThe OCaml RustRust provides asynchronous channels for communication between threads. Channels allow a unidirectional flow of information between two endpoints: the use std::sync::mpsc; use std::thread; fn main() { let (tx, rx) = mpsc::channel(); thread::spawn(move || { tx.send(123).unwrap(); }); let result = rx.recv(); println!("{result:?}"); } XMOS XCThe XMOS programming language XC provides a primitive type "Chan" and two operators "<:" and ":>" for sending and receiving data from a channel.[5] In this example, two hardware threads are started on the XMOS, running the two lines in the "par" block. The first line transmits the number 42 through the channel while the second waits until it is received and sets the value of x. The XC language also allows asynchronous receiving on channels through a select statement. chan c; int x; par { c <: 42; c :> x; } ApplicationsIn addition to their fundamental use for inter-thread communication, channels can be used as a primitive to implement various other concurrent programming constructs which can be realized as streams. For example, channels can be used to construct futures and promises, where a future is a one-element channel, and a promise is a process that sends to the channel, fulfilling the future.[6] Similarly, iterators can be constructed directly from channels.[7] List of implementationsList of non-standard, library-based implementations of channels
References
External links |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |