The interpretation and application of Rent's rule
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on system-level interconnect prediction
Cache miss behavior: is it √2?
Proceedings of the 3rd conference on Computing frontiers
A Power and Energy Exploration of Network-on-Chip Architectures
NOCS '07 Proceedings of the First International Symposium on Networks-on-Chip
Implications of Rent's Rule for NoC Design and Its Fault-Tolerance
NOCS '07 Proceedings of the First International Symposium on Networks-on-Chip
On a Pin Versus Block Relationship For Partitions of Logic Graphs
IEEE Transactions on Computers
Fractal communication in software data dependency graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Toward five-dimensional scaling: how density improves efficiency in future computers
IBM Journal of Research and Development
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Implications of electronics technology trends to algorithm design
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
International Journal of Embedded and Real-Time Communication Systems
Roadmap towards ultimately-efficient zeta-scale datacenters
Proceedings of the Conference on Design, Automation and Test in Europe
Hi-index | 0.00 |
Scaling of electronics technology has brought us to a pivotal point in the design of computational devices. Technology scaling favours transistors over wires which has led us into an era where communication takes more time and consumes more power than the computation itself. This technology driver inevitably pushes us toward a communication-centric approach to computer system design from both hardware and software perspectives. As a consequence the data movement in time and space exhibited by algorithms will need to be understood to undertake system-level performance predictions. We demonstrate that algorithms exhibit fractal like communication behaviour which is likely to help with such an analysis.