Please use this identifier to cite or link to this item:
|dc.title||Compactly representing parallel program executions|
|dc.identifier.citation||Goel, A.,Roychoudhury, A.,Mitra, T. (2003). Compactly representing parallel program executions. ACM SIGPLAN Notices 38 (10) : 190-201. ScholarBank@NUS Repository.|
|dc.description.abstract||Collecting a program's execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution profiles are more detailed than count based execution profiles, since they present the order of execution of the various blocks in a program: modules, procedures, basic blocks etc. Recently, online string compression techniques have been employed for collecting compact representations of sequential program executions. In this paper, we show how a similar approach can be taken for shared memory parallel programs. Our compaction scheme yields one to two orders of magnitude compression compared to the uncompressed parallel program trace on some of the SPLASH benchmarks. Our compressed execution traces contain detailed information about synchronization and control/data flow which can be exploited for post-mortem analysis. In particular, information in our compact execution traces are useful for accurate data race detection (detecting unsynchronized shared variable accesses that occurred in the execution).|
|dc.subject||Dynamic program analysis|
|dc.subject||Program path compression|
|dc.description.sourcetitle||ACM SIGPLAN Notices|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Mar 31, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.