A Process Algebra for Optimization for Parallel Programs

We propose a theoretical framework for the per-formance analysis and optimization of parallel pro-grams through an algebraic relation on expressions in a time-extended process calculus. The relation is an extension of bisimulation and is characterized by having the ability to order behaviorally equivalent communicating processes with respect to their rel-ative speeds, and have some useful algebraic prop-erties. This abstract outlines the calculus and the relation and gives some views on the framework.