Dynamic and evolutionary placement in an event-driven...

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S223000, C709S224000, C709S239000

Reexamination Certificate

active

07979578

ABSTRACT:
Method, system and computer readable program code for dynamic and evolutionary component placement in an event processing system having producers, consumers, a plurality of nodes between the producers and the consumers, and a flow graph representing operator components to be executed between the producers and the consumers. A description of a change to the system is received. At each node, next-hop neighbor nodes for each consumer are identified. A routing value is assigned to each next-hop neighbor node for each consumer and the routing values are updated according to an update rule that represents a chromosome in a routing probe. The update rule in a routing probe is selectively updated from a plurality of update rules at the consumer. The probability of selecting a particular update rule is reinforced or decayed based on the success of an update rule in allowing routing probes to create many different efficient routes. At each producer, nests of scouting probes are adaptively selected from an available set of nests and dispatched to execute hypothetical placement of a query by an independent agent called a “leader”. A placement of the operator components that minimizes performance cost of the system relative to the hypothetical placement is selected. Each scouting probe contains chromosomes that guide placement. Scouting probes in two different nests have different chromosomes. The performance cost of the hypothetical changed placement is evaluated and the performance evaluation is used to evolve at least one chromosome of a scouting ant in each nest.

REFERENCES:
patent: 5848403 (1998-12-01), Gabriner et al.
patent: 5946673 (1999-08-01), Francone et al.
patent: 6490566 (2002-12-01), Schmidt
patent: 6882988 (2005-04-01), Subbu et al.
patent: 6904335 (2005-06-01), Solomon
patent: 7277876 (2007-10-01), Solomon
patent: 7305371 (2007-12-01), Brueckner et al.
patent: 7827268 (2010-11-01), Monier et al.
patent: 2003/0069865 (2003-04-01), Subbu et al.
patent: 2004/0083129 (2004-04-01), Herz
patent: 2006/0085558 (2006-04-01), Solomon
patent: 2006/0167917 (2006-07-01), Solomon
patent: 2008/0040529 (2008-02-01), Bartley et al.
patent: 2009/0234943 (2009-09-01), Gyo et al.
P. Pietzuch et al. “Network-aware operator placement for stream processing systems”, In ICDE, pp. 49, 2006.
Y. Zhou et al., “Efficient Dynamic Operator Placement in a Locally Distributed Continuous Query System”, Proceedings of the 14th International Conference on Cooperative Information Systems, Montpellier, France, Nov. 2006, pp. 54-71, LNCS 4275, Springer-Verlag.
V. Kumar et al., “Distributed Stream Management using Utility-Driven Self-Adaptive Middleware”, In Proceedings of the Second international Conference on Automatic Computing (Jun. 13-16, 2005), ICAC. IEEE Computer Society, Washington, DC, 3-14.
C Chiu et al., “A Genetic Algorithm for Reliability-Oriented Task Assignment with k Duplications in Distributed Systems”, Journal of Transactions on Reliability, vol. 55, No. 1., Mar. 2006.
M. Daoud et al., “An Efficient Genetic Algorithm for Task Scheduling in Heterogeneous Distributed Computng Systems”, In IEEE Congress on Evolutionary Computation, Jul. 2006.
M. Solar et al., “Placement and routing of Boolean Functions in constrained FPGAs using a Distributed Genetic Algorithm and Local Search”, In proceedings of Parallel and Distributed Processing Symposium (IPDPS), 2006.
M. Aldasht et al., “A Genetic Exploration of Dynamic Load Balancing Algorithms”, Journal of Evolutionary Computation. vol. 1, Issue, Jun. 19-23, 2004 pp. 1158-1163 vol. 1.
H. Aguirre et al., “Improved Distributed Genetic Algorithm with Cooperative-Competitive Genetic Operators”, IEEE International Conference on Systems, Man, and Cybernetics, 2000. vol. 5, Issue , 2000 pp. 3816-3822 vol. 5.
Y. Tsujimura et al., “Data Distribution Considered Communication Flow in Network Using Genetic Algorithm”, IEEE International Conference on Knowledge-Based Intelligent Electronic Systems, 1998.
P. Maes, “Modeling Adaptive Autonomous Agents”, Artificial Life, 1994.
N. Minar et al., “Cooperating Mobile Agents for Dynamic Network Routing”, Software Agents for Future Communications Systems, 1999.
D. Rus et al., “Autonomous and Adaptive Agents that Gather lnformation”, AAAI '96 International Workshop on Intelligent Adaptive Agents, 1996.

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

Dynamic and evolutionary placement in an event-driven... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic and evolutionary placement in an event-driven..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic and evolutionary placement in an event-driven... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2685953

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