Patents by Inventor John Morgan Oslake

John Morgan Oslake 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).

  • Publication number: 20090006071
    Abstract: A method and system for defining performance models of distributed applications such as distributed systems or network systems in a way that combines discrete and analytical models and simulating such performance models for analyzing software performance and impacts on devices of the distributed applications is described. Also described is a method for accelerating the simulation process by converting the discrete load into aggregate load dynamically based on the statistical analysis of the simulation results.
    Type: Application
    Filed: June 29, 2007
    Publication date: January 1, 2009
    Applicant: Microsoft Corporation
    Inventors: Pavel A. Dournov, John Morgan Oslake, Glenn R. Peterson, Jonathan C. Hardwick, Hemanth Kaza
  • Publication number: 20070271560
    Abstract: To determine whether to deploy a candidate VM to a candidate host, taking into consideration resources available from the candidate host and resources required by the candidate VM, a sub-rating is calculated for each of several resources available from the candidate host, where the sub-rating for the resource corresponds to an amount of the resource that is free after the candidate VM is deployed to the candidate host. Thereafter, a rating is calculated from the calculated sub-ratings to characterize how well the candidate host can accommodate the candidate VM. The rating for the candidate host are presented to a selector that determines whether to deploy the candidate VM to the candidate host based on the rating thereof.
    Type: Application
    Filed: May 18, 2006
    Publication date: November 22, 2007
    Applicant: Microsoft Corporation
    Inventors: Brian M. Wahlert, Rene Antonio Vega, Robert Gibson, Robert M. Fries, William L. Scheidel, Pavel A. Dournov, John Morgan Oslake
  • Patent number: 7284146
    Abstract: Availability of a clustered system is determined by identifying all possible states of a cluster, mapping the connections between the states are mapped and determining the probability of the cluster being in each of the states is determined. Availability of the cluster is the sum of the probabilities of being in those states in which the cluster is at least partially available. Parameters affecting the availability of the cluster include the rates at which a cluster transitions from state to state, including the reciprocal of Mean Time To Fail, Mean Time to Fail-Over, Mean Time To Fail-Back and Mean Time To Restore. Availability of statefull and stateless clusters may be determined. Availability of clusters including any number of nodes (e.g., a Internet service) can be determined. In one embodiment of the invention, a target availability is determined and parameters are varied to determine the most efficient approach to reach the target availability.
    Type: Grant
    Filed: January 12, 2006
    Date of Patent: October 16, 2007
    Assignee: Microsoft Corporation
    Inventors: David Edward Guimbellot, John Morgan Oslake
  • Patent number: 7024580
    Abstract: Availability of a clustered system is determined by identifying all possible states of a cluster, mapping the connections between the states are mapped and determining the probability of the cluster being in each of the states is determined. Availability of the cluster is the sum of the probabilities of being in those states in which the cluster is at least partially available. Parameters affecting the availability of the cluster include the rates at which a cluster transitions from state to state, including the reciprocal of Mean Time To Fail, Mean Time to Fail-Over, Mean Time To Fail-Back and Mean Time To Restore. Availability of statefull and stateless clusters may be determined. Availability of clusters including any number of nodes (e.g., a Internet service) can be determined. In one embodiment of the invention, a target availability is determined and parameters are varied to determine the most efficient approach to reach the target availability.
    Type: Grant
    Filed: November 15, 2002
    Date of Patent: April 4, 2006
    Assignee: Microsoft Corporation
    Inventors: David Edward Guimbellot, John Morgan Oslake
  • Publication number: 20040153866
    Abstract: Availability of a clustered system is determined by identifying all possible states of a cluster, mapping the connections between the states are mapped and determining the probability of the cluster being in each of the states is determined. Availability of the cluster is the sum of the probabilities of being in those states in which the cluster is at least partially available. Parameters affecting the availability of the cluster include the rates at which a cluster transitions from state to state, including the reciprocal of Mean Time To Fail, Mean Time to Fail-Over, Mean Time To Fail-Back and Mean Time To Restore. Availability of statefull and stateless clusters may be determined. Availability of clusters including any number of nodes (e.g., a Internet service) can be determined. In one embodiment of the invention, a target availability is determined and parameters are varied to determine the most efficient approach to reach the target availability.
    Type: Application
    Filed: November 15, 2002
    Publication date: August 5, 2004
    Applicant: Microsoft Corporation
    Inventors: David Edward Guimbellot, John Morgan Oslake