会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 32. 发明授权
    • System and method for implementing a fast file synchronization in a data processing system
    • 用于在数据处理系统中实现快速文件同步的系统和方法
    • US07464237B2
    • 2008-12-09
    • US11259898
    • 2005-10-27
    • Jos M. AccapadiMathew AccapadiAndrew DunsheaDirk Michel
    • Jos M. AccapadiMathew AccapadiAndrew DunsheaDirk Michel
    • G06F12/00
    • G06F12/0804G06F3/0601G06F12/0866G06F2003/0692G06F2212/311
    • A system and method for implementing a fast file synchronization in a data processing system. A memory management unit divides a file stored in system memory into a collection of data block groups. In response to a master (e.g., processing unit, peripheral, etc.) modifying a first data block group among the collection of data block groups, the memory management unit writes a first block group number associated with the first data block group to system memory. In response to a master modifying a second data block group, the memory management unit writes the first data block group to a hard disk drive and writes a second data block group number associated with the second data block group to system memory. In response to a request to update modified data block groups of the file stored in the system memory to the hard disk drive, the memory management unit writes the second data block to the hard disk drive.
    • 一种用于在数据处理系统中实现快速文件同步的系统和方法。 存储器管理单元将存储在系统存储器中的文件划分成数据块组的集合。 响应于在数据块组的集合中修改第一数据块组的主(例如,处理单元,外围设备等),存储器管理单元将与第一数据块组相关联的第一块组号写入系统存储器 。 响应于主修改第二数据块组,存储器管理单元将第一数据块组写入硬盘驱动器,并将与第二数据块组相关联的第二数据块组编号写入系统存储器。 响应于将存储在系统存储器中的文件的修改的数据块组更新到硬盘驱动器的请求,存储器管理单元将第二数据块写入硬盘驱动器。
    • 33. 发明授权
    • Method and apparatus for aging data in a cache
    • 用于在缓存中老化数据的方法和装置
    • US07337276B2
    • 2008-02-26
    • US11201642
    • 2005-08-11
    • Jos AccapadiAndrew DunsheaGreg R. MewhinneyMysore Sathyanaranyana Srinivas
    • Jos AccapadiAndrew DunsheaGreg R. MewhinneyMysore Sathyanaranyana Srinivas
    • G06F12/00
    • G06F12/0897G06F12/0891
    • A computer implemented method, apparatus, and computer usable code for managing cache data. A partition identifier is associated with a cache entry in a cache, wherein the partition identifier identifies a last partition accessing the cache entry. The partition identifier associated with the cache entry is compared with a previous partition identifier located in a processor register in response to the cache entry being moved into a lower level cache relative to the cache. The cache entry is marked if the partition identifier associated with the cache entry matches the previous partition identifier located in the processor register to form a marked cache entry, wherein the marked cache entry is aged at a slower rate relative to an unmarked cache entry.
    • 计算机实现的方法,装置和用于管理高速缓存数据的计算机可用代码。 分区标识符与高速缓存中的高速缓存条目相关联,其中分区标识符标识访问高速缓存条目的最后一个分区。 与高速缓存条目相关联的分区标识符与位于处理器寄存器中的先前分区标识符进行比较,以响应于高速缓存条目相对于高速缓存移动到较低级高速缓存。 如果与高速缓存条目相关联的分区标识与位于处理器寄存器中的先前分区标识符相匹配以形成标记的高速缓存条目,则标记高速缓存条目,其中标记的高速缓存条目相对于未标记的高速缓存条目以较慢的速率进行老化。
    • 37. 发明申请
    • System and method for CPI scheduling on SMT processors
    • SMT处理器CPI调度的系统和方法
    • US20050086660A1
    • 2005-04-21
    • US10671132
    • 2003-09-25
    • Jos AccapadiAndrew DunsheaDirk MichelMysore Srinivas
    • Jos AccapadiAndrew DunsheaDirk MichelMysore Srinivas
    • G06F9/46
    • G06F9/4881G06F2209/483
    • A system and method for identifying compatible threads in a Simultaneous Multithreading (SMT) processor environment is provided by calculating a performance metric, such as CPI, that occurs when two threads are running on the SMT processor. The CPI that is achieved when both threads were executing on the SMT processor is determined. If the CPI that was achieved is better than the compatibility threshold, then information indicating the compatibility is recorded. When a thread is about to complete, the scheduler looks at the run queue from which the completing thread belongs to dispatch another thread. The scheduler identifies a thread that is (1) compatible with the thread that is still running on the SMT processor (i.e., the thread that is not about to complete), and (2) ready to execute. The CPI data is continually updated so that threads that are compatible with one another are continually identified.
    • 通过计算在SMT处理器上运行两个线程时发生的性能度量(如CPI),可以提供用于识别同时多线程(SMT)处理器环境中的兼容线程的系统和方法。 确定在两个线程在SMT处理器上执行时实现的CPI。 如果实现的CPI优于兼容性阈值,则记录指示兼容性的信息。 当线程即将完成时,调度程序将查看完成线程所属的运行队列,以调度另一个线程。 调度程序标识(1)与SMT处理器上仍然运行的线程(即,即将完成的线程)兼容的线程,以及(2)准备执行。 持续更新CPI数据,以便不断地识别彼此兼容的线程。
    • 39. 发明授权
    • Associating process priority with I/O queuing
    • 将流程优先级与I / O排队关联
    • US09262357B2
    • 2016-02-16
    • US12240190
    • 2008-09-29
    • Jos M. AccapadiAndrew DunsheaVandana MallempatiAgustin Mena, III
    • Jos M. AccapadiAndrew DunsheaVandana MallempatiAgustin Mena, III
    • G06F3/00G06F13/364
    • G06F13/362G06F13/364
    • Input/output (I/O) requests generated by processes are typically stored in I/O queues. Because the queued I/O requests may not be associated with the processes that generated them, changing a process' priority may not affect the priority of the I/O requests generated by the process. Therefore, after the process' priority has been increased, it may be forced to wait for an I/O handler to service its I/O request, which may be stuck behind an I/O request generated by a lower priority process. Functionality can be implemented to associate the processes' priorities with the I/O requests generated by the processes. Also, reordering the queued I/O requests to reflect changes in the processes' priorities can ensure that the I/O requests from high priority processes are serviced before the I/O requests from low priority processes. This can ensure efficient processing and lower wait times for high priority processes.
    • 由进程生成的输入/输出(I / O)请求通常存储在I / O队列中。 因为排队的I / O请求可能不与生成它们的进程相关联,所以更改进程的优先级可能不会影响进程生成的I / O请求的优先级。 因此,在进程优先级增加之后,可能迫使其等待I / O处理程序来服务其I / O请求,这可能会被较低优先级进程生成的I / O请求所困扰。 可以实现功能,将进程的优先级与进程生成的I / O请求相关联。 此外,重新排序排队的I / O请求以反映进程优先级的更改可以确保在优先级较低的进程的I / O请求之前对来自高优先级进程的I / O请求进行服务。 这可以确保高优先级进程的有效处理和较短的等待时间。