会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Execution of dynamic languages via metadata extraction
    • 通过元数据提取来执行动态语言
    • US09003380B2
    • 2015-04-07
    • US12862560
    • 2010-08-24
    • Gheorghe Calin CascavalMehrdad H. Reshadi
    • Gheorghe Calin CascavalMehrdad H. Reshadi
    • G06F9/45G06F9/455G06F9/445
    • G06F9/45508G06F9/44505G06F9/45512
    • 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.
    • 用于执行以动态脚本语言编写的脚本的方法和设备包括分两个阶段解析脚本,使用简化语法进行预解析,以生成关于脚本的高级结构的脚本元数据,并使用语法和语法完整解析 动态脚本语言和生成的脚本元数据。 生成的元数据可以描述以脚本的语言存在的高级结构,诸如函数,对象方法和顶级调用图。 可以在完整解析过程中使用脚本元数据来确定要完全解析的代码部分。 这些方面最大限度地减少了运行时在解析中花费的处理时间,并且可以消除解释或编译将不被执行的代码段所需的处理。 还可以缓存脚本元数据以及完全解析的结果,以提供进一步的处理效率。
    • 2. 发明申请
    • EXECUTION OF DYNAMIC LANGUAGES VIA METADATA EXTRACTION
    • 动态语言通过元素提取的执行
    • US20110173597A1
    • 2011-07-14
    • US12862560
    • 2010-08-24
    • Gheorghe Calin CascavalMehrdad H. Reshadi
    • Gheorghe Calin CascavalMehrdad H. Reshadi
    • G06F9/45
    • G06F9/45508G06F9/44505G06F9/45512
    • 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.
    • 用于执行以动态脚本语言编写的脚本的方法和设备包括分两个阶段解析脚本,使用简化语法进行预解析,以生成关于脚本的高级结构的脚本元数据,并使用语法和语法完整解析 动态脚本语言和生成的脚本元数据。 生成的元数据可以描述存在于脚本的语言中的高级结构,例如函数,对象方法和顶级调用图。 可以在完整解析过程中使用脚本元数据来确定要完全解析的代码部分。 这些方面最大限度地减少了运行时在解析中花费的处理时间,并且可以消除解释或编译将不被执行的代码段所需的处理。 还可以缓存脚本元数据以及完全解析的结果,以提供进一步的处理效率。
    • 3. 发明授权
    • Method and system for predicting the performance benefits of mapping subsets of application data to multiple page sizes
    • 用于预测将应用程序数据子集映射到多个页面大小的性能优势的方法和系统
    • US07376808B2
    • 2008-05-20
    • US11343565
    • 2006-01-31
    • Gheorghe Calin CascavalEvelyn DuesterwaldPeter F. SweeneyRobert W. Wisniewski
    • Gheorghe Calin CascavalEvelyn DuesterwaldPeter F. SweeneyRobert W. Wisniewski
    • G06F9/34G06F12/00
    • G06F12/10G06F2212/652
    • A method for modeling the performance of memory address translation mechanism (MATM), comprises: a) receiving an execution profile that contains a memory address reference stream of an application, a set of page size mappings, and events about the application's data allocations and de-allocations; b) translating each memory reference in the input memory reference stream into a reference to the corresponding data object, by consulting the memory allocation and de-allocation events, to provide a data object reference stream; c) translating each data object reference into a corresponding page reference by consulting the page size mapping and by modeling the data allocation and de-allocation events in accordance with the mapping to provide a page reference stream and a number of pages of each page size that are needed by the respective mapping; d) using the page reference stream to provide a stream of reuse distance values; e) determining, for each reference in the reuse distance value stream, whether the reference results in a hit or a miss reference to the MATM to provide the number of hits and the number of misses for each MATM; f) providing the hit and miss values to a cost model to estimate the number of miss cycles; g) ranking the mappings by their miss cycle values such that the mapping with the lowest number of miss cycles has the highest rank.
    • 一种用于对存储器地址转换机制(MATM)的性能进行建模的方法包括:a)接收包含应用的存储器地址参考流,一组页面大小映射和关于应用的数据分配和de的事件的执行简档 分配; b)通过咨询存储器分配和解除分配事件来将输入存储器参考流中的每个存储器引用转换成对相应数据对象的引用,以提供数据对象引用流; c)通过参考所述页面大小映射并且根据所述映射对所述数据分配和解除分配事件进行建模来将每个数据对象引用转换成对应的页面引用,以提供页面引用流和每页页面大小的页数 需要通过各自的映射; d)使用页面参考流来提供重用距离值流; e)针对重用距离值流中的每个参考,确定参考是否导致对MATM的命中或错过引用以提供每个MATM的命中次数和未命中次数; f)向成本模型提供命中和未命中值以估计错过周期数; g)通过它们的错误循环值对映射进行排序,使得具有最低错误周期数的映射具有最高等级。