Patent
Branch trace compression
Rajiv Madampath
- 21 Aug 2013
17
TL;DR: In this paper, a run-time branch trace value is determined to be divisible, without a remainder, by a first prime number of the plurality of prime numbers of the program.
read more
Abstract: Exemplary methods, apparatuses, and systems assign a plurality of branch instructions within a computer program to a plurality of prime numbers. Each branch instruction is assigned a unique prime number within the plurality of prime numbers. A run-time branch trace value is determined to be divisible, without a remainder, by a first prime number of the plurality of prime numbers. The run-time branch trace value was generated during execution of the computer program. An output is generated indicating that a first branch instruction assigned to the first prime number was executed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Techniques for enforcing control flow integrity using binary translation
Koichi Yamada,Palanivelrajan Shanmugavelayutham,Sravani Konda +2 more
- 23 Dec 2014
TL;DR: In this article, the authors present a method to determine a valid target address for a branch instruction from information stored in a relocation table, a linkage table, or both, the relocation table and the linkage table associated with a binary file and store the valid target addresses in a table in memory.
32
Patent
Compression techniques for encoding stack trace information
Eric S. Chan
- 05 May 2017
TL;DR: In this paper, the authors provide a thread classification method that represents stack traces in a compact form using classification signatures, using a stack trace that includes a sequence of stack frames and a trace signature that represents the set.
10
Patent
Correlation of stack segment intensity in emergent relationships
Eric S. Chan
- 05 May 2017
TL;DR: In this paper, a branch point along one or more linearly connected stack frames of a stack segment was detected, where the stack segment is associated with one of the thread intensity statistic parameters.
4
Patent
Distributed code tracing system
Alaranta Anssi,Banga Rohit,Wu Haotian,Li Shengxin,Hoffman Jeffrey +4 more
- 31 May 2018
TL;DR: In this article, a distributed code tracing system that provides code tracing as a service in a multi-tenant computing environment is described, where a code trace is received that is associated with a request submitted to a particular application hosted in a computing environment.
3
Patent
Correlation of thread intensity and heap usage to identify heap-hoarding stack traces
Eric S. Chan
- 05 May 2017
TL;DR: In this paper, the authors determine a length of time when heap usage by processes exceeds a threshold and then correlate the heap information with the thread information to identify code that correspond to the heap usage exceeding the threshold.
3
References
Dynamic branch prediction with perceptrons
Daniel A. Jimenez,Calvin Lin +1 more
- 20 Jan 2001
TL;DR: A new method for branch prediction is presented that uses one of the simplest possible neural networks, the perceptron, as an alternative to the commonly used two-bit counters and achieves increased accuracy by making use of long branch histories.
Branch history guided instruction prefetching
V. Srinivasan,Edward S. Davidson,Gary Tyson,M.J. Charney,T.R. Puzak +4 more
- 20 Jan 2001
TL;DR: BHGP correlates the execution of a branch instruction with I-cache misses and uses branch instructions to trigger prefetches of instructions that occur later in the program execution, for a given N>1.
184
Patent
Microprocessor with built-in instruction tracing capability
David S. Christie
- 15 Apr 1997
TL;DR: In this article, a computer system employing an instruction tracing mechanism includes a memory and a CPU, and the memory includes a trace buffer used to store records of the instruction tracing, which is pointed to by a tracer pointer.
181
ScalaTrace: Scalable Compression and Replay of Communication Traces for High Performance Computing
Michael Noeth,Prasun Ratn,Frank Mueller,Martin Schulz,B R de Supinski +4 more
- 16 May 2008
TL;DR: In this article, the authors introduce intra-and inter-node compression techniques of MPI events that are capable of extracting an application's communication structure and present a replay mechanism for the traces generated by their approach and discuss results of their implementation for BlueGene/L.
116
Improving trace cache effectiveness with branch promotion and trace packing
Sanjay J. Patel,Marius Evers,Yale N. Patt +2 more
- 16 Apr 1998
TL;DR: On a machine where the execution engine has a very aggressive memory disambiguator, the performance of a machines using branch promotion and trace packing is on average 11% higher than a machine using neither technique.
111