公开(公告)号：US07664774B2

公开(公告)日：2010-02-16

申请号：US11345593

申请日：2006-02-01

申请人： Sanjay Agrawal ,  Lik Han Chu ,  Vivek R. Narasayya

发明人： Sanjay Agrawal ,  Lik Han Chu ,  Vivek R. Narasayya

IPC分类号： G06F7/00 ,  G06F12/00 ,  G06F17/00

CPC分类号： G06F17/30587 ,  Y10S707/99943

摘要： The subject disclosure pertains to exploitation of sequence information in a workload for the purpose of performance tuning. An optimal or exhaustive approach to tune sequences by mapping to a shortest path problem is provided as well as powerful techniques that result in optimal or nearly optimal solutions. Also disclosed is greedy approach that is much more efficient than the optimal approach and yet also generates solutions of comparable quality. Further yet, systems and methods are provided that facilitate extraction of sequence information and implementation of recommendations.

摘要翻译： 本发明涉及为了进行性能调整而在工作负载中利用序列信息。 提供了通过映射到最短路径问题来优化序列的最佳或穷尽方法，以及导致最佳或接近最优解的强大技术。 还披露了比最佳方法更有效的贪心方法，但也产生了可比较质量的解决方案。 此外，还提供了有助于提取序列信息和实施建议的系统和方法。

公开(公告)号：US20070192280A1

公开(公告)日：2007-08-16

申请号：US11345593

申请日：2006-02-01

申请人： Sanjay Agrawal ,  Lik Han Chu ,  Vivek Narasayya

发明人： Sanjay Agrawal ,  Lik Han Chu ,  Vivek Narasayya

IPC分类号： G06F17/30

CPC分类号： G06F17/30587 ,  Y10S707/99943

摘要： The subject disclosure pertains to exploitation of sequence information in a workload for the purpose of performance tuning. An optimal or exhaustive approach to tune sequences by mapping to a shortest path problem is provided as well as powerful techniques that result in optimal or nearly optimal solutions. Also disclosed is greedy approach that is much more efficient than the optimal approach and yet also generates solutions of comparable quality. Further yet, systems and methods are provided that facilitate extraction of sequence information and implementation of recommendations.

摘要翻译： 本发明涉及为了进行性能调整而在工作负载中利用序列信息。 提供了通过映射到最短路径问题来优化序列的最佳或穷尽方法，以及导致最佳或接近最优解的强大技术。 还披露了比最佳方法更有效的贪心方法，但也产生了可比较质量的解决方案。 此外，还提供了有助于提取序列信息和实施建议的系统和方法。