Advanced Micro Devices Corporation

International Business Machines Corporation

Yiwei Li

Larry D Barto

Steven C Nettles

H Van Dyke Parunak

Gustavo Mata

Ping Chen

Charles Scott Graham

Robert Kimberlin Foster

Robert Michael Russin

David Alan Richardson

Patricia Y Wang

Venu G Potluri

Elizabeth A Ruth

Nils Bertelsen

Migrating a logical partition with a native logical port including establishing in the target computing system a target VIOS that includes a virtual network interface controller (vNIC) server, the vNIC server of the target VIOS coupled for data communications to a first target virtual adapter; copying the logical partition including a vNIC client to the target computing system; starting the logical partition; establishing, by the vNIC client of the logical partition, data communications with the vNIC server of the target VIOS, including performing I/O data communications between the logical partition and the first target virtual adapter; establishing a second logical port in the logical partition on the target computing system, including coupling for I/O data communications the second logical port to a second target virtual adapter; and performing I/O data communications from the logical partition to the second target virtual adapter through the second logical port.

Migrating a logical partition with a native logical port

In one embodiment, a data structure stores information about the number of client virtual I/O adapters, the number of possible destination VIOS hosts and the number of available slots on those hosts. The information is used to iteratively assign adapters to available slots of the VIOS hosts of the destination server to which a client partition is to be migrated. A method comprises testing the data structure to determine whether conditions exist that make allocation of the adapter to a VIOS host unquestionable.

Finding workable virtual I/O mappings for HMC mobile partitions

A method includes generating a plurality of bid requests for processing a workpiece. Each bid request is associated with one of a plurality of resources capable of processing the workpiece. For each of the bid requests, a commitment window including a kernel specifying a time period required for processing the workpiece is generated. A first committed capacity of the associated resource is determined based on a schedule of engagements compatible with the processing required for the workpiece. A second committed capacity of the associated resource is determined based on a schedule of engagements not compatible with the processing required for the workpiece. A first rate function specifying a processing cost for the associated resource as a function of the first and second committed capacities is provided. The first and second committed capacities and the first rate function are combined to generate a basic cost function associated with the associated resource. A plurality of candidate bids are generated based on the basic cost functions. One of the candidate bids is selected for scheduling the associated resource.

Method and apparatus for scheduling a resource

A method and system for generating security rules for implementation by a rule interpretation engine to define accessibility to one or more aspects of an Enterprise System is described. The method and system allow a security officer to graphically indicate an operation to be affected by the security rule being defined; a specific aspect of the system affected by the rule; a security regulation to be implemented by the rule; and an access type to be permitted by the rule.

Method and system for generating access policies

A method and apparatus for scheduling appointments in a manufacturing process flow are disclosed. The method and apparatus include a number of aspects including appointments in which processing windows float within commitment windows; appointments in which the processing windows include consumption and processing intervals and in which the processing windows can overlap with the processing interval of other appointments; the use of different kinds of calendars including different types of appointments maintained in a variety of states; a calendaring system in which appointments are constrained by the implicit constraints not represented by booked appointments as well as the explicit constraints represented by booked appointments; calendar manipulation techniques used in managing the calendars; and corresponding appointments maintained over multiple calendars in a synchronized manner.

Display unit with processor and communication controller

A method for generating a cost function includes providing a resource for processing a workpiece. A plurality of cost function parameters is provided. A library of parameterized cost function components is acessed based on the plurality of cost function parameters to generate a cost function for processing the workpiece using the resource. A system includes a resource for processing a workpiece and at least one scheduling agent. The scheduling agent is configured to provide a plurality of cost function parameters and access a library of parameterized cost function components based on the plurality of cost function parameters to generate a cost function for processing the workpiece using the resource.

Method and apparatus for determining cost functions using parameterized components

A system and method are provided for monitoring work in process ('WIP') in a manufacturing facility. The system and method utilize software objects to identify a bottleneck workstation and calculate a WIP value representing the amount of work approaching the bottleneck workstation. If it is determined that the WIP value for a bottleneck workstation is projected to fall below a control limit during the evaluation period, an additional amount of work is released into the manufacturing line. In this manner, new work is introduced to a bottleneck station in order to prevent bottleneck starvation. Various embodiments provide for multiple products and multiple bottleneck workstations.

Starvation avoidance lot start agent (SALSA)

A method includes providing a schedule of engagements for a resource. Each engagement has a working window and an associated engagement density function. The engagement density functions of the scheduled engagements are combined to generate a committed capacity function for the resource. A region of violation in the committed capacity function is identified where the committed capacity of the resource exceeds a capacity threshold. An area of a region of overlap between the working window of a selected one of the engagements and the region of violation is determined. An area reduction amount for the selected engagement is determined based on a portion of the area of the region of overlap. The working window of the selected engagement is changed based on the area reduction amount.

Method and apparatus for reducing scheduling conflicts for a resource

A system and method are provided for calculating a plurality of bottleneck delta virtual work in process time ('VWIP') values. Each of the bottleneck delta VWIP values represents the time until one of n bottleneck workstations begins to risk starvation.

Lot start agent that determines delta virtual WIP time for each bottleneck station in a multi-product and multi-bottleneck manufacturing environment

An automated system is provided in a facility that manufactures m products, where m&#x3e;0. The system comprises a software object that provides for calculation of one or more bottleneck delta virtual work in process time ('VWIP') values. Each of the bottleneck delta VWIP values represents the amount of time until one of n bottleneck workstations begins to risk starvation, where n&#x3e;0. VWIP is the amount of time a bottleneck will stay busy processing WIP that will reach the bottleneck in less time than new lot starts will reach the same bottleneck. In at least one embodiment, each of the bottleneck delta VWIP values is calculated as a mathematical function of virtual WIP time for the corresponding bottleneck workstation and a lower control limit for the corresponding bottleneck workstation. In at least one other embodiment, n&#x3e;2 and the software object provides for calculation of a plurality of bottleneck delta VWIP values. The software object contains program code that provides for the foregoing functionality either directly or by invoking one or more other objects.

Lot start agent that determines quantity and timing for lot starts

The invention is a technique by which a manufacturing process flow determines when to begin processing a batch of lots. The invention includes a method for determining whether to begin processing a batch in one aspect and a manufacturing process flow in a second aspect. The method comprises: ascertaining a respective time at which each of a plurality of additional lots will be received into the batch, the batch including a plurality of present lots; assessing a cost for a machine, each additional lot, and each present lot for each respective time at which each additional lot will be received should the machine begin processing the batch at the respective time; and determining the respective time at which the total cost borne by the machine, each additional lot, and each present lot will be at a minimum. The manufacturing process flow comprises a processing tool that processes batch-by-batch, a batch of present lots, a plurality of additional lots that may be included in the batch, and a software agent or a computing system. The software agent/computing system is capable of performing the method set forth above.

Determining batch start versus delay

A method and apparatus for scheduling in an automated manufacturing environment, comprising are disclosed. The method includes detecting an occurrence of a predetermined event in a process flow; notifying a software scheduling agent of the occurrence; and reactively scheduling an action from the software scheduling agent responsive to the detection of the predetermined event. The apparatus is automated manufacturing environment including a process flow and a computing system. The computing system further includes a plurality of software scheduling agents residing thereon, the software scheduling agents being capable of reactively scheduling appointments for activities in the process flow responsive to a plurality of predetermined events.

Agent reactive scheduling in an automated manufacturing environment

A method for generating a cost function for processing a candidate workpiece using a resource includes identifying processing requirements for the candidate workpiece. A first committed capacity of the resource is determined based on a schedule of engagements associated with other workpieces having processing requirements compatible with the processing requirements of the candidate workpiece. A second committed capacity of the resource is determined based on a schedule of engagements associated with other workpieces having processing requirements not compatible with the processing requirements of the candidate workpiece. The cost function is generated based on the first and second committed capacities. A system includes a resource for processing a candidate workpiece and at least one scheduling agent. The scheduling agent is configured to identify processing requirements for the candidate workpiece, determine a first committed capacity of the resource based on a schedule of engagements associated with other workpieces having processing requirements compatible with the processing requirements of the candidate workpiece, determine a second committed capacity of the resource based on a schedule of engagements associated with other workpieces having processing requirements not compatible with the processing requirements of the candidate workpiece, and generate the cost function based on the first and second committed capacities.

Method and apparatus for generating a multi-dimensional cost function

A method for scheduling a resource for processing a workpiece includes defining a commitment window having a kernel specifying a time period required for processing the workpiece. A plurality of candidate bids having candidate commitment windows within the commitment window with varying start times, end times and candidate commitment window sizes is generated. A cost for each of the plurality of candidate bids is determined. A flexibility discount is applied to the cost of the candidate bid. Each candidate bid is evaluated in accordance with an objective function. A candidate bid is selected for scheduling the resource based on the objective function evaluation. A system includes a resource for processing a workpiece and at least one scheduling agent. The scheduling agent is configured to define a commitment window having a kernel specifying a time period required for processing the workpiece, generate a plurality of candidate bids having candidate commitment windows within the commitment window with varying start times, end times and candidate commitment window sizes, determine a cost for each of the plurality of candidate bids, apply a flexibility discount to the cost of the candidate bid, evaluate each candidate bid in accordance with an objective function, and select a candidate bid for scheduling the resource based on the objective function evaluation.

Growing community of inventors

Austin, TX, United States of America

Yiwei Li