Electrical computers and digital processing systems: interprogra – Interprogram communication using message
Reexamination Certificate
2011-03-29
2011-03-29
Sough, Hyung S (Department: 2194)
Electrical computers and digital processing systems: interprogra
Interprogram communication using message
C706S012000
Reexamination Certificate
active
07917911
ABSTRACT:
An application is monitored to identify different execution paths, e.g., sequences of invoked components, which occur due to the receipt of messages by the application. Similarities between the execution paths are determined based on a distance algorithm, in one approach, and execution paths which are similar are assigned to a common group. Additionally, application runtime data such as response times is obtained for the execution paths and aggregated for the group. The messages can also be grouped based on the grouping of the execution paths. Further, a representative execution path can be determined for each execution path group for comparison to subsequent execution paths. A representative message can similarly be determined for each message group. Results can be reported which include a group identifier, representative message, representative execution path, count, and aggregated runtime data.
REFERENCES:
patent: 4774681 (1988-09-01), Frisch
patent: 5375199 (1994-12-01), Harrow
patent: 5426730 (1995-06-01), Miyake
patent: 5655081 (1997-08-01), Bonnell
patent: 5784553 (1998-07-01), Kolawa
patent: 5790858 (1998-08-01), Vogel
patent: 5862381 (1999-01-01), Advani
patent: 5898873 (1999-04-01), Lehr
patent: 5940618 (1999-08-01), Blandy
patent: 5978594 (1999-11-01), Bonnell
patent: 5996092 (1999-11-01), Augsburg
patent: 6141699 (2000-10-01), Luzzi
patent: 6260187 (2001-07-01), Cirne
patent: 6263298 (2001-07-01), Kerman
patent: 6266805 (2001-07-01), Nwana
patent: 6282701 (2001-08-01), Wygodny
patent: 6295642 (2001-09-01), Blandy
patent: 6332212 (2001-12-01), Organ
patent: 6332213 (2001-12-01), Grossman
patent: 6530075 (2003-03-01), Beadle
patent: 6611276 (2003-08-01), Muratori
patent: 6643842 (2003-11-01), Angel
patent: 6654741 (2003-11-01), Cohen
patent: 6658367 (2003-12-01), Conrad
patent: 6792460 (2004-09-01), Oulu
patent: 6941367 (2005-09-01), Vosseler
patent: 7076695 (2006-07-01), McGee
patent: 7093013 (2006-08-01), Hornok, Jr.
patent: 7376752 (2008-05-01), Chudnovsky et al.
patent: 2002/0029265 (2002-03-01), Mizoguchi
patent: 2002/0038228 (2002-03-01), Waldorf
patent: 2002/0073195 (2002-06-01), Hellerstein
patent: 2002/0099731 (2002-07-01), Abajian
patent: 2002/0169870 (2002-11-01), Vosseler
patent: 2002/0174222 (2002-11-01), Cox
patent: 2002/0198985 (2002-12-01), Fraenkel
patent: 2003/0009507 (2003-01-01), Shum
patent: 2003/0018909 (2003-01-01), Cuomo
patent: 2003/0065986 (2003-04-01), Fraenkel
patent: 2003/0079160 (2003-04-01), McGee et al.
patent: 2003/0158895 (2003-08-01), Mehra
patent: 2003/0191989 (2003-10-01), O'Sullivan
patent: 2004/0003375 (2004-01-01), George
patent: 2004/0042430 (2004-03-01), Addy
patent: 2004/0068560 (2004-04-01), Oulu
patent: 2004/0075690 (2004-04-01), Cirne
patent: 2004/0078691 (2004-04-01), Cirne et al.
patent: 2004/0123279 (2004-06-01), Boykin
patent: 2004/0215762 (2004-10-01), Oulu
patent: 2004/0215768 (2004-10-01), Oulu
patent: 2004/0254920 (2004-12-01), Brill
patent: 2005/0021748 (2005-01-01), Garcea
patent: 2005/0039187 (2005-02-01), Avakian
patent: 2005/0049924 (2005-03-01), DeBettencourt
patent: 2005/0055437 (2005-03-01), Burckart
patent: 2005/0060372 (2005-03-01), DeBettencourt
patent: 2005/0114508 (2005-05-01), DeStefano
patent: 2005/0149360 (2005-07-01), Galperin
patent: 2005/0228890 (2005-10-01), Lawrence
patent: 2005/0229165 (2005-10-01), Ma
patent: 2006/0095569 (2006-05-01), O'Sullivan
patent: 2006/0095570 (2006-05-01), O'Sullivan
patent: 2006/0104518 (2006-05-01), Yang
patent: 2006/0218143 (2006-09-01), Najork
patent: 2007/0005782 (2007-01-01), Zheng
patent: 2007/0266149 (2007-11-01), Cobb
patent: 2008/0034082 (2008-02-01), McKinney
patent: 2008/0104062 (2008-05-01), Oliver
patent: 2008/0134209 (2008-06-01), Bansal et al.
patent: 1024430 (2000-02-01), None
Andrew Foss; W. Wang; O. Zaïane. A Non-Parametric Approach to Web Log Analysis. Presented at Workshop on Web Mining Midland Hotel, Chicago, Illinois (Apr. 7, 2001). [Retrieved from http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.6609 on Nov. 12, 2009].
Natheer Khasawneh. Toward Better Website Usage: Leveraging Data Mining Techniques and Rough Set Learning to Construct Better-To-Use Websites. Dissertation, University of Akron (Aug. 2005). [Retrieved from http://etd.ohiolink.edu/send-pdf.cgi/Khasawneh%20Natheer%20Yousef.pdf?acc—num=akron1120534472 on Nov. 12, 2009].
T.A. Runkler; J.C. Bezdek. Web Mining With Relational Clustering. International Journal of Approximate Reasoning. vol. 32 (2003). pp. 217-236.
Fred J. Damerau. A Technique for Computer Detection and Correction of Spelling Errors. Communicaitons of the ACM. vol. 7, No. 3 (Mar. 1964). pp. 171-176.
S. Guha, R. Rastogi, and K. Shim, “ROCK: A Robust Clustering Algorithm for Categorical Attributes,” Proceedings of the 15th International Conference in on Data Engineering, pp. 512-521 (Mar. 23-26, 1999) [retrieved from http://linkinghub.elsevier.com/retrieve/pii/S0306437900000223 on May 17, 2010].
D. Reilly and M Reilly, Java Network Programming and Distributed Computing, Person Education Inc., Boston, MA, pp. 237-314 (2000).
I. Witten and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations, Morgan Kaufmann Publishers, San Francisco, CA, pp. 210-227, 325-328 (2000).
Maneesh Sahu, Java Server Pages From Scratch (2001), Que Publishing, pp. 1-40, 181-261.
Michael Sipser, Introduction to the Theory of Computation (1997), PWS Publishing Co., pp. 3-4.
Response to Office Action dated Dec. 11, 2008, U.S. Appl. No. 11/565,730, filed Dec. 1, 2006.
Office Action dated May 13, 2009, U.S. Appl. No. 11/565,730, filed Dec. 1, 2006.
Office Action dated Sep. 16, 2008, U.S. Appl. No. 11/565,730, filed Dec. 1, 2006.
U.S. Appl. No. 09/795,901, filed Feb. 28, 2001, “Adding Functionality To Existing Code At Exits,” by Cobb.
U.S. Appl. No. 11/304,153, filed Dec. 15, 2005, “Execution Flow Shape Compression for Aggregate Data Reporting in an Application Manager,” by Vanrenen et al.
“Using the WorkArea Facility,” Version 4.0, WebSphere Application Server, IBM Corp., Mar. 2001.
Sodhi,et al. “Skeleton Based Performance Prediction on Shared Networks,” CCGRID 2004: The IEEE International Symposium on Cluster Computing and the Grid, Apr. 2004, Chicago, IL.
“JSR 149: Work Area Service for J2EE,” Sun Microsystems, www.jcp.org/en/jsr/detail?id=149&showPrint, printed Aug. 22, 2005.
Notice of Allowance dated Nov. 2, 2009, U.S. Appl. No. 11/565,730, filed Dec. 1, 2006.
Addleman Mark J.
Bansal Jyoti Kumar
Seidman David Isaiah
Computer Associates Think Inc.
Sough Hyung S
Vierra Magen Marcus & DeNiro LLP
Wathen Brian
LandOfFree
Automated grouping of messages provided to an application... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Automated grouping of messages provided to an application..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automated grouping of messages provided to an application... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2775237