IP Library Granted Patent US 9,081,627
Granted Patent B1
US 9,081,627 · App. 11/831,657 · Granted Jul 14, 2015

Workload management with resource transfer sequence planned as a function of ranking of resource allocations

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,081,627
App. No.
11/831,657
Granted
Jul 14, 2015
Kind
B1
Abstract

A computer system includes computing resources and workload containers to which the resources can be allocated. A workload manager plans 1) a reallocation of the computing resources among said containers, and 2) a transfer sequence for units of the computing resources to implement said reallocation. The transfer sequence is selected as a function of a ranking of resource allocations and/or delay-related costs in implementing the reallocation.

Claims (16)

1. A computer-implemented method comprising:

executing workloads in respective containers by using hardware resources allocated to those containers;

preparing a reallocation plan for reallocating said hardware resources amongst said containers, said reallocation plan requiring transfer of at least some hardware resource units, said reallocation plan being based at least in part on workload priorities pre-assigned to said workloads prior to said preparing, said preparing involving explicitly assigning resource-unit priorities to resource units requiring transfer to implement said reallocation so as to differentiate least-needed resource units from most-needed resource units;

preparing a transfer sequence plan for implementing said reallocation plan, said transfer sequence plan specifying an order in which said resource units requiring transfer are to be transferred so that delays associated with transfers of said least-needed resource units are longer than delays associated with transfers of said most-needed resource units, said order being based at least in part on said resource-unit priorities; and

after preparing said transfer sequence plan, implementing said reallocation plan by implementing said transfer sequence plan.

2. A method as recited in claim 1 wherein said resource-unit priorities are assigned according to the relative benefit of accomplishing or relative cost of delaying or both a transfer of each said unit according to its assignment for said reallocation.

3. A method as recited in claim 1 wherein said resource-unit priorities are derived, at least in part, from said workload priorities.

4. A method as recited in claim 1 wherein said preparing a transfer sequence plan involves selecting source containers for resource units are to be transferred to respective destination containers.

5. A system comprising non-transitory computer-readable media encoded with code configured to, when executed by a processor:

plan a reallocation of computing resources to resource containers in which workloads are executing, said reallocation requiring transfer of at least some computing resource units, said planning being based at least in part on workload priorities pre-assigned to said workloads prior to said planning, the planning involving explicitly assigning resource-unit priorities to resource units requiring transfer to implement said reallocation so as to differentiate least-needed units from most-needed units;

plan a transfer sequence for implementing said reallocation, said transfer sequence having an order in which said resource units requiring transfer are to be transferred so that delays associated with transfers of said least-needed resource units are longer than delays associated with transfers of said most-needed resource units, said order being based at least in part on said resource-unit priorities; and

after said transfer sequence is planned, implement said reallocation by implementing said transfer sequence.

6. A system as recited in claim 5 further comprising said processor.

7. A system as recited in claim 5 wherein said code is configured to assign resource-unit priorities according to the relative benefit of accomplishing or relative cost of delaying or both a transfer of each said unit according to its assignment for said reallocation.

8. A system as recited in claim 5 wherein said code is configured to assign resource-unit priorities based at least in part on said workload priorities.

9. A method as recited in claim 5 wherein said preparing a transfer sequence plan involves selecting source containers for resource units to be transferred to respective destination containers.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 18, 2021
From: OT PATENT ESCROW, LLC
To: VALTRUS INNOVATIONS LIMITED
Reel/Frame 058897/0262 →
PATENT ASSIGNMENT, SECURITY INTEREST, AND LIEN AGREEMENT Recorded Jan 26, 2021
From: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP; HEWLETT PACKARD ENTERPRISE COMPANY
To: OT PATENT ESCROW, LLC
Reel/Frame 055269/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 3, 2007
From: BLANDING, WILLIAM H.; HERINGTON, DANIEL EDWARD; JORDAN, GREGORY D.
To: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
Reel/Frame 019694/0923 →