Show simple item record

dc.contributor.advisorKanade, Aditya
dc.contributor.authorAfraz, Mohammed
dc.date.accessioned2020-07-23T06:40:13Z
dc.date.available2020-07-23T06:40:13Z
dc.date.submitted2015
dc.identifier.urihttps://etd.iisc.ac.in/handle/2005/4496
dc.description.abstractAcyclic path profile is an abstraction of dynamic control flow paths of procedures and has been found to be useful in a wide spectrum of activities. Unfortunately, the runtime overhead of obtaining such a profile can be high, limiting its use in practice. In this work, we present partitioned path profiling (P3) which runs K copies of the program in parallel, each with the same input but on a separate core, and collects the profile only for a subset of intra-procedural paths in each copy, thereby, distributing the overhead of profiling. P3 identifies “profitable” procedures and assigns disjoint subsets of paths of a profitable procedure to different copies for profiling. To obtain exact execution frequencies of a subset of paths, we design a new algorithm, called PSPP. All paths of an unprofitable procedure are assigned to the same copy. P3 uses the classic Ball-Larus algorithm for profiling unprofitable procedures. Further, P3 attempts to evenly distribute the profiling overhead across the copies. To the best of our knowledge, P3 is the first algorithm for parallel path profiling. We have applied P3 to profile several programs in the SPEC 2006 benchmark. Compared to sequential profiling, P3 substantially reduced the runtime overhead on these programs averaged across multiple inputs. The reduction was 23%, 43% and 56% on average for 2, 4 and 8 cores respectively. P3 also performed better than a coarse-grained approach that treats all procedures as unprofitable and distributes them across available cores. For 2 cores, the profiling overhead of P3 was on an average 5% less compared to the coarsegrained approach across these programs. For 4 and 8 cores, it was respectively 18% and 25% less.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesG27113;
dc.rightsI grant Indian Institute of Science the right to archive and to make available my thesis or dissertation in whole or in part in all forms of media, now hereafter known. I retain all proprietary rights, such as patent rights. I also retain the right to use in future works (such as articles or books) all or part of this thesis or dissertationen_US
dc.subjectPrecise Selective Path Profilingen_US
dc.subjectPartitioned Path Profilingen_US
dc.subjectInteresting Pathsen_US
dc.subjectProfitable Procedureen_US
dc.subjectStatic Analysisen_US
dc.subjectPath Profilingen_US
dc.subject.classificationComputer Scienceen_US
dc.titleP3 : An Effective Technique for Partitioned Path Profilingen_US
dc.typeThesisen_US
dc.degree.nameMTech (Res)en_US
dc.degree.levelMastersen_US
dc.degree.grantorIndian Institute of Scienceen_US
dc.degree.disciplineEngineeringen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record