Method and system for graph analysis and synchronization

Details Method and system for graph analysis and synchronization Method and system for graph analysis and synchronization

2004-08-13

2009-11-03

Rutten, James (Department: 2192)

Data processing: software development, installation, and managem

Software program development tool

Modeling

C717S136000, C345S440000, C703S013000

Reexamination Certificate

active

07614037

ABSTRACT:
A cyclic graph may be partitioned. The partitions of the cyclic graph may include an acyclic component of the cyclic graph and a set of partitioned links. The partitions of the cyclic graph may have a particular order. The elements of the cyclic graph may be serialized with a particular serialization order. The serialization order of the elements of the cyclic graph may correspond to the order of the partitions of the cyclic graph. The elements of the acyclic component of the cyclic graph may be serialized before the elements of the set of partitioned links. A computer system may include a graph synchronization component configured to partition the cyclic graph and determine the serialization order of the elements of the cyclic graph. A serialization of the cyclic graph does serialize the elements of the cyclic graph in the determined serialization order.

REFERENCES:
patent: 4698751 (1987-10-01), Parvin
patent: 4953106 (1990-08-01), Gansner et al.
patent: 5187785 (1993-02-01), Shah
patent: 5515487 (1996-05-01), Beaudet et al.
patent: 5748188 (1998-05-01), Hu et al.
patent: 5784557 (1998-07-01), Oprescu
patent: 6499037 (2002-12-01), Breitbart et al.
patent: 6553384 (2003-04-01), Frey et al.
patent: 6651246 (2003-11-01), Archambault et al.
patent: 6708187 (2004-03-01), Shanumgam et al.
patent: 6768988 (2004-07-01), Boreham et al.
patent: 6832370 (2004-12-01), Srinivasan et al.
patent: 7185328 (2007-02-01), Grover
patent: 7389335 (2008-06-01), MacLeod et al.
patent: 2002/0166112 (2002-11-01), Martin et al.
patent: 2003/0055991 (2003-03-01), Krishnapuram et al.
patent: 2005/0257200 (2005-11-01), Taylor
patent: 2008/0114937 (2008-05-01), Reid et al.
Megiddo, Nimrod and Sarkar, Vivek, “Optimal Weighted Loop Fusion for Parallel Programs”, ACM 19976, p. 282-291, retrieved Dec. 2, 2002 from the ACM database.
Karp et al., “The Grasper-CL Graph Management System” 1994, Kluwer Academic Publishers, LISP and Symbolic Computation, 30 pages.
Good, G., “The LDAP Data Interchange Format (LDIF)—Technical Specification,”Network Working Group, Request for Comments: 2849, pp. 1-14, Standards Track, The Internet Society (Jun. 2000).
Mansfield et al., “Schema Publishing in X.500 Directory,”Network Working Group, Request for Comments: 1804, pp. 1-10, Experimental (Jun. 1995).
Wahl et al., “Lightweight Directory Access Protocol (v3),”Network Working Group, Request for Comments: 2251, pp. 1-50, Standards Track, The Internet Society (Dec. 1997).
Wahl et al., “Lightweight Directory Access Protocol (v3) : Attribute Syntax Definitions,”Network Working Group, Request for Comments: 2252, pp. 1-32, Standards Track, The Internet Society (Dec. 1997).
Wahl, “A Summary of the X.500(96) User Schema for use with LDAPv3,”Network Working Group, Request for Comments: 2256, pp. 1-20, Standards Track, The Internet Society (Dec. 1997).
Johner, Heinz, et al. “Understanding LDAP” IBM Redbooks, Nov. 10, 1999, p. 1-193 (complete document).
Chartrand, Gary,Introductory Graph Theory, Dover Publications, Inc., New York, pp. 1-25, 147-152 (1977).
Freire, et al., “Integrating Network Devices in a Meta-Directory: the MetaComm Experience,”Information Systems, vol. 27, pp. 193-217 (2002).
Xie, Aiguo and Peter A. Beerel, “Implicit Enumeration of Strongly Connected Components and an Application to Formal Verification,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 19, No. 10, pp. 1225-1230 (2002).
Zhao-Hong et al., “Minimizing the Copy Graph to Improve Scalability,”Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies, Chengdu, China, pp. 923-926 (2003).

Affiliated with

Also associated with

Rating

Method and system for graph analysis and synchronization does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for graph analysis and synchronization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for graph analysis and synchronization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4137369