Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing – Computer-to-computer data transfer regulating
Reexamination Certificate
2007-10-02
2007-10-02
Eng, David Y. (Department: 2155)
Electrical computers and digital processing systems: multicomput
Computer-to-computer protocol implementing
Computer-to-computer data transfer regulating
Reexamination Certificate
active
10627883
ABSTRACT:
A method of determining a placement of services of a distributed application onto nodes of a distributed resource infrastructure. In an embodiment of the present invention, a placement indicator for a specific service is provided. Communication constraints between node pairs are also provided. The communication constraints ensure that a sum of transport demands between a particular node pair does not exceed a transport capacity between the particular node pair. Constraints can be expressed for preventing unwanted placements. Preferences can be expressed for preferring specified placements. Each term of the sum of transport demands comprises a product of a first placement variable, a second placement variable, and the transport demand between the services associated with the first and second placement variables. The placement indicator, the communication constraints, and an objective comprise an integer program. A local search solution is applied to solve the integer program, which determines the placement of the services onto the nodes.
REFERENCES:
patent: 6031984 (2000-02-01), Walser
patent: 6035333 (2000-03-01), Jeffries et al.
patent: 6226673 (2001-05-01), Yoshimoto
patent: 6526420 (2003-02-01), Borowsky et al.
patent: 6785253 (2004-08-01), Du
patent: 6874032 (2005-03-01), Gersht et al.
patent: 2002/0048259 (2002-04-01), Adam et al.
patent: 2002/0056007 (2002-05-01), Gersht et al.
patent: 2002/0095493 (2002-07-01), Byrnes
patent: 2003/0115355 (2003-06-01), Cometto et al.
patent: 2003/0204587 (2003-10-01), Billhartz
patent: 2003/0225903 (2003-12-01), Lodha
Sven Graupner, Vadim Kotov, Artur Andrzejak, Holger Trinks, Control Architecture for Service Grlds in a Federation of Utility Data Centers, HP Labs Technical Report HPL-2002-235, Hewlett-Packard Company, Palo Alto, Aug. 21, 2002. <http://www.hpl.hp.com/techreports/2002/HPL-2002-235.pdf>.
Artur Andrzejak, Sven Graupner, Vadim Kotov, Holger Trinks, Algorithms for Self-Origanization and Adaptive Service Placement in Dynamic Distributed Systems, HP Labs Technical Report, HPL-2002-259, Hewlett-Packard Company, Palo Alto, Sep. 2002. <http://www.hpl.hp.com/techreports/2002/HPL-2002-259.pdf>.
Cipriano Santos, Xiaoyun Zhu, Harlan Crowder, A Mathematical Optimization Approach for Resource Allocation in Large Scale Data Centers, HP Labs Technical Report, HPL-2002-64(R.1), Hewlett-Packard Company, Palo Alto, 2002. <http://www.hpl.hp.com/techreports/2002/HPL-2002-64R1.pdf>.
Parameswaran Ramanathan, Suresh Chalasani, Resource Placement with Multiple Adjacency Constraints in K-ary n-Cubes, IEEE transactions on Parallel & Distribute Systems, May 1995, vol. 6, No. 5, pp. 511-519, IEEE Press, Los Alamitos, 1995.
Sven Graupner, Vadim Kotov, Holger Trinks, Resource-Sharing and Service Deployment in Virtual Data Centers, The 22nd International Conference on Distributed Computing Systems Workshops, Vienna Austria, Jul. 2-5, 2002, pp. 666-671, IEEE Computer Society, Los Alamitos, 2002.
Christodoulous A. Floudas, V. Visweswaran, Quadratic Optomization, Handbook of Global Optimization, pp. 217-269, Kluwer Academic Publishers, Boston, 1995.
Joachim P. Walser, Solving Linear Pseudo-Boolean Constraint Problems with Local Search, Proceedings of the Fourteenth National Conference on Artificial Intelligence and the Ninth Innovative Applications of Artificial Intelligence Conference, Jul. 27-31, 1997, Providence, Rhode Island, pp. 269-274, AAAI Press, Menlo Park, 1997.
Bart Selman, Hector Levesque, David Mitchell, A New Method for Solving Hard Satisfiability Problems, Proceedings of the Tenth National Conference on Artificial Intelligence Jul. 12-18, 1992, San Jose, California, pp. 440-446, AAAI Press, Menlo Park, 1992.
David Abramson, Henry Dang, Mohan Krishnamoorthy, A Comparison of Two Methods for Solving 0-1 Integer Programs Using a General Purpose Simulated Annealing Algorithim. Annals of Operations Research, v. 63, pp. 129-150, Baltzer Science, Amsterdam, Netherlands, 1996.
Joachim Paul Walser, Domain-Independent Local Search for Linear Integer Optomization, Dissertation, Programming Systems Lab, Univerität de Saarlandes,. Saarbrücken, Germany, Oct. 1998.
Bart Selman, Greedy Local Search in MIT Encyclopedia of the Cognitive Sciences, MIT Press, Cambridge, 1999.
Bart Selman, Henry A. Kautz, Bram Cohen, Local Search Strategies for Satifiabily Testing Presented at the Second DIMACS Challenge on Cliques, Coloring, and Satisfiability, Oct. 11-13, 1993, Piscataway, New Jersey.
Bart Selman, Henry A. Kautz, Bram Cohen, Noise Strategies for Improving Local Search, Proceedings of the Twelfth National Conference on Artificial Intelligence, Aug. 1-4, 1994, Seattle, Washington, pp. 337-343, AAAI Press, Menlo Park, 1994.
Andrzejak Artur
Graupner Sven
Eng David Y.
Hewlett--Packard Development Company, L.P.
LandOfFree
Incorporating constraints and preferences for determining... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Incorporating constraints and preferences for determining..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incorporating constraints and preferences for determining... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3873014