Title | ||
---|---|---|
Complementing missing and inaccurate profiling using a minimum cost circulation algorithm |
Abstract | ||
---|---|---|
Edge profiling is a very common means for providing feedback on program behavior that can be used statically by an optimizer to produce highly optimized binaries. However collecting full edge profile carries a significant runtime overhead. This overhead creates addition problems for real-time applications, as it may prevent the system from meeting runtime deadlines and thus alter its behavior. In this paper we show how a low overhead sampling technique can be used to collect inaccurate profile which is later used to approximate the full edge profile using a novel technique based on the Minimum Cost Circulation Problem. The outcome is a machine independent profile gathering scheme that creates a slowdown of only 2%-3% during the training set, and produces an optimized binary which is only 0.6% less than a fully optimized one. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1007/978-3-540-77560-7_20 | HiPEAC |
Keywords | Field | DocType |
novel technique,program behavior,low overhead sampling technique,machine independent profile gathering,meeting runtime deadline,optimized binary,edge profiling,inaccurate profile,significant runtime overhead,full edge profile,minimum cost circulation algorithm,inaccurate profiling,flow network,profiling,control flow,real time,sampling,sampling technique | Flow network,Training set,Profiling (computer programming),Program behavior,Computer science,Control flow,Parallel computing,Real-time computing,Sampling (statistics),Circulation problem,Binary number | Conference |
Volume | ISSN | ISBN |
4917 | 0302-9743 | 3-540-77559-5 |
Citations | PageRank | References |
7 | 0.67 | 7 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Roy Levin | 1 | 7 | 0.67 |
Ilan Newman | 2 | 1149 | 82.18 |
Gadi Haber | 3 | 55 | 9.19 |