Data processing: artificial intelligence – Knowledge processing system
Reexamination Certificate
2007-01-23
2007-01-23
Patel, Ramesh (Department: 2121)
Data processing: artificial intelligence
Knowledge processing system
C709S200000
Reexamination Certificate
active
10268509
ABSTRACT:
An approach to performing graph-based computation uses one or both of an efficient startup approach and efficient control using process pools. Efficient startup of a graph-based computation involves precomputing data representing a runtime structure of a computation graph such that an instance of the computation graph is formed using the precomputed data for the required type of graph to form the runtime data structure for the instance of the computation graph. Pools of processes that are each suitable for performing computations associated with one or more vertices of the computation graphs are formed such that at runtime, members of these pools of processes are dynamically assigned to particular vertices of instances of computation graphs when inputs are available for processing at those vertices.
REFERENCES:
patent: 5966072 (1999-10-01), Stanfill et al.
patent: 6088716 (2000-07-01), Stanfill et al.
patent: 6330008 (2001-12-01), Razdow et al.
patent: 6437796 (2002-08-01), Sowizral et al.
patent: 6480876 (2002-11-01), Rehg et al.
patent: 6584581 (2003-06-01), Bey et al.
patent: 6608628 (2003-08-01), Ross et al.
patent: 6611862 (2003-08-01), Reisman
patent: 6654907 (2003-11-01), Stanfill et al.
patent: 6658464 (2003-12-01), Reisman
patent: 2001/0055019 (2001-12-01), Sowizral et al.
patent: 2002/0080181 (2002-06-01), Razdow et al.
patent: 2002/0091747 (2002-07-01), Rehg et al.
patent: 2002/0091748 (2002-07-01), Rehg et al.
“RASSP Data Flow Graph Design Application Note”, International Conference on Parallel Processing, Dec. 2000, Retrieved from the Internet http://www.atl.external.Imco.com/projects/rassp/RASSP_legacy/appnotes/FLOW/APNOTE_FLOW_02.
Stanfill et al., “Parallel Free-Text Search on the Connection Machine System”, Communications of the ACM, Dec. 1996, vol. 29, No. 12.
Ou et al., Architecture-Independent Locality-Improving Transformations of Computational Graphs Embedded in k-Dimensions Proceedings of the 9th Intl Conf on Supercomputing, 1995.
Cytron et al., “Efficiently Computing Static Single Assignment Form and the Control Dependence Graph”, ACM Transactions o Programming Languages and Systems, vol. 13, No 4, Oct. 1991.
Martin et al., “Models of computations and Systems-Evaluation of Vertex Probabilities in Graph Models of Computations”, Journal of the Association for Computing Machinery, vol. 14, No. 2, Apr. 1967.
Baer et al., “Legality and Other Properties of Graph Models of Computations”, Journal of the Association for Computing Machinery, vol. 17, No 3, Jul. 1970.
Stanfill, “The Marriage of Parallel Computing and Information Retrieval”, IEE Colloquium on Parallel Techniques for Information Retrieval, Apr. 1989.
Stanfill, “Massively Parallel Information Retrieval for Wide Area Information Servers”, 1991 IEEE International Conference on Systems, Man and Cybernetics, Oct. 1991.
Wah et al., Report on Workshop on High Performance Computing and Communications for Grand Challenge Applications, IEEE Transactions on Knowledge and Data Engineering, Feb. 1993.
Li et al., “A Practical External Sort for Shared Disk MPPs”, Proceedings of Supercomputing '93, 1993.
Stanfill et al., “Parallel Free-Text Search on the Connection Machine System”, Communications of the ACM, vol. 29, No. 12, Dec. 1996.
Bookstein et al., “Modeling Word Occurences for the Compression of Concordances”, ACM Transactions on Information Systems, vol. 15, No 3, Jul. 1997.
Ab Initio Software Corporation
Datskovskiy Sergey
Fish & Richardson P.C.
Patel Ramesh
LandOfFree
Startup and control of graph-based computation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Startup and control of graph-based computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Startup and control of graph-based computation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3797740