Locality metrics and program physical structures
Gespeichert in:
| Titel: | Locality metrics and program physical structures |
|---|---|
| Autoren: | Kang Zhang, Narasimhaiah Gorla |
| Weitere Verfasser: | The Pennsylvania State University CiteSeerX Archives |
| Quelle: | http://www.utdallas.edu/~kzhang/Publications/JSS00.pdf.gz. |
| Publikationsjahr: | 2000 |
| Bestand: | CiteSeerX |
| Schlagwörter: | Locality metric, Physical structure, Logical structure, Program component |
| Beschreibung: | 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 dam. The performance shows the feasibility of the algorithm and closeness of its output to the optimal result found by the exhaustive approach. |
| Publikationsart: | text |
| Dateibeschreibung: | application/pdf |
| Sprache: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.6689; http://www.utdallas.edu/~kzhang/Publications/JSS00.pdf.gz |
| Verfügbarkeit: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.6689 http://www.utdallas.edu/~kzhang/Publications/JSS00.pdf.gz |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Dokumentencode: | edsbas.F4484BEB |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | 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 dam. The performance shows the feasibility of the algorithm and closeness of its output to the optimal result found by the exhaustive approach. |
|---|