Alex Zhang

US Patent:

7076459, Jul 11, 2006

Filed:

Mar 21, 2001

Appl. No.:

09/813907

Inventors:

Alex Xin Zhang - Mountain View CA, US
Dirk Beyer - Mountain View CA, US
Julie Ann Ward - Menlo Park CA, US
Tongwei Liu - Redwood City CA, US

Assignee:

Hewlett-Packard Development Company, LP. - Houston TX

International Classification:

G06Q 40/00

US Classification:

705 37, 705 35

Abstract:

A method for generating a demand estimate for a product includes gathering a set of auction data which is relevant to the product, removing from the auction data all but a highest bid from each unique bidder in the auction data, and correcting a bias in the auction data caused by a set of characteristics of an auction from which the auction data is obtained. In one embodiment, the auction data is obtained from an on-line auction which is characterized by bidders not necessarily knowing the start time of the auction.

US Patent:

7146353, Dec 5, 2006

Filed:

Jul 22, 2003

Appl. No.:

10/624318

Inventors:

Pankaj K. Garg - Sunnyvale CA, US
Cipriano A. Santos - Modesto CA, US
Hsiu-Khuern Tang - Menlo Park CA, US
Alex Zhang - San Jose CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 7/00

US Classification:

707 2, 709105, 709100, 709 2, 709226, 705 27, 713100

Abstract:

Method and apparatus for allocating resources to a plurality of applications. In various embodiments instrumentation data may be gathered for work requests processed by the applications. An associated workload level may be determined for work requests processed by the applications. For each application an application resource requirement may be determined as a function of the workload levels and a service level metric associated with the application. For each application an assigned subset of resources may be determined as a function of the application resource requirement, a minimization of communication delays between resources, and a bandwidth capacity requirement of the application. The resources may be automatically reconfigured consistent with the assigned subset of resources for each application.

US Patent:

7286969, Oct 23, 2007

Filed:

Jul 18, 2003

Appl. No.:

10/623444

Inventors:

Troy Alexander Shahoumian - Sunnyvale CA, US
Dirk Beyer - Walnut Creek CA, US
Alex Zhang - San Jose CA, US

Assignee:

Hewlett Packard Development Company, L.P. - Houston TX

International Classification:

G06F 17/50
H05K 7/16
A47F 7/00

US Classification:

703 1, 361727, 211 26

Abstract:

In one embodiment of a computer implemented method of determining placement of components in a rack, a rack height, a set of components to be placed in the rack, and a height are provided for each of the components. A placement of the components in the rack is determined according to constraints. The placement of the components is then evaluated according to an objective. The constraints may comprise a rack height constraint, a single placement constraint, and a non-overlapping constraint. The rack height constraint ensures that placement of a particular component does not result in a top height of the particular component exceeding the rack height. The single placement constraint ensures that each component is placed once and only once. The non-overlapping constraint ensures that each slot in the rack is occupied by no more than a single component. The method may further comprise providing a weight and a weight distribution for each component in the set of components.

US Patent:

7426616, Sep 16, 2008

Filed:

Aug 22, 2006

Appl. No.:

11/508102

Inventors:

Kimberly Keeton - Palo Alto CA, US
Dirk Beyer - Walnut Creek CA, US
Ernesto Brau - Palo Alto CA, US
Arif Merchant - Palo Alto CA, US
Cipriano Santos - Palo Alto CA, US
Alex Zhang - San Jose CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 12/00

US Classification:

711161

Abstract:

Provided is a method for determining a recovery schedule. The method includes accepting as input a recovery graph. The recovery graph presents one or more strategies for data recovery. In addition, at least one objective is provided and accepted. The recovery graph is formalized as an optimization problem for the provided objective. When formalized as an optimization problem, at least one solution technique is applied to determine at least one recovery schedule.

US Patent:

7581008, Aug 25, 2009

Filed:

Nov 12, 2003

Appl. No.:

10/706401

Inventors:

Alex Zhang - Mountain View CA, US
Cipriano A. Santos - Modesto CA, US
Dirk M. Beyer - Walnut Creek CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 15/173

US Classification:

709226, 709203, 709223, 709224, 703 2

Abstract:

A system and method employing an allocation process for determining the number of server machines at each tier of a multiple tiered server system. The allocation process evaluates the number of server machines at each tier sufficient to achieve an average response time of a transaction request to be processed by the server system in response to changes in the average number of transaction requests. The allocation process also identifies shadow pricing enabling analysis of the cost associated with incremental changes in the average response time or other critical system resources.

US Patent:

7594016, Sep 22, 2009

Filed:

Jun 16, 2005

Appl. No.:

11/153925

Inventors:

Yunhong Zhou - Sunnyvale CA, US
Anshul Kothari - Mountain View CA, US
Ram Swaminathan - Cupertino CA, US
Robert E. Tarjan - Princeton NJ, US
Alex X. Zhang - San Jose CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 15/173

US Classification:

709226, 709203, 709229, 718104

Abstract:

Fractional, non-integer numbers of servers are calculated for respective tiers of a multi-tiered system using a server allocation algorithm. The fractional, non-integer numbers of servers are rounded up to integer numbers to compute allocated numbers of servers for respective tiers.

US Patent:

7720955, May 18, 2010

Filed:

Oct 10, 2006

Appl. No.:

11/545754

Inventors:

Terence P. Kelly - Palo Alto CA, US
Alex X. Zhang - San Jose CA, US
Christopher C. Stewart - Rochester NY, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 13/00

US Classification:

709223

Abstract:

A method for determining performance of an application in a system is described herein. The method includes receiving performance data of the application, the performance data includes a plurality of types of transactions performed by the application, a counted number of transactions for each of the plurality of transaction types as performed by the application, and a total service time by the system of the counted number of transactions of each of the plurality of transaction types; calibrating a performance model of the application in accordance with the received performance data; and calculating an expected performance of the application by the system based on the performance model calibration and the received performance data.

US Patent:

8117107, Feb 14, 2012

Filed:

Jun 29, 2001

Appl. No.:

09/895690

Inventors:

Alex Xin Zhang - Mountain View CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06Q 40/00
G06Q 10/00
G06Q 30/00
G06F 17/50
G06F 9/44

US Classification:

705 37, 705 711, 705 729, 705 731

Abstract:

The present invention provides a novel simulation based method for analyzing new auction formats and rules, from limited and partially observable bidder characteristics. A simulation platform under this method is general enough to be easily modified to a specific design of auctions. This method will utilize the known results, if any, on some aspects of the auction rules under consideration, and simultaneously recover an extended set of bidder characteristics from limited and partially observed, existing bidder data, and will predict bidder behavior under the new auction rules. Advantageously, this method applies known results on some aspects of an auction format to the new learning of this format.