Magnus Karlsson, 552470 Betlo Ave, Mountain View, CA 94043

6836827, Dec 28, 2004

Aug 13, 2002

10/217698

Magnus Karlsson - Mountain View CA
Mallik Mahalingam - Sunnyvale CA

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

G06F 1200

711133, 711136, 711137

Delayed caching receives an evaluation interval to delay updating the objects stored in a delayed cache, delays a time period corresponding to the evaluation interval, and updates the objects stored in the contents of the delayed cache when the time period delay has completed. The configuration operation for the delayed cache selects a time interval to sample a trace having object access frequencies for objects stored in a cache, creates a first working set of objects accessed during the time interval and a second working set of objects accessed during a subsequent time interval based on the historical trace, determines that the difference between the objects contained in the first and second working sets does not exceed a maximum threshold with the selected time interval, and sets a evaluation interval for evaluating the contents of the cache to the selected time interval.

7000141, Feb 14, 2006

Nov 14, 2001

10/295554

Magnus Karlsson - Mountain View CA, US
Qian Wang - State College PA, US
John Wilkes - Palo Alto CA, US

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

G06F 11/00

714 4, 709201

A technique for data placement in a distributed system that takes into account fault tolerance. Data placement is performed in which data objects, and possibly replicas thereof, are assigned to nodes within the distributed system. The resulting placement is then tested to determine whether the system provides desired performance under various different fault scenarios. If not, the distributed system is altered such as by altering its capacity or its capacity allocations. Performing data placement, testing for fault-tolerance and altering capacity or capacity allocations are performed repetitively, thereby increasing the system's ability to provide the desired performance under the fault scenarios. Preferably, a system and placement are eventually determined that provide the desired performance under the given fault scenarios.

7266125, Sep 4, 2007

Oct 31, 2002

10/284355

Zhichen Xu - Sunnyvale CA, US
Mallik Mahalingam - Sunnyvale CA, US
Magnus Karlsson - Mountain View CA, US

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

H04L 12/56
H04L 12/28

370401, 370400

A system and method for an auxiliary network for a peer-to-peer overlay network using landmark numbering. Using information available through the auxiliary network, expressway connections are established amongst expressway nodes and ordinary connections are established between ordinary and expressway nodes. The connections established is unconstrained and arbitrary. After the connections are established, efficient routing of information may take place.

7315930, Jan 1, 2008

Oct 30, 2003

10/698182

Magnus Karlsson - Mountain View CA, US
Christos Karamanolis - Los Gatos CA, US

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

G06F 12/06

711170, 711162, 707 10

An embodiment of a method of selecting a heuristic class for data placement in a distributed storage system begins by forming a general integer program which models the data placement and forming a specific integer program which models a heuristic class for the data placement. The general and specific integer programs each comprising an objective of minimizing a replication cost. The method continues with solving the general integer program which provides a general lower bound for the replication cost and solving the specific integer program which provides a specific lower bound for the replication cost. The method concludes with selecting the heuristic class if a difference between the general lower bound and the specific lower bound is within an allowable amount.

7379428, May 27, 2008

Oct 31, 2002

10/284100

Zhichen Xu - Sunnyvale CA, US
Mallik Mahalingam - Sunnyvale CA, US
Magnus Karlsson - Mountain View CA, US

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

H04L 12/28

370254, 370400, 370401, 370410

A system and method for an auxiliary network for a peer-to-peer overlay network using autonomous system level topology. Using information available through the auxiliary network, expressway connections are established amongst expressway nodes and ordinary connections are established between ordinary and expressway nodes. The connections established is unconstrained and arbitrary. After the connections are established, efficient routing of information may take place.

7433316, Oct 7, 2008

Feb 20, 2003

10/368426

Zhichen Xu - Sunnyvale CA, US
Mallik Mahalingam - Sunnyvale CA, US
Magnus Karlsson - Mountain View CA, US

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

G01R 31/08

370238, 370251

Described herein is a method for creating route summaries in an auxiliary network for a peer-to-peer (P2P) overlay network for routing a data packet. The method comprises dividing a d-dimensional Cartesian space of nodes in the P2P overlay network into multiple virtual grids that form the auxiliary network, numbering each virtual grid, summarizing default overlay network zones of the P2P overlay network corresponding to each of the virtual grids that form the auxiliary network, receiving a data packet, and routing the data packet to a packet destination using one of the P2P overlay network and the auxiliary network.

7617250, Nov 10, 2009

Sep 22, 2003

10/666577

Zhichen Xu - Sunnyvale CA, US
Magnus Karlsson - Mountain View CA, US
Chunqiang Tang - Rochester NY, US
Christos Karamanolis - Los Gatos CA, US

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

G06F 17/30

707200

A data model represents semantic information associated with objects stored in a file system. The data model includes a first object identifier, a second object identifier and a relation identifier. The first object identifier identifies a first object stored in the file system. The second object identifier identifies a second object stored in the file system, wherein the second object is related to the first object. The relation identifier identifies a relationship between the first object and the second object.

7694305, Apr 6, 2010

Oct 21, 2004

10/972232

Magnus Karlsson - Mountain View CA, US
Christos Karamanolis - Los Gatos CA, US
Xiaoyun Zhu - San Jose CA, US

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

G06F 9/46
G06F 15/173

718105, 709224, 709226

An embodiment of a method of controlling access to a computing resource within a shared computing environment begins with a first step of measuring performance parameters for workloads accessing the computing resource to determine a performance parameter vector for the workloads. The method continues with a second step of estimating a controller function for the computing resource by analysis of recent performance parameters and recent throughputs. The controller function comprises a mathematical operation which takes an input and provides an output. In a third step, the method compares the performance parameter vector to a reference performance parameter vector to determine an error parameter. In a fourth step, the method applies the controller function to the error parameter to determine a target throughput for each of the workloads. The method concludes with a fifth step of adjusting access to the computing resource for each work load having a throughput limit different from about the target throughput by reducing or increasing the throughput limit for the workload to about the target throughput.