Patents by Inventor Scott Alan Rhine

Scott Alan Rhine 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: 7360219
    Abstract: A computer-implemented method for distributing processes among a plurality of resources is disclosed. The processes are associated with a plurality of priority groups. The method includes ascertaining whether a first priority group of the plurality of priority groups is rich, the first priority group of the plurality of groups being deemed rich if the first priority group is entitled to at least a whole one of the plurality of resources, the first priority group of the plurality of groups being deemed poor if the first priority group is entitled to less than the whole one of the plurality of resources. The method also includes distributing processes of the first priority group among at least a first subset of the plurality of resources in accordance with a first computer-implemented methodology if the first priority group is deemed a rich.
    Type: Grant
    Filed: December 13, 2002
    Date of Patent: April 15, 2008
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventor: Scott Alan Rhine
  • Patent number: 7313101
    Abstract: A computer-implemented method for filtering, responsive to a logical specification of a network farm and a communication model for the farm, a tree topology network specification to obtain a filtered tree topology network specification is disclosed. The filtered tree topology network specification has fewer devices therein relative to the tree topology network specification, devices needed for constructing the farm being available in the filtered tree topology network specification. The method includes removing a first set of devices and a first set of switching elements from the tree topology network specification starting at the lowest level of the tree topology network specification and working toward the root node of the tree topology network specification. Each device in the first set of devices represents one of a redundant device, a device having a type unneeded by the farm, and a device unavailable for constructing the farm.
    Type: Grant
    Filed: December 20, 2002
    Date of Patent: December 25, 2007
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Scott Alan Rhine, Sharad Singhal, Xiaoyun Zhu
  • Patent number: 7310343
    Abstract: Methods and apparatus for creating a network farm from a tree topology network are disclosed. One method includes receiving a logical specification of the farm, the logical specification specifying at least one of device types required by the farm and a number of devices for each of the device types. The method further includes receiving a communication model for the farm, the communication model specifying expected bandwidth usage for devices of the farm. The method additionally includes ascertaining, responsive to the logical specification and the communication model, a solution set of devices among devices of the tree topology network for constructing the farm.
    Type: Grant
    Filed: December 20, 2002
    Date of Patent: December 18, 2007
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Scott Alan Rhine, Sharad Singhal, Xiaoyun Zhu
  • Publication number: 20040120330
    Abstract: A computer-implemented method for filtering, responsive to a logical specification of a network farm and a communication model for the farm, a tree topology network specification to obtain a filtered tree topology network specification is disclosed. The filtered tree topology network specification has fewer devices therein relative to the tree topology network specification, devices needed for constructing the farm being available in the filtered tree topology network specification. The method includes removing a first set of devices and a first set of switching elements from the tree topology network specification starting at the lowest level of the tree topology network specification and working toward the root node of the tree topology network specification. Each device in the first set of devices represents one of a redundant device, a device having a type unneeded by the farm, and a device unavailable for constructing the farm.
    Type: Application
    Filed: December 20, 2002
    Publication date: June 24, 2004
    Inventors: Scott Alan Rhine, Sharad Singhal, Xiaoyun Zhu
  • Publication number: 20040120331
    Abstract: Methods and apparatus for creating a network farm from a tree topology network are disclosed. One method includes receiving a logical specification of the farm, the logical specification specifying at least one of device types required by the farm and a number of devices for each of the device types. The method further includes receiving a communication model for the farm, the communication model specifying expected bandwidth usage for devices of the farm. The method additionally includes ascertaining, responsive to the logical specification and the communication model, a solution set of devices among devices of the tree topology network for constructing the farm.
    Type: Application
    Filed: December 20, 2002
    Publication date: June 24, 2004
    Inventors: Scott Alan Rhine, Sharad Singhal, Xiaoyun Zhu
  • Publication number: 20040117790
    Abstract: A computer-implemented method for distributing processes among a plurality of resources is disclosed. The processes are associated with a plurality of priority groups. The method includes ascertaining whether a first priority group of the plurality of priority groups is rich, the first priority group of the plurality of groups being deemed rich if the first priority group is entitled to at least a whole one of the plurality of resources, the first priority group of the plurality of groups being deemed poor if the first priority group is entitled to less than the whole one of the plurality of resources. The method also includes distributing processes of the first priority group among at least a first subset of the plurality of resources in accordance with a first computer-implemented methodology if the first priority group is deemed a rich.
    Type: Application
    Filed: December 13, 2002
    Publication date: June 17, 2004
    Inventor: Scott Alan Rhine