yeah were actually from the same koala colony
1F8LZF…8gsQ
1F8LZF7xb8a7aSnGV226bXECALFP9u8gsQ
- 0 Following
- 0 Followers
- 614 Posts
Activity
I’m not very up to date with what the cool kids do, but that appears to be just JSON sir
brrrscript, my favorite
/pay @27 $10.00
anyone ever used a HackRF
we could also make our own from ZT
expressvpn. express is the only one i know of who was raided and had authorities admit there was nothing they could use on the servers they stole.
https://www.expressvpn.com/blog/expressvpn-statement-andrey-karlov-investigation/
i forget who had some thoughts on ceph awhile ago but iirc it was meh
[https://ceph.com/wp-content/uploads/2016/08/weil-crush-sc06.pdf]
twetch#7453 6.9y
"File systems unfit as distributed storage backends"
http://delivery.acm.org/10.1145/3360000/3359656/p353-aghayev.pdf
ah it was @1623, shoulda known
took me 45 minutes to order from apmex bc the site kept timing out
i think i've said this before but you definitely have a future as a motivational speaker
the great slumber
youve enlightened me
about 25% of the time with twetch wallet, it says "twetch wallet: balance too low" or something and i have to post the same thing again
watchin CSW before bed, eh
Reposted
twetch#2022 6.0y
there are two kinds of programmers - those who have written compilers and those who havent
Reposted
twetch#7335 7.2y
fast c compiler (called b: isomorphic to c)
computer language benchmarks: t.b and t.c
run compile(ms) runsize
b 230 .06 1K
gcc-O1 320 60.00 3K
gcc-O2 230 90.00 3K
gcc-O9 230 200.00 8K
In a word, polyhedral techniques are the symbolic counterpart, for structured loops (but without unrolling them), of compilation techniques designed for acyclic control-flow graphs or unstructured loops.
Polyhedral compilation encompasses the compilation techniques that rely on the representation of programs and that exploit combinatorial/geometrical optimizations on these objects to analyze/optimize the programs.
Compared to optimizations that handle loops or arrays as a whole, polyhedral techniques can work at the granularity of their elements, i.e., at the granularity of a loop iteration and instance of a statement, and at the granularity of an array element.
"MLIR embraces polyhedral compiler techniques for their many advantages representing and transforming dense numerical kernels, but it uses a form that differs significantly from other polyhedral frameworks"
twetch#7453 5.7y
MLIR: A Compiler Infrastructure for the End of Moore's Law
[https://arxiv.org/pdf/2002.11054.pdf]
The interest of using polyhedral representations is that they can be manipulated or optimized with algorithms whose complexity depends on their structure and not on the number of elements they represent.
an intermediate representation acts as a common denominator for logical simplifications (optimizations) of code. attempting to optimize without an IR is less about the possible optimizations and more about the quirks of the frontend language
In particular, LLVM IR is both well specified and the only interface to the optimizer
An intermediate representation (IR) is the data structure or code used internally by a compiler or virtual machine to represent source code. An IR is designed to be conducive for further processing, such as optimization and translation.
An IR may take one of several forms: an in-memory data structure, or a special tuple- or stack-based code readable by the program. In the latter case it is also called an intermediate language.