Patents by Inventor Sven Graupner

Sven Graupner has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7150014
    Abstract: Techniques are provided for automatically deploying software packages. Management agents represent these packages, a logical tree represents the deployed structure, and a node of the tree represents a management agent. A node that does not have any child node is referred to as a leaf node. A recursive process associated with at least one repository generates the structure. The repositories include information for configuring the nodes and thus control the deployment process. During deployment, a non-leaf node, referred to as an initiator node, uses information received from a corresponding repository to generate its child nodes. A child node, if being an initiator node, recursively generates its child nodes until the recursive process stops as there is no additional child node to be generated. Further, node identifiers are automatically established and assigned to respective nodes.
    Type: Grant
    Filed: October 4, 2002
    Date of Patent: December 12, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Sven Graupner, Holger Trinks, Vadim Kotov
  • Patent number: 7072960
    Abstract: A method for generating automated mappings of service demands to server capacities in a distributed computer system, including a plurality of server and service nodes. The method establishing server model layer and a service model layer and a set of server and service attribute values, which are associated with the plurality of server and service nodes. Each set of server attributes values and service attributes values are normalized and a mapping of service nodes onto server nodes is generated.
    Type: Grant
    Filed: June 10, 2002
    Date of Patent: July 4, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Sven Graupner, Vadim Kotov
  • Patent number: 7054934
    Abstract: Method and apparatus for optimizing allocation of computer resources between server and service models. A server model is established in response to user input data. The server model includes one or more server nodes, and each server node has an associated set of capacity attributes. In addition, a service model is established that includes one or more service nodes. Each service node has an associated set of demand attributes. In response to a user selection, one of a plurality of optimization methods and one of a plurality of optimization policies, as embodied in objective functions, are selected for mapping the server nodes and service nodes. An optimized mapping is then generated of the server nodes in the server model to the service nodes in the service model using the selected optimization method, along with the demand and capacity attributes.
    Type: Grant
    Filed: October 26, 2001
    Date of Patent: May 30, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Sven Graupner, Vadim Kotov, Holger Trinks
  • Patent number: 7039705
    Abstract: Method and apparatus for representing capacities and demands in a layered computing environment using normalized values for identifying optimal allocations of computing resources. A plurality of server models are established, with each server model including one or more server nodes and each server node having an associated set of capacity attributes. Similarly, a plurality of service models are established, each service model including one or more service nodes and each service node having an associated set of demand attributes. The server models are defined with a layered relationship as are the service models. A node that is part of a model in one layer corresponds to a model in the next-lower layer. The invention normalizes the demand and capacity attributes of the server nodes and service nodes in the different model layer in order to generate optimized mappings of service nodes to server nodes.
    Type: Grant
    Filed: October 26, 2001
    Date of Patent: May 2, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Sven Graupner, Vadim Kotov, Holger Trinks
  • Patent number: 7035930
    Abstract: Method and framework for identifying optimal allocations of computing resources in a complex, distributed data processing environment. A plurality of server models are established, with each server model including one or more server nodes and each server node having an associated set of capacity attributes. Similarly, a plurality of service models are established, each service model including one or more service nodes and each service node having an associated set of demand attributes. The server models are defined with a layered relationship as are the service models. A node that is part of a model in one layer corresponds to a model in the next-lower layer. The invention generates optimized mappings of service nodes that are described in user-selected service models to server nodes that are described in user-selected server models, as a function of the associated sets of demand and capacity attributes.
    Type: Grant
    Filed: October 26, 2001
    Date of Patent: April 25, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Sven Graupner, Vadim Kotov, Holger Trinks
  • Publication number: 20050228618
    Abstract: A system for workload placement among data centers includes a plurality of grid resource allocation managers (GRAMs), wherein the GRAMs are configured to obtain information from the data centers. The system also includes an information service configured to receive information from the plurality of GRAMs and a broker configured to receive an application request and to determine resource requirements from the application request, wherein the broker is configured to determine which of the data centers contains adequate resources to perform the requested application. The system further includes a co-allocator configured to receive information pertaining to the data centers having the adequate resources, wherein the co-allocator is further configured to select one of the data centers to perform the requested application based upon energy efficiency characteristics of the data centers.
    Type: Application
    Filed: April 9, 2004
    Publication date: October 13, 2005
    Inventors: Chandrakant Patel, Ratnesh Sharma, Cullen Bash, Sven Graupner
  • Publication number: 20050033844
    Abstract: A method of determining a placement of services of a distributed application onto nodes of a distributed resource infrastructure. In an embodiment of the present invention, a placement indicator for a specific service is provided. Communication constraints between node pairs are also provided. The communication constraints ensure that a sum of transport demands between a particular node pair does not exceed a transport capacity between the particular node pair. Constraints can be expressed for preventing unwanted placements. Preferences can be expressed for preferring specified placements. Each term of the sum comprises a product of a first placement variable, a second placement variable, and the transport demand between the services associated with the first and second placement variables. The placement indicator, the communication constraints, and an objective comprise an integer program.
    Type: Application
    Filed: July 25, 2003
    Publication date: February 10, 2005
    Inventors: Artur Andrzejak, Sven Graupner
  • Publication number: 20050021583
    Abstract: A method of determining a set of variables to receive value changes as part of a local search solution to an integer programming problem. The method can be used where a constraint has one or more polynomial terms of at least second order. In an embodiment of the present invention an unsatisfied constraint is selected. Stores are created for allowable changes of value for the variables in the unsatisfied constraint. The unsatisfied constraint is parsed through by term. For each variable in a term, the stores are updated with a change in the term for each of the allowable changes of the value while maintaining other variables constant. A variable to receive the value change, and possibly a value for the variable, are chosen based upon the store which meets at least one improvement criterion.
    Type: Application
    Filed: July 25, 2003
    Publication date: January 27, 2005
    Inventors: Artur Andrzejak, Sven Graupner
  • Publication number: 20050021831
    Abstract: A method of determining a placement of services of a distributed application onto nodes of a distributed resource infrastructure comprises first, second, and third steps. The first step forms communication constraints between node pairs. The communication constraints ensure that a sum of transport demands between a particular node pair does not exceed a transport capacity between the particular node pair. Each term of the sum comprises a product of a first placement variable, a second placement variable, and the transport demand between the services associated with the first and second placement variables. The second step forms an objective. The communication constraints and the objective comprise an integer program. The third step employs a local search solution to solve the integer program, which determines the placement of the services onto the nodes.
    Type: Application
    Filed: July 25, 2003
    Publication date: January 27, 2005
    Inventors: Artur Andrzejak, Sven Graupner
  • Publication number: 20040179481
    Abstract: A computer network system having an overlay network, which comprises of a plurality of nodes and an initiator node connected via a reference. The generalized references are links, which interconnect the nodes and form an overlay topology. The system uses position information in the overlay topology for message routing between participating applications in the overly network. The automatic generation of path-based service identifiers and service locations is another aspect of the system.
    Type: Application
    Filed: March 14, 2003
    Publication date: September 16, 2004
    Inventor: Sven Graupner
  • Publication number: 20040068723
    Abstract: Techniques are provided for automatically deploying software packages. Management agents represent these packages, a logical tree represents the deployed structure, and a node of the tree represents a management agent. A node that does not have any child node is referred to as a leaf node. A recursive process associated with at least one repository generates the structure. The repositories include information for configuring the nodes and thus control the deployment process. During deployment, a non-leaf node, referred to as an initiator node, uses information received from a corresponding repository to generate its child nodes. A child node, if being an initiator node, recursively generates its child nodes until the recursive process stops as there is no additional child node to be generated. Further, node identifiers are automatically established and assigned to respective nodes.
    Type: Application
    Filed: October 4, 2002
    Publication date: April 8, 2004
    Inventors: Sven Graupner, Holger Trinks, Vadim Kotov
  • Publication number: 20040015780
    Abstract: A data element in an electronic document is accessed by parsing a header associated with the electronic document for an information pointer tag and the information pointer tag is parsed for a key term. This key term includes an associated path to the data element. The data element is within a document hierarchy associated with the electronic document. In addition, the associated path is utilized to locate the data element in response to finding the key term and the data element is accessed in response to locating the data element.
    Type: Application
    Filed: July 16, 2002
    Publication date: January 22, 2004
    Inventors: Sven Graupner, Tilo Nitzsche
  • Publication number: 20030236822
    Abstract: A method for generating automated mappings of service demands to server capacities in a distributed computer system, including a plurality of server and service nodes. The method establishing server model layer and a service model layer and a set of server and service attribute values, which are associated with the plurality of server and service nodes. Each set of server attributes values and service attributes values are normalized and a mapping of service nodes onto server nodes is generated.
    Type: Application
    Filed: June 10, 2002
    Publication date: December 25, 2003
    Inventors: Sven Graupner, Vadim Kotov
  • Publication number: 20030084156
    Abstract: Method and framework for identifying optimal allocations of computing resources in a complex, distributed data processing environment. A plurality of server models are established, with each server model including one or more server nodes and each server node having an associated set of capacity attributes. Similarly, a plurality of service models are established, each service model including one or more service nodes and each service node having an associated set of demand attributes. The server models are defined with a layered relationship as are the service models. A node that is part of a model in one layer corresponds to a model in the next-lower layer. The invention generates optimized mappings of service nodes that are described in user-selected service models to server nodes that are described in user-selected server models, as a function of the associated sets of demand and capacity attributes.
    Type: Application
    Filed: October 26, 2001
    Publication date: May 1, 2003
    Applicant: Hewlett-Packard Company
    Inventors: Sven Graupner, Vadim Kotov, Holger Trinks
  • Publication number: 20030084157
    Abstract: Method and apparatus for optimizing allocation of computer resources between server and service models. A server model is established in response to user input data. The server model includes one or more server nodes, and each server node has an associated set of capacity attributes. In addition, a service model is established that includes one or more service nodes. Each service node has an associated set of demand attributes. In response to a user selection, one of a plurality of optimization methods and one of a plurality of optimization policies, as embodied in objective functions, are selected for mapping the server nodes and service nodes. An optimized mapping is then generated of the server nodes in the server model to the service nodes in the service model using the selected optimization method, along with the demand and capacity attributes.
    Type: Application
    Filed: October 26, 2001
    Publication date: May 1, 2003
    Applicant: Hewlett Packard Company
    Inventors: Sven Graupner, Vadim Kotov, Holger Trinks
  • Publication number: 20030084155
    Abstract: Method and apparatus for representing capacities and demands in a layered computing environment using normalized values for identifying optimal allocations of computing resources. A plurality of server models are established, with each server model including one or more server nodes and each server node having an associated set of capacity attributes. Similarly, a plurality of service models are established, each service model including one or more service nodes and each service node having an associated set of demand attributes. The server models are defined with a layered relationship as are the service models. A node that is part of a model in one layer corresponds to a model in the next-lower layer. The invention normalizes the demand and capacity attributes of the server nodes and service nodes in the different model layer in order to generate optimized mappings of service nodes to server nodes.
    Type: Application
    Filed: October 26, 2001
    Publication date: May 1, 2003
    Applicant: Hewlett Packard Company
    Inventors: Sven Graupner, Vadim Kotov, Holger Trinks