Concurrent computing: Difference between revisions
m
→{{header|Wren}}: Changed to Wren S/H
m (→{{header|Wren}}: Changed to Wren S/H) |
|||
| (2 intermediate revisions by 2 users not shown) | |||
Line 60:
print(w)</syntaxhighlight>
=={{header|
==={{header|BaCon}}===
{{libheader|gomp}}
{{works with|OpenMP}}
Line 96 ⟶ 97:
Rosetta</pre>
==={{header|BBC BASIC}}===
{{works with|BBC BASIC for Windows}}
The BBC BASIC interpreter is single-threaded so the only way of achieving 'concurrency' (short of using assembler code) is to use timer events:
Line 1,058 ⟶ 1,059:
=={{header|Java}}==
Create a new <code>Thread</code> array, shuffle the array, start each thread.
<syntaxhighlight lang="java">
Thread[] threads = new Thread[3];
threads[0] = new Thread(() -> System.out.println("enjoy"));
threads[1] = new Thread(() -> System.out.println("rosetta"));
threads[2] = new Thread(() -> System.out.println("code"));
Collections.shuffle(Arrays.asList(threads));
for (Thread thread : threads)
thread.start();
</syntaxhighlight>
<br />
An alternate demonstration
{{works with|Java|1.5+}}
Uses CyclicBarrier to force all threads to wait until they're at the same point before executing the println, increasing the odds they'll print in a different order (otherwise, while the they may be executing in parallel, the threads are started sequentially and with such a short run-time, will usually output sequentially as well).
Line 2,213 ⟶ 2,226:
=={{header|Wren}}==
<syntaxhighlight lang="
var words = ["Enjoy", "Rosetta", "Code"]
| |||