Patents by Inventor Ramesh Baskaran

Ramesh Baskaran 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: 8244873
    Abstract: A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins.
    Type: Grant
    Filed: March 7, 2011
    Date of Patent: August 14, 2012
    Assignee: International Business Machines Corporation
    Inventors: Ramesh Baskaran, Sameep Mehta, Anindya Neogi, Vinayaka D. Pandit, Gyana Ranjan Parija, Akshat Verma
  • Publication number: 20110161470
    Abstract: A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins.
    Type: Application
    Filed: March 7, 2011
    Publication date: June 30, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ramesh Baskaran, Sameep Mehta, Anindya Neogi, Vinayaka D. Pandit, Gyana Ranjan Parija, Akshat Verma
  • Patent number: 7970905
    Abstract: A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins.
    Type: Grant
    Filed: July 3, 2008
    Date of Patent: June 28, 2011
    Assignee: International Business Machines Corporation
    Inventors: Ramesh Baskaran, Sameep Mehta, Anindya Neogi, Vinayaka D. Pandit, Gyana Ranjan Parija, Akshat Verma
  • Publication number: 20100005173
    Abstract: A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins.
    Type: Application
    Filed: July 3, 2008
    Publication date: January 7, 2010
    Applicant: International Business Machines Corporation
    Inventors: Ramesh Baskaran, Sameep Mehta, Anindya Neogi, Vinayaka D. Pandit, Gyana Ranjan Parija, Akshat Verma