Dynamic component placement in an event-driven...

Details Dynamic component placement in an event-driven... Dynamic component placement in an event-driven...

2011-06-14

2011-06-14

Chankong, Dohm (Department: 2452)

Electrical computers and digital processing systems: multicomput

Computer-to-computer data routing

Least weight routing

C719S318000

Reexamination Certificate

active

07962650

ABSTRACT:
Method, system and computer usable program code for dynamic 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 computational 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. Using the routing values in a context of the change, a performance cost of the system is estimated based on hypothetical changed placements of the computational components at nodes along paths from a producer to a consumer through the next-hop neighbor nodes for each consumer, and a changed placement of the computational components that minimizes performance cost of the system relative to the hypothetical changed placements is selected.

REFERENCES:
patent: 5166927 (1992-11-01), Iida et al.
patent: 6185598 (2001-02-01), Farber et al.
patent: 6260072 (2001-07-01), Rodriguez-Moral
patent: 6829771 (2004-12-01), Bahrs et al.
patent: 7010525 (2006-03-01), Botzer et al.
patent: 7080146 (2006-07-01), Bradford et al.
patent: 7840704 (2010-11-01), Balonado et al.
patent: 2003/0235168 (2003-12-01), Sharma et al.
patent: 2004/0103218 (2004-05-01), Blumrich et al.
patent: 2006/0200251 (2006-09-01), Gu et al.
patent: 2007/0047453 (2007-03-01), Bender et al.
patent: 2007/0083662 (2007-04-01), Adams et al.
patent: 2007/0160039 (2007-07-01), Xu
patent: 2007/0223377 (2007-09-01), de Heer
patent: 2007/0233843 (2007-10-01), Frey-Ganzel et al.
patent: 2008/0301175 (2008-12-01), Applebaum et al.
patent: 2009/0024622 (2009-01-01), Chkodrov et al.
Jueneman et al., “Explicit Path Routing for Seitching Network”, IBM Technical Disclosure Bulletin, vol. 18, No. 9, Feb. 1976, pp. 3059-3062.
Lynch et al., “Channel-to-Channel Adaption”, IBM Technical Disclosure Bulletin, vol. 23, No. 2, Jul. 1980, pp. 710-711.
“Network Feasibility Algorithm and Class of Service Generation in Advanced Peer-to-Peer Networks”, IBM Technical Disclosure Bulletin, vol. 34, No. 3, Aug. 1991, pp. 38-41.
“Load Balancing for Variable Sized Connections with Dynamically changing Bandwidth Requirements”, IBM Technical Disclosure Bulletin, vol. 35, No. 5, Oct. 1992, pp. 435-438.
“Algorithm for Assigning Weights to Links of APPN Networks”, IBM Technical Disclosure Bulletin, vol. 36, No. 11, Nov. 1993, pp. 171-172.
Pandit et al., “Performance Modeling and Placement of Transforms for Stateful Mediations”, IBM Technical Report, Nov. 2004, pp. 1-21.
Shah et al., “Flux: An Adaptive Partitioning Operator for Continuous Query Systems”, In ICDE, Oct. 2002, pp. 1-15.
Xing et al., “Dynamic Load Distribution in the Borealis Stream Processor”, In ICDE, 2005, pp. 1-12.
Ahmad et al., “Network-Aware Query Processing for Stream-Based Applications”, In VLDB, 2004, pp. 1-12.
Pietzuch et al., “Network-Aware Operator Placement for Stream-Processing Systems”, In ICDE, 2006, pp. 1-12.
Srivastava et al., “Operator Placement for In-Network Stream Query Processing”, In PODS, 2005, pp. 1-9.
Marques et al., “Ant Colony Optimization for Job Shop Scheduling”, Proceedings of the Third Workshop on Genetic Algorithms and Artificial Life (GAAL 99), 1999, pp. 1-8.
Colorni et al., “The Ant System Applied to the Quadratic Assignment Problem”, IEEE Transactions on Knowledge and Data Engineering 11 (5), 1998, pp. 1-18.
Corcoran et al., “A Genetic Algorithm for File and Task Placement in a Distributed System”, Evolutionary Computation, IEEE World Congress on Computational Intelligence, Proceedings of the First IEEE Conference on Volume, Jun. 1994, pp. 1-5, vol. 1, Issue 27-29.
Ooi et al., “Efficient Dynamic Operator Placement in a Locally Distributed Continuous Query System”, Proceedings of the 14th International Conference on Cooperative Information Systems, Nov. 2006, pp. 1-18, LNCS 4275, Springer-Verlag, Montpellier, France.
Cooper et al., “Distributed Stream Management using Utility-Driven Self-Adaptive Middleware”, In Proceedings of the Second International Conference on Automatic Computing, IEEE Computer Society, Jun. 2005, pp. 1-12, Washington, D.C., United States.
Gu et al., “Synergy: Sharing-Aware Component Composition for Distributed Stream Processing Systems”, ACM/IFIP/USENIX International Middleware Conference, Nov. 2006, pp. 1-20, Melbourne, Australia.
Gu et al., “Optimal Component Composition for Scalable Stream Processing”, IEEE International Conference on Distributed Computing Systems, 2005, pp. 1-10, Columbus, OH, United States.
Caro et al., “AntNet: Distributed Stigmergetic Control for Communications Networks”, Journal of Artificial Inteligence Research 9, 1998, pp. 1-49.
Amini et al., “Adaptive Control of Extreme-Scale Stream Processing Systems”, In Proceedings of ICDCS, 2006, pp. 1-7, Yorktown Heights, NY, United States.

Affiliated with

Also associated with

Rating

Dynamic component 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 component placement in an event-driven..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic component placement in an event-driven... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2621184