Startup and control of graph-based computation

Data processing: artificial intelligence – Knowledge processing system

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07577628

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: 4972314 (1990-11-01), Getzinger et al.
patent: 5323452 (1994-06-01), Dickman et al.
patent: 5805462 (1998-09-01), Poirot 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: 6259988 (2001-07-01), Galkowski et al.
patent: 6314114 (2001-11-01), Coyle et al.
patent: 6330008 (2001-12-01), Razdow 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: 6496961 (2002-12-01), Gupta 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: 6651234 (2003-11-01), Gupta et al.
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: 6879946 (2005-04-01), Rong et al.
patent: 7062483 (2006-06-01), Ferrari et al.
patent: 7085426 (2006-08-01), August
patent: 7103620 (2006-09-01), Kunz et al.
patent: 7130484 (2006-10-01), August
patent: 7165030 (2007-01-01), Yi et al.
patent: 7167850 (2007-01-01), Stanfill
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/0023413 (2003-01-01), Srinivasa
patent: 2005/0177531 (2005-08-01), Bracewell
Ou et al. “Arhitecture-Indpendent Locality-Improving Transformations of Computational Graphs Embedded in κ-Dimensions” ACM, 1995. pp. 289-298.
Efficient graph-based computation and manipulation of functional decision diagrams Kebschull, U.; Rosenstiel, W.; Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on Feb. 22-25, 1993 pp. 278-282 Digital Object Identifier 10.1109/EDAC.1993.386463.
Ou et al., “Architecture-Independent Locality-Improving Transformations of Computational Graphs Embedded in κ-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 of 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.
Stantfill, “Massively Paralle 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”, IEE 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.
Babaoglu, O et al. “Mapping parallel computations onto distributed systems in Paralex” Compuero '91. Advanced Computer Technology, Reliable Systems and Applications. 5thAnnual European Computer Conference. Proceedings. Bologna, Italy May 13-16, 1991, Los Alamitos, CA, USA, IEEE Comput. Soc, US, May 13, 1991, pp. 123-130.
Gamma et al. “Design Patterns: Elements of Reusable Object-Oriented Software”, Sep. 1999.

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

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.

Rate now

     

Profile ID: LFUS-PAI-O-4076571

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