Patents by Inventor Jayram S. Thathachar
Jayram S. Thathachar 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: 9285242Abstract: Methods and arrangements for determining a network connectivity model. Meters are interfaced with, and periodic synchronous power-related measurements are collected from different meters. Measurement messages are sent to a predetermined location for being consolidated and processed, and a network connectivity model is thereupon determined.Type: GrantFiled: July 31, 2012Date of Patent: March 15, 2016Assignee: International Business Machines CorporationInventors: Vijay Arya, Shivkumar Kalyanaraman, Devasenapathi Periagraharam Seetharamakrishnan, Jayram S. Thathachar
-
Publication number: 20140039818Abstract: Methods and arrangements for determining a network connectivity model. Meters are interfaced with, and periodic synchronous power-related measurements are collected from different meters. Measurement messages are sent to a predetermined location for being consolidated and processed, and a network connectivity model is thereupon determined.Type: ApplicationFiled: July 31, 2012Publication date: February 6, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Vijay Arya, Shivkumar Kalyanaraman, Devasenapathi Periagraharam Seetharamakrishnan, Jayram S. Thathachar
-
Publication number: 20110251976Abstract: A method for efficiently approximating cascaded aggregates in a data stream in a single pass over a dataset, with entries presented to the methodology in an arbitrary order includes receiving out-of-order data entries in the data stream, aggregating particular data entries into aggregated data sets from the data stream based on a first characteristic of the data entries, computing a normalized Euclidean norm around mean values of each of the aggregated data sets, calculating an average of all of the normalized Euclidean norms of each of the aggregated data sets, and calculating a value based on the first characteristic as a result of calculating the average of all of the normalized Euclidean norms.Type: ApplicationFiled: April 13, 2010Publication date: October 13, 2011Applicant: International Business Machines CorporationInventors: Jayram S. Thathachar, David P. Woodruff
-
Patent number: 7797326Abstract: Disclosed is a method of scanning a data stream in a single pass to obtain uniform data samples from selected intervals. The method comprises randomly selecting elements from the stream for storage in one or more data buckets and, then, randomly selecting multiple samples from the bucket(s). Each sample is associated with a specified interval immediately prior to a selected point in time. There is a balance of probabilities between the selection of elements stored in the bucket and the selection of elements included in the samples so that elements scanned during the specified interval are included in the sample with equal probability. Samples can then be used to estimate the degree of sortedness of the stream, based on counting how many elements in the sequence are the rightmost point of an interval such that majority of the interval's elements are inverted with respect to the interval's rightmost element.Type: GrantFiled: April 18, 2006Date of Patent: September 14, 2010Assignee: International Business Machines CorporationInventors: Parikshit Gopalan, Robert Krauthgamer, Jayram S. Thathachar
-
Patent number: 7765301Abstract: A benefit task system implements a policy for allocating resources to yield some benefit. The method implemented may be applied to a variety of problems, and the benefit may be either tangible (e.g., profit) or intangible (e.g., customer satisfaction). In one example, the method is applied to server allocation in a Web site server “farm” given full information regarding future loads to maximize profits for the Web hosting service provider. In another example, the method is applied to the allocation of telephone help in a way to improve customer satisfaction. In yet another example, the method is applied to distributed computing problem where the resources to be allocated are general purpose computers connected in a network and used to solve computationally intensive problems.Type: GrantFiled: February 13, 2006Date of Patent: July 27, 2010Assignee: International Business Machines CorporationInventors: Tracy J. Kimbrel, Robert Krauthgamer, Maria Minkoff, Baruch M. Schieber, Maxim I. Sviridenko, Jayram S. Thathachar
-
Patent number: 7546247Abstract: A method for server allocation in a Web server “farm” is based on limited information regarding future loads to achieve close to the greatest possible revenue based on the assumption that revenue is proportional to the utilization of servers and differentiated by customer class. The method of server allocation uses an approach of “discounting the future”. Specifically, when the policy faces the choice between a guaranteed benefit immediately and a potential benefit in the future, the decision is made by comparing the guaranteed benefit value with a discounted value of the potential future benefit. This discount factor is exponential in the number of time units that it would take a potential benefit to be materialized. The future benefits are discounted because by the time a benefit will be materialized, things might change and the algorithm might decide to make another choice for a potential (even greater) benefit.Type: GrantFiled: September 26, 2007Date of Patent: June 9, 2009Assignee: International Business Machines CorporationInventors: Tracy J. Kimbrel, Robert Krauthgarner, Baruch M. Schieber, Maxim I. Sviridenko, Jayram S. Thathachar
-
Patent number: 7308415Abstract: A method for server allocation in a Web server “farm” is based on limited information regarding future loads to achieve close to the greatest possible revenue based on the assumption that revenue is proportional to the utilization of servers and differentiated by customer class. The method of server allocation uses an approach of “discounting the future”. Specifically, when the policy faces the choice between a guaranteed benefit immediately and a potential benefit in the future, the decision is made by comparing the guaranteed benefit value with a discounted value of the potential future benefit. This discount factor is exponential in the number of time units that it would take a potential benefit to be materialized. The future benefits are discounted because by the time a benefit will be materialized, things might change and the algorithm might decide to make another choice for a potential (even greater) benefit.Type: GrantFiled: December 4, 2001Date of Patent: December 11, 2007Assignee: International Business Machines CorporationInventors: Tracy J. Kimbrel, Robert Krauthgamer, Maria Minkoff, Baruch M. Schieber, Maxim I. Sviridenko, Jayram S. Thathachar
-
Patent number: 7130777Abstract: Disclosed is a system, method, and program storage device of aggregating opinions comprising consolidating a plurality of expressed opinions on various dimensions of topics as discrete probability distributions, generating an aggregate opinion as a single point probability distribution by minimizing a sum of weighted divergences between a plurality of the discrete probability distributions, and presenting the aggregate opinion as a Bayesian network, wherein the divergences comprise Kullback-Liebler distance divergences, and wherein the expressed opinions are generated by experts and comprise opinions on sentiments of products and services. Moreover, the aggregate opinion predicts success of the products and services. Furthermore, the experts are arranged in a hierarchy of knowledge, wherein the knowledge comprises the various dimensions of topics for which opinions may be expressed upon.Type: GrantFiled: November 26, 2003Date of Patent: October 31, 2006Assignee: International Business Machines CorporationInventors: Ashutosh Garg, Jayram S. Thathachar, Shivakumar Vaithyanathan, Huaiyu Zhu
-
Patent number: 7120621Abstract: A system and method are described for constructing and implementing generic software agents for automated tuning of computer systems and applications. The framework defines the modules and interfaces to allow agents to be created in a modular fashion. The specifics of the target system are captured by adaptors that provide a uniform interface to the target system. Data in the agent is managed by a metric manager, and controller modules implement the desired control algorithms. The modular structure and common interfaces allow for the construction of generic agents that are applicable to a wide variety of target systems, and can use a wide variety of control algorithms.Type: GrantFiled: January 29, 2002Date of Patent: October 10, 2006Assignee: International Business Machines CorporationInventors: Joseph Phillip Bigus, Joseph L. Hellerstein, Sujay Parekh, Jeffrey Robert Pilgrim, Donald A. Schlosnagle, Mark S. Squillante, Jayram S. Thathachar
-
Patent number: 7085837Abstract: A benefit task system implements a policy for allocating resources to yield some benefit. The method implemented may be applied to a variety of problems, and the benefit may be either tangible (e.g., profit) or intangible (e.g., customer satisfaction). In one example, the method is applied to server allocation in a Web site server “farm” given full information regarding future loads to maximize profits for the Web hosting service provider. In another example, the method is applied to the allocation of telephone help in a way to improve customer satisfaction. In yet another example, the method is applied to distributed computing problem where the resources to be allocated are general purpose computers connected in a network and used to solve computationally intensive problems.Type: GrantFiled: December 4, 2001Date of Patent: August 1, 2006Assignee: International Business Machines CorporationInventors: Tracy J. Kimbrel, Robert Krauthgamer, Baruch M. Schieber, Maxim I. Sviridenko, Jayram S. Thathachar, Maria Minkoff
-
Patent number: 6925452Abstract: A method and system are described for end-user transaction recognition based on server data such as sequences of remote procedure calls (RPCs). The method may comprise machine-learning techniques for pattern recognition such as Bayesian classification, feature extraction mechanisms, and a dynamic-programming approach to segmentation of RPC sequences. The method preferably combines information-theoretic and machine-learning approaches. The system preferably includes a learning engine and an operation engine. A learning engine may comprise a data preparation subsystem (feature extraction) and a Bayes Net learning subsystem (model construction). The operation engine may comprise transaction segmentation and transaction classification subsystems.Type: GrantFiled: May 22, 2000Date of Patent: August 2, 2005Assignee: International Business Machines CorporationInventors: Joseph L. Hellerstein, Irina Rish, Jayram S. Thathachar
-
Patent number: 6718358Abstract: A system and method is described for generic automated tuning for performance management. The system comprises a target to be controlled and a generic automated tuning agent (GATA) that performs this control. The controlled target provides interfaces to metrics relating to workload, service levels, and configuration information, as well as a means to adjust tuning controls that determine resource allocations within the target. The GATA inputs the metrics, estimates new tuning control settings based on service objectives specified by administrators, and outputs the tuning control settings.Type: GrantFiled: March 31, 2000Date of Patent: April 6, 2004Assignee: International Business Machines CorporationInventors: Joseph Phillip Bigus, Joseph L. Hellerstein, Mark S. Squillante, Jayram S. Thathachar
-
Publication number: 20030144983Abstract: A system and method are described for constructing and implementing generic software agents for automated tuning of computer systems and applications. The framework defines the modules and interfaces to allow agents to be created in a modular fashion. The specifics of the target system are captured by adaptors that provide a uniform interface to the target system. Data in the agent is managed by a metric manager, and controller modules implement the desired control algorithms. The modular structure and common interfaces allow for the construction of generic agents that are applicable to a wide variety of target systems, and can use a wide variety of control algorithms.Type: ApplicationFiled: January 29, 2002Publication date: July 31, 2003Applicant: International Business Machines CorporationInventors: Joseph Phillip Bigus, Joseph L. Hellerstein, Sujay Parekh, Jeffrey Robert Pilgrim, Donald A. Schlosnagle, Mark S. Squillante, Jayram S. Thathachar
-
Publication number: 20030105868Abstract: A benefit task system implements a policy for allocating resources to yield some benefit. The method implemented may be applied to a variety of problems, and the benefit may be either tangible (e.g., profit) or intangible (e.g., customer satisfaction). In one example, the method is applied to server allocation in a Web site server “farm” given full information regarding future loads to maximize profits for the Web hosting service provider. In another example, the method is applied to the allocation of telephone help in a way to improve customer satisfaction. In yet another example, the method is applied to distributed computing problem where the resources to be allocated are general purpose computers connected in a network and used to solve computationally intensive problems.Type: ApplicationFiled: December 4, 2001Publication date: June 5, 2003Inventors: Tracy J. Kimbrel, Robert Krauthgamer, Baruch M. Schieber, Maxim I. Sviridenko, Jayram S. Thathachar
-
Publication number: 20030105655Abstract: A method for server allocation in a Web server “farm” is based on limited information regarding future loads to achieve close to the greatest possible revenue based on the assumption that revenue is proportional to the utilization of servers and differentiated by customer class. The method of server allocation uses an approach of “discounting the future”. Specifically, when the policy faces the choice between a guaranteed benefit immediately and a potential benefit in the future, the decision is made by comparing the guaranteed benefit value with a discounted value of the potential future benefit. This discount factor is exponential in the number of time units that it would take a potential benefit to be materialized. The future benefits are discounted because by the time a benefit will be materialized, things might change and the algorithm might decide to make another choice for a potential (even greater) benefit.Type: ApplicationFiled: December 4, 2001Publication date: June 5, 2003Inventors: Tracy J. Kimbrel, Robert Krauthgamer, Maria Minkoff, Baruch M. Schieber, Maxim I. Sviridenko, Jayram S. Thathachar