The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Prime subprogram parsing of a program
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A study of computer program structure.
A study of computer program structure.
On the decomposition of programs into primes
On the decomposition of programs into primes
Programming tools: statement counts and procedure timings
ACM SIGPLAN Notices
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Optimally profiling and tracing programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Static branch frequency and program profile analysis
MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
| Hi-index | 0.00 |
The problem of minimizing the time overhead of counters and traversal markers is studied. The methodology used to study the problem is based upon Markov processes. A fundamental result is presented that characterizes those flowcharts where the problem can be solved uniquely in the case of counters. Two methods are described that avoid poor choices of counter placement by choosing counter placements from a dominating set. With respect to the problem of traversal marker placement, the basic result that traversal markers must be placed on the complement of a uni-connected sub-graph is extended to flowcharts with circuits. Finally it is shown that complements of uni-connected subgraphs that are minimal in size may not have minimal time overheads.