Sciweavers

108 search results - page 1 / 22
» Compactly representing parallel program executions
Sort
View
PPOPP
2003
ACM
13 years 10 months ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra
IWPSE
2005
IEEE
13 years 10 months ago
Extracting Sequence Diagram from Execution Trace of Java Program
A software system is continuously changed so many times. When we try to change a software, we must understand how the software is implemented, especially about the functions to be...
Koji Taniguchi, Takashi Ishio, Toshihiro Kamiya, S...
FPL
2006
Springer
115views Hardware» more  FPL 2006»
13 years 8 months ago
Executing Hardware as Parallel Software for Picoblaze Networks
Multi-processor architectures have gained interest recently because of their ability to exploit programmable silicon parallelism at acceptable power-efficiency figures. Despite th...
Pengyuan Yu, Patrick Schaumont
ICSE
2004
IEEE-ACM
14 years 5 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury
IWMM
2000
Springer
90views Hardware» more  IWMM 2000»
13 years 8 months ago
Compact Garbage Collection Tables
Garbage collection tables for finding pointers on the stack can be represented in 20-25% of the space previously reported. Live pointer information is often the same at many call ...
David Tarditi