APPARATUS, METHOD, AND SYSTEM FOR DYNAMICALLY OPTIMIZING CODE UTILIZING ADJUSTABLE TRANSACTION SIZES BASED ON HARDWARE LIMITATIONS
    1.
    发明申请
    APPARATUS, METHOD, AND SYSTEM FOR DYNAMICALLY OPTIMIZING CODE UTILIZING ADJUSTABLE TRANSACTION SIZES BASED ON HARDWARE LIMITATIONS 审中-公开
    基于硬件限制的可调整交易尺寸动态优化代码的装置,方法和系统

    公开(公告)号:WO2012040742A3

    公开(公告)日:2012-06-14

    申请号:PCT/US2011053337

    申请日:2011-09-26

    Abstract: An apparatus and method is described herein for conditionally committing /andor speculative checkpointing transactions, which potentially results in dynamic resizing of transactions. During dynamic optimization of binary code, transactions are inserted to provide memory ordering safeguards, which enables a dynamic optimizer to more aggressively optimize code. And the conditional commit enables efficient execution of the dynamic optimization code, while attempting to prevent transactions from running out of hardware resources. While the speculative checkpoints enable quick and efficient recovery upon abort of a transaction. Processor hardware is adapted to support dynamic resizing of the transactions, such as including decoders that recognize a conditional commit instruction, a speculative checkpoint instruction, or both. And processor hardware is further adapted to perform operations to support conditional commit or speculative checkpointing in response to decoding such instructions.

    Abstract translation: 本文描述了用于有条件地提交/推测的检查点事务的装置和方法,这可能导致事务的动态调整大小。 在二进制代码的动态优化期间,插入事务以提供存储器排序保护措施,这使得动态优化器能够更积极地优化代码。 并且条件提交可以有效地执行动态优化代码,同时试图阻止事务用尽硬件资源。 虽然投机检查点能够在中止交易后快速有效地恢复。 处理器硬件适于支持事务的动态调整大小,诸如包括识别条件提交指令的解码器,推测性检查点指令或两者。 并且处理器硬件还适于执行响应于解码这样的指令来支持条件提交或推测性检查点的操作。

    APPARATUS, METHOD, AND SYSTEM FOR PROVIDING A DECISION MECHANISM FOR CONDITIONAL COMMITS IN AN ATOMIC REGION
    3.
    发明申请
    APPARATUS, METHOD, AND SYSTEM FOR PROVIDING A DECISION MECHANISM FOR CONDITIONAL COMMITS IN AN ATOMIC REGION 审中-公开
    设备,方法和系统,用于提供原子地区条件性的决策机制

    公开(公告)号:WO2012040715A3

    公开(公告)日:2012-06-21

    申请号:PCT/US2011053285

    申请日:2011-09-26

    Abstract: An apparatus and method is described herein for conditionally committing /andor speculative checkpointing transactions, which potentially results in dynamic resizing of transactions. During dynamic optimization of binary code, transactions are inserted to provide memory ordering safeguards, which enables a dynamic optimizer to more aggressively optimize code. And the conditional commit enables efficient execution of the dynamic optimization code, while attempting to prevent transactions from running out of hardware resources. While the speculative checkpoints enable quick and efficient recovery upon abort of a transaction. Processor hardware is adapted to support dynamic resizing of the transactions, such as including decoders that recognize a conditional commit instruction, a speculative checkpoint instruction, or both. And processor hardware is further adapted to perform operations to support conditional commit or speculative checkpointing in response to decoding such instructions.

    Abstract translation: 本文描述了用于有条件地提交/推测的检查点事务的装置和方法,这可能导致事务的动态调整大小。 在二进制代码的动态优化期间,插入事务以提供存储器排序保护措施,这使得动态优化器能够更积极地优化代码。 并且条件提交可以有效地执行动态优化代码,同时尝试防止事务用尽硬件资源。 虽然投机检查点可以在交易中止时快速有效地恢复。 处理器硬件适于支持事务的动态调整大小,诸如包括识别条件提交指令的解码器,推测性检查点指令或两者。 并且处理器硬件还适于执行响应于解码这样的指令来支持条件提交或推测性检查点的操作。

    CONTEXT-SENSITIVE SLICING FOR DYNAMICALLY PARALLELIZING BINARY PROGRAMS
    4.
    发明申请
    CONTEXT-SENSITIVE SLICING FOR DYNAMICALLY PARALLELIZING BINARY PROGRAMS 审中-公开
    用于动态平行二进制程序的上下文敏感切片

    公开(公告)号:WO2011056278A3

    公开(公告)日:2011-06-30

    申请号:PCT/US2010046685

    申请日:2010-08-25

    CPC classification number: G06F11/3604 G06F8/433 G06F8/456

    Abstract: In one embodiment of the invention a method comprising (1) receiving an unstructured binary code region that is single-threaded; (2) determining a slice criterion for the region; (3) determining a call edge, a return edge, and a fallthrough pseudo-edge for the region based on analysis of the region at a binary level; and (4) determining a context-sensitive slice based on the call edge, the return edge, the fallthrough pseudo-edge, and the slice criterion. Embodiments of the invention may include a program analysis technique that can be used to provide context-sensitive slicing of binary programs for slicing hot regions identified at runtime, with few underlying assumptions about the program from which the binary is derived. Also, in an embodiment a slicing method may include determining a context-insensitive slice, when a time limit is met, by determining the context-insensitive slice while treating call edges as a normal control flow edges.

    Abstract translation: 在本发明的一个实施例中,一种方法包括:(1)接收单线程的非结构化二进制码区; (2)确定该区域的切片标准; (3)基于二进制级别的区域分析来确定区域的呼叫边缘,返回边缘和穿透式伪边缘; (4)基于呼叫边缘,返回边缘,下穿伪边缘和切片标准来确定上下文敏感切片。 本发明的实施例可以包括程序分析技术,该程序分析技术可以用于提供用于对在运行时识别的热区域进行切片的二进制程序的上下文敏感的分片,而关于从其导出二进制的程序的基本假设很少。 而且,在一个实施例中,切片方法可以包括当满足时间限制时确定上下文不敏感切片,通过确定上下文不敏感切片而将呼叫边缘视为正常控制流边缘。

    APPARATUS, METHOD, AND SYSTEM FOR PROVIDING A DECISION MECHANISM FOR CONDITIONAL COMMITS IN AN ATOMIC REGION
    8.
    发明公开
    APPARATUS, METHOD, AND SYSTEM FOR PROVIDING A DECISION MECHANISM FOR CONDITIONAL COMMITS IN AN ATOMIC REGION 审中-公开
    设备,方法和系统提供决策机制有条件的义务在核区

    公开(公告)号:EP2619654A4

    公开(公告)日:2016-11-16

    申请号:EP11827728

    申请日:2011-09-26

    Applicant: INTEL CORP

    Abstract: An apparatus and method is described herein for conditionally committing and/or speculative checkpointing transactions, which potentially results in dynamic resizing of transactions. During dynamic optimization of binary code, transactions are inserted to provide memory ordering safeguards, which enables a dynamic optimizer to more aggressively optimize code. And the conditional commit enables efficient execution of the dynamic optimization code, while attempting to prevent transactions from running out of hardware resources. While the speculative checkpoints enable quick and efficient recovery upon abort of a transaction. Processor hardware is adapted to support dynamic resizing of the transactions, such as including decoders that recognize a conditional commit instruction, a speculative checkpoint instruction, or both. And processor hardware is further adapted to perform operations to support conditional commit or speculative checkpointing in response to decoding such instructions.

    Abstract translation: 的装置和方法被描述为有条件地提交和/或推测检查点的交易,这潜在地导致了交易的动态调整。 在二进制代码动态优化,交易被插入到内存提供保障顺序,使动态优化,以更积极的优化代码。 和条件提交启用动态优化代码的执行效率,同时努力避免用尽硬件资源的交易。 虽然投机性的检查站时能交易的中止快速高效的恢复。 处理器硬件angepasst支持交易的动态调整,为寻求包括解码器确实承认条件提交指令,推测检查点指令,或两者兼而有之。 和处理器的硬件是执行操作,以支持条件提交或推测检查点的响应于解码请示此外angepasst。

    CONTEXT-SENSITIVE SLICING FOR DYNAMICALLY PARALLELIZING BINARY PROGRAMS
    10.
    发明公开
    CONTEXT-SENSITIVE SLICING FOR DYNAMICALLY PARALLELIZING BINARY PROGRAMS 有权
    上下文敏感的SLICING用于动态并行二进制程序

    公开(公告)号:EP2494468A4

    公开(公告)日:2013-11-20

    申请号:EP10828698

    申请日:2010-08-25

    Applicant: INTEL CORP

    CPC classification number: G06F11/3604 G06F8/433 G06F8/456

    Abstract: In one embodiment of the invention a method comprising (1) receiving an unstructured binary code region that is single-threaded; (2) determining a slice criterion for the region; (3) determining a call edge, a return edge, and a fallthrough pseudo-edge for the region based on analysis of the region at a binary level; and (4) determining a context-sensitive slice based on the call edge, the return edge, the fallthrough pseudo-edge, and the slice criterion. Embodiments of the invention may include a program analysis technique that can be used to provide context-sensitive slicing of binary programs for slicing hot regions identified at runtime, with few underlying assumptions about the program from which the binary is derived. Also, in an embodiment a slicing method may include determining a context-insensitive slice, when a time limit is met, by determining the context-insensitive slice while treating call edges as a normal control flow edges.

Patent Agency Ranking