Lightweight Single Reader Locks
    1.
    发明申请
    Lightweight Single Reader Locks 审中-公开
    轻便单读卡器锁

    公开(公告)号:US20080040560A1

    公开(公告)日:2008-02-14

    申请号:US11686498

    申请日:2007-03-15

    IPC分类号: G06F12/14

    摘要: A method, system and computer program product for generating a read-only lock implementation from a read-only lock portion of program code. In response to determining that a lock portion of the program code is a read-only lock, a read-only lock implementation is generated to protect at least one piece of shared data. The read-only lock implementation comprises a plurality of instructions with dependencies created between the instructions to ensure that a lock corresponding to the data is determined to be free before permitting access to that data. In one embodiment, when executed, the read-only lock implementation loads a lock word from a memory address into a register and places a reserve on the memory address. The lock word is evaluated to determine if the lock is free, and, in response to determining that the lock is tree, at least one piece of shared data protected by the lock is accessed. A value is conditionally stored back to the memory address if the reserve is present. A dependency exists between the step of loading of the lock word and the step of accessing the at least one piece of shared data, thereby causing the step of loading of the lock word to be performed before the step of accessing of the at least one piece of shared data.

    摘要翻译: 一种用于从程序代码的只读锁部分生成只读锁实现的方法,系统和计算机程序产品。 响应于确定程序代码的锁定部分是只读锁,生成仅读锁定实现以保护至少一个共享数据。 只读锁实现包括在指令之间创建依赖关系的多个指令,以确保在允许对该数据的访问之前,对应于数据的锁定被确定为空闲。 在一个实施例中,当执行时,只读锁定实现将锁定字从存储器地址加载到寄存器中,并将存储器放置在存储器地址上。 评估锁定字以确定锁是否空闲,并且响应于确定锁是树,至少一个被锁保护的共享数据被访问。 如果存在存储,则有条件地将值存储回存储器地址。 在加载锁定字的步骤和访问至少一个共享数据的步骤之间存在依赖性,从而导致在访问至少一个片段的步骤之前加载要执行的锁定字的步骤 的共享数据。

    System enabling transactional memory and prediction-based transaction execution method
    2.
    发明授权
    System enabling transactional memory and prediction-based transaction execution method 有权
    系统启用事务内存和基于预测的事务执行方法

    公开(公告)号:US08799590B2

    公开(公告)日:2014-08-05

    申请号:US12463113

    申请日:2009-05-08

    IPC分类号: G06F9/52 G06F9/46

    摘要: A system enabling Transactional Memory with overflow prediction mechanism, comprising: prediction unit for predicting the mode for the next execution of a transaction based on the final status of the previous execution of the transaction; execution unit for executing the transaction in the execution mode predicted by the prediction unit, wherein the execution mode comprises overflow mode and non-overflow made. According to this invention, before a transaction is executed, it is predicted whether or not the transaction will overflow, and therefore, the execution of the transaction which is necessary to determine whether or not an overflow will occur is saved.

    摘要翻译: 一种启用具有溢出预测机制的事务性存储器的系统,包括:预测单元,用于基于事务的先前执行的最终状态来预测下一次执行事务的模式; 执行单元,用于在由预测单元预测的执行模式中执行交易,其中执行模式包括溢出模式和非溢出。 根据本发明,在交易执行之前,预测交易是否将溢出,因此,确定是否将发生溢出所必需的交易的执行被保存。

    Optimizing source code for iterative execution
    3.
    发明授权
    Optimizing source code for iterative execution 有权
    优化源代码进行迭代执行

    公开(公告)号:US07340733B2

    公开(公告)日:2008-03-04

    申请号:US10314094

    申请日:2002-12-05

    IPC分类号: G06F9/44 G06F9/45

    CPC分类号: G06F8/4441

    摘要: An embodiment of the present invention provides an optimizer for optimizing source code to generate optimized source code having instructions for instructing a central processing unit (CPU) to iteratively compute values for a primary recurrence element. A computer programmed loop for computing the primary recurrence element and subsequent recurrence elements is an example of a case involving iteratively computing the primary recurrence element. The CPU is operatively coupled to fast operating memory (FOM) and operatively coupled to slow operating memory (SOM). SOM stores the generated optimized source code. The optimized source code includes instructions for instructing said CPU to store a computed value of the primary recurrence element in a storage location of FOM. The instructions also includes instructions to consign the computed value of the primary recurrence element from the storage location to another storage location of the FOM.

    摘要翻译: 本发明的一个实施例提供一种用于优化源代码以产生优化的源代码的优化器,其具有用于指示中央处理单元(CPU)迭代地计算初级重复元件的值的指令。 用于计算主要递归元素和随后的递归元素的计算机编程回路是涉及迭代地计算主要复发元素的情况的示例。 CPU可操作地耦合到快速操作存储器(FOM)并且可操作地耦合到慢速操作存储器(SOM)。 SOM存储生成的优化源代码。 优化的源代码包括用于指示所述CPU将计算的主循环元素的值存储在FOM的存储位置中的指令。 指令还包括将计算的主循环元素的值从存储位置委托给FOM的另一个存储位置的指令。

    SYSTEM ENABLING TRANSACTIONAL MEMORY AND PREDICTION-BASED TRANSACTION EXECUTION METHOD
    4.
    发明申请
    SYSTEM ENABLING TRANSACTIONAL MEMORY AND PREDICTION-BASED TRANSACTION EXECUTION METHOD 有权
    系统启用交易记忆和基于预测的交易执行方法

    公开(公告)号:US20090292884A1

    公开(公告)日:2009-11-26

    申请号:US12463113

    申请日:2009-05-08

    IPC分类号: G06F12/00 G06N5/02

    摘要: This invention provides a system enabling Transactional Memory with overflow prediction mechanism, comprising: prediction unit for predicting the mode for the next execution of a transaction based on the final status of the previous execution of the transaction; execution unit for executing the transaction in the execution mode predicted by the prediction unit, wherein the execution mode comprises overflow mode and non-overflow made. According to this invention, before a transaction is executed, it is predicted whether or not the transaction will overflow, and therefore, the execution of the transaction which is necessary to determine whether or not an overflow will occur is saved and the system performance can be improved.

    摘要翻译: 本发明提供一种能够实现具有溢出预测机制的事务性存储器的系统,包括:预测单元,用于基于事务的先前执行的最终状态来预测下一次执行事务的模式; 执行单元,用于在由预测单元预测的执行模式中执行交易,其中执行模式包括溢出模式和非溢出。 根据本发明,在交易执行之前,预测交易是否会溢出,因此,确定是否发生溢出所必需的交易的执行被保存,并且系统性能可以是 改进。