Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Cascaval
Gheorghe C. Cascaval, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20110258532 | MEMOIZING WEB-BROWSING COMPUTATION WITH DOM-BASED ISOMORPHISM - Methods and devices for accelerating webpage rendering by a browser store document object model (DOM) tree structures and computations of rendered pages, and compare portions of a DOM tree of pages being render to determining if portions of the DOM tree structures match. If a DOM tree of a webpage to be rendered matches a DOM tree stored in memory, the computations associated with the match DOM tree may be recalled from memory, obviating the need to perform the calculations to render the page. A tree isomorphism algorithm may be used to recognize DOM trees stored in memory that match the DOM tree of the webpage to be rendered. Reusing rendering computations may significantly reducing the time and resources required for rendering web pages. Identifying reusable portions of calculation results based on DOM tree isomorphism enables the browser to reuse stored webpage rendering calculations even when URLs do not match. | 10-20-2011 |
Gheorghe C. Cascaval, Los Altos Hills, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120226477 | Reducing Overhead and Increasing Precision with Code Instrumentation - Mechanisms are provided for performing performance monitoring of code executing in the data processing system. A performance measurement is obtained for the execution of a region of code of interest. A determination is made as to whether an overhead associated with a current performance measurement mechanism is greater than a predetermined threshold amount of the performance measurement for the execution of the region of code of interest. A dynamic switch is performed from the current performance measurement mechanism to a second performance measurement mechanism, having a lower overhead, for obtaining performance measurements for the execution of the region of code of interest in response to the overhead associated with the current performance measurement mechanism being greater than the predetermined threshold amount of the performance measurement for the execution of the region of code of interest. | 09-06-2012 |
Gheorghe Calin Cascaval, Carmel, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20080229028 | UNIFORM EXTERNAL AND INTERNAL INTERFACES FOR DELINQUENT MEMORY OPERATIONS TO FACILITATE CACHE OPTIMIZATION - A computer implemented method, software infrastructure and computer usable program code for improving application performance. A delinquent memory operation instruction is identified. A delinquent memory operation instruction is an instruction associated with cache misses that exceeds a threshold number of cache misses. A directive is inserted in a code region associated with the delinquent memory operation to form annotated code. The directive indicates an address of the delinquent memory operation instruction and a number of memory latency cycles expected to be required for the delinquent memory operation instruction to execute. The information included in the annotated code is used to optimize execution of an application associated with the delinquent memory operation instruction. | 09-18-2008 |
Gheorghe Calin Cascaval, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20110173597 | EXECUTION OF DYNAMIC LANGUAGES VIA METADATA EXTRACTION - Methods and devices for executing scripts written in a dynamic scripting language include parsing scripts in two stages, a pre-parse using a simplified grammar to generate script metadata regarding the high level structure of the script, and a full parse using the grammar and syntax of the dynamic scripting language and generated script metadata. The generated metadata may describe the high level structure that is present in the language of the script such as functions, object methods, and a top level call graph. The script metadata may be used during the full parse to determine the parts of the code to be fully parsed. The aspects minimize processing time spent in the parsing at run-time, and may eliminate processing required to interpret or compile sections of code that will not be executed. Script metadata as well as results of full parsing may also be cached to provide further processing efficiencies. | 07-14-2011 |