.png){kind=icon}
返回
Locality metrics and program physical structures
.png){kind=icon}
OA
AI
DOI：10.1016/S0164-1212(00)00059-5.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Years of programming experience has convinced us that the physical structure of a program, such as the locations of the program's components, their calls, and the depth of nested calls, is important in determining how effective and efficient the program can be debugged and maintained. This paper introduces a new class of physical metrics, known as locality metric, that measures the relative positions of components in a program listing and reveals useful attributes that may affect programmer productivity. The placement of the components can be determined by a simple algorithm that is of polynomial time complexity. The paper compares the performance of the algorithm with that of an exhaustive search approach and also reports various characteristics of the locality metric based on the collected statistical data. The performance shows the feasibility of the algorithm and closeness of its output to the optimal result found by the exhaustive approach. (C) 2000 Elsevier Science Inc. All rights reserved.
Keyword:
locality metric
physical structure
logical structure
program component
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容