会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Dynamic circular work-stealing deque
    • 动态循环工作脱钩
    • US07346753B2
    • 2008-03-18
    • US11311201
    • 2005-12-19
    • David R. ChaseYosef Lev
    • David R. ChaseYosef Lev
    • C06F12/00C06F13/00C06F13/28C06F3/00C06F5/00C06F9/46
    • G06F7/785
    • A deque of a local process in a memory work-stealing implementation may use one or more data structures to perform work. If the local process attempts to add a new value to its deque's circular array when the data structure is full (i.e., an overflow condition occurs), the contents of the data structure are copied to a larger allocated circular array (e.g., a circular array of greater size than the original circular array). The entries in the original, smaller-sized circular array are copied to positions in the now-active, larger-sized circular array, and the system is configured to work with the newly activated circular array. By this technique, the local process is thus provided with space to add the new value.
    • 内存工作窃取实现中的本地进程的一个deque可以使用一个或多个数据结构来执行工作。 如果本地进程尝试在数据结构已满(即发生溢出情况)时向其deque的圆形数组添加新值,则将数据结构的内容复制到较大的分配的圆形数组(例如圆形数组 比原始圆形阵列更大的尺寸)。 原始较小尺寸的圆形阵列中的条目将复制到现在活动的较大尺寸圆形阵列中的位置,并且系统配置为使用新激活的圆形阵列。 通过这种技术,本地进程因此被提供有添加新值的空间。
    • 2. 发明授权
    • Fast programming method for nonvolatile memories, in particular flash memories, and relative memory architecture
    • 用于非易失性存储器,特别是闪速存储器和相对存储器架构的快速编程方法
    • US06981107B2
    • 2005-12-27
    • US10281078
    • 2002-10-24
    • Guido LomazziJacopo MulattiSt fano Surico
    • Guido LomazziJacopo MulattiSt fano Surico
    • G11C16/10C06F12/00
    • G11C16/10G11C2216/14G11C2216/16
    • The programming method includes the following steps: sequentially receiving a plurality of data words; temporarily storing each data word after its reception; and simultaneously writing in parallel the plurality of stored data words in a memory array. After reception and temporary storage of each data word, the memory increments an address counter and sends a “ready” signal. Upon reception of each new data word, the memory verifies whether the address associated thereto is in the same sector as the initial data word and whether n data words have already been stored. If the sector is different, blind-programming step is terminated and the verifying is carried out; if the sector is the same but n data words have already been stored temporarily, the memory writes the temporarily stored words in the memory array, updates the address counter, and then sends the “ready” signal.
    • 编程方法包括以下步骤:顺序地接收多个数据字; 在接收后临时存储每个数据字; 并且同时将多个存储的数据字并行地写入存储器阵列中。 在每个数据字的接收和临时存储之后,存储器增加一个地址计数器并发送一个“就绪”信号。 在接收到每个新的数据字时,存储器验证与其相关联的地址是否在与初始数据字相同的扇区中,以及是否已经存储了n个数据字。 如果扇区不同,则盲编程步骤终止并进行验证; 如果扇区是相同的,但是n个数据字已经被临时存储,则存储器将临时存储的字写入存储器阵列,更新地址计数器,然后发送“就绪”信号。
    • 3. 发明授权
    • Software refreshed memory device and method
    • 软件刷新存储器件和方法
    • US07307908B2
    • 2007-12-11
    • US11287488
    • 2005-11-28
    • Terry L. Gilton
    • Terry L. Gilton
    • G11C7/00G11C11/00C06F12/00H01L29/06H01L31/107
    • G11C5/005G11C11/406G11C11/40603G11C11/40622G11C13/0004G11C13/0011G11C13/0033G11C13/0069G11C16/3431
    • A software refreshed memory device comprises a plurality of memory cells that must be periodically refreshed to avoid losing data. Preferably, the memory cells can avoid losing data even though the time interval between successive memory refresh operations is relatively long, as compared to the time interval between successive memory refresh operations in a conventional volatile memory device, such as a DRAM. A processor can perform periodic memory refresh operations by executing a set of memory refresh instructions implemented in software, rather than in hardware. Accordingly, the memory device can advantageously be simplified, because the need for memory refresh circuitry and for a unique refresh control signal are advantageously eliminated. Moreover, the processor executing the memory refresh instructions can typically perform more sophisticated algorithms, as compared to memory refresh circuitry implemented in hardware, for determining when to perform a memory refresh operation. For example, the processor can determine whether each individual memory cell needs to be refreshed, thereby advantageously avoiding performing unnecessary refresh operations on memory cells that do not need to be refreshed.
    • 软件刷新的存储器件包括必须定期刷新以避免丢失数据的多个存储器单元。 优选地,与常规易失性存储器件(例如DRAM)中的连续存储器刷新操作之间的时间间隔相比,即使连续存储器刷新操作之间的时间间隔相对较长,存储器单元也可避免丢失数据。 处理器可以通过执行以软件实现的一组存储器刷新指令而不是硬件来执行周期性的存储器刷新操作。 因此,有利地可以简化存储器件,因为有利地消除了对存储器刷新电路和唯一刷新控制信号的需要。 此外,与硬件实现的存储器刷新电路相比,执行存储器刷新指令的处理器通常可以执行更复杂的算法,用于确定何时执行存储器刷新操作。 例如,处理器可以确定每个单独的存储器单元是否需要刷新,从而有利地避免对不需要刷新的存储器单元执行不必要的刷新操作。
    • 4. 发明授权
    • Persistent volume mount points
    • 持久音量安装点
    • US6119131A
    • 2000-09-12
    • US97061
    • 1998-06-12
    • Luis Felipe CabreraNorbert P. Kusters
    • Luis Felipe CabreraNorbert P. Kusters
    • G06F3/06C06F12/00
    • G06F3/0607G06F3/0632G06F3/0644G06F3/0674Y10S707/99952Y10S707/99953Y10S707/99954
    • Information regarding volume mount points hosted by a logical volume are stored on the physical device underlying the logical volume so that the relationships between the host logical volume and target logical volumes mounted on the volume mount points can be reconstituted when the system containing the logical volumes is rebooted, when the underlying physical devices are moved with the system, and when the logical volumes are transported to a different system. A data structure stored on the physical device contains the directory name of the volume mount point and the unique identifier and a globally unique mount name of the target logical volume mounted at the volume mount point. When the target logical volume is present in the system, symbolic links are created to relate the volume mount point name to a device name for the target logical volume so that pathnames containing the directory junction name are resolved correctly. If the target volume is not present in the system, the corresponding symbolic link does not exist, so an incorrect logical volume cannot be mounted onto a volume mount point. Furthermore, because the logical volumes contain the directory junction information, the namespace representing the logical volumes is self-describing so that neither user knowledge nor intervention is required to reconstitute the namespace.
    • 有关由逻辑卷托管的卷安装点的信息存储在逻辑卷底层的物理设备上,以便在包含逻辑卷的系统为包含逻辑卷的系统时,主机逻辑卷与安装在卷安装点上的目标逻辑卷之间的关系可以重新构建 当底层物理设备与系统一起移动时,以及何时将逻辑卷传输到其他系统时重新启动。 存储在物理设备上的数据结构包含卷安装点的目录名称和唯一标识符以及安装在卷安装点的目标逻辑卷的全局唯一安装名称。 当系统中存在目标逻辑卷时,会创建符号链接,以将卷安装点名称与目标逻辑卷的设备名称相关联,以便正确解析包含目录结名的路径名。 如果系统中不存在目标卷,则相应的符号链接不存在,因此不正确的逻辑卷无法挂载到卷安装点上。 此外,由于逻辑卷包含目录结点信息,表示逻辑卷的命名空间是自描述的,因此不需要用户知识和干预来重构命名空间。