会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Memory management in a data processing system
    • 数据处理系统中的内存管理
    • US06925542B2
    • 2005-08-02
    • US10393592
    • 2003-03-21
    • William C. MoyerRay Marshall
    • William C. MoyerRay Marshall
    • G06F12/02G06F12/06G06F12/00
    • G06F12/0292G06F12/0692Y02D10/13
    • Memory management in a data processing system (10) is achieved by using one or more timing bits (54) to specify a timing parameter of a memory (18, 19, 34). To implement this in some embodiments of the present invention, a memory array (32, 33, 42) is multiple-mapped in the physical memory map (70) of processor (12) and the address bits (54) associated with the multiple-mapping are used to directly control timing parameters of the memory arrays (32, 33, 42). This allows for flexible timing specifications to be derived quickly on an access by access basis without requiring any additional control storage overhead.
    • 通过使用一个或多个定时位(54)来指定存储器(18,19,34)的定时参数来实现数据处理系统(10)中的存储器管理。 为了在本发明的一些实施例中实现这一点,存储器阵列(32,33,42)被多映射在处理器(12)的物理存储器映射(70)中,并且与多重映射相关联的地址位(54) 映射用于直接控制存储器阵列(32,33,42)的定时参数。 这允许在访问基础上快速导出灵活的时序规范,而不需要任何额外的控制存储开销。
    • 3. 发明授权
    • System and method for conditional task switching during ordering scope transitions
    • 在订购范围转换期间进行条件任务切换的系统和方法
    • US09372723B2
    • 2016-06-21
    • US14231784
    • 2014-04-01
    • Zheng XuTommi M. JokinenWilliam C. Moyer
    • Zheng XuTommi M. JokinenWilliam C. Moyer
    • G06F9/48
    • G06F9/4843G06F9/461G06F9/48
    • A data processing system includes a processor core and ordering scope manager circuitry. The processor core sends an indication of a first ordering scope identifier for a current ordering scope a task currently being executed by the processor core and a second ordering scope identifier for a next-in-order ordering scope of the task. The ordering scope manager receives the indication the first and second ordering scope identifiers from processor core, and, provides a no task switch indicator to the processor core in response to determining that the first task is a first-in-transition-order task for the first ordering scope identifier and that processor core is authorized to execute the next-in-order ordering scope. The processor core transitions from executing in the current ordering scope to executing in the next-in-order ordering scope without performing task switch in response to the no task switch indicator being provided.
    • 数据处理系统包括处理器核心和订购范围管理器电路。 处理器核心向当前订购范围发送当前由处理器核心执行的任务的第一订购范围标识符和用于任务的下一个订购范围的第二订购范围标识符的指示。 订购范围管理器从处理器核心接收第一和第二订购范围标识符的指示,并且响应于确定第一任务是第一个转换顺序任务,向处理器核心提供无任务切换指示符 第一个订购范围标识符,该处理器核心被授权执行下一个订购范围。 处理器核心从当前订购范围内的执行转变为按顺序排序范围执行,而不响应于提供无任务切换指示器而执行任务切换。
    • 4. 发明申请
    • WATCHDOG METHOD AND DEVICE
    • 手表方法和装置
    • US20160098313A1
    • 2016-04-07
    • US14504702
    • 2014-10-02
    • William C. Moyer
    • William C. Moyer
    • G06F11/07G06F9/50
    • G06F11/0757G06F11/0724
    • Each task assigned to a core can be considered an “active” task. Sequential strobe signals of a watchdog signal can be spaced apart in time by a certain duration. The duration between strobe signals is longer than the expected duration of an active task. By knowing that all tasks being monitored are expected to execute within an expected amount of time, the duration between the strobe signals can be set to be longer than that expected amount of time. If a task has not transitioned to inactive by a next strobe, a watchdog error has occurred.
    • 分配给核心的每个任务可以被认为是一个“主动”任务。 看门狗信号的顺序选通信号可以在时间上间隔一段持续时间。 选通信号之间的持续时间长于活动任务的预期持续时间。 通过知道所有被监视的任务预期在预期的时间内执行,选通信号之间的持续时间可以被设置为比预期的时间长。 如果任务没有被下一个选通转换为非活动状态,则发生看门狗错误。
    • 6. 发明申请
    • SYSTEM AND METHOD FOR CONDITIONAL TASK SWITCHING DURING ORDERING SCOPE TRANSITIONS
    • 系统和方法在订单范围转换期间进行条件性的任务切换
    • US20150277973A1
    • 2015-10-01
    • US14231789
    • 2014-04-01
    • Zheng XuTommi M. JokinenWilliam C. Moyer
    • Zheng XuTommi M. JokinenWilliam C. Moyer
    • G06F9/48
    • G06F9/4843G06F9/461G06F9/48
    • A data processing system includes a processor core and a hardware module. The processor core performs tasks on data packets. The hardware module stores a first ordering scope identifier at a first storage location of the ordering scope manager. The first ordering scope identifier indicates a first ordering scope that a first task is operating in. The ordering scope manager increments the first ordering scope identifier to create a new ordering scope identifier. In response to determining that the processor core is authorized to transition the first task from the first ordering scope to a second ordering scope associated with the new ordering scope identifier, the ordering scope manager provides hint information to the processor core. The processor core transitions from the first ordering scope to the second ordering scope without completing a task switch in response to the hint information.
    • 数据处理系统包括处理器核心和硬件模块。 处理器内核在数据包上执行任务。 硬件模块在订购范围管理器的第一存储位置处存储第一订购范围标识符。 第一个订购范围标识符指示第一个任务正在操作的第一个订购范围。订购范围管理器增加第一个订购范围标识符以创建新的订购范围标识符。 响应于确定处理器核被授权将第一任务从第一排序范围转换到与新排序范围标识符相关联的第二排序范围,订购范围管理器向处理器核提供提示信息。 处理器核心从第一订购范围转换到第二订购范围,而不响应于提示信息完成任务切换。
    • 8. 发明授权
    • Shared resource based thread scheduling with affinity and/or selectable criteria
    • 基于共享资源的线程调度,具有亲和度和/或可选择的标准
    • US08739165B2
    • 2014-05-27
    • US12017988
    • 2008-01-22
    • Andrew C. RussellWilliam C. Moyer
    • Andrew C. RussellWilliam C. Moyer
    • G06F9/46
    • G06F9/5027G06F9/5094Y02D10/22
    • Threads may be scheduled to be executed by one or more cores depending upon whether it is more desirable to minimize power or to maximize performance. If minimum power is desired, threads may be schedule so that the active devices are most shared; this will minimize the number of active devices at the expense of performance. On the other hand, if maximum performance is desired, threads may be scheduled so that active devices are least shared. As a result, threads will have more active devices to themselves, resulting in greater performance at the expense of additional power consumption. Thread affinity with a core may also be taken into consideration when scheduling threads in order to improve the power consumption and/or performance of an apparatus.
    • 线程可以被调度为由一个或多个核执行,这取决于是否更希望最小化功率或最大化性能。 如果需要最小功率,则可以调度线程,使得有效设备是最共享的; 这将以牺牲性能为代价来最小化活动设备的数量。 另一方面,如果需要最大性能,则可以调度线程,使得有源设备最不共享。 因此,线程将自己拥有更多的活动设备,导致更高的性能,而牺牲额外的功耗。 为了提高设备的功耗和/或性能,调度线程时也可以考虑与核心的线程亲和度。
    • 9. 发明授权
    • Progressive memory initialization with waitpoints
    • 具有等待点的逐行内存初始化
    • US08725975B2
    • 2014-05-13
    • US11619294
    • 2007-01-03
    • William C. Moyer
    • William C. Moyer
    • G06F3/06
    • G06F3/061G06F3/0632G06F3/0673G06F11/1008
    • A method includes initializing a counter value of a hardware counter. The method further includes iteratively adjusting the counter value and storing an initialization value to a memory location using a memory address based on the counter value. The method also includes generating an interrupt request based on a comparison of the counter value to a waitpoint value concurrent with iteratively adjusting and storing. A memory device includes a memory array and an initialization module. The initialization module includes a counter, a register to store a waitpoint value, write logic configured to write an initialization value to a memory location of the memory array associated with a memory address that is based on a counter value of the counter, and interrupt logic configured to generate an interrupt request based on a comparison of the counter value of the counter to the waitpoint value.
    • 一种方法包括初始化硬件计数器的计数器值。 该方法还包括迭代地调整计数器值,并且使用基于计数器值的存储器地址将初始化值存储到存储器位置。 该方法还包括基于通过迭代调整和存储同时计算值与等待点值的比较来产生中断请求。 存储器件包括存储器阵列和初始化模块。 初始化模块包括计数器,用于存储等待点值的寄存器,被配置为将初始化值写入与基于计数器的计数器值的存储器地址相关联的存储器阵列的存储器位置的写入逻辑,以及中断逻辑 被配置为基于计数器的计数器值与等待点值的比较来生成中断请求。
    • 10. 发明申请
    • Data Type Dependent Memory Scrubbing
    • 数据类型依赖内存清理
    • US20140052931A1
    • 2014-02-20
    • US13588243
    • 2012-08-17
    • Ravindraraj RamarajuWilliam C. MoyerAndrew C. Russell
    • Ravindraraj RamarajuWilliam C. MoyerAndrew C. Russell
    • G06F12/08
    • G06F12/0895G06F11/106G06F11/1064Y02D10/13
    • A method for controlling a memory scrubbing rate based on content of the status bit of a tag array of a cache memory. More specifically, the tag array of a cache memory is scrubbed at smaller interval than the scrubbing rate of the storage arrays of the cache. This increased scrubbing rate is in appreciation for the importance of maintaining integrity of tag data. Based on the content of the status bit of the tag array which indicates modified, the corresponding data entry in the cache storage array is scrubbed accordingly. If the modified bit is set, then the entry in the storage array is scrubbed after processing the tag entry. If the modified bit is not set, then the storage array is scrubbed at a predetermined scrubbing interval.
    • 一种用于基于高速缓冲存储器的标签阵列的状态位的内容来控制存储器擦除速率的方法。 更具体地说,高速缓冲存储器的标签阵列以比缓存的存储阵列的擦除速率更小的间隔进行擦除。 对于保持标签数据完整性的重要性,这种提高的清洗率是值得赞赏的。 基于指示被修改的标签阵列的状态位的内容,相应地擦除缓存存储阵列中的相应数据条目。 如果修改的位被设置,则在处理标签条目之后擦除存储阵列中的条目。 如果未设置修改的位,则以预定的擦洗间隔擦除存储阵列。