Patents by Inventor Anindya Neogi
Anindya Neogi 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: 9164791Abstract: In response to a performance parameter of a virtual machine (VM) exceeding a threshold, an operation to be performed relative to the VM is identified. A resource requirement of performing the operation is determined using a resource requirement thresholds hierarchy. The resource requirement thresholds hierarchy is usable for computing the resource requirement of the operation when the operation is performed at a specified level in a hierarchy within a virtualized environment where the VM is executing. A violation value resulting from performing the operation is determined using a violation value thresholds hierarchy. If the resource requirement and the violation value do not exceed a resource requirement threshold and a violation value threshold respectively, a first configuration of the VM is revised to a second configuration of the VM. The second configuration includes a result of performing the operation relative to the VM at the specified level in the hierarchy.Type: GrantFiled: January 10, 2013Date of Patent: October 20, 2015Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Deepak Arun Deshpande, Anindya Neogi, Priti P. Patil
-
Publication number: 20150149497Abstract: A method is provided for determining problem resolutions within a networked computing environment. The method includes retrieving, by one or more computer processors, event data from within a networked computing environment. The method includes determining, by the one or more computer processors, a characteristic of a database within the networked computing environment, the database storing a plurality of problem resolutions. The method includes determining, by the one or more computer processors, a search query corresponding to the event data and to the characteristic of the database. The method includes performing, by the one or more computer processors, a first search of the database using the search query and then refining, by the one or more computer processors, the search query. The method then includes performing, by the one or more computer processors, at least one additional search of the database using the refined search query.Type: ApplicationFiled: August 25, 2014Publication date: May 28, 2015Inventors: Rose C Kanjirathinkal, Anindya Neogi, Sriram Raghavan
-
Publication number: 20150149541Abstract: Methods, systems, and articles of manufacture for leveraging social media to assist in troubleshooting are provided herein. A method includes extracting user-generated information pertaining to multiple failure scenarios from at least one social media data source; determining one or more causality relationships between a set of log entries associated with the multiple failure scenarios and the extracted user-generated information; identifying a similarity between the one or more determined causality relationships and information contained within a user query; and providing guidance to the user regarding resolving and/or obviating a failure associated with the user query based on said identified similarity.Type: ApplicationFiled: November 26, 2013Publication date: May 28, 2015Applicant: International Business Machines CorporationInventors: Rose Catherine Kanjirathinkal, Sriram Raghavan, Anindya Neogi, Sai Dattathrani
-
Publication number: 20150149450Abstract: A method is provided for determining problem resolutions within a networked computing environment. The method includes retrieving, by one or more computer processors, event data from within a networked computing environment. The method includes determining, by the one or more computer processors, a characteristic of a database within the networked computing environment, the database storing a plurality of problem resolutions. The method includes determining, by the one or more computer processors, a search query corresponding to the event data and to the characteristic of the database. The method includes performing, by the one or more computer processors, a first search of the database using the search query and then refining, by the one or more computer processors, the search query. The method then includes performing, by the one or more computer processors, at least one additional search of the database using the refined search query.Type: ApplicationFiled: November 27, 2013Publication date: May 28, 2015Applicant: International Business Machines CorporationInventors: Rose C. Kanjirathinkal, Anindya Neogi, Sriram Raghavan
-
Patent number: 8959523Abstract: A virtual machine placement framework is described to enable a data center operator to develop a placement scheme to satisfy its particular constraints while simultaneously optimizing resource utilization. To generate a placement solution, the virtual machine placement problem is first characterized as a “bin packing” problem. The framework provides simple interface tools and processing modules, and a pluggable architecture for receiving placement algorithms. To generate a solution, an administrator creates an XML representation that abstracts physical entities (e.g., data center, subnet, rack, physical server, and the like) into a hierarchical tree of bins. The administrator also defines a set of “rules” that govern (direct) the placement of the virtual machines by placing constraints on the placement scheme. Using the hierarchical tree and the rules, the framework is executed to generate a placement as a solution to a bin packing problem, preferably on a layer-by-layer basis.Type: GrantFiled: March 30, 2012Date of Patent: February 17, 2015Assignee: International Business Machines CorporationInventors: Priti P. Patil, Anindya Neogi, Aritra Sen, Akshat Verma
-
Publication number: 20140196030Abstract: In response to a performance parameter of a virtual machine (VM) exceeding a threshold, an operation to be performed relative to the VM is identified. A resource requirement of performing the operation is determined using a resource requirement thresholds hierarchy. The resource requirement thresholds hierarchy is usable for computing the resource requirement of the operation when the operation is performed at a specified level in a hierarchy within a virtualized environment where the VM is executing. A violation value resulting from performing the operation is determined using a violation value thresholds hierarchy. If the resource requirement and the violation value do not exceed a resource requirement threshold and a violation value threshold respectively, a first configuration of the VM is revised to a second configuration of the VM. The second configuration includes a result of performing the operation relative to the VM at the specified level in the hierarchy.Type: ApplicationFiled: January 10, 2013Publication date: July 10, 2014Applicant: International Business Machines CorporationInventors: Deepak Arun Deshpande, Anindya Neogi, Priti P. Patil
-
Publication number: 20140075492Abstract: Identity context-based access control is implemented by generating an identity context expression from user identity data. In particular, users are clustered based on combinations of one or more attributes. These clusters comprise one or more identity context(s). Preferably, an intersection of attribute sets of each user in the cluster is formed. In addition, an intersection of attribute sets of each user not in the cluster also is formed. If the attribute set that is common across the cluster of users is not a subset of the attribute set that is common across the rest of the users, then the attribute set forms a unique identity context expression. To reduce the number of roles used in role-based access control (RBAC), at least one role is replaced with an identity context expression. Run-time access control is then enabled.Type: ApplicationFiled: September 10, 2012Publication date: March 13, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kaushal Kiran Kapadia, Rahul Prabhakar Kulkarni, Nataraj Nagaratnam, Anindya Neogi, Magesh Rajamani
-
Publication number: 20140007093Abstract: In response to a performance parameter of a virtual machine (VM) exceeding a threshold, an operation to be performed relative to the VM is identified. A resource requirement of performing the operation is determined using a resource requirement thresholds hierarchy. The resource requirement thresholds hierarchy is usable for computing the resource requirement of the operation when the operation is performed at a specified level in a hierarchy within a virtualized environment where the VM is executing. A violation value resulting from performing the operation is determined using a violation value thresholds hierarchy. If the resource requirement and the violation value do not exceed a resource requirement threshold and a violation value threshold respectively, a first configuration of the VM is revised to a second configuration of the VM. The second configuration includes a result of performing the operation relative to the VM at the specified level in the hierarchy.Type: ApplicationFiled: July 2, 2012Publication date: January 2, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Deepak Arun Deshpande, Anindya Neogi, Priti P. Patil
-
Publication number: 20130263120Abstract: A virtual machine placement framework is described to enable a data center operator to develop a placement scheme to satisfy its particular constraints while simultaneously optimizing resource utilization. To generate a placement solution, the virtual machine placement problem is first characterized as a “bin packing” problem. The framework provides simple interface tools and processing modules, and a pluggable architecture for receiving placement algorithms. To generate a solution, an administrator creates an XML representation that abstracts physical entities (e.g., data center, subnet, rack, physical server, and the like) into a hierarchical tree of bins. The administrator also defines a set of “rules” that govern (direct) the placement of the virtual machines by placing constraints on the placement scheme. Using the hierarchical tree and the rules, the framework is executed to generate a placement as a solution to a bin packing problem, preferably on a layer-by-layer basis.Type: ApplicationFiled: March 30, 2012Publication date: October 3, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Priti P. Patil, Anindya Neogi, Aritra Sen, Akshat Verma
-
Publication number: 20130054299Abstract: A method, system, and computer program product for user interface for dynamic workflow state management are provided in the illustrative embodiments. A set of steps of a workflow is presented as a set of tabs in a graphical user interface (UI). Each tab includes a visual indicator indicating a status of a corresponding step associated with that tab. Tor a step in the set of steps, a visual indicator in a tab is used to depict a status of the step in the workflow, the visual indicator visually changing with a change in the status of the step. A status update is received for the step. A determination is made whether the status update also includes a status update for a related step in the workflow, A visual indicator corresponding to the related step is changed in accordance with the status update for the related step.Type: ApplicationFiled: August 22, 2011Publication date: February 28, 2013Applicant: International Business Machines CorporationInventors: DEEPAK ARUN DESHPANDE, Anindya Neogi, Priti P. Patil
-
Publication number: 20120215923Abstract: A system and method for managing dynamically allocated resources assigned to a service includes providing a service to be used by a plurality of sites in a federation. Usage information associated with the service is communicated to each of the plurality of sites. A disposition of the service is determined based on local policies and the usage information received from other sites by a service owner. The disposition of the service is updated across a plurality of sites in accordance with messages sent by the service owner to reduce resource usage.Type: ApplicationFiled: April 30, 2012Publication date: August 23, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Ajay Mohindra, Anindya Neogi
-
Patent number: 8244873Abstract: 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: GrantFiled: March 7, 2011Date of Patent: August 14, 2012Assignee: International Business Machines CorporationInventors: Ramesh Baskaran, Sameep Mehta, Anindya Neogi, Vinayaka D. Pandit, Gyana Ranjan Parija, Akshat Verma
-
Patent number: 8230249Abstract: Techniques for dynamically selecting a server state for one or more servers in a cluster of servers are provided. The techniques include tracking each active and sleep state of each server in a cluster of servers, and selecting a server state for one or more servers in the cluster of servers to meet one or more workload level requirements of the cluster of servers, wherein selecting a server state for one or more servers comprises scheduling a transition between one or more active and sleep states for the one or more servers, wherein scheduling the transition comprises using power consumption information for each state and transition time information for each transition.Type: GrantFiled: July 15, 2009Date of Patent: July 24, 2012Assignee: International Business Machines CorporationInventors: Gargi B. Dasgupta, Anindya Neogi, Akshat Verma
-
Publication number: 20120174104Abstract: N applications are placed on M virtualized servers having power management capability. A time horizon is divided into a plurality of time windows, and, for each given one of the windows, a placement of the N applications is computed, taking into account power cost, migration cost, and performance benefit. The migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for the given one of the windows. The N applications are placed onto the M virtualized servers, for each of the plurality of time windows, in accordance with the placement computed in the computing step for each of the windows.Type: ApplicationFiled: March 15, 2012Publication date: July 5, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Anindya Neogi, Akshat Verma
-
Patent number: 8214829Abstract: N applications are placed on M virtualized servers having power management capability. A time horizon is divided into a plurality of time windows, and, for each given one of the windows, a placement of the N applications is computed, taking into account power cost, migration cost, and performance benefit. The migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for the given one of the windows. The N applications are placed onto the M virtualized servers, for each of the plurality of time windows, in accordance with the placement computed in the computing step for each of the windows.Type: GrantFiled: January 15, 2009Date of Patent: July 3, 2012Assignee: International Business Machines CorporationInventors: Anindya Neogi, Akshat Verma
-
Publication number: 20120144219Abstract: A method, system and computer-usable medium are disclosed for optimizing the power consumption of a plurality of information processing systems. Historical usage data representing power usage of a plurality of information processing systems is retrieved in response to a request to generate power savings recommendations. Statistical analysis is performed on the historical usage data are to determine usage patterns, which are then further analyzed to determine repetitions of the usage patterns. In turn, the repetitions of the usage patterns are analyzed to generate power consumption management recommendations to initiate power consumption management actions at particular times. One or more business constraints are determined, which are used to generate constraints to the power consumption management recommendations.Type: ApplicationFiled: December 6, 2010Publication date: June 7, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Abdolreza Salahshour, Samar Choudhary, Gargi B. Dasgupta, Anindya Neogi, Balan Subramanian, Akshat Verma
-
Patent number: 8161058Abstract: A method of identifying at least one resource in a distributed computing system which is a potential root cause of performance degradation of the system includes the steps of: computing operational bounds for the system and operational bounds for at least one resource in the system; comparing current end-to-end system performance with the operational bounds for the system; when the current end-to-end system performance is outside of the operational bounds for the system, comparing current performance of the at least one resource in the system with the operational bounds for the at least one resource; and generating at least one output identifying the at least one resource in the system which is a potential root cause of performance degradation of the system.Type: GrantFiled: March 27, 2008Date of Patent: April 17, 2012Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Gautam Kar, Anindya Neogi, Anca Sailer
-
Patent number: 8132180Abstract: Described are methods, apparatus and computer programs for determining run-time dependencies between logical components of a data processing environment. Components of the data processing environment are monitored by monitoring agents accessing run-time activity data via APIs of the managed system. A dependency generator identifies correlations between the run-time activity of the monitored components. For synchronous monitored systems, the dependency generator calculates an activity period for monitored components and determines which component's activity periods contain the activity periods of other components. Containment is used as an indicator of a likely dependency relationship, and a weighting is computed for each dependency relationship based on the consistency of containment.Type: GrantFiled: April 7, 2008Date of Patent: March 6, 2012Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Manish Gupta, Gautam Kar, Parviz Kermani, Anindya Neogi
-
Publication number: 20120004951Abstract: A method for tracking metrics, goals and personal accomplishments may include receiving, by a processing device, each electronic message tagged by the employee as a personal accomplishment. The method may also include storing each tagged electronic message, by the processing device, in a database associate with a personal accomplishments tracking system. The method may additionally include providing, by the processing device, each tagged electronic message to the employee for sorting and analysis.Type: ApplicationFiled: June 30, 2010Publication date: January 5, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: REKHA D. GARAPATI, SUBRAMANIAN KRISHNAMURTHY, ANINDYA NEOGI, ATUL SAXENA
-
Patent number: 8006230Abstract: Described are methods, apparatus and computer programs for determining run-time dependencies between logical components of a data processing environment. Components of the data processing environment are monitored by monitoring agents accessing run-time activity data via APIs of the managed system. A dependency generator identifies correlations between the run-time activity of the monitored components. For synchronous monitored systems, the dependency generator calculates an activity period for monitored components and determines which component's activity periods contain the activity periods of other components. Containment is used as an indicator of a likely dependency relationship, and a weighting is computed for each dependency relationship based on the consistency of containment.Type: GrantFiled: April 7, 2008Date of Patent: August 23, 2011Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Manish Gupta, Gautam Kar, Parviz Kermani, Anindya Neogi