Class dependency graph-based class loading and reloading

Details Class dependency graph-based class loading and reloading Class dependency graph-based class loading and reloading

2006-05-02

2006-05-02

Thomson, William (Department: 2194)

Electrical computers and digital processing systems: interprogra

Dynamic linking, late binding

C719S332000, C717S166000

Reexamination Certificate

active

07039923

ABSTRACT:
Embodiments of a system and method for providing class dependency graph-based class loading and reloading may be used to segregate namespaces in a graph-centric way, and may provide a set of normalized topologies that may be used to efficiently support hot-swapping of programmatic logic such as classes, applets, and beans, among other applications. Embodiments may provide a domain-independent, flexible and robust namespace segregation technique that is based on the dependency between the various classes and not on details like the roles the classes play. The problem of segregating namespaces is formulated as a graph theory problem, and a solution is sought through graph techniques. The graph may be normalized by identifying and grouping interdependent classes and non-interdependent classes in separate groups. A directed dependency relationship of the groups may be determined using the relationships between the member classes of the groups.

REFERENCES:
patent: 6339841 (2002-01-01), Merrick et al.
patent: 6470494 (2002-10-01), Chan et al.
patent: 6571388 (2003-05-01), Venkatraman et al.
patent: 6748396 (2004-06-01), Klicnik et al.
patent: 6915511 (2005-07-01), Susarla et al.
patent: 2004/0015936 (2004-01-01), Susarla et al.
Liang et al., “Dynamic Class Loading in the Jave Virtual Machine,” 1998, pp. 36-44.
Nuutila et al., “On Finding the Strong Components in a Directed Graph,” 1993, pp. 1-17.
Nuutila et al., “On Finding the Strongly Connected Components in a Directed Graph,” 1993, pp. 1-14.
“Transitive Closure and Reduction,” 1997, pp. 1-3.
“Class java.lang.ClassLoad,” Sun Microsystems, Inc.,Submit a bug or feature—Version 1.1.8 of Java Platform API Specification, 1995-1999, 6 pages.
“iPlanet Application Server Overview Guide”, Chapters 2 & 4, Sun Microsystems, Inc., 2000, 14 pages.
“Programmer's Guide (Java), iPlanet Application Server,” Release 6.0, Apr. 2000, pp. 289-291.
“JAVA Language Reference,” O'Reilly, 2ndEdition, Jul. 1997, 11 pages.
Gong, “Secure Java Class Loading,” IEEE, Dec. 1998, (pp. 56-61).
“Java Dynamic Class Loader,” vol. 39, No. 11, IBM Technical Disclosure Bulletin, Nov. 1996, (pp. 107-108).
Kosaraju, et al., “Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version)”, Dept. of Computer Science, Johns Hopkins Univ., Baltimore, MD 21218, ACM 1998, pp. 398-406.
Akio, et al., “An Effective Parallel Algorithm for Finding Strongly Connected Components of a Sparse Directed Graph,” Information Processing Society of Japan, Jun. 19, 2001, 1 page.

Affiliated with

Also associated with

Rating

Class dependency graph-based class loading and reloading does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Class dependency graph-based class loading and reloading, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Class dependency graph-based class loading and reloading will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3607569