Estimating interlock and improving balance for pipelined architectures
Journal of Parallel and Distributed Computing
Machine Characterization Based on an Abstract High-Level Language Machine
IEEE Transactions on Computers
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Parallel Computers Two: Architecture, Programming and Algorithms
Parallel Computers Two: Architecture, Programming and Algorithms
Performance Metrics Based on Computational Action
International Journal of High Performance Computing Applications
A metric space for productivity measurement in software development
Proceedings of the second international workshop on Software engineering for high performance computing system applications
A note on scaling the Linpack benchmark
Journal of Parallel and Distributed Computing
The computational energy spectrum of a program as it executes
The Journal of Supercomputing
Balance principles for algorithm-architecture co-design
HotPar'11 Proceedings of the 3rd USENIX conference on Hot topic in parallelism
| Hi-index | 0.00 |
We define a normed metric space for computer programs and derive from it the Principle of Computational Least Action. In our model, programs follow trajectories determined by Newton's equation of motion in an abstract computational phase space and generate computational action as they evolve. A program's action norm is the L 1-norm of its action function, and its distance from other programs is the distance derived from the action norm. The Principle of Computational Least Action states the goal of performance optimization as finding the program with the smallest action norm. We illustrate this principle by analyzing a simple program.