Processing transactions using graph-based computations...

Data processing: artificial intelligence – Knowledge processing system

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C712S201000

Reexamination Certificate

active

07636699

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: 4922418 (1990-05-01), Dolecek
patent: 4972314 (1990-11-01), Getzinger et al.
patent: 5161216 (1992-11-01), Reps et al.
patent: 5495590 (1996-02-01), Comfort et al.
patent: 5630047 (1997-05-01), Wang
patent: 5692168 (1997-11-01), McMahan
patent: 5712971 (1998-01-01), Stanfill et al.
patent: 5802267 (1998-09-01), Shirakihara et al.
patent: 5923832 (1999-07-01), Shirakihara et al.
patent: 5933640 (1999-08-01), Dion
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: 6401216 (2002-06-01), Meth et al.
patent: 6437796 (2002-08-01), Sowizral et al.
patent: 6449711 (2002-09-01), Week
patent: 6480876 (2002-11-01), Rehg et al.
patent: 6584581 (2003-06-01), Bay 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: 6813761 (2004-11-01), Das et al.
patent: 6848100 (2005-01-01), Wu et al.
patent: 7076804 (2006-07-01), Kershenbaum et al.
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.
patent: 2002/0129340 (2002-09-01), Tuttle
patent: 2002/0184616 (2002-12-01), Chessell et al.
patent: 2003/0174165 (2003-09-01), Barney
Jawadi et al. “A Graph-based Transaction Model for Active Databases and its Parallel Implementation”, 1994, U. Florida Tech. Rep TR94-0003, pp. 1-29.
Ebert et al. “A Declarative Approach to Graph Based Modeling”, 1994, Workshop on Graph-Theoretic Concepts in Computer Science. pp. 1-19.
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.
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.
Ou et al., Architecture-Independent Locality-Improving Transformations of Computational Graphs Embedded in k-Dimensions Proceedings of the 9thIntl 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.
“RASSP Data Flow Graph Design Application Note”, International Conference on Parallel Processing, Dec. 2000 Retrieved from the Internet.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Processing transactions using graph-based computations... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Processing transactions using graph-based computations..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Processing transactions using graph-based computations... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4113346

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.