会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Data management in solid state storage devices
    • 固态存储设备中的数据管理
    • US09176817B2
    • 2015-11-03
    • US13617571
    • 2012-09-14
    • Roy D. CideciyanEvangelos S. EleftheriouRobert HaasXiao-Yu HuIlias Iliadis
    • Roy D. CideciyanEvangelos S. EleftheriouRobert HaasXiao-Yu HuIlias Iliadis
    • G11C29/00G06F11/10H03M13/05
    • G06F11/108G06F11/1008G06F11/1068H03M13/05
    • A mechanism is provided for controlling a solid state storage device in which the solid state storage comprises erasable blocks each comprising a plurality of data write locations. Input data is stored in successive groups of data write locations, each group comprising write locations in a set of erasable blocks in each of a plurality of logical subdivisions of the solid state storage. The input data is error correction encoded such that each group contains an error correction code for the input data in that group. Metadata, indicating the location of input data in the solid state storage, is maintained in memory. An indication of validity of data stored in each data write location is also maintained. Prior to erasing a block, valid input data is recovered from the group containing write locations in that block. The recovered data is then re-stored as new input data.
    • 提供一种用于控制固态存储装置的机构,其中固态存储器包括每个包括多个数据写入位置的可擦除块。 输入数据被存储在连续的数据写入位置组中,每个组包括在固态存储器的多个逻辑分区中的每一个中的一组可擦除块中的写入位置。 输入数据被纠错编码,使得每个组包含用于该组中的输入数据的纠错码。 指示固态存储器中的输入数据的位置的元数据被保存在存储器中。 还保持了存储在每个数据写入位置中的数据的有效性的指示。 在擦除块之前,从包含该块中的写入位置的组中恢复有效的输入数据。 然后将恢复的数据重新存储为新的输入数据。
    • 7. 发明授权
    • Renewal management for data items
    • 数据项更新管理
    • US08681990B2
    • 2014-03-25
    • US12411791
    • 2009-03-26
    • Christian CachinPatrick DrozRobert HaasXiao-Yu HuIlias IliadisRené A. Pawlitzek
    • Christian CachinPatrick DrozRobert HaasXiao-Yu HuIlias IliadisRené A. Pawlitzek
    • H04L9/00
    • H04L9/0891G06F11/1461G06F21/6209G06F2221/2151
    • A system, method apparatus, and computer readable medium for managing renewal of a dynamic set of data items. Each data item has an associated renewal deadline, in a data item management system. A renewal schedule allocates to each data item a renewal interval for renewal of the data item. On addition of a new data item, if a potential renewal interval having a duration required for renewal of the data item, and having an ending at the renewal deadline for that item does not overlap a time period in the schedule during which the system is busy, the renewal schedule is automatically updated by allocating the potential renewal interval to the new data item. If the potential renewal interval does overlap a busy period, the renewal schedule is automatically updated by selecting an earlier renewal interval for at least one data item in the set.
    • 一种用于管理动态数据项集的更新的系统,方法装置和计算机可读介质。 在数据项管理系统中,每个数据项具有关联的更新期限。 更新计划为每个数据项分配更新数据项的更新间隔。 在添加新数据项时,如果具有更新数据项所需的持续时间并且在该项目的更新期限结束的潜在更新间隔与系统正忙期间的调度中的时间段不重叠 ,通过将潜在的更新间隔分配给新的数据项来自动更新更新计划。 如果潜在的更新间隔与繁忙期间重叠,则通过为集合中的至少一个数据项选择较早的更新间隔来自动更新更新计划。
    • 10. 发明申请
    • REDUCING ACCESS CONTENTION IN FLASH-BASED MEMORY SYSTEMS
    • 在基于闪存的存储器系统中减少访问内容
    • US20120297128A1
    • 2012-11-22
    • US13563947
    • 2012-08-01
    • Evangelos S. EleftheriouRobert HaasPeter MuellerRoman A. Pletka
    • Evangelos S. EleftheriouRobert HaasPeter MuellerRoman A. Pletka
    • G06F12/02
    • G06F12/0246G06F2212/7208
    • Exemplary embodiments include a method for reducing access contention in a flash-based memory system, the method including selecting a chip stripe in a free state, from a memory device having a plurality of channels and a plurality of memory blocks, wherein the chip stripe includes a plurality of pages, setting the ship stripe to a write state, setting a write queue head in each of the plurality of channels, for each of the plurality of channels in the flash stripe, setting a write queue head to a first free page in a chip belonging to the channel from the chip stripe, allocating write requests according to a write allocation scheduler among the channels, generating a page write and in response to the page write, incrementing the write queue head, and setting the chip stripe into an on-line state when it is full.
    • 示例性实施例包括一种用于减少基于闪存的存储器系统中的访问争用的方法,该方法包括从具有多个信道的存储器件和多个存储器块中选择处于空闲状态的芯片条带,其中芯片条带包括 多个页面,将所述条纹设置为写入状态,为所述多个通道中的每一个设置所述多个通道中的每一个中的写入队列头部,将所述写入队列头部设置到所述第一自由页面中的第一自由页面 属于来自芯片条带的信道的芯片,根据写入分配调度器在信道之间分配写请求,产生页写入,并响应于页写,增加写队列头,并将片段条设置为on 线状态当它满了。