electricshampo1

8 ms·

31.
by electricshampo1 6y ago
(author here) Using srand(0) as in your gist; changing int8_t to char ; using int for sum: BM_hn 10155300 ns BM_avx512 9218652 ns ----- BM_avx512 9372319 ns BM_hn 10428792 ns Your code is getting ~18-19GB/s read b
32.
by electricshampo1 6y ago
(Author here) The main focus of the article is to show a worked example of how to analyze the behavior of simple programs. The circuitous path taken in the article is similar to that which you might face when analyzing your own programs. Th
33.
by electricshampo1 6y ago
NOTE: The article has been updated and expanded since the initial post.
34.
by electricshampo1 6y ago
That is essentially the approach mentioned in the article at " UPDATE: see https://www.realworldtech.com/forum/?threadid=200693&curpost... for a dramatic simplification. Not catching this is an oversight on my
35.
On Summing Integers(unomerite.medium.com)
26 points by electricshampo1 6y ago|13 comments
36.
Facebook’s Tectonic Filesystem:Efficiency from Exascale [pdf](usenix.org)
1 points by electricshampo1 6y ago|0 comments
37.
by electricshampo1 6y ago
One use is scalable counting: Is Parallel Programming Hard, And, If So, What Can You Do About It? https://cdn.kernel.org/pub/linux/kernel/people/paulmck/perfb...
38.
by electricshampo1 6y ago
a related analysis showing epoll vs thread per request https://www.slideshare.net/brendangregg/rxnetty-vs-tomcat-pe...
39.
by electricshampo1 6y ago
66GBps is from each of 10 drives doing ~6.6 GBps; don't think the infinity fabric is the limiter here
40.
by electricshampo1 6y ago
A similar problem previously written about for Google Drive (which files to suggest to the user and possible prefetch) Quick Access: Building a Smart Experience for Google Drive (2017) https://research.google/pubs/pub46
41.
by electricshampo1 6y ago
It shards it this way (by primary key ranges) to support efficient range scans.
42.
by electricshampo1 6y ago
I agree with basically everything you said. However, this would only apply in relatively narrow cases where your workload can be supported by a single RSM. There is an absolute limit for the sequencing alone from a single leader, even after
43.
by electricshampo1 6y ago
I read through this and it is unclear what the point of this is. Most real world RSM deployments (Spanner, DynamoDB, etc) are composed of many separate RSMs one for each shard/partition. The requisite performance is readily provided by
44.
by electricshampo1 6y ago
I think it is unfortunate that single node/non scalable databases are still being used, which then leads people to have to do gymnastics to mitigate their limitations (no write scaling, etc). If they used something like Spanner, they w
45.
by electricshampo1 6y ago
working link: https://www.intel.com/content/dam/www/public/us/en/documents...
46.
by electricshampo1 6y ago
Patrol scrub is basically this ( https://www.intel.com/content/dam/www/public/us/en/documents... it is built into the memory controller, no OS involvement is needed.
47.
by electricshampo1 6y ago
Thanks for this; should have looked more carefully.
48.
by electricshampo1 6y ago
Does sqlite have per page checksums (for bit rot detection)? Only thing per page I see in the docs is https://www.sqlite.org/fileformat2.html "SQLite has the ability to set aside a small number of extra bytes at the en
49.
by electricshampo1 6y ago
Naively it seems that ingestion for data of the form (space (longitude, latitude), time, DATA) is readily addressed by the ideas in that patent: - hierarchical partitioning of space, each node storing the data for the regions represented by
50.
by electricshampo1 6y ago
Try take a look at Spatial Sieve Tree (Inventor J. Andrew Rogers) https://patents.google.com/patent/US7734714B2/en https://www.jandrewrogers.com/2015/03/02/geospatial-database... h
51.
by electricshampo1 6y ago
Some examples: Methods and apparatus for optimizing resource utilization in distributed storage systems https://patents.google.com/patent/US9990147B2/en?inventor=Ja... Load rebalancing for shared resource https:&