B. Zorn and P. N. Hilfinger, "A Memory Allocation Profiler for C and Lisp," Proceedings of the Summer 1988 USENIX Conference, (June 1988). - 27 -  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Cache Profiling and the SPEC Benchmarks: A Case Study - Lebeck, Wood (1994) (103 citations) (Correct)
....quickly determine which of several data structures on a source line is 11 responsible for most cache misses. CPROF annotates both static and dynamic data structures. Dynamically allocated structures are labeled by concatenating the procedure names on the call stack at the point of allocation [12]. An appended counter value allows unique identification of all dynamically allocated structures. The text window is used to view individual source files, where each line is annotated with the corresponding number of cache misses. The X windows user interface allows the user to browse within the ....
B. Zorn and P. N. Hilfinger, "A Memory Allocation Profiler for C and Lisp," Proceedings of the Summer 1988 USENIX Conference, (June 1988). - 27 -
MemSpy: Analyzing Memory System Bottlenecks in Programs - Martonosi, Gupta, Anderson (1992) (46 citations) (Correct)
....That is, data allocated in different calls to a procedure from different call paths will be monitored in separate bins. 8 We claim that data objects 8 The exact method used for tracking the call path is similar to that used by Zorn and Hilfinger in their memory allocation profiler, mprof [18]. allocated at the same point in the source code via the same call path are usually similar in memory behavior, and their statistics, in general, should be aggregated. To implement this proposed method of data division, MemSpy needs to be able to map every possible memory address to its ....
B. Zorn and P. N. Hilfinger. A Memory Allocation Profiler for C and Lisp. Technical Report UCB/CSD 88/404, University of California, Berkeley, Feb. 1988.
Tools and Techniques for Memory System Design and Analysis - Lebeck (1995) (2 citations) (Correct)
....button. Finally, the counts displayed in the data window can be written to a file with the dump counts button. CProf annotates both static and dynamic data structures. Dynamically allocated structures are labeled by concatenating the procedure names on the call stack at the point of allocation [84]. An end counter value allows unique identification of all dynamically allocated structures. 46 Figure 21: CProf User Interface 47 The text window is used to view individual source files, where each line is annotated with the corresponding number of cache misses. The X windows user interface ....
Benjamin Zorn and Paul N. Hilfinger. A Memory Allocation Profiler for C and LISP. Technical Report UCB/CSD 88/404, Computer Science Division (EECS), University of California at Berkeley, February 1988.
Integrating Performance Monitoring and Communication in .. - Martonosi, Ofelt.. (1996) (18 citations) (Correct)
....data structures that map each memory location accessed by the monitored program to its corresponding program data structure identifier. The mappings handle heap allocated as well as static data, and they aggregate together elements of dynamic data structures such as linked lists. MGA95] and [ZH88] describe similar methods. FlashPoint gathers statistics on the number and latency of read and write misses. It maintains separate categories of statistics for local and remote references. It also keeps counts on the number of invalidations required and on the number of cold misses in the ....
B. Zorn and P. N. Hilfinger. A Memory Allocation Profiler for C and Lisp. Technical Report UCB/CSD 88/404, Feb. 1988.
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