Patents by Inventor Jeffrey Kephart
Jeffrey Kephart 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: 9052895Abstract: Systems, apparatuses, methods, and software that implement power budget allocation optimization algorithms in multi-processor systems, such as server farms. The algorithms are derived from a queuing theoretic model that minimizes the mean response time of the system to the jobs in the workload while accounting for a variety of factors. These factors include, but are not necessarily limited to, the type of power (frequency) scaling mechanism(s) available within the processors in the system, the power-to-frequency relationship(s) of the processors for the scaling mechanism(s) available, whether or not the system is an open or closed loop system, the arrival rate of jobs incoming into the system, the number of jobs within the system, and the type of workload being processed.Type: GrantFiled: April 7, 2011Date of Patent: June 9, 2015Assignees: International Business Machines, Carnegie Mellon UniversityInventors: Mor Harchol-Balter, Anshul Gandhi, Rajarshi Das, Jeffrey Kephart
-
Publication number: 20120084580Abstract: Systems, apparatuses, methods, and software that implement power budget allocation optimization algorithms in multi-processor systems, such as server farms. The algorithms are derived from a queuing theoretic model that minimizes the mean response time of the system to the jobs in the workload while accounting for a variety of factors. These factors include, but are not necessarily limited to, the type of power (frequency) scaling mechanism(s) available within the processors in the system, the power-to-frequency relationship(s) of the processors for the scaling mechanism(s) available, whether or not the system is an open or closed loop system, the arrival rate of jobs incoming into the system, the number of jobs within the system, and the type of workload being processed.Type: ApplicationFiled: April 7, 2011Publication date: April 5, 2012Applicants: International Business Machines, Carnegie Mellon UniversityInventors: Mor Harchol-Balter, Anshul Gandhi, Rajarshi Das, Jeffrey Kephart
-
Publication number: 20070016824Abstract: Techniques for globally managing systems are provided. One or more measurable effects of at least one hypothetical action to achieve a management goal are determined at a first system manager. The one or more measurable effects are sent from the first system manager to a second system manager. At the second system manager, one or more procedural actions to achieve the management goal are determined in response to the one or more received measurable effects. The one or more procedural actions are executed to achieve the management goal.Type: ApplicationFiled: July 14, 2006Publication date: January 18, 2007Applicant: International Business Machines CorporationInventors: John Bivens, David Chess, Donna Dillenberger, Steven Froehlich, James Hanson, Mark Hulber, Jeffrey Kephart, Giovanni Pacifici, Michael Spreitzer, Asser Tantawi, Mathew Thoennes, Ian Whalley, Peter Yocom
-
Publication number: 20060149821Abstract: A method for detecting undesirable emails is disclosed. The method combines input from two or more spam classifiers to provide improved classification effectiveness and robustness. The method's effectiveness is improved over that of any one constituent classifier in the sense that the detection rate is increased and/or the false positive rate is decreased. The method's robustness is improved in the sense that, if spammers temporarily elude any one constituent classifier, the other constituent classifiers will still be likely to catch the spam. The method includes obtaining a score from each of a plurality of constituent spam classifiers by applying them to a given input email. The method further includes obtaining a combined spam score from a combined spam classifier that takes as input the plurality of constituent spam classifier scores, the combined spam classifier being computed automatically in accordance with a specified false-positive vs. false-negative tradeoff.Type: ApplicationFiled: January 4, 2005Publication date: July 6, 2006Inventors: Vadakkedathu Rajan, Mark Wegman, Richard Segal, Jason Crawford, Jeffrey Kephart, Shlomo Hershkop
-
Publication number: 20060149820Abstract: A method for detecting undesirable e-mails is disclosed. The method includes collecting a plurality of undesirable e-mails, arranging the plurality of undesirable e-mails into a plurality of groups and generating, for each group, at least one token, thereby producing a plurality of tokens for the plurality of undesirable e-mails. The method further includes receiving a first e-mail and generating at least one token for the first e-mail. The method further includes causing a comparison of the at least one token for the first e-mail with at least one of the plurality of tokens for the plurality of undesirable e-mails and identifying the first e-mail as an undesirable e-mail if the at least one token for the first e-mail matches any of the plurality of tokens for the plurality of undesirable e-mails.Type: ApplicationFiled: January 4, 2005Publication date: July 6, 2006Inventors: Vadakkedathu Rajan, Mark Wegman, Richard Segal, Jason Crawford, Joel Ossher, Jeffrey Kephart
-
Publication number: 20060026570Abstract: The present invention is directed to systems and methods that treat the monitoring of a software application as a separate and independent concern from the software application itself. The present invention utilizes aspect oriented programming to intercept, analyze, decompose the application states of a software application and then to link appropriate non-invasive constructs into the software application code to provide application state information to an autonomic manager through a plurality of sensors. The autonomic manager analyzes the application state information for compliance pre-defined parameters, and takes appropriate corrective action including modifying the software application states using a plurality of effectors. The sensors and effectors are linked as non-invasive constructs to the software application, and in aspect oriented programming constitute aspects.Type: ApplicationFiled: August 2, 2004Publication date: February 2, 2006Inventors: Hoi Chan, Trieu Chieu, Jeffrey Kephart
-
Method and apparatus for utility-based dynamic resource allocation in a distributed computing system
Publication number: 20050172291Abstract: In one embodiment, the present invention is a method for allocation of finite computational resources amongst multiple entities, wherein the method is structured to optimize the business value of an enterprise providing computational services. One embodiment of the inventive method involves establishing, for each entity, a service level utility indicative of how much business value is obtained for a given level of computational system performance. The service-level utility for each entity is transformed into a corresponding resource-level utility indicative of how much business value may be obtained for a given set or amount of resources allocated to the entity. The resource-level utilities for each entity are aggregated, and new resource allocations are determined and executed based upon the resource-level utility information. The invention is thereby capable of making rapid allocation decisions, according to time-varying need or value of the resources by each of the entities.Type: ApplicationFiled: January 30, 2004Publication date: August 4, 2005Inventors: Rajarshi Das, Jeffrey Kephart, Gerald Tesauro, William Walsh -
Publication number: 20050091364Abstract: A system and method for providing real-time, dynamic switching between first and second service providers each capable of providing a service for users over a communications network. The method includes steps of: establishing switching criterion for deciding when to switch service provision between the first service provider and second service provider; maintaining state information associated with a user's use of the service provided by a first service provider; switching between the first and second service provided over the communications network based on satisfaction of the switching criterion; and, migrating any state information maintained up to the time of switching to the second service. Preferably, the dynamic switching occurs in a manner substantially transparent to the user.Type: ApplicationFiled: September 30, 2003Publication date: April 28, 2005Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David Bantz, David Chess, Christos Georgiou, Jeffrey Kephart, Clifford Pickover
-
Publication number: 20050010388Abstract: An improved method and system for performing dynamic online multi-parameter optimization for autonomic computing systems are provided. With the method and system of the present invention, a simplex, i.e. a set of points in the parameter space that has been directly sampled, is maintained. The system's performance with regard to a particular utility value is measured for the particular setting of configuration parameters associated with each point in the simplex. A new sample point is determined using the geometric transformations of the simplex. The method and system provide mechanisms for limiting the size of the simplex that is generated through these geometric transformations so that the present invention may be implemented in noisy environments in which the same configuration settings may lead to different results with regard to the utility value. In addition, mechanisms are provided for resampling a current best point in the simplex to determine if the environment has changed.Type: ApplicationFiled: October 31, 2003Publication date: January 13, 2005Applicant: International Business Machines CorporationInventors: Saurabh Bagchi, Rajarshi Das, Yixin Diao, Marc Kaplan, Jeffrey Kephart