Howard Hao-Wei Liu

US Patent:

8090870, Jan 3, 2012

Filed:

Mar 5, 2009

Appl. No.:

12/381028

Inventors:

Howard Liu - San Marino CA, US
Ken Long - Burbank CA, US
Sheldon Shen - Arcadia CA, US

Assignee:

Disney Enterprises, Inc. - Burbank CA

International Classification:

G06F 15/16
G06F 15/173
G06F 11/00
H03M 13/00

US Classification:

709239, 709238, 709231, 709242, 714751, 714779, 370232, 370237, 370238

Abstract:

There is provided a method for adaptive data transfer over packet networks. The method comprises selecting a first communication path for transferring the data to the second computer, starting to transfer the data over the first communication path to the second computer, monitoring transfer characteristics of the first communication path related to the data transfer, storing the transfer characteristics associated with the first communication path in a database, comparing the transfer characteristics against one or more previously stored transfer characteristics related to one or more prior data transfers, and determining whether to alter a transfer algorithm being utilized for transferring the data to the second computer based on the comparing.

US Patent:

50310895, Jul 9, 1991

Filed:

Dec 30, 1988

Appl. No.:

7/292124

Inventors:

Howard T. Liu - San Marino CA
John A. Silvester - Los Angeles CA

Assignee:

United States of America as represented by the Administrator, National
Aeronautics and Space Administration - Washington DC

International Classification:

G06F 1200

US Classification:

364200

Abstract:

In a distributed heterogeneous computer system having a plurality of computer nodes each operatively connected through a network interface to a network to provide for communications and transfers of data between the nodes and wherein the nodes each have a queue for containing jobs to be performed, an improvement for dynamically reallocating the system's resources for optimized job performance. There is first logic at each node for dynamically and periodically calculating and saving a workload value as a function of the number of jobs on the node's queue. Second logic is provided at each node for transfering the node's workload value to other nodes on the network at the request of the other nodes. Finally, there is third logic at each node operable at the completion of each job. The third logic includes, logic for checking the node's own workload value, logic for polling all the other nodes for their workload value if the checking node's workload value is below a preestablished value indicating the node as being underutilized and available to do more jobs, logic for checking the workload values of the other nodes as received, and logic for transfering a job from the queue of the other of the nodes having the highest workload value over a preestablished value indicating the other of the nodes as being overburdened and requiring job relief to the que of the checking node.