3 ms·
Instruction-less computation
- antome 11y agoTuring-Completeness is a wonderful thing. In fact, it's pretty cool just how many things in various systems are Turing complete: http://www.gwern.net/Turing-complete http://www.gwern.net/Turing-complete
- mukundmr 11y agoDo compilers take advantage of these features?
- Noughmad 11y agoI would think that task switching and interrupts are much slower than actual processor instructions. So there is no reason for compilers to use it.
- Gladdyu 11y agoA task/context switch involves dumping the entire contents of the registers and caches, loading the new values and resuming execution of the other task. It most likely messes up your pipeline - it's several orders of magnitude slower than just executing a simple instruction.
- amelius 11y agoBut what if you are running a task on an expensive supercomputer that bills you based on the number of instructions performed? :)
- IsTom 11y agoMeh. I thought this would be something cool like 110 rules. https://en.wikipedia.org/wiki/Rule_110 https://en.wikipedia.org/wiki/Rule_110
- praseodym 11y agoRelated: an x86/x64 obfuscator that transforms a program to use only mov instructions https://github.com/xoreaxeaxeax/movfuscator https://github.com/xoreaxeaxeax/movfuscator