M. Rajagopalan, S. K. Debray, M. A. Hiltunen, and R. D. Schlichting. Profile-Directed Optimization of Event Based Programs. In Programming Languages Design and Implementation, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
System Call Clustering: A Profile Directed.. - Rajagopalan.. (2003) Self-citation (Rajagopalan Debray Hiltunen Schlichting) (Correct)
....on edge weights. The algorithm for graph creation is described in figure 4. The algorithm simply traverses the trace and adds new edges (and the corresponding nodes, if necessary) or increases the weight of an existing edge, as appropriate. A detailed description of this technique is given in [20]. Figure 5 shows the source code for a simple file copy program, its control flow graph, and the syscall graph resulting from a typical execution of the program. 3.2 Identifying Multi Call Code This section address the question of how we determine which portions of the program can be ....
M. Rajagopalan, S. Debray, M. Hiltunen, and R. Schlichting. Profile-directed optimization of event-based programs. In Proceedings of the ACM SIGPLAN 2002.
Fast Paths in Concurrent Programs - Xu, Kumar, Li (2004) (Correct)
No context found.
M. Rajagopalan, S. K. Debray, M. A. Hiltunen, and R. D. Schlichting. Profile-Directed Optimization of Event Based Programs. In Programming Languages Design and Implementation, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC