Title :
Complexity metrics for distributed programs
Author_Institution :
Dept. of Comput. Sci. & Commun. Eng., Kyushu Univ., Fukuoka, Japan
Abstract :
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
Keywords :
data flow analysis; graph theory; parallel programming; software metrics; complexity; complexity metrics; distributed programs; graph-theoretical representations; multiple control flows; multiple data flows; primary program dependences; Application software; Communication system control; Complexity theory; Computer science; Concurrent computing; Flow graphs; Fluid flow measurement; Software debugging; Software maintenance; Software measurement;
Conference_Titel :
Software Reliability Engineering, 1993. Proceedings., Fourth International Symposium on
Conference_Location :
Denver, CO
Print_ISBN :
0-8186-4010-3
DOI :
10.1109/ISSRE.1993.624282
