会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明申请
    • INPUT/OUTPUT COMPLETION SYSTEM FOR A DATA PROCESSING PLATFORM
    • 用于数据处理平台的输入/输出完成系统
    • US20100070664A1
    • 2010-03-18
    • US12623506
    • 2009-11-23
    • David W. Schroth
    • David W. Schroth
    • G06F5/00
    • G06F13/124
    • A mechanism is disclosed for performing I/O operations using queue banks within a data processing system that supports multiple processing partitions. A queue bank is a re-useable area of memory allocated for performing I/O operations. All memory locking and address-translation functions are generally performed only once for a queue bank to reduce system overhead. After a queue bank has been used to perform an I/O operation, some processing is performed to make it available for re-use. This processing determines whether the queue bank contains memory that is being removed from a current processing partition. If so, a delay is imposed so that the queue bank is not made available for immediate re-use. This creates a window of time wherein all queue banks that contain the affected memory are inactive, thereby allowing the affected memory to be removed from the partition without halting on-going I/O activity.
    • 公开了一种用于使用支持多个处理分区的数据处理系统内的队列进行I / O操作的机制。 队列库是分配用于执行I / O操作的可重用的内存区域。 所有内存锁定和地址转换功能通常只对队列执行一次,以减少系统开销。 在使用队列执行I / O操作之后,执行一些处理以使其可以重新使用。 该处理确定队列库是否包含正在从当前处理分区移除的存储器。 如果是这样,则会发生延迟,使得队列不能立即重新使用。 这将创建一个时间窗口,其中包含受影响的内存的所有队列都不活动,从而允许从分区中删除受影响的内存,而不会停止正在进行的I / O活动。
    • 8. 发明授权
    • Input/output completion system and method for a data processing platform
    • 数据处理平台的输入/输出完成系统和方法
    • US07899958B2
    • 2011-03-01
    • US11643313
    • 2006-12-21
    • David W. Schroth
    • David W. Schroth
    • G06F3/00
    • G06F13/124
    • A mechanism is disclosed for performing I/O operations using queue banks within a data processing system that supports multiple processing partitions. A queue bank is a re-useable area of memory allocated for performing I/O operations. All memory locking and address-translation functions are generally performed only once for a queue bank to reduce system overhead. After a queue bank has been used to perform an I/O operation, some processing is performed to make it available for re-use. This processing determines whether the queue bank contains memory that is being removed from a current processing partition. If so, a delay is imposed so that the queue bank is not made available for immediate re-use. This creates a window of time wherein all queue banks that contain the affected memory are inactive, thereby allowing the affected memory to be removed from the partition without halting on-going I/O activity.
    • 公开了一种用于使用支持多个处理分区的数据处理系统内的队列进行I / O操作的机制。 队列库是分配用于执行I / O操作的可重用的内存区域。 所有内存锁定和地址转换功能通常只对队列执行一次,以减少系统开销。 在使用队列执行I / O操作之后,执行一些处理以使其可以重新使用。 该处理确定队列库是否包含正在从当前处理分区移除的存储器。 如果是这样,则会发生延迟,使得队列不能立即重新使用。 这将创建一个时间窗口,其中包含受影响的内存的所有队列都不活动,从而允许从分区中删除受影响的内存,而不会停止正在进行的I / O活动。
    • 9. 发明授权
    • System and method for affinity dispatching for task management in an emulated multiprocessor environment
    • 用于仿真多处理器环境中任务管理的亲和调度的系统和方法
    • US08661435B2
    • 2014-02-25
    • US12886969
    • 2010-09-21
    • David W. SchrothBrian GarrettAndrew T. JenningsMichael John Rieschi
    • David W. SchrothBrian GarrettAndrew T. JenningsMichael John Rieschi
    • G06F9/455
    • G06F9/5033G06F9/455
    • The disclosure relates generally to managing assignment of tasks among instruction processors (IPs) within a computer system having multiple IPs, and more particularly to binding emulated IPs with a host system's IPs (e.g., processor cores) for facilitating control over affinity-based assignment of tasks among the host system's IPs by a task manager (e.g., OS) that is executing on the emulated IPs, rather than running directly on the host system's IPs. Certain embodiments provide techniques for binding emulated IPs with actual IPs of a computing system that is hosting the emulated IPs, thereby enabling better control of management of the system by a task manager executing on the emulated IPs. For instance, in certain embodiments, a dispatcher (e.g., of an OS running on emulated IPs) performs affinity-based management of task assignment for tasks performed for an application program among IPs of a host system that is hosting the emulated IPs.
    • 本公开一般涉及管理具有多个IP的计算机系统内的指令处理器(IP)中的任务的分配,更具体地说,涉及将仿真IP与主机系统的IP(例如,处理器核)绑定在一起,以便于对基于亲和力的分配进行控制 任务管理器(例如OS)在主机系统的IP之间执行任务,而不是直接在主机系统的IP上运行。 某些实施例提供了用于将仿真的IP与承载仿真IP的计算系统的实际IP绑定的技术,从而能够更好地控制由仿真IP执行的任务管理器对系统的管理。 例如,在某些实施例中,调度员(例如,在仿真IP上运行的OS)对承载仿真IP的主机系统的IP之间的应用程序执行的任务执行基于关系的对任务分配的管理。
    • 10. 发明授权
    • Input/Output completion system for a data processing platform
    • 数据处理平台的输入/输出完成系统
    • US07818478B2
    • 2010-10-19
    • US12623506
    • 2009-11-23
    • David W. Schroth
    • David W. Schroth
    • G06F3/00G06F5/00
    • G06F13/124
    • A mechanism is disclosed for performing I/O operations using queue banks within a data processing system that supports multiple processing partitions. A queue bank is a re-useable area of memory allocated for performing I/O operations. All memory locking and address-translation functions are generally performed only once for a queue bank to reduce system overhead. After a queue bank has been used to perform an I/O operation, some processing is performed to make it available for re-use. This processing determines whether the queue bank contains memory that is being removed from a current processing partition. If so, a delay is imposed so that the queue bank is not made available for immediate re-use. This creates a window of time wherein all queue banks that contain the affected memory are inactive, thereby allowing the affected memory to be removed from the partition without halting on-going I/O activity.
    • 公开了一种用于使用支持多个处理分区的数据处理系统内的队列进行I / O操作的机制。 队列库是分配用于执行I / O操作的可重用的内存区域。 所有内存锁定和地址转换功能通常只对队列执行一次,以减少系统开销。 在使用队列执行I / O操作之后,执行一些处理以使其可以重新使用。 该处理确定队列库是否包含正在从当前处理分区移除的存储器。 如果是这样,则会发生延迟,使得队列不能立即重新使用。 这将创建一个时间窗口,其中包含受影响的内存的所有队列都不活动,从而允许从分区中删除受影响的内存,而不会停止正在进行的I / O活动。