-
We need to devise a method of submitting primitives (triangles, etc) to the low-level renderer such as `OpenGL_3_2` in a renderer-agnostic, efficient manner.
The immediate conclusion for this would b…
-
I am not sure this is the right place, should I move it to email?
I realized a problem when I am writing a comment at https://github.com/ericgu/AnExerciseInCouplingDesRefWG/issues/4
For data flo…
-
Parallel random graph construction in GraphBIG is not implemented correctly.
C++ standard library containers like vector, list, and unordered_map are not thread-safe. Calling push_back concurrently…
-
-
Multi-item CAS or CASN is the basis for some interesting concurrent data structures. It would be nice if `atomic-primops` provides a CASN (or perhaps CAS2, CAS3 ... CAS10?).
I took a look [A Practi…
-
It is easy to write simple benchmarks for concurrent hash tables. But when these data-structures hit real world data is when we learn how they truly perform. There has been much research on concurrent…
-
I am using FLANN algorithm for knnSearch with LSHIndex as the data structure for BRISK descriptors.
I am creating an LSH index with feature descriptors extracted from 67 images.
knnSearch with a ra…
-
What’s pros and cons of using map-sync.Mutex over sync.Map.
-
### Description
I got the following error when doing a simple QA with nano graph:
Model: GPT4-o-mini
User-id: 1, can see public conversations: True
Session reasoning type None
Session LLM opena…
-
It is typically desirable for a compiler to produce the same output for a given input across multiple compilation runs. Some even advocate that two runs with the same input should always produce bitwi…