会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Localized viewing of file system names
    • 本地化查看文件系统名称
    • US08244712B2
    • 2012-08-14
    • US10389743
    • 2003-03-18
    • Bertrand SerletAli Ozer
    • Bertrand SerletAli Ozer
    • G06F7/00
    • G06F17/30141
    • The elements of a file system contain information that provides language-specific views of the file system. An indicator in each element enables a quick determination to be made whether that element is localized. These indicators can take the form of a key-value pair in a properties list, a special file in the element, such as an empty file, or a special extension on the name of the file. If the element is localized, the localization information can be stored as part of the element, or in a central location for use with multiple different elements. A library of APIs associated with the file system performs methods to determine whether a requested file system element is localized, and to retrieve the localized name in that case.
    • 文件系统的元素包含提供文件系统的语言特定视图的信息。 每个元素中的指示器可以快速确定该元素是否是本地化的。 这些指标可以采用属性列表中的键值对的形式,元素中的特殊文件(如空文件)或文件名称上的特殊扩展名。 如果元素是本地化的,则定位信息可以作为元素的一部分存储,或者存储在用于多个不同元素的中心位置。 与文件系统相关联的API库可执行确定所请求的文件系统元素是否已本地化的方法,并在该情况下检索本地化的名称。
    • 4. 发明授权
    • Method and system using reusable state information for synchronization and maintenance of data
    • 使用可重复使用状态信息进行数据同步和维护的方法和系统
    • US07730026B2
    • 2010-06-01
    • US10883541
    • 2004-07-01
    • Bertrand Serlet
    • Bertrand Serlet
    • G06F12/00G06F17/30
    • G06F17/30309G06F17/30174G06F17/30209G06F17/30575
    • A system for synchronization whereby metadata repository maintains information regarding the history and status of data items in a data repository. Data items are associated with states and such states changes (e.g. increment) in response to changes to the data items. History statements associated with the same states describe the changes in a generic enough fashion that multiple data items may be associated with a single state (e.g. if multiple data items share a common history such as that they were all edited by a user on the same device). The history repository is synchronized with other history repositories so as to reflect the states of data items on multiple devices. The synchronized history stores are used during synchronization to identify and resolve data conflicts through ancestry of data item history.
    • 用于同步的系统,其中元数据存储库维护关于数据存储库中的数据项的历史和状态的信息。 数据项与状态相关联,并且这些状态响应于对数据项的改变而改变(例如增量)。 与相同状态相关联的历史记录以通用的方式描述变化,使得多个数据项可以与单个状态相关联(例如,如果多个数据项共享共同历史,例如它们全部由同一设备上的用户编辑 )。 历史记录库与其他历史记录库同步,以反映多个设备上数据项的状态。 同步历史存储在同步期间被使用,以通过祖先的数据项历史识别和解决数据冲突。
    • 5. 发明授权
    • Transparent local and distributed memory management system
    • 透明的本地和分布式内存管理系统
    • US07716450B2
    • 2010-05-11
    • US11946752
    • 2007-11-28
    • Blaine GarstAli OzerBertrand SerletTrey Matteson
    • Blaine GarstAli OzerBertrand SerletTrey Matteson
    • G06F12/00
    • G06F12/0261Y10S707/99953Y10S707/99957
    • A system for transparent local and distributed memory management overcomes the requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. An autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). This is useful in distributed networks where different programming conventions on remote and local machines made the memory management task particularly difficult. This is also useful in an object-oriented programming environment.
    • 用于透明本地和分布式存储器管理的系统克服了跟踪分配给新对象或新程序或数据结构的存储空间是否可以回收的要求。 在新的占空比开始时创建一个自动释放池。 自动释放池在占空比期间保留新分配的内存空间。 自动释放池在占空比结束时自动处理。 作为配置自动释放池的结果,新分配的存储器空间被回收(即被解除分配)。 这对于在远程和本地机器上的不同编程约定使内存管理任务特别困难的分布式网络中非常有用。 这在面向对象的编程环境中也是有用的。
    • 7. 发明授权
    • Transparent local and distributed memory management system
    • 透明的本地和分布式内存管理系统
    • US06304884B1
    • 2001-10-16
    • US09504664
    • 2000-02-14
    • Blaine GarstAli OzerBertrand SerletTrey Matteson
    • Blaine GarstAli OzerBertrand SerletTrey Matteson
    • G06F1212
    • G06F9/5016G06F12/023G06F12/0261Y10S707/99957
    • The present invention discloses a system for transparent local and distributed memory management. The invention overcomes the prior art's requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. According to the present invention an autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). The present invention is useful in distributed networks where different programming conventions on remote and local machines made the prior art's memory management task particularly difficult. The present invention is also useful in an object-oriented programming environment.
    • 本发明公开了一种用于透明的本地和分布式存储器管理的系统。 本发明克服了现有技术跟踪分配给新对象或新程序或数据结构的存储空间是否可以回收的要求。 根据本发明,在新的占空比开始时创建自动释放池。 自动释放池在占空比期间保留新分配的内存空间。 自动释放池在占空比结束时自动处理。 作为配置自动释放池的结果,新分配的存储器空间被回收(即被解除分配)。 本发明在分布式网络中是有用的,其中远程和本地机器上的不同编程约定使现有技术的存储器管理任务变得特别困难。 本发明在面向对象编程环境中也是有用的。
    • 8. 发明授权
    • Asynchronous garbage collection
    • 异步垃圾收集
    • US5355483A
    • 1994-10-11
    • US732453
    • 1991-07-18
    • Bertrand Serlet
    • Bertrand Serlet
    • G06F12/02G06F12/00
    • G06F12/0269G06F2212/702
    • The present invention consists of a new type of garbage collector, one that runs in a different process being scanned. With this method, the process being collected communicates its memory state ("a memory snapshot") to a garbage collecting process (GC), and the GC process scans the memory and sends back the information about garbage. As a result, the present invention permits garbage collection to be performed asynchronously. The process being scanned for garbage is interrupted only briefly, to obtain the memory snapshot. The process then runs without interruption while the garbage collection is being performed. The present invention makes the assumption that if an object is garbage at the time of the memory snapshot it remains garbage any time later, since new pointers to that object cannot be created during asynchronous collection. The method further considers the case where the results of a cache computation is a collectable object itself. The method includes keeping a list while a collection is in progress of all the objects being given away from the cache. When an object is received as garbage from the GC, it is only freed if it is not on the list. The garbage collecting process is performed using a conservative scan. The garbage collector finds out if an object is garbage by scanning the memory address space and comparing the value found in each scanned memory address to see if the value matches the candidate for garbage. If no match is found, this means that the candidate for garbage is not referenced and therefore, is garbage.
    • 本发明包括一种新型垃圾收集器,一种在不同扫描过程中运行的垃圾收集器。 使用这种方法,正在收集的进程将其内存状态(“内存快照”)传达到垃圾回收进程(GC),GC进程扫描内存并发回有关垃圾的信息。 结果,本发明允许异步执行垃圾收集。 正在扫描垃圾的进程只会中断,以获取内存快照。 然后,当进行垃圾收集时,进程会中断运行。 本发明假定如果在存储器快照时对象是垃圾,则其将在随后的任何时候保持为垃圾,因为在异步收集期间不能创建对该对象的新指针。 该方法还考虑了高速缓存计算的结果是可收集对象本身的情况。 该方法包括在从高速缓存提供的所有对象的集合正在进行中保持列表。 当一个对象从GC接收为垃圾时,只有当对象不在列表中时才被释放。 垃圾收集过程使用保守的扫描进行。 垃圾收集器通过扫描存储器地址空间并比较每个扫描存储器地址中找到的值来查看对象是否是垃圾,以查看该值是否与垃圾的候选者匹配。 如果没有匹配,这意味着垃圾的候选者不被引用,因此是垃圾。
    • 10. 发明授权
    • Reusable content addressable stores as building blocks for creating large scale storage infrastructures
    • 可重用的内容可寻址商店作为创建大型存储基础架构的构建块
    • US08631209B2
    • 2014-01-14
    • US13358742
    • 2012-01-26
    • Bertrand SerletRoger Bodamer
    • Bertrand SerletRoger Bodamer
    • G06F12/00
    • G06F12/0866G06F3/061G06F3/065G06F3/067G06F17/30097G06F2212/284G06F2212/463
    • Techniques are described for using chunk stores as building blocks to construct larger chunk stores. A chunk store constructed of other chunk stores (a composite chunk store) may have any number and type of building block chunk stores. Further, the building block chunk stores within a composite chunk store may be arranged in any manner, resulting in any number of levels within the composite chunk store. The building block chunk stores expose a common interface, and apply the same hash function to content of chunks to produce the access key for the chunks. Because the access key is based on content, all copies of the same chunk will have the same access key, regardless of the chunk store that is managing the copy. In addition, no other chunk will have that same access key.
    • 描述了使用块存储作为构建块来构建较大块存储的技术。 由其他块存储(复合块存储)构造的块存储可以具有任何数量和类型的构建块块存储。 此外,复合块存储中的构建块块存储可以以任何方式布置,导致复合块存储器内的任何数量的级别。 构建块块存储暴露公共接口,并将相同的散列函数应用于块的内容以产生块的访问密钥。 由于访问密钥是基于内容的,所以相同块的所有副本将具有相同的访问密钥,而不管管理副本的块存储。 此外,没有其他块将具有相同的访问密钥。