Browse Prior Art Database

Lean Parallel Build CPU Allocation Process

IP.com Disclosure Number: IPCOM000111940D
Original Publication Date: 1994-Apr-01
Included in the Prior Art Database: 2005-Mar-26
Document File: 2 page(s) / 33K

Publishing Venue

IBM

Related People

Redpath, RJ: AUTHOR

Abstract

Methods of CPU allocation for Parallel Builds have been established which center on load balancing. Load balancing naturally requires constant communication and feedback. In addition, the complexity of CPU servers is increased to manage internal queues along with communication traffic. Prior art for CPU allocation centers around evenly distributing the load but none that addresses the need for reduce complexity and reduced communication traffic and cost of implementation.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 97% of the total text.

Lean Parallel Build CPU Allocation Process

      Methods of CPU allocation for Parallel Builds have been
established which center on load balancing.  Load balancing naturally
requires constant communication and feedback.  In addition, the
complexity of CPU servers is increased to manage internal queues
along with communication traffic.  Prior art for CPU allocation
centers around evenly distributing the load but none that addresses
the need for reduce complexity and reduced communication traffic and
cost of implementation.

      The process is as follows.  The parallel build design is based
on a CPU availability algorithm.  A set of CPUs is defined for use in
a build request.  The set of CPUs should be sorted by load capacity
for efficient availability usage.  The CPU machine list is scanned
linearly for job submission, and machines are marked in the list as
busy.  When a job is complete, the machine is marked as available and
the list is linearly scanned again for job submission.  Since the CPU
list is sorted by load capacity (greatest load capacity is first),
machines which can process faster will be used more often.  The CPU
availability list is periodically updated with the actuary function.
The actuary function checks for a death of a machine and marks the
CPU entry as not available for job submission.

      In summary, the CPU machine list is processing power sorted in
descending order with linear searching so as to pick up the first
available...