Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.programmer > #53768
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Newsgroups | comp.lang.java.programmer |
| Subject | Emulating ADA RendezVous in π-WAM (Re: GPU Backend: Find 0xCAFFEE with π-WAM) |
| Date | 2026-08-05 14:30 +0200 |
| Message-ID | <114vacj$10nl1$3@solani.org> (permalink) |
| References | <1148lqu$hg9r$3@solani.org> <114ppkd$svql$3@solani.org> |
Hi, While ADA RendezVous is often depicted as tied to a leading task that initiate the exchange and responder task that completes the exchange. The exchange mechanism itself can be extracted into a channel object. We do so using busy-wait in 100% Prolog to extend the π-WAM emulator. To obtain channel objects, we could straight forward realize the offer/poll from Doug Lea’s SynchronousQueue using the Prolog dynamic database. The test case with emulated MPMC queues worked like a charm. We plan further benchmarking of physically grouped logical threads. Bye See also: Emulating ADA RendezVous in π-WAM https://medium.com/2989/11ad1908dbcf Mild Shock schrieb: > Hi, > > We recently got a little excited seeing the > figures of a budget AI laptop experiment running > π-WAM on its silicon integrated GPU. Meanwhile > we could contain ourselves, and brought the > prototype into production via the library(edge/ > furryhaze). A first experience report. > > We try to find 0xCAFFEE in enumerating 4 6-bit > digits and the baseline is Dogelog Player VM in > a browser. The CPU backend with 64 logical threads > is already 20 times faster, partly due to its > 32-bit specialization. The GPU backend with 4096 > logical threads boosts a further factor of 7 times. > > Bye > > See also: > > GPU Backend: Find 0xCAFFEE with π-WAM > https://medium.com/2989/8890efd3503c > > Mild Shock schrieb: >> Dear All, >> >> We are happy to announce a new edition of >> the Dogelog Player: >> >> - Syntax Errors: >> Using some generic object access API across >> JavaScript, Python and Java, we could extract >> an error line and an error caret from an >> input stream in 100% Prolog, and add it to >> the display of syntax errors. The feature is >> open source, might serve human programmers >> and coder agents brain food alike. >> >> - Parallel Emulation: >> The emulate/1 predicate for π-WAM got a >> brother emulate/2 that accepts an option list, >> that we can extend in future releases. The >> emulator itself has been extended to perform >> a parallel simulation by using interleaved >> synchronized emulation in 100% Prolog and >> recognizes a size/1 option for the number >> of logical threads. >> >> - Parallel Execution: >> There now exists also a CPU backend that >> complements the Dogelog Player cooperative >> multitasking by preemptive multithreading >> accepting π-WAM code via the newly introduced >> execute/2 predicate. This predicate additionally >> recognizes a group/1 option for the number of >> logical threads that are bundled onto >> a physical thread. >> >> Have Fun! >> >> Jan Burse, July 27, 2026, https://www.herbrand.ai/ >
Back to comp.lang.java.programmer | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
GPU Backend: Find 0xCAFFEE with π-WAM (Re: ANN: Dogelog Player 2.2.4 (Parallel π-WAM)) Mild Shock <janburse@fastmail.fm> - 2026-08-03 12:13 +0200
Emulating ADA RendezVous in π-WAM (Re: GPU Backend: Find 0xCAFFEE with π-WAM) Mild Shock <janburse@fastmail.fm> - 2026-08-05 14:30 +0200
Re: Emulating ADA RendezVous in π-WAM (Re: GPU Backend: Find 0xCAFFEE with π-WAM) Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-05 23:44 +0800
π-WAM Assembly: Comfortable Labels and Goto (Re: π-WAM Contest: 1 Million Packets with Prolog) Mild Shock <janburse@fastmail.fm> - 2026-08-09 19:40 +0200
csiph-web