会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Cache hierarchy design for use in a memory management unit
    • 缓存层次结构设计用于内存管理单元
    • US4985829A
    • 1991-01-15
    • US068788
    • 1987-06-26
    • Satish M. ThatteDonald W. Oxley
    • Satish M. ThatteDonald W. Oxley
    • G06F12/08G06F12/10
    • G06F12/1063G06F12/0864
    • A cache hierarchy to be managed by a memory management unit (MMU) combines the advantages of logical and virtual address caches by providing a cache hierarchy having a logical address cache backed up by a virtual address cache to achieve the performance advantage of a large logical address cache, and the flexibility and efficient use of cache capacity of a large virtual address cache. A physically small logical address cache is combined with a large virtual address cache. The provision of a logical address cache enables reference count management to be done completely by the controller of the virtual address cache and the memory management processor in the MMU. Since the controller of the logical address cache is not involved in the overhead associated with reference counting, higher performance is accomplished as the CPU-MMU interface is released as soon as the access to the logical address cache is completed.
    • 由存储器管理单元(MMU)管理的高速缓存层次结构通过提供具有由虚拟地址缓存备份的逻辑地址缓存的高速缓存层级来组合逻辑和虚拟地址高速缓存的优点,以实现大逻辑地址的性能优势 缓存,以及灵活性和高效利用高速缓存的大容量虚拟地址缓存。 物理上小的逻辑地址缓存与大型虚拟地址缓存组合。 提供逻辑地址缓存使得引导计数管理能够由MMU中的虚拟地址缓存和存储器管理处理器的控制器完成。 由于逻辑地址缓存的控制器不涉及与引用计数相关联的开销,所以当完成对逻辑地址缓存的访问时,CPU-MMU接口被释放,就会实现更高的性能。
    • 4. 发明授权
    • Computer memory system with parallel garbage collection independent from
an associated user processor
    • 具有独立于相关用户处理器的并行垃圾收集的计算机存储器系统
    • US4775932A
    • 1988-10-04
    • US636187
    • 1984-07-31
    • Donald W. OxleyTimothy J. McEnteeSatish M. Thatte
    • Donald W. OxleyTimothy J. McEnteeSatish M. Thatte
    • G06F12/00G06F12/02
    • G06F12/0253G06F12/0261Y10S707/99957
    • A memory system for association with a user processor for operation independently from the user processor includes a physical memory and an interface unit for enabling the associated user processor to access the physical memory. The physical memory is represented in a virtual address space which is garbage collected in parallel with the operation of the user processor. The garbage collection process includes reference count deallocation and a garbage collection algorithm for deallocating cyclic structures not deallocated by the reference count process. The reference count process includes providing for a reference count indicating the number of pointer references to a memory block in the virtual address space. When the reference count becomes zero, and no other references to a memory block exist, the block may be freed. In the garbage collection algorithm, the virtual memory space is traced in areas, called OLDSPACE, and compactly copied into a new area, called NEWSPACE. The OLDSPACE and NEWSPACE are further scavenged to insure that all referenced blocks of memory are copied, and the remaining OLDSPACE is cleaned. The garbage collection process is performed in parallel with the operation of the user processor.
    • 用于与用户处理器相关联以用于独立于用户处理器的操作的存储器系统包括物理存储器和用于使相关联的用户处理器能够访问物理存储器的接口单元。 物理存储器在与用户处理器的操作并行收集的虚拟地址空间中表示。 垃圾收集过程包括引用计数解除分配和垃圾收集算法,用于释放通过引用计数过程而不被释放的循环结构。 参考计数过程包括提供指示虚拟地址空间中的指针引用到存储器块的引用计数。 当引用计数为零时,并且不存在对存储器块的其他引用,则该块可以被释放。 在垃圾收集算法中,虚拟内存空间被跟踪在被称为OLDSPACE的区域中,并被紧密复制到一个称为NEWSPACE的新区域。 OLDSPACE和NEWSPACE进一步清理,以确保所有引用的内存块都被复制,剩下的OLDSPACE被清理。 垃圾收集过程与用户处理器的操作并行执行。
    • 8. 发明授权
    • Incremental, multi-area, generational, copying garbage collector for use
in a virtual address space
    • 用于虚拟地址空间的增量,多区域,世代,复制垃圾收集器
    • US4797810A
    • 1989-01-10
    • US878551
    • 1986-06-26
    • Timothy J. McEnteeRobert W. BloemerDonald W. OxleySatish M. Thatte
    • Timothy J. McEnteeRobert W. BloemerDonald W. OxleySatish M. Thatte
    • G06F12/08G06F12/00G06F12/02G06F12/12G06F11/00
    • G06F12/0276Y10S707/99957
    • An incremental garbage collector for use in conjunction with a virtual memory, operates on selected generations of an area upon objects which are contained in a semispace, oldspace or newspace, and during the garbage collection process, all accessible objects are copied from the oldspace to the newspace. The garbage collection process occurs in four phases. In the "flip" phase oldspace and newspace of each generation are exchanged. In the "trace" phase, the pointers which are part of a root set of the generation being collected are traced and all oldspace objects referenced by the pointers are copied to newspace, and the pointers in the root set are updated. All copied objects are then "scavenged" to update any pointers in the cells of the copied objects, and to copy to newspace all oldspace objects referenced by those pointers. Finally a "cleaning oldspace" phase is performed as a low-priority background process to purge the entries for the virtual pages on which "obsolete" pointers reside.
    • 与虚拟内存一起使用的增量垃圾收集器,对包含在半空间,旧空间或新空间中的对象的区域的选定世代进行操作,并且在垃圾收集过程中,所有可访问对象都从旧空间复制到 新空间 垃圾收集过程分四个阶段进行。 在“翻转”阶段,每一代的旧空间和新空间被交换。 在“跟踪”阶段中,跟踪所收集生成的根组的一部分的指针,并将指针引用的所有旧空间对象复制到新空间,并更新根集中的指针。 所有复制的对象然后被“清理”以更新复制对象的单元格中的任何指针,并将这些指针引用的所有旧空间对象复制到新空间。 最后,执行“清理旧空间”阶段作为低优先级后台进程,以清除“过时”指针所在的虚拟页面的条目。
    • 10. 发明授权
    • Method for managing virtual memory to separate active and stable memory
blocks
    • 用于管理虚拟内存以分离主动和稳定的内存块的方法
    • US4660130A
    • 1987-04-21
    • US634334
    • 1984-07-24
    • David H. BartleyTimothy J. McEnteeDonald W. OxleySatish M. Thatte
    • David H. BartleyTimothy J. McEnteeDonald W. OxleySatish M. Thatte
    • G06F12/00G06F12/02G06F12/08G06F12/12
    • G06F12/122G06F12/0253
    • A method for compacting blocks of memory in a demand paged virtual address space which includes a plurality of virtual address pages includes identifying active and stable blocks to be compacted by defining a pointer to indicate a page of the virtual memory space, and advancing the pointer to continually indicate the page of the beginning of the available virtual memory space. As new blocks are allocated, they are located in the virtual address space beginning at the next available location of the advancing pointer. As blocks are referenced by the user, they are moved to the current location of the advancing pointer, so that, stable blocks may be collected together on stable pages and active blocks are collected together on active pages. A disk memory is provided, and periodically the pages containing collected stable blocks are "paged-out" to it. The method improves the overall throughput of data in the memory by reducing the time waiting for disk, the time in which the CPU is delayed during frequent garbage collections, and the allocation response time. Also, the method insures efficient use of the backing store by insuring that sparsely allocated pages are not written out to disk.
    • 一种用于在包含多个虚拟地址页的需求分页虚拟地址空间中压缩存储器块的方法包括:通过定义指示虚拟存储器空间的页面的指针来识别待压缩的活动和稳定块,并且将指针推向 持续指示可用虚拟内存空间开头的页面。 当分配新的块时,它们位于从前进指针的下一个可用位置开始的虚拟地址空间中。 当用户引用块时,它们被移动到前进指针的当前位置,使得可以在稳定页面上一起收集稳定块,并且活动块在活动页面上一起收集。 提供磁盘存储器,并且周期性地将包含收集的稳定块的页面“分页”。 该方法通过减少等待磁盘的时间,在频繁的垃圾收集期间CPU被延迟的时间以及分配响应时间来提高存储器中数据的总体吞吐量。 此外,该方法通过确保稀疏分配的页面不被写出到磁盘来确保有效地使用后台存储。