TRACER BASED RUNTIME OPTIMIZATION FOR DYNAMIC PROGRAMMING LANGUAGES
    1.
    发明申请
    TRACER BASED RUNTIME OPTIMIZATION FOR DYNAMIC PROGRAMMING LANGUAGES 审中-公开
    用于动态编程语言的基于跟踪的运动优化

    公开(公告)号:WO2013116551A1

    公开(公告)日:2013-08-08

    申请号:PCT/US2013/024193

    申请日:2013-01-31

    Applicant: APPLE INC.

    Abstract: A method and an apparatus that generate tracer data randomly and infrequently for origins and destinations of values created during runtime of a compiled code of a source code is described. A tracer graph may be updated to record the origins and destinations of the values during the runtime. The compiled code may be optimized to reduce processing resources between the origins and the destinations of the values according to the tracer graph. The optimized compiled code may be executed for at least a portion of the source code.

    Abstract translation: 描述了在源代码的编译代码的运行时间期间创建的值的起点和目的地随机地且不经常地生成跟踪器数据的方法和装置。 可以更新跟踪图,以在运行时记录值的起点和目的地。 可以优化编译的代码以根据示踪图来减少值的起点和目的地之间的处理资源。 可以对源代码的至少一部分执行优化的编译代码。

    RUNTIME OPTIMIZATION USING META DATA FOR DYNAMIC PROGRAMMING LANGUAGES
    2.
    发明申请
    RUNTIME OPTIMIZATION USING META DATA FOR DYNAMIC PROGRAMMING LANGUAGES 审中-公开
    使用META数据进行动态编程语言的运行时优化

    公开(公告)号:WO2013116555A1

    公开(公告)日:2013-08-08

    申请号:PCT/US2013/024198

    申请日:2013-01-31

    Applicant: APPLE INC.

    Abstract: A method and an apparatus that optimize operations for a key among a collection of key indexed data structures using meta data describing properties of the key with respect to the collection of data structures are described. The meta data may correspond to a cache dynamically updated to indicate invariants which are true for the key in a current state of the collection of data structures. Expensive calculations to search through the collection of data structures for the key may be avoided. For example, costly lookup operations over a collection of data structures may not be required at all if a key is known to always (or to never) reference certain specific values, or for these values to have certain meta properties, in any of the collection of data structure globally throughout a system at a current state.

    Abstract translation: 描述了使用描述关于数据结构的集合的属性的元数据的关键索引数据结构的集合中的密钥优化操作的方法和装置。 元数据可以对应于动态更新的高速缓存,以指示在数据结构的收集的当前状态中对于密钥是真实的不变量。 可以避免用于搜索密钥数据结构收集的昂贵的计算。 例如,如果已知密钥总是(或从不)引用某些特定值,或者对于这些值具有某些元属性,则在任何集合中可以不需要对数据结构集合的昂贵的查找操作 的数据结构在整个系统中处于当前状态。

Patent Agency Ranking