TW200905470A - Workload management in virtualized data processing environment - Google Patents

Abstract

A system, method and computer-readable medium for balancing access among multiple logical partitions to the physical system resources of a computer system employing system virtualization. Each of the logical partitions is classified, initially during a startup period, in accordance with a level of allocated dispatch window utilization. Performance metrics of one or more of the physical system resources are determined in association with one or more of the logical partitions. The performance metrics determination is performed at a hardware level independent of programming interrupts. During a dispatch window in which a given set of the physical system resources are configured for allocation to one of the logical partitions, the given set of physical system resources are re-allocated to a replacement logical partition in accordance with the determined performance metrics associated with the replacement logical partition and the dispatch window utilization classification of the replacement logical partition.

Description

200905470 IX. INSTRUCTIONS: TECHNICAL FIELD OF THE INVENTION The present invention generally relates to managing workloads in a data processing system. More particularly, the present invention relates to managing workloads in a segmentation system such as a logical segmentation system. This application is related to the following application in the same application: _______

Please refer to the US Patent Application No. _______ (Agency No. AUS920060139US2) for "Workload Management IN VIRTUALIZED DATA PROCESSING f ENVIRONMENT"; _______ US Patent Application No. _______ (Agent Case No. AUS920060139US3) in the WORKLOAD MANAGEMENT IN VIRTUALIZED DATA PROCESSING ENVIRONMENT; _______Application Named "Taking Hardware Statistics" US Pat. App. );. The application is hereby incorporated by reference in its entirety by reference in its entirety in its entirety in its entirety herein in its entirety in its entirety in [Prior Art] Logical partitioning of computer resources allows multiple system images to be created in a single physical machine or combination of processors. Virtualization is a term used to represent the system's imaging. In system imaging, each system image (also known as virtual machine 129569.doc 200905470 (VM)) uses the shared resources of the physical computer system to operate in a manner independent of other frequency logic. In this way, each logical segmentation of the corresponding sVM can be independently reset, the manned can be different for each-division, and different software programs can be operated using different input/output (1/〇) devices. For example, a commercial embodiment of a logical blade system includes IBM's p〇wer5 multiprocessor architecture. One of the important aspects of logical segmentation is managing individual split workloads. For example, in POWER5, a workload manager called a hypervisor manages the work between partitions. In this type of shared resource environment, the hypervisor uses interleaved slot scheduling. Techniques (in a broad sense, similar to general multitasking computing schedules) configure physical system resources such as memory, central processing unit (CPU), I/O, etc., to logical partitioning. The hypervisor attempts to balance the partitioned workload by scheduling the partitioning work as a logical processor to the physical system resources as needed and/or preconfigured: One aspect of the knifeing schedule is specifically about processor resource utilization. And sharing. That is, for scheduling purposes, the segmentation using processor capacity from a shared processor pool is defined as capped or undefined. The defined segmentation cannot exceed its configured processor. right. Unrestricted support for logical partitioning enables undefined partitioning to exceed its configured capacity in the presence of unused capacity in the shared processor pool. This unused capacity is derived from other partitions that do not fully utilize all of their sorrowful I or shared pools in other ways that are not fully configured. When scheduling, a logical partition contains the configured physical processor resources as a logical processor. Scheduling of logical processors (sometimes referred to as virtual processors) 129569.doc 200905470 requires configuration of processing loops, memory, and other physical system resources that are configured for pre-specified use by partitioning during a given dispatch window Time period or time slice. For example, an operating system operating on P0WER5 has a preset 10 msec dispatch window. Any unused portion of the configured dispatch window can be configured to one or more of the undefined partitions in the system. The lottery mechanism (7) plus 7 based on the priority level of the undefined split is typically used to determine which undefined split will replace the split of the original schedule with the unused portion of the schedule window. Although relatively simple and computationally insignificant, the aforementioned replacement tuning does not adequately address the potential efficiencies associated with the logical structure and functional characteristics of the segmentation. When the segmentation is replaced during the respective dispatch window of the so-called interactive segmentation, an important source of inefficiency in scheduling occurs. The segmentation is characterized as "interaction" based on the reliance of segmentation on external processing events and the likelihood of interruption during a given scheduling window, or in the alternative case, characterized as "batch." Batch d is largely derived from Response to external events: Use: The entire dispatch window. Conversely, the interactive split waits outside the dispatch window:: The component usually temporarily suspends the activity during the response. In order to benefit profitably, the fourth degree t does not cause the = split to temporarily suspend the work. The hyper-manager can try to use the pre-replacement of the pre-replacement, and it will still be the other task in the case of the division of the external event response. The current scheduling window of the split replacement is completed. 129569.doc -10- 200905470 If the temporary abort split is not replaced during the period of split inactivity, the scheduling window loop is wasted. On the other hand, although it is enabled in other cases, it is wasted. The advantageous use of the scheduling window loop, but the conventional segmentation replacement technique cannot solve the computational cost of the interactive processing of the interactive segmentation that replaces the replacement. This leads to the need to re-schedule the re-scheduled segmentation of the interactive segmentation of the replacement and the loopback to return the row. Unlike the dedicated system, the virtual system needs to re-establish the § memory occupancy for each schedule (mem〇ry. In addition to being re-arranged into the queue, the replaced interactive segmentation must consume an additional % to restore the XX memory occupancy, which is an important source of inefficiency in workload management in virtual systems. Logical partition management does not address the aforementioned and many other issues regarding split scheduling and runtime time workload balancing. Therefore, it can be seen that there are methods, systems, and computer program products for managing the scheduling of logical partitions and balancing the work and the competition. Needs. Other requirements of this issue. This solution is used to balance the multiple logical partitions. __ Use the system system's real m (4) access (four) system, method and 々 During the start-up period, 'depending on the configuration of the dispatch window, use each of the logical cuts in the logical cut. Determine the truth and the logic, the gentleman Λ 1 knife. The performance metric of one or more logically segmented physical system resources. In the segmentation: the process of interrupt-independent hardware debt measurement and tracking logic is determined in these physical system resources. One of the given sets of computer-readable media tiers disclosed herein for classifying the system system resources used to correlate one or more of the scheduling resources used to perform performance 129569.doc 200905470 Entity system resources are configured for configuration to During a scheduling window of one of the logical partitions, 'the performance metric of the determinations associated with a replacement logical partition and the scheduling window of the replacement logical partitioning use the classification to re-create the given group entity system resources Configuring to the alternate logical partition. In another aspect, a method, system, and computer program product for balancing workload between multiple logical partitions of a shared physical system resource utilizes memory occupancy statistics to determine split replacement Sex and priority. The method includes determining a performance metric of one or more physical system resources associated with the logical partitions in the physical system resources and determining the memory occupancy using the equivalent energy metric. One of the physical system resources, a given group of entity system resources, is configured to logically partition one of the logical partitions - a scheduling window μ', the physical system resources according to the determined memory occupancy values The given group of entity system resources are reconfigured to another logical partition in the logical partitions. In another aspect, a method, system, and computer program product for dynamically tuning a scheduler in a rare cognition is disclosed, wherein the schedule is to schedule a shared entity during a given dispatch window. The multi-sleeve of system resources. s logical division. The method includes scheduling the logical partitions using a preconfigured t' scheduling® period during the "system startup period". During the logical partition scheduling, the disk Α ^ _ /, the dedicated logical partition is associated with determining the effectiveness of the _ or the worm or the plurality of physical system resources in the physical system resources. In the equivalent energy level associated with the segmentation, U is used to determine the memory occupancy value of the logic branches, and the other values are used to modulate the denier value for a tuned %" "In the style of exploration, the memory value of the memory such as 1 hai is used to describe the dynamics during the period from the following detailed description. The above and additional 129569.doc 200905470 of the present invention are included in the rights. The advantages will become apparent. [Embodiment] The novel features of the present invention are set forth in the scope of the accompanying application. However, the present invention, as well as its preferred mode of use, ', field goals, and advantages, will be best understood from the following detailed description when read in conjunction with the accompanying drawings. The system and method of the present invention enable resource allocation and workload balancing in a virtual computing environment **^-*^. An exemplary virtual computing environment includes a plurality of logical partitions ‘where two or more of the partitions are: the cut-off manages the workload. As used herein, 'terminology' segmentation " generally refers to a subset of data processing hardware resources that are configured into one operating system. Segmentation may also be referred to as a thread or any other computing unit. The preferred embodiment of the system and method for carrying out the invention is described, wherein like reference numerals indicate the same and corresponding parts throughout. The present invention enables the sharing of resources across the entire logical segmentation under the guidance of the workload manager Dynamic redistribution. In one aspect, the present invention achieves improved workload management and system efficiency by using a dynamically adjustable partition scheduling mechanism. The segmentation scheduling mechanism is characterized by a hardware tracking mechanism, implemented in an implementation. In the example, the hardware tracking mechanism determines the segmentation performance metric established with respect to the memory occupancy as the segmentation level. In another aspect, the present invention dynamically adjusts each of the memory usage metrics by hardware tracking. Do not logically divide the schedule within the dispatch window. The invention enables the entire logical segmentation under the guidance of the workload manager With the dynamic redistribution of resources, in an embodiment, the work 129569.doc 200905470 load manager can be set up -1 - ^ ^' state. For example, the resources of the CPU resources, the logic to find the source includes Translated by Bayi source, 1/0 resource, coprocessor, channel resource: the original two in one embodiment, by integrating the hypervisor function and the body segmentation monitoring mechanism into a performance adjustment feedback back: configuration Dynamic adjustment to achieve workload balancing and more system efficiency. The present invention solves the limitation of system throughput caused by memory access latency. The present invention utilizes split scheduling Memory access statistics to mitigate memory latency effects. This memory-sensitive partitioning schedule improves the formulation of segmentation scheduling decisions and provides greater scheduling window scheduling flexibility. In an embodiment, the present invention Consider the memory footprint setting cost in the segmentation of the selection-segmentation to preempt or replace it in the original schedule. The present invention further contemplates subsequent occupancy setting costs for rescheduling the replaced partition to recover a portion of its original dispatch window. DETAILED DESCRIPTION OF THE INVENTION Referring now to the drawings, wherein the same reference numerals refer to the same and corresponding parts, one embodiment of a virtual computing environment implementing the workload management features of the present invention is illustrated in FIG. There is illustrated a virtual computing system that includes most of the features included in the p〇WER5 server provided by International Business Machines Corporation (Armonk, N.Y.). The virtual computing system 1A generally includes: a firmware layer resource 12A including a hypervisor Π5; and a hardware layer resource 122 including a common processor pool 117 and memory devices 121 and 125. The shared processor pool 117 preferably includes a multiprocessor assembly including a plurality of processors 108, 110, 112, and 114 (represented as cpw 129569.doc -14 - 200905470 cp w, respectively). And the cache memory associated with the processor is stolen from the factory 121. The virtual computing system 1 includes a plurality of logical partitions i〇5a_105D (respectively. The hypervisor 115 manages and adjusts the assignment of the hardware layer resource 丨22 between the logical partitions 1 05 A-1 05D. CTi /7-CTW and associated cache memory milk_skills are represented by the hypervisor 11 5 in a manner that results in resource virtualization to the logical partition of the 1 part of the factory's physical system resources - the physical system resources are usually Physical devices, components, and associated physical phenomena, such as memory devices, processing

'Drive H' bus, processor/bus cycle, etc., this is a non-physical, abstract system such as program hierarchy organization and program agreement (such as their hierarchical organization and program agreement with the operating system) The resources are different. Physical system resources can also be distinguished from logical or virtual definable entities such as virtual machines. Each of the logical partitions includes - or a plurality of logical processors (not explicitly shown), each of which represents an entire or a portion of one of the processors configured to the split entity. The logical processor of one of the partitions 105A-105D may be dedicated to the sub-section #j' such that the lower layer resolves: #源 Reserved for the split, or may be shared such that the underlying processor resources are available for other partitions.

In the illustrated embodiment, each of the logically segmented ones has a resident operating system! Q4 (which can vary between splits) and - a separate system that bites multiple applications. In the implementation, the operating system 104A HMD can be an operating system or an i5/〇sTM operating system provided by JEM C〇rp〇ratl〇n. In addition, the operating system UMA-HMD (or a subset thereof) includes separate (10) workload managers __ 129569.doc -15· 200905470 106D 'which is used to manage application work in each of the respective partitions Load ^ In one embodiment, hypervisor 115 operates as a hidden partition without authorized capacity. The system resource to logical partition configuration is managed by hypervisor 115, which can be implemented by microcode running on the processor. The hypervisor call provides a means for communication between any of the operating systems ι〇4α·ι〇4〇 and the hypervisor 115, which supports segmentation by supporting techniques that are explained in further detail below. Scheduled heuristics with minimal idle time to enable more efficient use of physical processor capacity. The logical partitioning and s manager 115 typically includes one or more tangible program modules residing in separate portions of the central memory associated with the processor (10) / (10). FIG. 2 is a high-level diagram showing an example of an erroneous architecture 2 用以 for facilitating partitioning according to an embodiment of the present invention. The split scheduling architecture integrates the HPL 7L (PMU) 204 with other system components such as the shared processor pool 117, hypervisor 115, and cache memory 2〇6. Although the PMU 204 is not depicted as an obvious module in FIG. 2, it should be noted that some or all of the components of the pMu 2〇4^hardware, (4), and software components may be integrated into the SuperStolen. In addition, it should be noted that the cache memory 鸠 indicates some of the collective cache memory resources (10) used by the CPUs included in the CPUs 10, ug, 112, and 114 in the shared processor pool 117 or All memory resources. PMU 2G4 includes logic, program modules, and other hardware, and other functions that monitor physical system resource performance metrics (eg, their performance related to memory usage 129569.doc -16 - 200905470 metrics) for resources configured to split IN IN. Body and / or software modules. This equivalent energy metric preferably includes a cache (four) and, in particular, a measure of the cache memory usage of each of the partitions. The high-level diagram of Figure 2 illustrates the integration and interaction interface between the PMU 204 and other system components that enable such monitoring of the physical system resources associated with the logical partition. When the currently scheduled logical split uses the CPU from the shared processor pool ΐ7 to execute its instruction stream and access the contents of the memory location via a person or store operation, the CPU issues such requests via the CPU_cache interface 212. To its associated cache memory 2G6. Next, the task in the cache memory is whether the content of the memory exists in the storage area of the cache memory, and (4) if so, the cached data is transmitted back to the CPU, or (7) right, then The autonomous memory (such as the shared memory 125) extracts the memory content before it is loaded or stored. If the requested memory content is already in the cache memory 206, the data is passed back to (4) without accessing the shared memory 125 (such as 'via the cache. Memory interface 21()). At this time, there is no need to interact with the PMU 204. However, the information requested is not available in the cache memory 206, and the data must be extracted via the cache-memory interface plus the autonomous shared memory 125. 8 Referring to FIG. 3, a schematic diagram illustrating the internal architecture of the segmentation monitoring unit 204, the hypervisor 115, and the segmentation history table 305, which may be implemented within the architecture illustrated in FIG. 2, illustrates the same order. The wheel entry side includes pMu 2〇4', which is illustrated as including a tracking logic module 302, ·^, 6 /

The remote tracking logic module 322 processes the input from the CPU interface 208 and the cache interface 2 μ " from 214 to generate the split vectors 3〇8, 3 10 and 129569.doc 200905470 312. On its output side, the architecture includes a hypervisor 115 and split history = 〇 5 / In the illustrated embodiment, the hypervisor (1) includes a -priority 5 ten-calculation module 304 that processes the public treasure The technique processes the cutter vectors 3〇8, 31〇, and 312 to generate and update the inside of the split history table 305. Eight offices, wide knife.丨〗 History table 3 0 5 contains for virtual meter

Calculate all items in the system 1〇0 that are logically partitioned. In the illustrated embodiment, the knife cut history table 305 is illustrated as including a column-based record 'each one corresponding to one of the lake logical partitions in the system, where each-divided record has more (five) to behave The main (c〇lumn wise) data field. The logical sub-identifier field and the number of cycles per instruction (1) called the value, the cache line count (CLC) value, and the cache miss count (CMC) in the behavior of the main blocker. The value of the position, and the value will be explained in further detail below. In addition to the CPI, cLc, and CMC values for hardware detection, the main fields of behavior for each partition table item include the memory occupancy period value TFP, the occupancy value change VAR, and the cache affinity; The CA value interception, which can be derived from one or more of the aforementioned CPI, CLC, and CMC values. The 'tracking logic module 3〇2 in the PMU 204 includes performance metrics for detecting 'processing and temporarily storing physical system resources (such as the processing and suffix resources depicted in Figures 1 and 2). Logic and data storage hardware devices. The performance metric is detected in association with the logical segmentation to which the physical system resources such as memory and CPU are configured during the measurement. The detected and processed performance metrics are stored in association with the logically separated identification code to which the physical resource is currently configured. The association between a given set of performance metrics and a logical partition may be provided by a CPU interface temporary storage 129569.doc -18. 200905470 314 containing one or more currently scheduled partitioned identification codes. Preferably, the scale value in the register 3i4 is set in the scheduling decision. The exemplary performance metrics collected by the tracking logic module 302 can include (10) counting, cache column counts, cache misses, and signals that can be detected directly on the interface 2〇8 and/or the cache interface 214. Other metrics that are determined to be related to memory access or processing efficiency are determined or calculated. The processor can be utilized by the processor to provide a loop count to measure activity during the time slice scheduled to be split on the physical processor. In the illustrated embodiment, the CPU count for each of the current splits (4) detected by the tracking logic 302 is stored in the scheduled split vector 3〇8. Similarly, the cache line count and the cache miss count for the scheduled logical split heart detected by the trace logic 302 are stored in the scheduled split vectors 31A and 312, respectively. In a preferred embodiment, the detection logic and data storage device in the tracking logic module 〇2 includes collection and processing on the CPU interface 2〇8 and cache independently of the program interrupt mechanism (eg, operating system interrupt). Hardware and dynamic devices for signals on interface 214. Such tracking and storage devices may include hardware such as logic gates, scratchpads, etc., and firmware encodings such as firmware encoded by the system bus snooping program (sn〇〇p〇r). The tracking logic module 3〇2 performs its detection, processing and storage functions at the hardware and/or firmware level regardless of the software program interruption. Therefore, such detection, processing, and storage functions are performed independently of the operating system core management constraints. In this manner, the sampling rate of the tracking logic module 322 collecting performance metrics may have the required information for determining the criteria to be used for segmentation scheduling and replacement (as explained in further detail below) 129569.doc -19- 200905470 Fine enough granularity, such as 〇 1 msec. The system performance metrics within the scheduled segmentation vectors 308, 310, and 3 12 include CPI counts, cache column counts, and caches for each of a predetermined number ((iv)) of current or previously scheduled logical scores = Not counting. The relationship between the segmentation vector values of each record and a corresponding logical segmentation is visually represented in Figure 3 by the =, where each of the subscripts represents a specified logical segmentation. The storage device storing the segmentation vectors "^, 310, and 312 in the trace logic 〇2 is preferably a dedicated scratchpad. The segmentation vector detected by the trace logic 302 and collected in the schedule is 3〇8,

The performance metrics in and 312 are processed by hypervisor 115 to update the segmentation history table 〇5. The interrupt signal generated or received by the hypervisor 115 determines when the system data update partition table 305 collected in the scheduled split vectors 3G8, 31G, and 312 should be used. The interruption indication or, in other cases, coincides with the expiration of the dispatch window of at least one of the sub-segments of the dispatch (4). Upon receiving the interrupt, the priority value calculation module 3〇4 retrieves and processes the segmentation vectors 3〇8, 31〇, and 312 to fill or update the items in the segmentation history table 〇5. In the illustrated embodiment, in response to the update towel, (4) in the records for the (four) logical segmentation, the behavioral master metric items are compared or otherwise processed in the vector 308, 31, and 312 of the schedule. Cpi, coffee, and (10) metrics. Assume that FIG. 3 shows that the first scheduling logic is assigned to one of the initial system startup periods of the 'knife d α-w, then the priority value calculation module 3 〇 4 uses eight halls, 丨. > U4 uses a knife to cut α- Each of the record items fills the split history table 305 and will be white & From the vector 308, 3 10 and 3 12, the cut vector data is input to the corresponding record item. During the system initialization period, the δ record generation process continues, and the increments of $%, 广// to all iV logical divisions have been recorded in the split history table 305 129569.doc -20- 200905470. After the initial scheduling of each logical segmentation and subsequent segmentation records are generated, the priority value calculation module 304 continues to process the scheduled vectors 308, 310, and 312 for each addition, replacement, or other condition at each signal update interval. The performance metrics and/or replacement priority value entries in the segmentation history table 305 are modified (as explained in further detail below). 4 is a high level block diagram representation of a sequence of scheduling prioritization for determining logical partitioning in accordance with the present invention. In particular, Figure 4 depicts an exemplary temporary and event-based prioritization factor, such as may be used by hypervisor 丨5 to make scheduling decisions (e.g., to replace or preempt a current scheduled segmentation). In order to integrate the prioritization as a dynamically adjustable factor throughout the split scheduling schedule, the hypervisor 1 15 determines the relative or absolute priority for each logical partition as a function of the metric associated with the cache memory footprint, and Therefore, the performance metric of hardware detection must be taken from the PMU 204. As explained above, the physical system performance metrics directly determined from the memory and CPU bus interface interface are detected and initially initialized and processed by using the hardware hierarchy logic and the scratchpad in the tracking logic module 3〇2. . The cache memory occupancy metric detected or generated by the tracking logic module 302 preferably includes a CPI count, a cache column count, and a cache miss count for each-scheduled partition, and is collected as a split vector 3〇. 8, 31 〇 and 312, the split directions 13 08, 31 G and 312 can be combined with other schedule priority factors to arrive at an overall scheduling priority. . Figure 5 to Figure 9 illustrates how the split-monitoring functionality is integrated into the logical knife schedule in conjunction with Figure 4 (especially when the schedule is replaced or preemptively after the configuration of the minimum split permission 129569.doc 200905470) An exemplary embodiment of a 'knife. J or a scheduled split. First of all, in the figure of Figure 4, the 排序+〃〃刀 priority sequence shows multiple priorities for the physical system performance metrics used to set and adjust the segmentation of the ISI & The factors of the poor and the poor 丨 丨 系 are combined and utilized. Figure 6 shows in further detail the computer-implemented program, the system performance measure of hardware detection by means of the process of implementing the thunder and squatting (and in detail, #叶口&马莜Finding the effect of memory access efficiency π degrees is judged and tangibly utilized to characterize one or more of each segmentation as a cut schedule prioritization factor. Figures 7 through 9 illustrate the implementation of a computer for use of the memory associated with the segmentation, the use of the latitude to determine the priority, and the tuning of the dispatch window. The prioritization features and/or scheduler tuning as illustrated in Figures 5 and 6 can be used with a hypervisor scheduler (e.g., a scheduler incorporated in hypervisor U5). However, it should be noted that the inventive features and techniques described herein are not necessarily limited to any one or more of the embodiments of (4). Those skilled in the art will readily appreciate and appreciate that various aspects of the determination and prioritization of the material can be varied without departing from the spirit and scope of the present invention, and in addition, the mechanisms and procedures described herein can be Basic aspects are used with other scheduling algorithms. Continuing with Figure 4', a segmentation 具有 having a base priority leaf ^) 4〇2, which may initially be null or otherwise neutral, has no effect on the split schedule/replacement decision. The base priority value leaf (1^ can be ^ by the hypervisor 11 5 to force the division of the preemption and / or substitute value of the number or other quantitative value or the standard. & cut the overall priority value of 425 Preferably, the dynamic fairness component of the base priority bp(Pi) 402 is dynamically adjusted. As shown in FIG. 4, by giving priority to the basis of the segmentation ^(ρ〇 is raised by some time 129569.doc -22- 200905470 1 related to the inner d (which is cumulatively represented as a priority summation example) to calculate the current priority ep(P,,t) 406 at time t with each amount of time. Current priority cp (Pi , t) 4_ This includes the base priority plus one of the priority summations 404 (depending on the current time interval) to increment the fair component. For the non-performance metric based segmentation scheduling, the priority of the logical segmentation is equal to Current priority Cp (Pi, 〇 406. The present invention provides a split scheduling mechanism that provides and has a physical system performance metric associated with the segmentation to determine the partition P, which has a scheduling priority of 425. This dark No. For processing resources using a shared group entity (processor, 5 memory, etc.) Multiple logical partitions performed in a virtual system can produce different values for the calculation of the priority of different partitions at the same time. In detail, the performance of the split-priority-independent priority is scared at every-schedule interval (7) , 〇 406 adjusts 420 - the performance-based factor off 418. The performance-based factor 418 represents one of a series of possible specific values, and the system performance metric associated with a segmentation can be used to cause the segmentation in question The priority level increases or decreases the specific value. In one embodiment, the cache memory occupancy value CFp(Pi) is processed by using a reliability factor calculation module ς416 to calculate the nose factor Δρ 418. Or a plurality of logic functions represented by the cache memory occupancy calculation module 412, and calculating CFp(Pi) itself as a segmentation buffer value calculated by the mechanism of the present invention. One or more entity resource metrics PRM(Pi) associated with the segmentation are processed by the cache memory occupancy calculation module @412 to determine a specified memory occupancy value that can be used to determine the split schedule priority. (eg CFP (Pi)). Occupancy calculation module Θ 41 2 and reliability factor calculation module; 129569.doc -23 · 200905470 41 6 Determine the factor based on performance 4] 8. As shown in Figure 4, Time t = the overall priority value of the split Pi is therefore a combined function of the base split priority 'temporary fair correction and the physical system metric associated with the split. Figure 5 is a super-management according to the present invention. A higher order side of the split scheduler state implemented for replacement-scheduled but temporarily suspended splitter: a representation. A replacement split vector or replacement queue 505 is generated and super-managed according to the methods disclosed herein. The device 115 is dynamically adjusted. The access replacement queue 505 determines absolute or relative replacement prioritization, for example, when a currently operating partition temporarily suspends processing during the current scheduling window before the scheduling window time quantum period expires. The replacement queue 505 is organized as a prioritized replacement target LPa-LPA array in which the #一 target contains or in its case is linked to the corresponding segmentation control block PCB 5〇2a_5〇2n, each The split control block maintains split status information, such as split configuration and adjusted scheduling status and replacement priority status in other partition specific data. As shown in FIG. 5, the replacement target LPa-LPn may be prioritized from "maximum," (ie, the highest priority among the available alternative partitions) to "minimum, that is, the lowest priority among the alternate partitions available". order. It may be advantageous to use the component of the replacement queue 505 to determine the scheduling priority, as will now be explained with reference to the stone. Referring to Figure 6, there is illustrated a high level flow diagram of the steps performed by segmentation monitoring unit 2〇4 and hypervisor H5 for determining a split schedule priority value in accordance with the present invention. As shown at steps 602 and 604, the program begins by initializing and identifying the logical segmentation, for example by generating a corresponding segmentation for each segmentation. 129569.doc • 24 - 200905470 Control block (such as 箄^;园...Fig. 5 The split control block shown in the figure). Setting the base of the one of the jaws J t «the tube is slow and unordered, and as described at steps 606 and 608, it is preferably set in the manner shown in FIG. 4 and Increment the 笤 笤 丨 丨 丨 她 她 她 她 她 她 Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ Τ To dynamically adjust the segmentation in a normalized manner, as in step 610, the Lujia, the processor, the real money, according to the scheduling configuration of the super-controller, the '&,' and 4 scheduling logic segmentation. During the splitting of the dispatch window, tracking and devices based on the hardware-based tracking device and modules (for example, tracking devices and modules in the tracking logic module 3〇2) are used to track and adjust

The effectiveness of one or more of the poor systems in the physical system associated with the logical division of the resources to the I during the suffocation. Xia ^ 615). Performing performance metric tracing at the hardware level of the programming interrupt (e.g., operating system outages) and performance metric tracing preferably include tracking CPI and other entity processing metrics. As shown in FIG. 6, the tracking entity resource metric includes the following sub-steps in the bucket, the scheduled partition-associated tracking metric, and wherein the metric is calculated using the hardware debt measure or determined by the hyper-manager 115 A prioritized value used to split replacement or other scheduling decisions. As depicted at step 612, the hardware hierarchy, the section, and the buffer state are used to record an entity resource metric associated with the recording time increment Δΐ ε (the recording rate is 隹β μ 疋 hand collection and storage and partitioning) The time increment ^ small ', in addition to the increment factor greater than 1, divided by the scheduling period defined by the scheduling period τ 八 8 * 4 1 DP is the number. After the collection of hardware intrusion of physical resource metrics and / or The result of the hardware detection of the body detection S. 129569.doc -25- 200905470, the priority value associated with the segmentation is calculated (step 6丨4). The priority value is calculated by the hardware detection/storage entity system metric or may be the detection/storage metric itself. For example, and referring to the embodiment shown in ',, and the figure, at step ό 12 The collected physical resource metric includes the CPI value collected in the scheduled segmentation vector 〇8, and the priority value calculated at step 614 is included in the following description with reference to FIG. 8α and FIG. The memory occupied by the cpi value in the program takes up the value. While determining the performance metric at step 615, preferably, each of the partitioning-scheduling windows calculates and updates a reliability factor such as a VAR value that is not plotted in the segmentation history table 305, as shown at step 616. Referring to Figure 8A, a more detailed depiction of the processing steps incorporated in step 615 is provided. In particular, Figure 8A illustrates the use of, for example, PMU 2〇4 and hypervisor 11 5 for use in determining scheduling decisions. A high-level flow chart of the steps of the memory occupancy performance value. The process begins with the segmentation scheduling step 61 and proceeds to step 8〇6, which depicts a time interval within the scheduling period of the scheduled segmentation. Point tn determines and records the cpi data. Compares the CPI value collected by jtn with the previous record used for the same segmentation (:1>1 value. First, the recorded CPI value indicates that the same segmentation is used during the scheduling period. - an earlier time point. In the scheduling period, an exemplary graphical representation of the CPI data is shown in Figure 88. The starting and ending times of the scheduling period are indicated in Figure 8B as TDP table tG and tDP over the entire scheduling period. The time points at which the CPI f is judged and recorded in the same partition - or a plurality of such schedules are represented as trec., trecl, t-2, trec3, etc. Returning to Figure 8 Step 808 'The ratio between the values 129569.doc •26·200905470 # : u ^ (for example) the cpi value recorded at time tree2 is compared with the cpi recorded in trecl. i ± ~ in the preferred embodiment, in one The CPI data determination at different time increments is performed over the entire 5 scheduling periods of a given logical partition. The substantial cost in the schedule for re-establishing the memory occupancy requirements on each-segmentation schedule. The purpose of the ratio performed at the step is to determine the period required for the segmentation to establish the memory footprint. The memory footprint establishment decision includes determining a corner point (such as depicted at trec3 in FIG. 8B) at which the CPI value is less than a specified displacement from the previous time increment of the previous scheduling period. Threshold. In Fig. 8B, 'time trec3 indicates a corner point at which the CPI value recorded at tree3 is different from the value recorded at La, which is smaller than the margin difference Δ(:ΡΙΤΗ)^ΗΙ^. The quantity period Tfp is therefore the period between ·. The determination of whether the difference between the CPI values is less than a specific threshold is shown in step 8 1 0. In response to not exceeding the threshold CPI difference, at step 8〇6 The recorded 〇1>1 value (i.e., the 'last CPI value') is recorded (step 812), and the recording interval of the next scheduling period is increased before returning to the next division under the same division at step 61 (step 814). When a given comparison (eg, between the cpi value collected at tre<;3 and the CPI value previously collected at trec2) results in compliance with the threshold criteria, the identification with the segmentation such as in the segmentation history table 305 The code associated record partitioned occupancy establishment period (step 8 16). Referring to Figure 6, and continuing as shown at step 618, the hypermanipulation η and / or PMU 204 can determine each of the logical partitions The scheduling period is utilized. The decision at step 61 8 is used to The segmentation is classified as batch splitting using all of its configured scheduling period configurations on 129569.doc -27- 200905470 or interacting with processing interrupts. In processing interrupts, during a scheduling period, the trick must wait An external event. The scheduled segmentation classified as batch segmentation will utilize substantially the entire scheduling period, while the interactive segmentation is subject to processing interruptions, such as when the process is temporarily aborted and must wait for a response from another program. The scheduling period utilizes a value exceeding the m limit (in one embodiment, the threshold is 95% utilized), and the segmentation is classified into batch segmentation (steps 618 and 622). No, as in the step and The segmentation is classified as an interaction as depicted in the ❹. The scheduling period uses the classification as a field included in the split control block previously described in FIG. 5, and can be used as a row by the hypervisor u5. The procedure priority criterion. For example, the hypervisor u5 may exclude the qualified replacement segmentation in the segmentation self-replacement row 5G5 (see Figure 5) identified as an interaction. As explained in Figure 7, the scheduling period utilization classification can be used by the hypervisor to determine whether to reconfigure the remainder of a scheduling window to the original partition that has been preempted or replaced. As shown at steps 624 and 626, the decision to split the scheduling priority is determined. The end of the value program 'inputs or updates such as their priority values stored in the split history table 〇5 and the PCB 502a-502n. As shown and explained above with reference to Figures 3 through 5, The performance metric of hardware (4) is associated with logical partitioning (such as in partitioning history table 〇5) and is used by hypervisor (1) to determine prioritizations such as prioritization determined by replacement queues 5〇5. In a preferred embodiment, the scheduling period can be performed during the system startup period using the classification and performance metrics to determine 'in the time (eg, five minutes) or 129569.doc -28-200905470 through the split scheduling A number of rotations to measure the system startup period. After collecting at least the primary pure prioritization data, the hypervisor uses the data for the replacement of the scheduled segmentation and other scheduling decisions and may preempt. Figure 7 is a flow diagram illustrating the steps performed by a scheduler, such as a scheduler in hypervisor 115, to balance the workload between logical partitions in accordance with the present invention. As shown at (4) 7〇2 and 71(), the program starts with the hypervisor Π5 to schedule the next set of one or more splits according to the system configuration split schedule. During the current scheduling cycle, the real system and system resource metrics including the scheduled split CPI and CLC are recorded and updated (step 712), and the replacement of the replacement prioritized values, such as those calculated at step 614 of FIG. 6, are updated. The value is prioritized (step 713). As depicted at step 714, the hypervisor 115 can determine whether the segmentation of a given schedule can be preempted based on the segmentation replacement priority ranking data. As used herein, "split preemption is similar to many of the mechanisms employed in the scheduled split that have been abandoned during the replacement-scheduling window and includes such mechanisms. The difference is that the split preemption may not require a replacement split that has temporarily aborted processing as a condition to trigger the replacement step described herein. As shown at steps 714 and 720, in response to the pre-specified preemption criteria that determine that a given scheduled partition has been met (in view of the prioritized values such as their prioritized values included in the partition history table 305) The hypervisor 11 5 temporarily suspends the scheduled partitioning and configures the system resources to a selected partition of the remainder of the scheduling window (which may be the whole). The replacement segmentation is selected according to the replacement priority 129569.doc -29-200905470 weighting material in the same or similar manner as the scheduling prioritization step described below with reference to step 718 and FIG. The hypervisor 115 uses the prioritized data in the replacement column (10) and the segmentation control block 5〇2a_5() 2n to determine whether the next segment to be scheduled or otherwise scheduled for the current segment will be replaced by the selected segmentation preemption. If the self-selection does not meet the preemption criteria (step 714) and the partitioning of the original schedule utilizes its entire scheduling configuration period (also # 'division does not temporarily abort processing) (step 716), then the hypervisor dispatch/load balance The program continues with the next step at step 71. The right is scheduled and does not preempt the "temporarily suspend processing during the tuning window period (step 716)." Then the hypervisor U5 processes the replacement partitioning provided by the alternative partitioning or the partitioning (four) block 502a_5〇2n. The data is judged to have met the pre-specified segmentation replacement criteria (steps 7 and 8). The replacement decision depicted at step 718 preferably includes evaluating the replacement priority value of the current idle logical partition to determine which of the partitions is suitable for replacing the currently suspended split. The replacement eligibility is determined by the imposed restrictions (such as the remaining portion of the restricted scheduling window) to evaluate one or more of the segmentation replacement priority values included in the segmentation control blocks 502a-502nf (eg, body occupancy values). . For example, the split of the original schedule has a split window period tdw. For IBM's P0WER5 architecture, it is 1 “ “.. Scheduling® period TDW is effectively divided by the scheduling increment τ, The configured minimum operating time increment and thus the super-manipulator U 5 ° replacement or preemption of the minimum increment of the scheduled segmentation. In this case the replacement criteria decision at step 718 includes determining that the decision is available Which of the subdivisions is qualified (in view of the restrictions imposed by the temporarily discontinued Tdpstch and the remainder of Ding _ 129569.doc • 30· 200905470). This = a path to ensure that the scheduling efficiency level is specified, Step 2 is determined by the knife cut Xiao Wangyi in determining whether or not the steps are selected and executed in a manner to ensure the specified processing efficiency level. As shown at steps 902 and 904, the program gate: ^ the executed event 'for example meets the preemptive criteria Or the dispatched component;:: replaces to facilitate the replacement criterion decision. The replacement criteria shown at the step are judged! = the weight T and 9°8' are used to use the available memory to occupy the stagnation value and Scheduling The remaining available portions are used to select a replacement segment. The step description is as to whether the occupancy period ip for an available replacement segment can be recorded in the segmentation control block and/or the segmentation history table 305 is less than the remaining of the scheduling window. The determination of the partial T-ing. Furthermore, in the case where the step crane does not use a tunable factor χ, the tunable factor X can be set to a value greater than 1 to determine whether a Tfp value for a segmentation forms an available schedule. A sufficiently small portion 8 of the period T_inin, such that a specified level of processing efficiency can be achieved. For example, in an embodiment, at step 718, the hypervisor 1丨5 according to the replacement logic segmentation has a satisfaction relationship xTfp s The memory occupancy value g Tfp of the decision Trem 仏 - (where X is greater than 1 and preferably at least 10) to make an alternative decision. As shown at steps 906 and 908, if the replacement priority value evaluation criteria are not met 'Exclude the segmentation as a possible replacement. Step 906 is performed on one or more of the segments until the replacement criteria are met, and as in step 91, the location 129569.doc -31 - 200905470 The program ends. Returning to Figure 7, in response to selecting a replacement segmentation, the hypervisor 1丨5 deconfigures the scheduling window resources from the replaced segmentation and configures the resources to the selected replacement segmentation (step 720). 5 and FIG. 6 , if the alternative segmentation has been classified as non-interactive (ie, batch), the replacement segmentation consumes the remaining scheduling window period, and the program returns to the next scheduling cycle (step 722 and 71〇). However, if the alternative segmentation is an interactive segmentation (step 722), then a replacement segmentation of a subset of the remaining schedule window periods is scheduled (step 723).

After completion of the replacement scheduling period, the scheduling window resource is reconfigured to the original replacement partition (step 724), and the program continues (step 726) or ends (step 728). Figure 1 illustrates a split schedule within a dispatch window in accordance with the present invention. The scheduling window shown in FIG. 1A is partially defined as having a configured scheduling window period tdw that begins at tstart and ends at tfinish 'and is characterized by a counter within the hypervisor 115 (not explicitly defined in the schema) The implementation is characterized in that the counter feature provides the hypervisor 115 with a sub-task activity at a specified scheduling window interval: a timed interrupt. In the illustrated embodiment, the segmentation indicated as being private is scheduled by hypervisor 115 at interleaved time intervals within the scheduling window (which respectively begin at times tstart, t1, and t2). According to the logical division of scheduling habits, the cut-off households each have a super-manager 115 that will be used for scheduling pre-planting energy and hole period rights to ensure that the split receives its respective minimum rights. In the embodiment, the right to take the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity During the remainder of the profit period ', , and 3_ finish, in the remaining period, the households and corpses 129569.doc -32- 200905470 3 were dispatched by the super-president 115 according to fairness. & π ρ And the scheduling priority factor is furthermore, and as explained above, for the segmentation 6 in its authorization, ... the suspension process, as explained in the scheduling period of the needle. Figure 11 is a diagram illustrating the invention according to the present invention. Between eight eight $1 W 1 as in the scheduling window shown in Figure 10, the high-order flow of the knife-cut schedule is tuned, ##广白L程图. If the f is drawn at step 1102, the next schedule is also issued. The hard signal of the window (also P' is not related to the cutting activity) _ is in, is not as in step 1104, The segmentation is scheduled to provide a period of profitability such as splitting p/, 4a^^^2, and h. Referring to Figure (7), the first date is a specified number of cycles for scheduling anywhere. The partitioned household /. If it belongs to the scheduled branch, the logical processor that does not cut the knife does not temporarily suspend the processing (step 1106) 'such as 'for self-scheduling split & - Step right configuration (steps 11〇8), then schedule the next schedule partition: for example, 'divided household 1104'. If the minimum right is configured (step is)

After the entire dispatch window period is consumed (step ni〇), the program returns to step 1102 for the next scheduled window period. In addition to scheduling to pay for splitting rights, Super Manager! Preferably, the prioritization factors (e.g., memory footprint values) derived from the performance metrics associated with the segmentation in other scheduling heuristics are used to dynamically schedule the segments. The super-management H115 prioritizes the performance metrics for scheduling: the situation is shown in Figure U, which is the logical processor condition of the temporary abort under the point tsus of the split ^ temporary abort processing in Figure 1G (4) (Step 1106). The other case illustrated in Figure n is the right post-scheduling (steps 1108 and 1110) starting at t3 in the dispatch window starting with the extra loop. 129569.doc -33- 200905470 Responding to the processing of a split temporary suspension (step 1 i 06) or the availability of an additional loop in the dispatch window 'super manager i 15 starts the scheduling at step 720' which includes the following substeps . The scheduling eligibility for the cuts is determined by comparing the time at which the memory occupancy of each of the partitions is established with the time remaining in the schedule window (step 1112). The qualifying segments for each step 1112 are then prioritized by establishing costs based on their respective occupancy levels, as illustrated at step 1114. For example, the stored statistics indicate the amount of time required for each segment to establish a memory footprint. As explained above with reference to Figure 9, the settling period in memory occupancy can be used to determine the relative efficiency of scheduling a particular segmentation, wherein a restricted scheduling window period is retained. The prioritization performed at step (1) 4 may thus include the steps illustrated in Figures 4 and 9. The segmentation selected according to the prioritization at step ln4 is not scheduled as in step (1)6. It is easy to use the target or target-oriented software development environment that provides portable source code for each computer or workstation hardware platform.

The law is implemented in software. The method and system of the present invention can be implemented as a routine on a personal computer (for example, (10) or (10) refers to, = is a resource on a resident W or a graphics workstation' implemented as a dedicated source code editor. In the management system of the crane or the like. Although ... has been referred to a better, you are a surname, a R _ 孰 此 姑 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 疋 描述 描述 描述 描述 描述 描述 描述 描述, the recognition of the master, σ without departing from the spirit and scope of the present invention, the implementation of the present invention, the form f, and the implementation of the various modifications are all within the scope of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 illustrates a virtual computing system for implementing workload balancing and scheduling windows 129569.doc • 34·200905470 tuning in accordance with the present invention; FIG. 2 is a diagram illustrating an embodiment of the present invention for facilitating A high-level schematic diagram of an exemplary architecture of a partitioning schedule; to illustrate the high-level sounding of the internal architecture, hypervisor, and partition history table of the partitioning monitoring early π, as may be implemented in the architecture illustrated in FIG. Figure; ~ Figure 4 is based on this issue A high-order block diagram representation of a sequence of alternative prioritizations used to determine logical partitioning; FIG. 5 is a representation of a high-order square diagram of a scheduling benefit state; ^ t The steps performed by the knife-cutting monitoring unit are used to determine the step of replacing the priority and the step-by-step flowchart of 35. FIG. 7 is a diagram illustrating the division between the divisions according to the present invention: The high-level flow chart of the steps of the step-by-step flow chart; the process of determining the segmentation monitoring unit for scheduling the replacement decision according to the execution of the present invention, the memory occupancy performance measure of the bundle Figure 8B is a graphical representation of the data of the number of exhibitions received in accordance with the present invention; e e & scheduling ® 循 ; ; ; ; ; ; ; ; ; ; ; ; I I I I I I I I I I I I I I I I I I I I I I Figure 10 is a flowchart of the selection process; — 129569.doc -35- 200905470 Dispatch High-level flow chart for dynamically tuning the steps of dividing the scheduler. [Main component symbol description] 100 virtual computing system 102A application 102B application 102C application 102D application 104 A operating system 104B operating system 104C operating system 104D Operating System 105A Logical Segmentation 105B Logical Segmentation 105C Logical Segmentation 105D Logical Segmentation 106A OS Workload Manager 106B OS Workload Manager 106C OS Workload Manager 106D OS Workload Manager 108 Processor CPU 110 Processor CPU 112 Processor CPU 114 Processor CPU 115 Hypervisor 129569.doc -36- 200905470 117 120 121 122 125 200 204 ^ 206 208 210 212 214 302 304 305 i- 308 310 312 314 322 402 404 406 Shared processor pool firmware layer resource memory Body device hardware layer memory device / shared memory partition scheduling architecture partition management unit / partition monitoring unit (PMU) cache memory CPU interface cache - memory interface CPU - cache interface cache interface 5 slave logic Module priority value calculation module segmentation history table segmentation Split vector partition vector CPU interface register processor utilize resource register base priority bp(Pi) priority sum dStj current priority cp(Pi,t) 129569.doc -37- 200905470 412 occupancy calculation module 416 416 Reliability Factor Calculation Module 418 418 Performance-Based Factor Δρ 420 Adjustment 425 Overall Priority Value/Scheduled Priority 502a Split Control Block 502b Split Control Block 502n Split Control Block 505 Replace 伫 CA CA Cache Correlation CLC cache column count CMC cache miss count CPI number of instruction cycles CPU1, CPU2, CPU3, CPU4 processor LP1 'LP2........LPa, ·...lpn logical split Ml , M2, M3, M4 cache memory Pi split P2 split P3 split PCB split control block t〇 schedule start time point ti time point h time point h time point 129569.doc •38- 200905470

tDP scheduling period end point Tdp split scheduling period Tdw scheduling window period tfinish time point Tfp memory occupancy value Tfp memory occupancy period value trec0 time point tree 1 time point trec2 time point trec3 time point tstart time point tsus time point VAR occupancy value change ACPIthrshld margin △tree recording time increment 39-129569.doc

Claims (1)

200905470, the scope of application for patents: 1. - The method of accessing the resources of each physical system between logical partitions in a computer system using system virtualization segmentation: = in the virtualized segmentation Each logical point: uses several shared entity resources of the computer system to operate in a manner independent of other partitioning logics. 'The method includes: ', the body detection logic collects the resources in the physical system resources, and so on. j, one or more logical divisions associated with z, several performance metrics of system resources; < 夕 solid entity Bai Xizhi's scheduling window utilizes each logical division of the hierarchy; and the knives (four) special logic segmentation One of the physical system resources provides the scheduling window for configuring the source into the logical partitions to be pre-constrained according to the =:: far replacement logical partition associated with the -replacement logical partition; 2:: The entity system resource is configured to the replacement logical partition. 2. The method of μ, wherein the method further comprises: storing the equivalent energy associated with the logical points associated with the respective ones Quantity; each logically split packet entity system resource configuration in the id-to-replacement logic step includes segmentation by 曰 and ^ according to the storage of the storage. ^度^Select the replacement logic 3. If you want to die 1 The method, the method further comprising: scheduling the logical partitions during a scheduling window - logical points 129569.doc 200905470 a logical processor, wherein the schedule includes a configuration - a pre-specified period during which the physical system The resource is configured for use by the one of the logical partitions; and the logical processor responsive to the schedule temporarily suspends processing during the pre-specified period, selecting another of the logical partitions to The physical system resources are reconfigured to the logical partition within the remainder of the pre-specified period, the selection being based on the collected rows associated with the other logical partition in the logical partitions. The method of claim 1, wherein the physical system resources include - or a processing loop of a plurality of physical processors and a plurality of memory resources.夕 5.::: The method of 'there should be a given set of entity system resource allocation-replacement logical segmentation further including excluding the eligibility from the replacement logic to classify the use as less than a number of knives. 1 Φ j ,, ''Summer's Week - all logical divisions in the logical division of the heart. 8. A system for accessing physical system resources between logical partitions in a computer system using system virtualization partitioning, used to balance multi-systems in the 129569.doc 200905470 system virtualization segmentation Each of the plurality of logical partitions uses a plurality of shared entity resources of the computer system to operate in a manner independent of other partitioning logic, the system comprising: for collecting the logical partitions of the physical system resources One or more logical segmentation hardware detection logics associated with one or more performance metrics of one or more physical system resources; configured to classify each of the logical segments in the logical segmentation according to a configured scheduling window Split scheduling logic; and for a given group of entity system resources in one of the physical system resources being preconfigured for configuration to one of the logical partitions - a scheduling window period and a replacement The collected performance metrics associated with the logical segmentation and the scheduling window of the replacement logical segmentation use the classification to group the given group Dividing the system resources to schedule the replacement logical segmentation logic. X Ming Mu 8 system, which further includes: Means for storing the equivalent energy metric associated with each of the logical partitions associated with the respective ones; and t' for configuring the given group entity system resources to - The efficiency of the split schedule logic is further _ θ / 用于 is used to select the replacement logic partition according to the "degree I" of the storage. 10. If the request item m further includes: #程逻辑. For a schedule Scheduling the split scheduling logic of one of the logic logic processors in the window during the window, and setting a pre-deduction h, wherein the schedule includes a pre-private period during which the period The I system resource is set for use by the one of the logical partitions in 129569.doc 200905470; and the logic processor for responding to the schedule temporarily suspends processing during the pre-specified period of time Another logical partitioning of the logical partitioning to reconfigure the physical system resources to the logically partitioned scheduling logic within a remainder of the pre-specified period, the selection being based on the logical partitioning The other-logical partitioning is associated with the collected performance metrics. 11. The system of claim 8, wherein the partitioning logic for configuring the given group entity system resources to a replacement logical partition Further included is a split schedule logic for excluding all of the logical partitions in the logical partition from the specified portion of the dispatch window that is less than a number of configurations from the eligibility of the replacement logical partition. The system of item 8 wherein the hardware detection logic for collecting a number of performance metrics (4) collects during the placement of the material mm into the logical partition of the material - or a plurality of logically divided scheduling windows: The system of claim 8, further comprising: dividing, by the equivalent audible, the amount of memory usage of the logical partitions: logic, wherein the memory occupancy value & 桎 〇栝 〇栝Used for a logical division to establish a period of memory occupancy. "· The system of claim 8, wherein the hardware debt measurement logic packet device. Ding 4 number 15. A computer system that is used to balance multiple logical partitions on a system partitioned by a system virtualization, and has stored in a pair of physical system resources. 129569.doc 200905470 In the virtualization of the system, in the virtualization of the system, the logical division of each of the plurality of logical sub-computer systems uses the U-square Dingdan entity to adjust the entity, , ^ -U , » , , ^ " A way of doing things independent of other partitioning logics, these computers are adapted to perform a method that includes: using hardware detection logic to receive a number of performance metrics of one or more physical system resources associated with one or more of the logical cutters in the physical system resource; class of the logical partitioning according to a configuration of the scheduling window utilized Levels are divided into logical partitions; and a given set of entity system resources in a given entity system resource is pre-configured for configuration into the logical partition - a scheduling window of logical partitioning The distribution window associated with the replacement logical partition is used to configure the given group entity system resource to the replacement logical partition using the classification. 16. The computer readable medium of claim 15, the method further comprising: storing the equivalent energy metric associated with each of the logical partitions associated with the respective ones; and wherein 'the given group Configuring the physical system resource to an alternate logical partition further includes selecting the replacement logical partition based on the stored performance metrics. 1 7. The computer readable medium of claim 15, wherein the method further comprises: scheduling a logical processor of one of the logical partitions during a scheduling window, wherein the scheduling comprises configuring a pre-specified period , 129569.doc 200905470 during which the 'physical system resources are configured for use in the logical partitioning - logical partitioning; and the logical processor in response to the scheduling temporarily suspends processing during the pre-specified period Selecting another of the logical partitions to logically reconfigure the physical system resources to the logical partition within a remainder of the pre-specified period, the selection being based on the other of the logical partitions A logical segmentation associated with the collected performance metrics is performed. 18. The computer readable medium of claim 15, wherein the configuring the given group entity system resource to a replacement logical segmentation further comprises excluding the qualifying from the replacement logical segmentation as being utilized to utilize less than a number of configurations One of the scheduling windows specifies all of the logical partitions in the partial logical partition. 19. The computer readable medium of claim 15 wherein the plurality of performance metrics are collected by the hardware detection logic to configure the physical system resources to the one or more logically split scheduling windows of the logical partitions Executed during the period. 20. The computer readable medium of claim 15, further comprising determining, by the equivalent energy metric, each memory occupancy value of the logical partitions, wherein the memory occupancy values comprise a logic partitioning Establish the period of the occupation of the memory. 21. A method for balancing access to various physical system resources between a plurality of logical partitions in a computer system employing system virtualization partitioning, wherein each of the plurality of logical partitions is in the virtualized partitioning of the system Logical partitioning enables 129569.doc 200905470 to operate with a number of shared entity resources of the computer system in a manner independent of other partitioning logic, the method comprising: utilizing hardware detection logic to collect the logical partitions of the physical system resources One or more logical divisions of a plurality of performance metrics associated with one or more physical system resources; processing the equivalent energy metrics to determine respective memory occupancy values of the logical partitions; and in the physical system resources During a scheduling window in which a given group of entity system resources are allocated to one of the logical partitions, the roots are based on the determined memory occupancy values of the physical system resources. The grouped entity system resources are configured to another logical segmentation of the logical segments. 22. The method of claim 21, wherein the equivalent energy metric comprises data per instruction cycle number, and wherein the memory occupancy values comprise a period for a logical segmentation to establish a memory footprint. 23. The method of claim 22, wherein the L* period for establishing a memory footprint is determined by detecting a corner point at which a point within one of the scheduling periods One of the number of cycles per instruction cycle is - the number of cycles per command cycle at a previous point in one of the scheduling periods of the same segment is less than a specified threshold. 24. The method of claim 22, wherein the utilizing the hardware detection logic to collect the plurality of performance metrics comprises collecting the number of cycles per instruction cycle on a plurality of consecutive segments of the logical segmentation of the ones of the logical segments. 25. The method of claim 24, wherein the one of the logical partitions is 129569.doc 200905470. The loop number data is collected on a number of consecutive schedules of logical partitions. Each instruction step comprises: - the nth time is in the Collecting the number of cycles per instruction cycle at increments in the mth schedule window of a given logical partition; and the (n+p>th) in the (m+q)th dispatch window of the given logical partition Collect the number of cycles per instruction at the time increment, where (7)n The step includes configuring, according to the other logical one of the logical partitions, whether the logical partition has a memory occupancy value satisfying the determination of the following relationship, configuring the given group entity system resource to the logical partition Medium = a logical division: One of the unused parts, and x is an efficiency multiplier greater than 丨. 27. A system for balancing access to physical system resources between a plurality of logical partitions in a computer system employing system virtualization partitioning, wherein each of the plurality of logical partitions is in the virtualized partitioning of the system Logical partitioning uses a number of shared entity resources of the computer system to operate in a manner independent of other partitioning logic, the system comprising: for collecting one or more logical partitions of the logical partitions of the physical system resources Hardware detection logic for combining several performance metrics of one or more physical system resources; segmentation monitoring logic for processing the equivalent energy metric to determine the volume of each of the logical segments; and During a scheduling window in which a given group of entity system resources are configured to be logically partitioned by one of the n nj in one of the entities, the system, and the first source, according to the Judging, Α 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 The other - logical split-off clothes row logic. 28. As requested in item 27, the Gansu a, , and Lieutenant equivalent energy metrics include the number of cycles per instruction, and where. The value of the occupancy of the sects includes a period for a logical division to establish a print, and 咅_° has a hidden occupancy. 29. If the rate of claim 28 is 蛘, 甘+乐, 死中五海 is used to establish a memory footprint: the period is determined by the corner point, at the corner point, at a ^ At the point of the aging period - the number of cycles per command is from: the same knife °] in one of the aging periods - the number of displacements per command cycle at the previous point is less than - the specified threshold. The system of claim 28, wherein the hardware detection logic includes means for collecting data per instruction cycle number on a plurality of consecutive schedules of the given logical partition in the = logical partition. The system of claim 30, wherein the number of cycles per instruction is collected on a number of successive schedules of a given logical segmentation of the logical segmentation further comprising: mth scheduling at one of the given logical segments Collecting the number of cycles per instruction cycle at an nth time increment in the window; and collecting at (n + ρ) time increments in the (m + q)th scheduling window of the given logical segmentation The number of cycles per instruction, where m, η, ρ 129569.doc 200905470 and q are integers greater than or equal to one. 32. The system of claim 27, wherein the split schedule logic for configuring the given set of entity system resources in the physical system resources to another logical partition of the logical partitions is further included for Whether the other logical segmentation in the logical segmentation has a memory occupancy value Tfp that satisfies the determination of the following relationship to configure the given group entity system resource to another logical segmentation of the logical segmentation Scheduling logic: x ding fP < ding delete (1) ized, where Ding unu (i) ized represents - the unused portion of the scheduling window period, and x is an efficiency multiplier greater than 丨. 33. A computer-readable medium having a plurality of computer-executable instructions encoded in its computer system for balancing access to physical system resources between a plurality of logical partitions, in a computer system employing a virtualized partitioning system In the virtual ft 该 of the system, each of the plurality of logical partitions uses the power square;:: the right-hand shared physical resource is - in a manner independent of other split logic, the Lei Cong can be powered Knowing that the stubborn instruction has been adapted to perform a method, including: % using hardware detection i 赭 赭 赭 & % % % 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集 收集忑寺^^ _ A series of performance metrics for one or more f-system lean sources associated with the I-series; 'an entity to process the equivalent energy-reducing amount; Α ϋ to determine the logically-divided memory Occupied to the =: a given group of resources in the distribution window according to the judgment of the judgment of the classification, the root occupancy value of the physical system resources in the 129569.doc 200905470 Given group entity system Series split. Configuring another logic in the logical segmentation 34. 35. 36. The computer readable medium of claim 33, wherein the equivalent energy metric ... is the number of cycles, and wherein the field is recognized The value of the memory occupancy includes: a segmentation to establish the period of memory occupancy. The computer readable medium of claim 34, wherein the method for establishing a memory: using: the period is determined by a corner of the debt measurement, at a point in the scheduling period of the corner point division The number of per-instruction cycle numbers is less than a specified threshold from a parental number of cycles at a previous point in a scheduling period of the same segment. 37. The computer readable medium of item 34, wherein the hardware (4) logic collects a number of effects & metrics included in the logical segmentation—collecting the number of cycles per instruction for a number of consecutive schedules of a given logical segmentation . The computer readable medium of claim 36, wherein the number of cycles per instruction is collected on a plurality of consecutive schedules of logical partitions in the logical partitions further comprises: an mth schedule window in one of the given logical partitions Collecting the number of data per instruction cycle at an ηth time increment; and collecting each (n+ρ) time increments in the (m+q)th scheduling window of the given logical partition The number of instruction loops, where m, η, ρ, and q are integers greater than or equal to one. 38. The computer readable medium of claim 33, wherein configuring the given group of entity system resources in the physical system resources to another one of the logical partitions comprises: segmenting according to the logic The other one - 129569.doc 200905470 Whether the logical partition has a memory occupancy value Tfp that satisfies the decision of the following relationship to configure the given group entity system resource to another logical partition in the logical partition: X Tfp S Tunutiiized 'where 'Tunut' ized table is one of the unutilized parts of the scheduling window period, and X is an efficiency multiplier greater than 1. 39. - Used for dynamic tuning - determining the sharing of resources of various physical systems Method for scheduling schedulers between logical partitions, the method comprising: 'collecting, among logical entity scheduling resources, associated with each of the logical partitions of the logical partitions - or more a number of performance metrics for the physical system resources; processing the equivalent energy metric to determine the amount of memory usage of the logical segments; and determining and determining The method of claim 39, wherein the method of dynamically adjusting each segment further comprises a given group of entities in the physical system resources, in accordance with the method of claim 39. The system resources are preconfigured for configuration to a scheduling window of one of the logical partitions, the system resources of the given group entity are configured according to the collected performance metrics associated with an alternate logical partition To the replacement of the logical partitioning. ' 4 1 · The method of claim 5, further comprising: scheduling the logically partitioned k-processors of the logical partitions during the scheduling window, wherein the scheduling includes configuration a pre-specified period of time during which a given set of entity system resources are configured for use by the logical partitioning of the logical partitions such as 129569.doc -12-200905470; and in response to the logic of the scheduling The prince temporarily suspends processing during the pre-specified period, selecting another logical division of the logical divisions to a remainder of the pre-specified period The given set of entity system resources are configured to the logical partition, and the selection is performed according to the collected performance metrics associated with the other logical partition in the logical partition of (4). 42. ^ ^ NW Whether the logical segmentation has a memory occupancy value Tfp that satisfies the determination of the following relationship to allocate the given township and real system resources in the physical system resources to the same Another logical partitioning; logical division; 43. 44. 45. fP TunUUhZed where Tunut"ized represents a portion of the dispatch window that is not utilized, and χ is an efficiency multiplier greater than 丨. The method of claim 39, wherein the performance metric comprises each data item, and wherein the memory occupancy value comprises a period for processing a memory to establish a memory footprint. 2 The method of claim 43, wherein the octopus used to establish the amount of memory usage is determined by a corner point of the debt measurement to determine 'at the corner point, at a point in the scheduling period of the cut. The value of a parent instruction cycle number is self-deprecating—one of the s-points in one of the scheduling periods is § HM. The number of sugar coatings is less than a specified threshold. A kind of scheduling schedule for crying 邋 ^ D for dynamically tuning a decision-making continuation of a plurality of knives. System, the system comprising: 129569.doc -13- 200905470 for collecting the physical system resources during the logical splitting schedule, and one or more physical system resources associated with each of the logical partitions Segmentation monitoring logic for a plurality of performance metrics; segmentation monitoring logic for processing the enablement metrics to determine the amount of memory usage of the logical segments; and for each of the memory footprints listed Change the dynamics to dynamically adjust the split schedule logic for each split schedule. 46. The method of claim 45, wherein the split schedule logic for dynamically adjusting the schedules of the points further comprises a system of resources for a given group of entities in the physical system resources Preconfiguring a schedule window for configuring logical partitioning to one of the logical partitions, configuring the given set of entity system resources to the replacement based on the collected performance metrics associated with a replacement logical partition Split-segment logic for logical segmentation. The system of claim 45, further comprising: a split schedule logic for scheduling a logical partition of one of the logical partitions during a scheduling window, wherein the scheduling includes configuring a pre-specified period, During this period, the configuration-given group entity system resource is selected by (4) (4) logical partitioning <the logical partitioning; and the logical processor for responding to the scheduling temporarily suspends processing during the pre-specified period to select the And another logical-segmentation to logically partition the given group of entity system resources in the remainder of the pre-specified period to configure the logically segmented split tiller logic, the selection being based on the logical partitioning The other-logical segmentation is performed in association with the collected performance metrics. If the request item further includes a memory occupancy value Tfp for determining whether the logical partition has a memory occupancy value Tfp satisfying the following relationship according to the logical division 129569.doc 200905470 ^ The system resource resource in the system resource is configured to the split schedule logic of the separate segment in the logical segmentation: '"knife X * T < τ fp - unuti丨ized, where TunutiHzed represents a The unused portion of the dispatch window period, and X is an efficiency multiplier greater than one. 49. 50. 51. The system of claim 45, wherein the equivalent energy metric comprises a number of data per instruction, and wherein the memory occupancy comprises one for -, a division to establish a memory The period of occupancy. The system of claim 49, which further includes a segmentation logic for determining a period of time for establishing a memory occupancy by detecting a point at the corner point, in----- One of the number of cycles per instruction cycle at the point in the scheduling period is from the same segmentation - the number of cycles per instruction cycle at the previous point in the scheduling period - and - the specified threshold. °° Computer-readable medium having computer-executable instructions encoded thereon for dynamic tuning-determining a scheduling schedule between a plurality of logical partitions of various physical system resources The computer executable is adapted to perform a method comprising: θ 收集 collecting, during the logical segmentation scheduling, each of the logical segments in the logical segmentation is associated with each of the logical segments - 〃 虱a number of performance metrics for system resources; processing the equivalent energy metric to determine the logical usage values; and. Valley memory accounts for 129569.doc •15- 200905470 Dynamically adjusts the scheduling of each segment based on the respective changes in the memory footprint of these decisions. The computer readable medium of claim 5, wherein the dynamically adjusting the partitioning schedule further comprises one of the physical system resources, the given group of entity system resources being preconfigured for configuration to the logical partitioning During a scheduling window of one of the logical partitions, the given set of entity system resources are configured to the replacement logical partition based on the collected performance metrics associated with a replacement logical partition. 5. The computer readable medium of claim 5, the method further comprising: during a scheduling window, scheduling a logical processor of one of the logical partitions, wherein the scheduling comprises configuration-pre- a specified period during which a given set of entity system resources are configured for use by the one of the logical partitions; and; the logical processor responsive to the schedule during the pre-specified period Time abort processing 'choose another of these logical partitions—logical partitioning Configuring the given group of basket alarms to the logical partition in a remaining portion of the pre-specified period, the selection being based on the collections associated with the logical segments = the other logical segmentation Efficacy: two 54. The logical partition of the computer readable by claim 53 is the logical partition of the given group entity system: the media, the method further includes Whether the logical partitioning has - satisfying the following usage value Tfp to configure the physical system resource resources to the logical partitions T ^^ 129569.doc 200905470 X* Tfp S Tunutilized, wherein Tunut(1)zed represents a scheduling window period The portion utilized, and x is an efficiency multiplier greater than 丨. 55. The computer readable medium of claim 51, wherein the equivalent energy metrics the instruction loop number data' and wherein the memory footprint values comprise a period for a logical partitioning to establish a memory footprint. 56. The computer readable medium of claim 55, wherein the period of occupancy is determined by 贞 ' " '', and by means of detecting a corner point, From the + 々 corner point - the number of values in the scheduling period from the same-segmented " one A before and during the day of the defensive period does not shift the value of the number of instructions per cycle by one point. L 129569.doc -17·