Memory Pacing
    1.
    发明申请
    Memory Pacing 失效
    内存起搏

    公开(公告)号:US20090254730A1

    公开(公告)日:2009-10-08

    申请号:US12478830

    申请日:2009-06-05

    IPC分类号: G06F12/02

    摘要: A method, system, and program for managing memory page requests in a multi-processor data processing system determines a threshold value of available memory, and dynamically adjusts an allocation time to fulfill a page request if the available memory is below a threshold value. The allocation time to fulfill the page request is based upon a percentage of available memory pages once a page stealer commences a scan for pages. An allocation wait time is inversely proportionally adjusted depending upon the percentage of available memory. The allocation wait time has a duration that increases in time as the percentage of available memory decreases and decreases in time as the percentage of available memory increases. More specifically, an average time per page to allocate a page including a scan time for the scan in computing the average time is determined. Then a tunable value is applied to the average time to determine a wait time. In a preferred embodiment, user defined values are received that would control the allocation wait time before fulfilling a page request.

    摘要翻译: 用于管理多处理器数据处理系统中的存储器页面请求的方法,系统和程序确定可用存储器的阈值,并且如果可用存储器低于阈值,则动态地调整分配时间以满足页面请求。 一旦页面窃取器开始扫描页面,则完成页面请求的分配时间基于可用内存页面的百分比。 分配等待时间根据可用内存的百分比进行反比例调整。 分配等待时间具有随时间增加的持续时间,随着可用内存的百分比的增加,可用内存的百分比随时间而减少。 更具体地,确定在计算平均时间时分配包括用于扫描的扫描时间的页面的每页的平均时间。 然后将可调值应用于平均时间以确定等待时间。 在优选实施例中,接收用户定义的值,其将在满足页面请求之前控制分配等待时间。

    Method for trading resources between partitions of a data processing system
    2.
    发明授权
    Method for trading resources between partitions of a data processing system 失效
    用于在数据处理系统的分区之间交换资源的方法

    公开(公告)号:US07698529B2

    公开(公告)日:2010-04-13

    申请号:US11621637

    申请日:2007-01-10

    IPC分类号: G06F13/00

    CPC分类号: G06F9/5077

    摘要: A method is provided for a data processing system configured to include multiple logical partitions, wherein resources of the system are selectively allocated among respective partitions. In the method, an entity such as a Partition Load Manager or a separate background process is used to manage resources based on locality levels. The method includes the step of evaluating the allocation of resources to each of the partitions at a particular time, in order to select a partition having at least one resource considered to be of low desirability due to its level of locality with respect to the selected partition. The method further comprises identifying each of the other partitions that has a resource matching the resource of low desirability, and determining the overall benefit to the system that would result from trading the resource of low desirability for the matching resource of each of the identified partitions. Resources are reallocated to trade the resource of low desirability for the matching resource of the identified partition that is determined to provide the greatest overall benefit for the system, provided that at least some overall system benefit will result from the reallocation.

    摘要翻译: 提供了一种用于数据处理系统的方法,所述数据处理系统被配置为包括多个逻辑分区,其中所述系统的资源在各个分区之间被选择性地分配。 在该方法中,使用诸如分区加载管理器或单独的后台进程的实体来基于地点级别来管理资源。 该方法包括在特定时间评估对每个分区的资源分配的步骤,以便由于其相对于所选择的分区的局部性水平而选择具有被认为是低可取性的至少一个资源的分区 。 该方法还包括识别具有与低可靠性的资源匹配的资源的每个其他分区,以及确定由对于每个所识别的分区的匹配资源的低期望性的资源进行交易而导致的系统的总体利益。 重新分配资源以交换被确定为系统提供最大整体利益的所识别分区的匹配资源的低可用性资源,前提是至少部分整体系统利益将由重新分配产生。

    Memory pacing
    3.
    发明授权
    Memory pacing 失效
    记忆起搏

    公开(公告)号:US07788455B2

    公开(公告)日:2010-08-31

    申请号:US12478830

    申请日:2009-06-05

    IPC分类号: G06F12/00

    摘要: A method, system, and program for managing memory page requests in a multi-processor data processing system determines a threshold value of available memory, and dynamically adjusts an allocation time to fulfill a page request if the available memory is below a threshold value. The allocation time to fulfill the page request is based upon a percentage of available memory pages once a page stealer commences a scan for pages. An allocation wait time is inversely proportionally adjusted depending upon the percentage of available memory. The allocation wait time has a duration that increases in time as the percentage of available memory decreases and decreases in time as the percentage of available memory increases. More specifically, an average time per page to allocate a page including a scan time for the scan in computing the average time is determined. Then a tunable value is applied to the average time to determine a wait time. In a preferred embodiment, user defined values are received that would control the allocation wait time before fulfilling a page request.

    摘要翻译: 用于管理多处理器数据处理系统中的存储器页面请求的方法,系统和程序确定可用存储器的阈值,并且如果可用存储器低于阈值,则动态地调整分配时间以满足页面请求。 一旦页面窃取器开始扫描页面,则完成页面请求的分配时间基于可用内存页面的百分比。 分配等待时间根据可用内存的百分比进行反比例调整。 分配等待时间具有随时间增加的持续时间,随着可用内存的百分比的增加,可用内存的百分比随时间而减少。 更具体地,确定在计算平均时间时分配包括用于扫描的扫描时间的页面的每页的平均时间。 然后将可调值应用于平均时间以确定等待时间。 在优选实施例中,接收用户定义的值,其将在满足页面请求之前控制分配等待时间。

    User defined preferred DNS reference
    4.
    发明授权
    User defined preferred DNS reference 失效
    用户定义的首选DNS参考

    公开(公告)号:US08037203B2

    公开(公告)日:2011-10-11

    申请号:US10782668

    申请日:2004-02-19

    IPC分类号: G06F15/173

    CPC分类号: H04L61/1511

    摘要: Methods, systems, and products are disclosed for user defined preferred DNS routing that include mapping for a user in a data communications application a domain name of a network host to a network address for a preferred DNS server, wherein the preferred DNS server has a network address for the domain name; receiving from the user a request for access to a resource accessible through the network host; and routing to the preferred DNS server a DNS request for the network address of the network host, the DNS request including the domain name of the network host. In typical embodiments, mapping a domain name to a network address for a preferred DNS server is carried out by storing, through the data communication application, the domain name in association with the network address for a preferred DNS server in a data structure in computer memory.

    摘要翻译: 公开了用于用户定义的优选DNS路由的方法,系统和产品,其包括将数据通信应用中的用户映射到网络主机的域名到优选DNS服务器的网络地址,其中优选DNS服务器具有网络 地址为域名; 从用户接收对通过网络主机可访问的资源的访问请求; 并将首选DNS服务器路由到网络主机的网络地址的DNS请求,DNS请求包括网络主机的域名。 在典型的实施例中,将域名映射到优选DNS服务器的网络地址是通过数据通信应用与计算机存储器中的数据结构中的优选DNS服务器的网络地址相关联地存储域名来执行的 。

    METHOD AND APPARATUS FOR INSTRUCTION TRACE REGISTERS
    5.
    发明申请
    METHOD AND APPARATUS FOR INSTRUCTION TRACE REGISTERS 有权
    指令跟踪寄存器的方法和装置

    公开(公告)号:US20090113239A1

    公开(公告)日:2009-04-30

    申请号:US11924192

    申请日:2007-10-25

    IPC分类号: G06F9/30 G06F11/07 G06F9/312

    CPC分类号: G06F9/30101

    摘要: A computer implemented method, apparatus, and computer usable program product for utilizing instruction trace registers. In one embodiment, a value in a target processor register in a plurality of processor registers is updated in response to executing an instruction associated with program code. In response to updating the value in the target processor register, an address for the instruction is copied from an instruction address register into an instruction trace register associated with the target processor register. The instruction trace register holds the address of the instruction that updated the value stored in the target processor register.

    摘要翻译: 一种用于使用指令跟踪寄存器的计算机实现的方法,装置和计算机可用程序产品。 在一个实施例中,响应于执行与程序代码相关联的指令,更新多个处理器寄存器中的目标处理器寄存器中的值。 响应更新目标处理器寄存器中的值,将指令的地址从指令地址寄存器复制到与目标处理器寄存器相关联的指令跟踪寄存器中。 指令跟踪寄存器保存更新存储在目标处理器寄存器中的值的指令的地址。

    Scheduling Compatible Threads in a Simultaneous Multi-Threading Processor Using Cycle Per Instruction Value Occurred During Identified Time Interval
    6.
    发明申请
    Scheduling Compatible Threads in a Simultaneous Multi-Threading Processor Using Cycle Per Instruction Value Occurred During Identified Time Interval 有权
    在同一个多线程处理器中调度兼容的线程使用周期每个指令值在确定的时间间隔期间发生

    公开(公告)号:US20080148274A1

    公开(公告)日:2008-06-19

    申请号:US12036804

    申请日:2008-02-25

    IPC分类号: G06F9/46

    CPC分类号: G06F9/4881 G06F2209/483

    摘要: Identifying compatible threads in a Simultaneous Multithreading (SMT) processor environment is provided by calculating a performance metric, such as cycles per instruction (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数据,以便不断地识别彼此兼容的线程。

    System and method for adding priority change value corresponding with a lock to a thread during lock processing
    7.
    发明授权
    System and method for adding priority change value corresponding with a lock to a thread during lock processing 失效
    用于在锁处理期间将与锁相对应的优先级更改值添加到线程的系统和方法

    公开(公告)号:US07278141B2

    公开(公告)日:2007-10-02

    申请号:US10422037

    申请日:2003-04-23

    IPC分类号: G06F9/46

    CPC分类号: G06F9/526 G06F9/4881

    摘要: A system and method is altering the priority of a process, or thread of execution, when the process acquires a software lock. The priority is altered when the lock is acquired and restored when the process releases the lock. Thread priorities can be altered for every lock being managed by the operating system or can selectively be altered. In addition, the amount of alteration can be individually adjusted so that a process that acquires one lock receive a different priority boost than a process that acquires a different lock. Furthermore, a method of tuning a computer system by adjusting lock priority values is provided.

    摘要翻译: 当进程获取软件锁时,系统和方法正在改变进程的优先级或执行的线程。 当获取锁定时,优先级会更改,并在进程释放锁定时恢复。 可以对由操作系统管理的每个锁进行线程优先级改变,或者可以有选择地改变。 此外,可以单独调整更改量,使得获取一个锁的进程与获取不同锁的进程接收到不同的优先级提升。 此外,提供了通过调整锁定优先级值来调整计算机系统的方法。

    System and method for CPI load balancing in SMT processors
    8.
    发明授权
    System and method for CPI load balancing in SMT processors 失效
    SMT处理器中CPI负载平衡的系统和方法

    公开(公告)号:US07676808B2

    公开(公告)日:2010-03-09

    申请号:US11955503

    申请日:2007-12-13

    IPC分类号: G06F9/46

    CPC分类号: G06F9/5083

    摘要: A system and method for scheduling threads in a Simultaneous Multithreading (SMT) processor environment utilizing multiple SMT processors is provided. Poor performing threads that are being run on each of the SMT processors are identified. After being identified, the poor performing threads are moved to a different SMT processor. Data is captured regarding the performance of threads. In one embodiment, this data includes each threads' CPI value. When a thread is moved, data regarding the thread and its performance at the time it was moved is recorded along with a timestamp. The data regarding previous moves is used to determine whether a thread's performance is improved following the move.

    摘要翻译: 提供了一种利用多个SMT处理器的同时多线程(SMT)处理器环境中调度线程的系统和方法。 识别在每个SMT处理器上运行的执行不良线程。 被识别后,执行不良的线程被移动到不同的SMT处理器。 捕获关于线程性能的数据。 在一个实施例中,该数据包括每个线程的CPI值。 当线程移动时,与线程及其在移动时的性能相关的数据与时间戳一起被记录。 关于先前移动的数据用于确定线程的性能是否随着移动而改善。

    Optimized Preemption and Reservation of Software Locks
    9.
    发明申请
    Optimized Preemption and Reservation of Software Locks 失效
    优化抢占和预订软件锁

    公开(公告)号:US20080163217A1

    公开(公告)日:2008-07-03

    申请号:US12049304

    申请日:2008-03-15

    IPC分类号: G06F9/46

    CPC分类号: G06F9/526 G06F2209/522

    摘要: An approach is provided that reserves a software lock for a waiting thread is presented. When a software lock is released by a first thread, a second thread that is waiting for the same resource controlled by the software lock is woken up. In addition, a reservation to the software lock is established for the second thread. After the reservation is established, if the lock is available and requested by a thread other than the second thread, the requesting thread is denied, added to the wait queue, and put to sleep. In addition, the reservation is cleared. After the reservation has been cleared, the lock will be granted to the next thread to request the lock.

    摘要翻译: 提供了一种保留用于等待线程的软件锁的方法。 当软件锁由第一个线程释放时,等待软件锁定的相同资源的第二个线程被唤醒。 另外,针对第二线程建立对软件锁定的预约。 在建立预留之后,如果第二线程之外的线程可用并请求该锁,则请求线程被拒绝,被添加到等待队列中并进入休眠状态。 此外,预订已被清除。 预订清除后,锁将被授予下一个线程以请求锁定。

    System for delaying priority boost in a priority offset amount only after detecting of preemption event during access to critical section
    10.
    发明授权
    System for delaying priority boost in a priority offset amount only after detecting of preemption event during access to critical section 有权
    用于仅在检测到关键部分的访问期间的抢占事件之前延迟优先级偏移量中的优先级提升的系统

    公开(公告)号:US07380247B2

    公开(公告)日:2008-05-27

    申请号:US10626192

    申请日:2003-07-24

    IPC分类号: G06F13/18 G06F13/00

    CPC分类号: G06F9/52 G06F9/4818

    摘要: A system and method is provided for delaying a priority boost of an execution thread. When a thread prepares to enter a critical section of code, such as when the thread utilizes a shared system resource, a user mode accessible data area is updated indicating that the thread is in a critical section and, if the kernel receives a preemption event, the priority boost that the thread should receive. If the kernel receives a preemption event before the thread finishes the critical section, the kernel applies the priority boost on behalf of the thread. Often, the thread will finish the critical section without having to have its priority actually boosted. If the thread does receive an actual priority boost then, after the critical section is finished, the kernel resets the thread's priority to a normal level.

    摘要翻译: 提供了一种用于延迟执行线程的优先级提升的系统和方法。 当线程准备进入代码的关键部分时,例如当线程利用共享系统资源时,更新用户模式可访问数据区域,指示线程处于关键部分,并且如果内核接收到抢占事件, 线程应该接收的优先级提升。 如果内核在线程完成关键部分之前收到抢占事件,则内核将代表线程应用优先级提升。 通常,线程将完成关键部分,而无需实际提升优先级。 如果线程确实接收到实际的优先级提升,那么在关键部分完成之后,内核会将线程的优先级重置为正常级别。