Complexity metrics for distributed programs
Joy Yee Shing Cheng · 2002
This paper proposes some new complexity metrics for distributed programs. The metrics are defined based on graph-theoretical representations for multiple control flows, multiple data flows, and various primary program dependences in distributed programs. They can be used to measure the complexity of a distributed program from various different viewpoints.