Apparatus, method, and system for dynamically optimizing code utilizing adjustable transaction sizes based on hardware limitations

    公开(公告)号:AU2011305091A1

    公开(公告)日:2013-03-14

    申请号:AU2011305091

    申请日:2011-09-26

    Applicant: INTEL CORP

    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.

    Allocation of alias registers in a pipelined schedule

    公开(公告)号:AU2013387185B2

    公开(公告)日:2016-08-04

    申请号:AU2013387185

    申请日:2013-05-30

    Applicant: INTEL CORP

    Abstract: Abstract of the Disclosure In an embodiment, a system includes a processor including one or more cores and a plurality of alias registers to store memory range information associated with a plurality of operations of a loop. The memory range information references one or more memory locations within a memory. The system also includes register 5 assignment means for assigning each of the alias registers to a corresponding operation of the loop, where the assignments are made according to a rotation schedule, and one of the alias registers is assigned to a first operation in a first iteration of the loop and to a second operation in a subsequent iteration of the loop. The system also includes the memory coupled to the processor. Other 10 embodiments are described and claimed. 2095201vl

    Allocation of alias registers in a pipelined schedule

    公开(公告)号:AU2013387185A1

    公开(公告)日:2014-12-18

    申请号:AU2013387185

    申请日:2013-05-30

    Applicant: INTEL CORP

    Abstract: Abstract of the Disclosure In an embodiment, a system includes a processor including one or more cores and a plurality of alias registers to store memory range information associated with a plurality of operations of a loop. The memory range information references one or more memory locations within a memory. The system also includes register 5 assignment means for assigning each of the alias registers to a corresponding operation of the loop, where the assignments are made according to a rotation schedule, and one of the alias registers is assigned to a first operation in a first iteration of the loop and to a second operation in a subsequent iteration of the loop. The system also includes the memory coupled to the processor. Other 10 embodiments are described and claimed. 2095201vl

    Apparatus, method, and system for dynamically optimizing code utilizing adjustable transaction sizes based on hardware limitations

    公开(公告)号:AU2011305091B2

    公开(公告)日:2014-09-25

    申请号:AU2011305091

    申请日:2011-09-26

    Applicant: INTEL CORP

    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.

    APPARATUS, METHOD, AND SYSTEM FOR PROVIDING A DECISION MECHANISM FOR CONDITIONAL COMMITS IN AN ATOMIC REGION

    公开(公告)号:SG188993A1

    公开(公告)日:2013-05-31

    申请号:SG2013018742

    申请日:2011-09-26

    Applicant: INTEL CORP

    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.

Patent Agency Ranking