4 ms·
This is the same problem as with other systems: You NEED to have an embarrassingly parallel problem to solve. Sequential part and Amdahl’s law will catch you q
by rkwasny 11y ago
This is the same problem as with other systems: You NEED to have an embarrassingly parallel problem to solve.
Sequential part and Amdahl’s law will catch you quickly.
- adapteva 11y agoYes, agreed. Note that the cool part of distributed computing is that everything is duplicated.(IO / disk / DRAM / CPU)
- white-flame 11y agoFrom my reading of the architecture, it's not just parallelism, but _streaming_ parallelism. The individual cores really don't have memory or cache to do "real work" on their own. In many cases, they're all competing for memory bandwidth. The target usage model seems to be where the actual algorithm employed can be pipelined, streaming in-flight results from one core to another. That has even more limited applicability than embarrassingly parallel architectures, and is incredibly difficult to map general problems to keeping the cores busy.