DYNAMIC MEMORY AFFINITY REALLOCATION AFTER PARTITION MIGRATION
    1.
    发明申请
    DYNAMIC MEMORY AFFINITY REALLOCATION AFTER PARTITION MIGRATION 有权
    分区移动后动态记忆重建

    公开(公告)号:US20120102258A1

    公开(公告)日:2012-04-26

    申请号:US12910234

    申请日:2010-10-22

    IPC分类号: G06F12/08

    摘要: A method of dynamically reallocating memory affinity in a virtual machine after migrating the virtual machine from a source computer system to a destination computer system migrates processor states and resources used by the virtual machine from the source computer system to the destination computer system. The method maps memory of the virtual machine to processor nodes of the destination computer system. The method deletes memory mappings in processor hardware, such as translation lookaside buffers and effective-to-real address tables, for the virtual machine on the destination computer system. The method starts the virtual machine on the destination computer system in virtual real memory mode. A hypervisor running on the destination computer system receives a page fault and virtual address of a page for said virtual machine from a processor of the destination computer system and determines if the page is in local memory of the processor. If the hypervisor determines the page to be in the local memory of the processor, the hypervisor returning a physical address mapping for the page to the processor. If the hypervisor determines the page not to be in the local memory of the processor, the hypervisor moves the page to local memory of the processor and returns a physical address mapping for said page to the processor.

    摘要翻译: 将虚拟机从源计算机系统迁移到目标计算机系统之后,在将虚拟机迁移到目标计算机系统之后,在虚拟机中动态重新分配存储器亲和性的方法将将虚拟机使用的处理器状态和资源从源计算机系统迁移到目标计算机系统。 该方法将虚拟机的内存映射到目标计算机系统的处理器节点。 该方法会删除目标计算机系统上的虚拟机的处理器硬件中的内存映射,例如翻译后备缓冲区和有效到真实的地址表。 该方法以虚拟实时存储模式启动目标计算机系统上的虚拟机。 在目的地计算机系统上运行的管理程序从目的地计算机系统的处理器接收所述虚拟机的页面错误和虚拟地址,并确定页面是否在处理器的本地存储器中。 如果管理程序将该页面确定在处理器的本地存储器中,则管理程序将页面的物理地址映射返回到处理器。 如果管理程序确定页面不在处理器的本地存储器中,则管理程序将页面移动到处理器的本地存储器,并将所述页面的物理地址映射返回到处理器。

    Method and apparatus for virtual processor dispatching to a partition based on shared memory pages
    2.
    发明授权
    Method and apparatus for virtual processor dispatching to a partition based on shared memory pages 失效
    基于共享存储器页面的虚拟处理器分配到分区的方法和装置

    公开(公告)号:US08271989B2

    公开(公告)日:2012-09-18

    申请号:US12027525

    申请日:2008-02-07

    IPC分类号: G06F9/455 G06F9/46

    摘要: The present invention provides a computer implemented method, data processing system, and computer program product for mapping and dispatching virtual processors in a data processing system having at least a first partition and a second partition. The data processing system runs a first partition on a virtual processor during a first timeslice. The data processing system identifies an at least one physical page used by the first partition and the second partition. The data processing system maps the at least one physical page to the first partition and the second partition. The data processing system determines a fitness value based on the mapping. The data processing system dispatches the Virtual processor to the second partition on a second timeslice based on the fitness value, wherein the second timeslice immediately succeeds after the first timeslice, whereby the at least one physical page remains in cache during at least the first timeslice and the second timeslice.

    摘要翻译: 本发明提供了一种用于在具有至少第一分区和第二分区的数据处理系统中映射和分派虚拟处理器的计算机实现方法,数据处理系统和计算机程序产品。 数据处理系统在第一时间片段期间在虚拟处理器上运行第一分区。 数据处理系统识别由第一分区和第二分区使用的至少一个物理页面。 数据处理系统将至少一个物理页面映射到第一分区和第二分区。 数据处理系统基于映射确定适应度值。 所述数据处理系统基于所述适合度值将所述虚拟处理器分配到所述第二分区,其中所述第二时间片在所述第一时间片之后立即成功,由此所述至少一个物理页在至少所述第一时间片内保持在高速缓存中,以及 第二个时间片

    METHOD AND APPARATUS FOR VIRTUAL PROCESSOR DISPATCHING TO A PARTITION BASED ON SHARED MEMORY PAGES
    3.
    发明申请
    METHOD AND APPARATUS FOR VIRTUAL PROCESSOR DISPATCHING TO A PARTITION BASED ON SHARED MEMORY PAGES 失效
    基于共享存储器页面的虚拟处理器分配到分区的方法和装置

    公开(公告)号:US20090204959A1

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

    申请号:US12027525

    申请日:2008-02-07

    IPC分类号: G06F9/455

    摘要: The present invention provides a computer implemented method, data processing system, and computer program product for mapping and dispatching virtual processors in a data processing system having at least a first partition and a second partition. The data processing system runs a first partition on a virtual processor during a first timeslice. The data processing system identifies an at least one physical page used by the first partition and the second partition. The data processing system maps the at least one physical page to the first partition and the second partition. The data processing system determines a fitness value based on the mapping. The data processing system dispatches the Virtual processor to the second partition on a second timeslice based on the fitness value, wherein the second timeslice immediately succeeds after the first timeslice, whereby the at least one physical page remains in cache during at least the first timeslice and the second timeslice.

    摘要翻译: 本发明提供了一种用于在具有至少第一分区和第二分区的数据处理系统中映射和分派虚拟处理器的计算机实现方法,数据处理系统和计算机程序产品。 数据处理系统在第一时间片段期间在虚拟处理器上运行第一分区。 数据处理系统识别由第一分区和第二分区使用的至少一个物理页面。 数据处理系统将至少一个物理页面映射到第一分区和第二分区。 数据处理系统基于映射确定适应度值。 所述数据处理系统基于所述适合度值将所述虚拟处理器分配到所述第二分区,其中所述第二时间片在所述第一时间片之后立即成功,由此所述至少一个物理页在至少所述第一时间片内保持在高速缓存中,以及 第二个时间片

    OPPORTUNISTIC USE OF LOCK MECHANISM TO REDUCE WAITING TIME OF THREADS TO ACCESS A SHARED RESOURCE
    4.
    发明申请
    OPPORTUNISTIC USE OF LOCK MECHANISM TO REDUCE WAITING TIME OF THREADS TO ACCESS A SHARED RESOURCE 失效
    锁定机制的机会性使用,以减少等待时间来获取共享资源

    公开(公告)号:US20110161539A1

    公开(公告)日:2011-06-30

    申请号:US12651294

    申请日:2009-12-31

    IPC分类号: G06F12/00 G06F9/46

    CPC分类号: G06F9/526

    摘要: Embodiments of the invention provide a method, apparatus and computer program product for enabling a thread to acquire a lock associated with a shared resource, when a locking mechanism is used therewith, wherein each embodiment reduces waiting time and enhances efficiency in using the shared resource. One embodiment is associated with a plurality of processors, which includes two or more processors that each provides a specified thread to access a shared resource. The shared resource can only be accessed by one thread at a given time, a locking mechanism enables a first one of the specified threads to access the shared resource while each of the other specified threads is retained in a waiting queue, and a second one of the specified threads occupies a position of highest priority in the queue. The method includes the step of identifying a time period between a time when the first specified thread releases access to the shared resource, and a later time when the second specified thread becomes enabled to access the shared resource. Responsive to an additional thread that is not one of the specified threads being provided by a processor to access the shared resource during the identified time period, it is determined whether a first prespecified criterion pertaining to the specified threads retained in the queue has been met. Responsive to the first criterion being met, the method determines whether a second prespecified criterion has been met, wherein the second criterion is that the number of specified threads in the queue has not decreased since a specified prior time. Responsive to the second criterion being met, the method then decides whether to enable the additional thread to access the shared resource before the second specified thread accesses the resource.

    摘要翻译: 本发明的实施例提供一种方法,装置和计算机程序产品,用于当使用锁定机构时使线程能够获取与共享资源相关联的锁,其中每个实施例减少等待时间并提高使用共享资源的效率。 一个实施例与多个处理器相关联,处理器包括两个或多个处理器,每个处理器提供指定的线程以访问共享资源。 共享资源只能在给定时间由一个线程访问,锁定机制使得指定线程中的第一个访问共享资源,而每个其他指定的线程保留在等待队列中,第二个 指定的线程占据队列中最高优先级的位置。 该方法包括识别在第一指定线程释放对共享资源的访问的时间之间的时间段以及第二指定线程变得能够访问共享资源的稍后时间的步骤。 响应于在识别的时间段期间处理器不提供访问共享资源的指定线程中的一个的附加线程,确定是否已经满足与保留在队列中的指定线程有关的第一预先指定的准则。 响应于满足的第一标准,该方法确定是否已经满足第二预定标准,其中第二标准是指定的先前时间之后队列中的指定线程的数量没有减少。 响应于满足的第二准则,该方法然后决定在第二指定线程访问资源之前是否允许附加线程访问共享资源。

    Lock mechanism to reduce waiting of threads to access a shared resource by selectively granting access to a thread before an enqueued highest priority thread
    5.
    发明授权
    Lock mechanism to reduce waiting of threads to access a shared resource by selectively granting access to a thread before an enqueued highest priority thread 失效
    锁定机制,以减少线程访问共享资源的等待,方法是选择性地授予在入队优先级线程之前访问线程

    公开(公告)号:US08607239B2

    公开(公告)日:2013-12-10

    申请号:US12651294

    申请日:2009-12-31

    IPC分类号: G06F9/46 G06F12/00

    CPC分类号: G06F9/526

    摘要: Two or more processors that each provides a specified thread to access a shared resource that can only be accessed by one thread at a given time. A locking mechanism enables one of the threads to access the shared resource while other threads are retained in a waiting queue. Responsive to an additional thread that is not one of the specified threads being provided access the shared resource during an identified time period, and responsive to a first criterion an a second criterion being met, the additional thread accesses the shared resource before the other threads in the waiting queue.

    摘要翻译: 两个或多个处理器每个提供指定线程以访问只能在给定时间由一个线程访问的共享资源。 锁定机制使其中一个线程可以访问共享资源,而其他线程保留在等待队列中。 响应于不是所提供的指定线程之一的附加线程在标识的时间段期间访问共享资源,并且响应于第一准则满足第二准则,附加线程在其他线程之前访问共享资源 等待队列。

    LOCK BASED MOVING OF THREADS IN A SHARED PROCESSOR PARTITIONING ENVIRONMENT
    8.
    发明申请
    LOCK BASED MOVING OF THREADS IN A SHARED PROCESSOR PARTITIONING ENVIRONMENT 审中-公开
    在共享处理器分割环境中基于锁定的螺纹移动

    公开(公告)号:US20120278809A1

    公开(公告)日:2012-11-01

    申请号:US13544958

    申请日:2012-07-09

    IPC分类号: G06F9/46

    摘要: The present invention provides a computer implemented method and apparatus to assign software threads to a common virtual processor of a data processing system having multiple virtual processors. A data processing system detects cooperation between a first thread and a second thread with respect to a lock associated with a resource of the data processing system. Responsive to detecting cooperation, the data processing system assigns the first thread to the common virtual processor. The data processing system moves the second thread to the common virtual processor, whereby a sleep time associated with the lock experienced by the first thread and the second thread is reduced below a sleep time experienced prior to the detecting cooperation step.

    摘要翻译: 本发明提供了一种计算机实现的方法和装置,用于将软件线程分配给具有多个虚拟处理器的数据处理系统的公共虚拟处理器。 数据处理系统相对于与数据处理系统的资源相关联的锁检测第一线程和第二线程之间的协作。 响应于检测合作,数据处理系统将第一线程分配给公共虚拟处理器。 所述数据处理系统将所述第二线程移动到所述公共虚拟处理器,由此与所述第一线程和所述第二线程所经历的锁相关联的休眠时间减少到在所述检测合作步骤之前经历的睡眠时间以下。

    Processor Management Via Thread Status
    9.
    发明申请
    Processor Management Via Thread Status 有权
    处理器管理通过线程状态

    公开(公告)号:US20120246652A1

    公开(公告)日:2012-09-27

    申请号:US13069338

    申请日:2011-03-22

    IPC分类号: G06F9/48

    摘要: Various systems, processes, and products may be used to manage a processor. In particular implementations, managing a processor may include the ability to determine whether a thread is pausing for a short period of time and place a wait event for the thread in a queue based on a short thread pause occurring. Managing a processor may also include the ability to activate a delay thread that determines whether a wait time associated with the pause has expired and remove the wait event from the queue based on the wait time having expired.

    摘要翻译: 可以使用各种系统,过程和产品来管理处理器。 在特定实现中,管理处理器可以包括确定线程是否在短时间段内暂停并且基于发生的短线程暂停将线程的等待事件置于队列中的能力。 管理处理器还可以包括激活延迟线程的能力,该延迟线程确定与暂停相关联的等待时间是否已经到期,并且基于等待时间已经到期从队列中移除等待事件。

    Heuristic based affinity dispatching for shared processor partition dispatching
    10.
    发明授权
    Heuristic based affinity dispatching for shared processor partition dispatching 有权
    用于共享处理器分区调度的基于启发式的亲和性调度

    公开(公告)号:US08108866B2

    公开(公告)日:2012-01-31

    申请号:US12130090

    申请日:2008-05-30

    摘要: A mechanism is provided for determining whether to use cache affinity as a criterion for software thread dispatching in a shared processor logical partitioning data processing system. The server firmware may store data about when and/or how often logical processors are dispatched. Given these data, the operating system may collect metrics. Using the logical processor metrics, the operating system may determine whether cache affinity is likely to provide a significant performance benefit relative to the cost of dispatching a particular logical processor to the operating system.

    摘要翻译: 提供了一种用于确定是否使用高速缓存亲和力作为在共享处理器逻辑分区数据处理系统中的软件线程调度的标准的机制。 服务器固件可以存储关于何时和/或多少逻辑处理器被调度的数据。 鉴于这些数据,操作系统可能会收集指标。 使用逻辑处理器度量,操作系统可以确定高速缓存关联性是否可能相对于将特定逻辑处理器调度到操作系统的成本提供显着的性能优点。