8 ms·
ARM Cortex-A72 fetch and branch processing
- lukehutch 6y agoWhat's the previously-investigated dataflow processor architecture that the author refers to in the bolded text?
- phire 6y agohttps://en.wikipedia.org/wiki/Dataflow_architecture https://en.wikipedia.org/wiki/Dataflow_architecture
- monocasa 6y agoI believe they're just commenting on how Tomusulo style OoO cores are internally similar to dataflow architectures in general, despite presenting a von Neumann veneer. https://en.m.wikipedia.org/wiki/Dataflow_architecture https://en.m.wikipedia.org/wiki/Dataflow_architecture
- CalChris 6y agoRight. So instead of speculation killed dataflow it's speculation used dataflow but in a useful way.
- GregarianChild 6y agoSpeculation killed dataflow. (Attributed to Arvind 2005) There have been many attempts at making data-flow applications compatible with general purpose computation workloads. They all failed to beat the performance of comparable conventional processors. [1] lists the following disadvantages of data-flow: - Debugging difficult (no precise state) - Interrupt/exception handling is difficult (what is precise state semantics?) - Implementing dynamic data structures difficult in pure data flow models - Too much parallelism? (Parallelism control needed) - High bookkeeping overhead (tag matching, data storage) - Instruction cycle is inefficient [1] https://course.ece.cmu.edu/~ece740/f13/lib/exe/fetch.php?media=onur-740-fall13-module5.2.1-dataflow-part1.pdf https://course.ece.cmu.edu/~ece740/f13/lib/exe/fetch.php?med...
- person_of_color 6y agoDidn't Wave Computing try this?
- lxgr 6y ago> This all may seem inefficient and crazy and it is. Program representation and execution need a major re-think along the lines of the once-investigated dataflow architecture. Why do and then un-do? In a world where most code is JIT compiled on the target architecture and/or periodically re-compiled using the latest, optimized compiler once a new CPU comes out – sure. But is that realistic? Maybe that would work for Android and iOS (with on-device and app store level compilation, respectively), but with Docker, we seem to be moving to the opposite direction again, and runtime hardware-based optimization makes a ton of sense there.
- GregarianChild 6y agoWhy do and then un-do? The reason is that we've not yet found a better way of making fast general purpose processors. The OOO (= out-of-order) approach with high-quality prediction (e.g. branch, value) to processor micro-architecture makes sense if you have to mask a lot of memory-access latency, which comes from data-dependent (= unpredictable) memory access. General purpose workloads have a lot of that. (If memory access patterns are more predictable, you'd probably run your workload on a GPU or TPU or DSP, or some other accelerator.) Compilers, whether ahead-of-time, or JIT, have not got enough information to schedule commands in a way that can mask memory latency the way an OOO scheduler inside a processor can. Stalling the pipeline because you are waiting for data to arrive from memory is disastrous for performance and to be avoided at all cost. Intel's Itanium was based on the premise that it is possible statically to schedule well enough, but that has been considered a failure for general workloads. Moreover, if you let a compiler schedule you need to have ISA extensions that allow you to communicate scheduling information to the processor which is not cost free (for example you may spend precious bits to encode scheduling order that you then cannot use for other things). I suspect that the very last word has not been spoken in this discussion, but everything obvious to make dataflow competitive (and quite a lot more) has been tried, and failed.
- Veedrac 6y agoIMO a lot of the problem is simply that powerful players (eg. Intel) had a vested interest in tying things to the platform, and the megaliths we've built on top all assume this construction, so even if there are clear ways in which things can be done better (there are), you'd have to reinvent the world to do them. Fundamental innovation is really difficult, and OoO CPUs avoid the need for it.
- FullyFunctional 6y ago> The retirement stage is some of the most difficult hardware logic to design [citation needed] There are many difficult parts to a super scalar speculative dynamically scheduled microprocessor, but retirement doesn't even make top 10. If I had to pick, it would hands-down be the load-store unit which is really hard to scale (and has a lot of gnarly corner cases). > This all may seem inefficient and crazy and it is. Program representation and execution need a major re-think along the lines of the once-investigated dataflow architecture. I actually agree with the impedance mismatch of our legacy ISAs, but "dataflow" is a bizarre pick as the original formulation was incredibly inefficient and all modern processors (A72 included) are already dataflow machines over a fixed windows of the (partially speculated) path through the program. There have been a lot of interesting paradigms published, but it's extremely rare for industry to take a risk. VLIW is still a darling (in principle very efficient iff you hit in the caches), but there are a _lot_ of other ideas. Browse through the past few decades of ISCA and MICRO proceedings to see examples. The cost of making new binaries is always the problem. At Transmeta we used binary translation as the answer for x86 and NVIDIA's Denver much improved upon the idea for Arm. Both use in-order execution which in hindsight didn't seem to have worked out. Alas, dynamic translation of binary code has huge overheads and issues with cold code. There's hope though; if the code you are translating is WASM then you are in a much better place, but still not quite as good as source as you are lacking all the alias knowledge. [updated typos and grammar]
- deleted 6y ago[deleted]
- deleted 6y ago[deleted]