From Newsgroup: sci.physics

Hi,

Moron there is no SIMT. As I already wrote:

He is also not Zweistein, since he doesn't
understand concepts such as:

- NVIDIA Volta ff. architecture

But you had the SIMD and MIMD disctinction
alreay in OpenMP (via #pragma omp simd and
#pragma omp parallel):

Flynn's Taxonomy classifies computer architectures
according to how many instruction streams (processes)
and data streams they can process simultaneously,
dividing them into four categories:
SISD, SIMD, MISD, and MIMD. https://www.geeksforgeeks.org/computer-organization-architecture/computer-architecture-flynns-taxonomy/

Its not so difficult to understand what
the NVIDIA Volta ff. architecture means.

Bye

Ross Finlayson schrieb:

They're considered really quite simple,
each of those threads is simple, SIMT.

Ross Finlayson schrieb:

On 06/25/2021 07:54 PM, Archimedes Plutonium wrote:

On Monday, June 21, 2021 at 12:00:21 PM UTC-5, Graham Cooper wrote:

On Tuesday, June 22, 2021 at 2:54:40 AM UTC+10, burs...@gmail.com wrote: >>>> Try yourself:

misc.prolog.compound.parenthesis.missing

LMAO!

Jan you work too hard. nobody wants theorem provers on prolog

ASIMO tech is going to LISP which will just have a UNIFY routine

but people can LEARN PROLOG if you EFF OFF!



VOTE NOW! BAN JAN

Archimedes Plutonium votes to ban Jan Burse from all Google
newsgroups, the man is a constant attack machine of anyone around.

Is Jan Burse behind the latest attacks on AP, where he forges AP's
name to Twitter and then appears 50% of Google search hits of AP,
appears all these forged Twitter posts of AP.

And Google says that Burse is a Google Scholar. Does the definition of
Google Scholar mean-- someone who spends the majority of his day in
attack of other people, is that the definition of a Google Scholar?

So if we look at a Google search of "Jan Burse" we see a fair and
balanced with counterpoint on his first page. In fact we see two
Counterpoints of the true character and worth of Jan Burse-- a nonstop
attacker of everyone around him. Shame that Sigmund Freud is not
around anymore, for maybe Sigmund could pry out how a person can be so
disgustingly hateful of everyone around.

So, is Jan the one responsible in filling up the first two pages of
Google Search of AP with venom of forged Twitter.

And a question please, Google, why do you even have Twitter posts in a
Google Search list. Twitter is the gutter press of journalism, so why
are half of AP's first two pages with Twitter forgeries? Or is that a
test that a Google Scholar has to pass,-- defecate into a Google
Search list of another person.

9th and 10th hit on first page of a Google Search of "Jan Burse"
----JAN BURSE BARRED FROM comp.lang.prolog ... - Google Groups
REQUEST FOR DISCUSSION - BAN JAN BURSE WADDA Ya SAY JAN? time to take
a break... you can answer c.l.p questions 2026. Mostowski Collapse's
profile ...

Joel Mesot of Zurich ETH, why cannot the idiot Jan Burse ...
Joel Mesot of Zurich ETH, why cannot the idiot Jan Burse understand
Boole logic is all wrong with his 10 OR 2 = 12 with AND as
subtraction, is Jan Burse a ...

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: sci.physics

Hi,

Confused rossy boy is confused. We are
not building a stupid web server, where
a listener thread spawns service threads,

and to avoid malloc and free, reuses
a pool, or some shitty fork join framework.
The producer and consumer example I posted

elsewhere archived a dataflow without
malloc and free of threads. You are miles
away from what we are doing here.

Bye

Ross Finlayson schrieb:

This is with infinity and continuity,
SIMT is a worker pool.

Mild Shock schrieb:

Hi,

Moron there is no SIMT. As I already wrote:

He is also not Zweistein, since he doesn't
understand concepts such as:

- NVIDIA Volta ff. architecture

But you had the SIMD and MIMD disctinction
alreay in OpenMP (via #pragma omp simd and
#pragma omp parallel):

Flynn's Taxonomy classifies computer architectures
according to how many instruction streams (processes)
and data streams they can process simultaneously,
dividing them into four categories:
SISD, SIMD, MISD, and MIMD. https://www.geeksforgeeks.org/computer-organization-architecture/computer-architecture-flynns-taxonomy/

Its not so difficult to understand what
the NVIDIA Volta ff. architecture means.

Bye

Ross Finlayson schrieb:

They're considered really quite simple,
each of those threads is simple, SIMT.

Ross Finlayson schrieb:

On 06/25/2021 07:54 PM, Archimedes Plutonium wrote:

On Monday, June 21, 2021 at 12:00:21 PM UTC-5, Graham Cooper wrote:

On Tuesday, June 22, 2021 at 2:54:40 AM UTC+10, burs...@gmail.com
wrote:

Try yourself:
misc.prolog.compound.parenthesis.missing

LMAO!

Jan you work too hard. nobody wants theorem provers on prolog

ASIMO tech is going to LISP which will just have a UNIFY routine

but people can LEARN PROLOG if you EFF OFF!



VOTE NOW! BAN JAN

Archimedes Plutonium votes to ban Jan Burse from all Google
newsgroups, the man is a constant attack machine of anyone around.

Is Jan Burse behind the latest attacks on AP, where he forges AP's
name to Twitter and then appears 50% of Google search hits of AP,
appears all these forged Twitter posts of AP.

And Google says that Burse is a Google Scholar. Does the definition
of Google Scholar mean-- someone who spends the majority of his day
in attack of other people, is that the definition of a Google Scholar?

So if we look at a Google search of "Jan Burse" we see a fair and
balanced with counterpoint on his first page. In fact we see two
Counterpoints of the true character and worth of Jan Burse-- a
nonstop attacker of everyone around him. Shame that Sigmund Freud is
not around anymore, for maybe Sigmund could pry out how a person can
be so disgustingly hateful of everyone around.

So, is Jan the one responsible in filling up the first two pages of
Google Search of AP with venom of forged Twitter.

And a question please, Google, why do you even have Twitter posts in
a Google Search list. Twitter is the gutter press of journalism, so
why are half of AP's first two pages with Twitter forgeries? Or is
that a test that a Google Scholar has to pass,-- defecate into a
Google Search list of another person.

9th and 10th hit on first page of a Google Search of "Jan Burse"
----JAN BURSE BARRED FROM comp.lang.prolog ... - Google Groups
REQUEST FOR DISCUSSION - BAN JAN BURSE WADDA Ya SAY JAN? time to take
a break... you can answer c.l.p questions 2026. Mostowski Collapse's
profile ...

Joel Mesot of Zurich ETH, why cannot the idiot Jan Burse ...
Joel Mesot of Zurich ETH, why cannot the idiot Jan Burse understand
Boole logic is all wrong with his 10 OR 2 = 12 with AND as
subtraction, is Jan Burse a ...

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: sci.physics

Hi,

I already posted the candidate MPMC queue
to do these things. But my research is
not yet conclusive:

Its actually quite amazing. Gemini, DeepSeek,
OpenAI all know Dmitriy V'jukov. I have asked
the IntelliJ integrated Freeium AI to generate

some code for me, I guess their service uses
by default OpenAI (Codex), and had it reviewed
by Gemini and DeepSeek. These AIs started lecturing

me about lazySet() in Java. But I went with set():

private static boolean enqueue(Queue q, Object data) {
int pos = q.enqueuePos.get();
for (; ; ) {
int index = pos & q.bufferMask;
int seq = q.sequences.get(index);
int dif = seq - pos;
if (dif == 0) {
if (q.enqueuePos.compareAndSet(pos, pos + 1)) {
q.data[index] = data;
q.sequences.set(index, pos + 1);
return true;
}
pos = q.enqueuePos.get();
} else if (dif < 0) {
return false;
} else {
pos = q.enqueuePos.get();
}
}
}

The above version seems to be more suitable
for my purpose, since it allows polling, it
basically implements offer(). While the

version posted on in the lock free group
by Chris M. Thomasson implements a spin wait
blocking put() already.

Bye

Mild Shock schrieb:

Hi,

Confused rossy boy is confused. We are
not building a stupid web server, where
a listener thread spawns service threads,

and to avoid malloc and free, reuses
a pool, or some shitty fork join framework.
The producer and consumer example I posted

elsewhere archived a dataflow without
malloc and free of threads. You are miles
away from what we are doing here.

Bye

Ross Finlayson schrieb:

This is with infinity and continuity,
SIMT is a worker pool.

Mild Shock schrieb:

Hi,

Moron there is no SIMT. As I already wrote:

He is also not Zweistein, since he doesn't
understand concepts such as:

- NVIDIA Volta ff. architecture

But you had the SIMD and MIMD disctinction
alreay in OpenMP (via #pragma omp simd and
#pragma omp parallel):

Flynn's Taxonomy classifies computer architectures
according to how many instruction streams (processes)
and data streams they can process simultaneously,
dividing them into four categories:
SISD, SIMD, MISD, and MIMD.
https://www.geeksforgeeks.org/computer-organization-architecture/computer-architecture-flynns-taxonomy/


Its not so difficult to understand what
the NVIDIA Volta ff. architecture means.

Bye

Ross Finlayson schrieb:

They're considered really quite simple,
each of those threads is simple, SIMT.

Ross Finlayson schrieb:

On 06/25/2021 07:54 PM, Archimedes Plutonium wrote:

On Monday, June 21, 2021 at 12:00:21 PM UTC-5, Graham Cooper wrote:

On Tuesday, June 22, 2021 at 2:54:40 AM UTC+10, burs...@gmail.com
wrote:

Try yourself:
misc.prolog.compound.parenthesis.missing

LMAO!

Jan you work too hard. nobody wants theorem provers on prolog

ASIMO tech is going to LISP which will just have a UNIFY routine

but people can LEARN PROLOG if you EFF OFF!



VOTE NOW! BAN JAN

Archimedes Plutonium votes to ban Jan Burse from all Google
newsgroups, the man is a constant attack machine of anyone around.

Is Jan Burse behind the latest attacks on AP, where he forges AP's
name to Twitter and then appears 50% of Google search hits of AP,
appears all these forged Twitter posts of AP.

And Google says that Burse is a Google Scholar. Does the definition
of Google Scholar mean-- someone who spends the majority of his day
in attack of other people, is that the definition of a Google Scholar? >>>>
So if we look at a Google search of "Jan Burse" we see a fair and
balanced with counterpoint on his first page. In fact we see two
Counterpoints of the true character and worth of Jan Burse-- a
nonstop attacker of everyone around him. Shame that Sigmund Freud is
not around anymore, for maybe Sigmund could pry out how a person can
be so disgustingly hateful of everyone around.

So, is Jan the one responsible in filling up the first two pages of
Google Search of AP with venom of forged Twitter.

And a question please, Google, why do you even have Twitter posts in
a Google Search list. Twitter is the gutter press of journalism, so
why are half of AP's first two pages with Twitter forgeries? Or is
that a test that a Google Scholar has to pass,-- defecate into a
Google Search list of another person.

9th and 10th hit on first page of a Google Search of "Jan Burse"
----JAN BURSE BARRED FROM comp.lang.prolog ... - Google Groups
REQUEST FOR DISCUSSION - BAN JAN BURSE WADDA Ya SAY JAN? time to
take a break... you can answer c.l.p questions 2026. Mostowski
Collapse's profile ...

Joel Mesot of Zurich ETH, why cannot the idiot Jan Burse ...
Joel Mesot of Zurich ETH, why cannot the idiot Jan Burse understand
Boole logic is all wrong with his 10 OR 2 = 12 with AND as
subtraction, is Jan Burse a ...

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: sci.physics

Hi,

Nobody cares about CivetWeb a C++/C library,
the rossy boy moron refuses to understand this
simple GPU test, that shows some AI Acceleration:

11.4 Giga Lips with a Budget Laptop https://github.com/Jean-Luc-Picard-2021/gigabudget

Bye

Johann 'Myrkraverk' Oskarsson schrieb:

Why not? Isn't this comp.lang.c? And isn't that exactly how
CivetWeb works internally? Have you never built your own web
sever in C? Not even with CivetWeb? It's really easy! You
only need to implement a callback or two.

Mild Shock schrieb:

Hi,

I already posted the candidate MPMC queue
to do these things. But my research is
not yet conclusive:

Its actually quite amazing. Gemini, DeepSeek,
OpenAI all know Dmitriy V'jukov. I have asked
the IntelliJ integrated Freeium AI to generate

some code for me, I guess their service uses
by default OpenAI (Codex), and had it reviewed
by Gemini and DeepSeek. These AIs started lecturing

me about lazySet() in Java. But I went with set():

-a-a-a-a private static boolean enqueue(Queue q, Object data) {
-a-a-a-a-a-a-a-a int pos = q.enqueuePos.get();
-a-a-a-a-a-a-a-a for (; ; ) {
-a-a-a-a-a-a-a-a-a-a-a-a int index = pos & q.bufferMask;
-a-a-a-a-a-a-a-a-a-a-a-a int seq = q.sequences.get(index);
-a-a-a-a-a-a-a-a-a-a-a-a int dif = seq - pos;
-a-a-a-a-a-a-a-a-a-a-a-a if (dif == 0) {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a if (q.enqueuePos.compareAndSet(pos, pos + 1)) {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a q.data[index] = data;
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a q.sequences.set(index, pos + 1);
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a return true;
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a }
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a pos = q.enqueuePos.get();
-a-a-a-a-a-a-a-a-a-a-a-a } else if (dif < 0) {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a return false;
-a-a-a-a-a-a-a-a-a-a-a-a } else {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a pos = q.enqueuePos.get();
-a-a-a-a-a-a-a-a-a-a-a-a }
-a-a-a-a-a-a-a-a }
-a-a-a-a }

The above version seems to be more suitable
for my purpose, since it allows polling, it
basically implements offer(). While the

version posted on in the lock free group
by Chris M. Thomasson implements a spin wait
blocking put() already.

Bye

Mild Shock schrieb:

Hi,

Confused rossy boy is confused. We are
not building a stupid web server, where
a listener thread spawns service threads,

and to avoid malloc and free, reuses
a pool, or some shitty fork join framework.
The producer and consumer example I posted

elsewhere archived a dataflow without
malloc and free of threads. You are miles
away from what we are doing here.

Bye

Ross Finlayson schrieb:

This is with infinity and continuity,
SIMT is a worker pool.

Mild Shock schrieb:

Hi,

Moron there is no SIMT. As I already wrote:

He is also not Zweistein, since he doesn't
understand concepts such as:

- NVIDIA Volta ff. architecture

But you had the SIMD and MIMD disctinction
alreay in OpenMP (via #pragma omp simd and
#pragma omp parallel):

Flynn's Taxonomy classifies computer architectures
according to how many instruction streams (processes)
and data streams they can process simultaneously,
dividing them into four categories:
SISD, SIMD, MISD, and MIMD.
https://www.geeksforgeeks.org/computer-organization-architecture/computer-architecture-flynns-taxonomy/


Its not so difficult to understand what
the NVIDIA Volta ff. architecture means.

Bye

Ross Finlayson schrieb:

They're considered really quite simple,
each of those threads is simple, SIMT.

Ross Finlayson schrieb:

On 06/25/2021 07:54 PM, Archimedes Plutonium wrote:

On Monday, June 21, 2021 at 12:00:21 PM UTC-5, Graham Cooper wrote: >>>>>> On Tuesday, June 22, 2021 at 2:54:40 AM UTC+10, burs...@gmail.com >>>>>> wrote:

Try yourself:
misc.prolog.compound.parenthesis.missing

LMAO!

Jan you work too hard. nobody wants theorem provers on prolog

ASIMO tech is going to LISP which will just have a UNIFY routine

but people can LEARN PROLOG if you EFF OFF!



VOTE NOW! BAN JAN

Archimedes Plutonium votes to ban Jan Burse from all Google
newsgroups, the man is a constant attack machine of anyone around.

Is Jan Burse behind the latest attacks on AP, where he forges AP's
name to Twitter and then appears 50% of Google search hits of AP,
appears all these forged Twitter posts of AP.

And Google says that Burse is a Google Scholar. Does the definition >>>>> of Google Scholar mean-- someone who spends the majority of his day >>>>> in attack of other people, is that the definition of a Google Scholar? >>>>>
So if we look at a Google search of "Jan Burse" we see a fair and
balanced with counterpoint on his first page. In fact we see two
Counterpoints of the true character and worth of Jan Burse-- a
nonstop attacker of everyone around him. Shame that Sigmund Freud
is not around anymore, for maybe Sigmund could pry out how a person >>>>> can be so disgustingly hateful of everyone around.

So, is Jan the one responsible in filling up the first two pages of >>>>> Google Search of AP with venom of forged Twitter.

And a question please, Google, why do you even have Twitter posts
in a Google Search list. Twitter is the gutter press of journalism, >>>>> so why are half of AP's first two pages with Twitter forgeries? Or
is that a test that a Google Scholar has to pass,-- defecate into a >>>>> Google Search list of another person.

9th and 10th hit on first page of a Google Search of "Jan Burse"
----JAN BURSE BARRED FROM comp.lang.prolog ... - Google Groups
REQUEST FOR DISCUSSION - BAN JAN BURSE WADDA Ya SAY JAN? time to
take a break... you can answer c.l.p questions 2026. Mostowski
Collapse's profile ...

Joel Mesot of Zurich ETH, why cannot the idiot Jan Burse ...
Joel Mesot of Zurich ETH, why cannot the idiot Jan Burse understand >>>>> Boole logic is all wrong with his 10 OR 2 = 12 with AND as
subtraction, is Jan Burse a ...

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: sci.physics

Hi,

Maybe there is a Rossy Boy flux generator
web server with infinity and continuity
HTTPS and .mjs type, aka SIMT halucination.

To run the GPU example that is written in HTML,
JavaScript and WebGPU / WGSL, the minium is
possibly a HTTPS server that can deliver the

right mime type for the .mjs extension. Its
then only a bundle of static pages that does
the demonstration. What worked on my side

is the IntelliJ browse button, which then uses
a small local server on its own, sandboxed to
serving some project files.

But this is only how to launch the test pages.

The Rossy Boy SIMT halucination, ould also work, who knows?

Bye

Mild Shock schrieb:

Hi,

Nobody cares about CivetWeb a C++/C library,
the rossy boy moron refuses to understand this
simple GPU test, that shows some AI Acceleration:

11.4 Giga Lips with a Budget Laptop https://github.com/Jean-Luc-Picard-2021/gigabudget

Bye

Johann 'Myrkraverk' Oskarsson schrieb:

Why not?-a Isn't this comp.lang.c?-a And isn't that exactly how
CivetWeb works internally?-a Have you never built your own web
sever in C?-a Not even with CivetWeb?-a It's really easy!-a You
only need to implement a callback or two.

Mild Shock schrieb:

Hi,

I already posted the candidate MPMC queue
to do these things. But my research is
not yet conclusive:

Its actually quite amazing. Gemini, DeepSeek,
OpenAI all know Dmitriy V'jukov. I have asked
the IntelliJ integrated Freeium AI to generate

some code for me, I guess their service uses
by default OpenAI (Codex), and had it reviewed
by Gemini and DeepSeek. These AIs started lecturing

me about lazySet() in Java. But I went with set():

-a-a-a-a private static boolean enqueue(Queue q, Object data) {
-a-a-a-a-a-a-a-a int pos = q.enqueuePos.get();
-a-a-a-a-a-a-a-a for (; ; ) {
-a-a-a-a-a-a-a-a-a-a-a-a int index = pos & q.bufferMask;
-a-a-a-a-a-a-a-a-a-a-a-a int seq = q.sequences.get(index);
-a-a-a-a-a-a-a-a-a-a-a-a int dif = seq - pos;
-a-a-a-a-a-a-a-a-a-a-a-a if (dif == 0) {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a if (q.enqueuePos.compareAndSet(pos, pos + 1)) {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a q.data[index] = data;
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a q.sequences.set(index, pos + 1); >> -a>-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a return true;
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a }
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a pos = q.enqueuePos.get();
-a-a-a-a-a-a-a-a-a-a-a-a } else if (dif < 0) {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a return false;
-a-a-a-a-a-a-a-a-a-a-a-a } else {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a pos = q.enqueuePos.get();
-a-a-a-a-a-a-a-a-a-a-a-a }
-a-a-a-a-a-a-a-a }
-a-a-a-a }

The above version seems to be more suitable
for my purpose, since it allows polling, it
basically implements offer(). While the

version posted on in the lock free group
by Chris M. Thomasson implements a spin wait
blocking put() already.

Bye

Mild Shock schrieb:

Hi,

Confused rossy boy is confused. We are
not building a stupid web server, where
a listener thread spawns service threads,

and to avoid malloc and free, reuses
a pool, or some shitty fork join framework.
The producer and consumer example I posted

elsewhere archived a dataflow without
malloc and free of threads. You are miles
away from what we are doing here.

Bye

Ross Finlayson schrieb:

This is with infinity and continuity,
SIMT is a worker pool.

Mild Shock schrieb:

Hi,

Moron there is no SIMT. As I already wrote:

He is also not Zweistein, since he doesn't
understand concepts such as:

- NVIDIA Volta ff. architecture

But you had the SIMD and MIMD disctinction
alreay in OpenMP (via #pragma omp simd and
#pragma omp parallel):

Flynn's Taxonomy classifies computer architectures
according to how many instruction streams (processes)
and data streams they can process simultaneously,
dividing them into four categories:
SISD, SIMD, MISD, and MIMD.
https://www.geeksforgeeks.org/computer-organization-architecture/computer-architecture-flynns-taxonomy/


Its not so difficult to understand what
the NVIDIA Volta ff. architecture means.

Bye

Ross Finlayson schrieb:

They're considered really quite simple,
each of those threads is simple, SIMT.

Ross Finlayson schrieb:

On 06/25/2021 07:54 PM, Archimedes Plutonium wrote:

On Monday, June 21, 2021 at 12:00:21 PM UTC-5, Graham Cooper wrote: >>>>>>> On Tuesday, June 22, 2021 at 2:54:40 AM UTC+10, burs...@gmail.com >>>>>>> wrote:

Try yourself:
misc.prolog.compound.parenthesis.missing

LMAO!

Jan you work too hard. nobody wants theorem provers on prolog

ASIMO tech is going to LISP which will just have a UNIFY routine >>>>>>>
but people can LEARN PROLOG if you EFF OFF!

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: sci.physics

Hi,

Your strictness is your problem , not mine.
The WebGPU / WGSL has explicitly an API
for so called compute shaders.

You can also combine compute shaders and
render shaders. But to use compute shaders
for AI acceration is not uncommon now.

See the WebLLM project by OpenAI where a
transformer is just a WebGPU / WGSL
pipeline type:

WebLLM: High-Performance
In-Browser LLM Inference Engine
https://webllm.mlc.ai/

But I do not assume that everybody is
crawling out of under his rock. And trying
to understand what happens with post NVIDIA

Volta GPUs that come as mobile iGPUs.

Take your time.

Bye

Johann 'Myrkraverk' Oskarsson schrieb:

On 29/07/2026 5:27 PM, Mild Shock wrote:

Hi,

Nobody cares about CivetWeb a C++/C library,
the rossy boy moron refuses to understand this
simple GPU test, that shows some AI Acceleration:

I don't know about you, but I don't run my webserver on my GPU. I use
it strictly for graphics.

Mild Shock schrieb:

Hi,

Maybe there is a Rossy Boy flux generator
web server with infinity and continuity
HTTPS and .mjs type, aka SIMT halucination.

To run the GPU example that is written in HTML,
JavaScript and WebGPU / WGSL, the minium is
possibly a HTTPS server that can deliver the

right mime type for the .mjs extension. Its
then only a bundle of static pages that does
the demonstration. What worked on my side

is the IntelliJ browse button, which then uses
a small local server on its own, sandboxed to
serving some project files.

But this is only how to launch the test pages.

The Rossy Boy SIMT halucination, ould also work, who knows?

Bye

Mild Shock schrieb:

Hi,

Nobody cares about CivetWeb a C++/C library,
the rossy boy moron refuses to understand this
simple GPU test, that shows some AI Acceleration:

11.4 Giga Lips with a Budget Laptop
https://github.com/Jean-Luc-Picard-2021/gigabudget

Bye

Johann 'Myrkraverk' Oskarsson schrieb:

Why not?-a Isn't this comp.lang.c?-a And isn't that exactly how
CivetWeb works internally?-a Have you never built your own web
sever in C?-a Not even with CivetWeb?-a It's really easy!-a You
only need to implement a callback or two.

Mild Shock schrieb:

Hi,

I already posted the candidate MPMC queue
to do these things. But my research is
not yet conclusive:

Its actually quite amazing. Gemini, DeepSeek,
OpenAI all know Dmitriy V'jukov. I have asked
the IntelliJ integrated Freeium AI to generate

some code for me, I guess their service uses
by default OpenAI (Codex), and had it reviewed
by Gemini and DeepSeek. These AIs started lecturing

me about lazySet() in Java. But I went with set():

-a-a-a-a private static boolean enqueue(Queue q, Object data) {
-a-a-a-a-a-a-a-a int pos = q.enqueuePos.get();
-a-a-a-a-a-a-a-a for (; ; ) {
-a-a-a-a-a-a-a-a-a-a-a-a int index = pos & q.bufferMask;
-a-a-a-a-a-a-a-a-a-a-a-a int seq = q.sequences.get(index);
-a-a-a-a-a-a-a-a-a-a-a-a int dif = seq - pos;
-a-a-a-a-a-a-a-a-a-a-a-a if (dif == 0) {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a if (q.enqueuePos.compareAndSet(pos, pos + 1)) {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a q.data[index] = data;
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a q.sequences.set(index, pos + 1);
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a return true;
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a }
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a pos = q.enqueuePos.get();
-a-a-a-a-a-a-a-a-a-a-a-a } else if (dif < 0) {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a return false;
-a-a-a-a-a-a-a-a-a-a-a-a } else {
-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a-a pos = q.enqueuePos.get();
-a-a-a-a-a-a-a-a-a-a-a-a }
-a-a-a-a-a-a-a-a }
-a-a-a-a }

The above version seems to be more suitable
for my purpose, since it allows polling, it
basically implements offer(). While the

version posted on in the lock free group
by Chris M. Thomasson implements a spin wait
blocking put() already.

Bye

Mild Shock schrieb:

Hi,

Confused rossy boy is confused. We are
not building a stupid web server, where
a listener thread spawns service threads,

and to avoid malloc and free, reuses
a pool, or some shitty fork join framework.
The producer and consumer example I posted

elsewhere archived a dataflow without
malloc and free of threads. You are miles
away from what we are doing here.

Bye

Ross Finlayson schrieb:

This is with infinity and continuity,
SIMT is a worker pool.

Mild Shock schrieb:

Hi,

Moron there is no SIMT. As I already wrote:

He is also not Zweistein, since he doesn't
understand concepts such as:

- NVIDIA Volta ff. architecture

But you had the SIMD and MIMD disctinction
alreay in OpenMP (via #pragma omp simd and
#pragma omp parallel):

Flynn's Taxonomy classifies computer architectures
according to how many instruction streams (processes)
and data streams they can process simultaneously,
dividing them into four categories:
SISD, SIMD, MISD, and MIMD.
https://www.geeksforgeeks.org/computer-organization-architecture/computer-architecture-flynns-taxonomy/


Its not so difficult to understand what
the NVIDIA Volta ff. architecture means.

Bye

Ross Finlayson schrieb:

They're considered really quite simple,
each of those threads is simple, SIMT.

Ross Finlayson schrieb:

On 06/25/2021 07:54 PM, Archimedes Plutonium wrote:

On Monday, June 21, 2021 at 12:00:21 PM UTC-5, Graham Cooper wrote: >>>>>>>> On Tuesday, June 22, 2021 at 2:54:40 AM UTC+10,

burs...@gmail.com wrote:

Try yourself:
misc.prolog.compound.parenthesis.missing

LMAO!

Jan you work too hard. nobody wants theorem provers on prolog

ASIMO tech is going to LISP which will just have a UNIFY routine >>>>>>>>
but people can LEARN PROLOG if you EFF OFF!

--- Synchronet 3.22a-Linux NewsLink 1.2