By Topic

Combined Network Complexity Measures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hall, N.R. ; IBM Federal Systems Division, 6600 Rockledge Drive, Bethesda, Maryland 20817, USA ; Preiser, S.

Most of the considerable work that has been done in the measurement of software complexity during the past several years has addressed complexity measurement of source code or design languages. Here we describe techniques to measure the complexity of large (>100,000 source lines of code) systems during the software architecture phase, before major design decisions have been made. The techniques to measure and reduce complexity are intuitively reasonable, easy to apply, and produce consistent results. Methods developed include (1) an extension of the graph-theoretic measure developed by McCabe to software architecture, as represented by networks of communicating modules, (2) a general technique that allows the complexity associated with allocation of resources (CPU, tape, disk, etc.) to be measured, and (3) a method that combines module complexity and network complexity, so that design trade-offs can be studied to determine whether it is advantageous to have separate modules for service functions, such as mathematical subroutines, data management routines, etc.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:28 ,  Issue: 1 )