A fast and efficient algorithm for topology-aware coallocation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5101 LNCS, Issue PART 1, 2008, Pages 274-283

  Kravtsov, Valentin ^a   Swain, Martin ^b   Dubin, Uri ^a   Dubitzky, Werner ^b   Schuster, Assaf ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF ULSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; GRAPH THEORY;

ALLOCATION SYSTEMS; COMPUTATIONAL SCIENCES; DISTRIBUTED APPLICATIONS (DA); EFFICIENT ALGORITHMS; GRAPH MATCHING; GRID SYSTEMS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; LABELED GRAPHS; NEW ALGORITHM; REAL WORLD;

PATTERN MATCHING;

EID: 47749153782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69384-0_33     Document Type: Conference Paper

References (17)

1. Charlot, M., et al.: The QosCosGrid project: Quasi-Opportunistic Supercomputing for Complex Systems Simulations. In: Description of a general framework from different types of applications. Ibergrid conference, Centro de Supercomputacion de Galicia (GESGA) (2007)
2. Kravtsov, V., Carmeli, D., Schuster, A., Yoshpa, B., Silberstein, M., Dubitzky, W.: Quasi-Opportunistic Supercomputing in Grids, Hot Topic Paper. In: IEEE International Symposium on High Performance Distributed Computing, Monterey Bay, California, USA (2007)
3. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years of Graph Matching in Pattern Recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(3), 265-298 (2004)
4. Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Trans. Pattern Anal. Mach. Intell. 18(4), 377-388 (1996)
5. Ullman, J.R.: An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach. 23, 31-42 (1976)
6. Cordella, L.P., Foggia, P., Sansone, C., Tortorella, F., Vento, M.: Graph matching: a fast algorithm and its evaluation. In: 14th Int. Conf. Pattern Recognition, pp. 1582-1584 (1998)
7. Gregory, L., Kittler, J.: Using graph search techniques for contextual colour retrieval. In: Joint IAPR Int. Workshops SSPR and SPR, pp. 186-194 (2002)
8. Fischler, M., Elschlager, R.: The representation and matching of pictorial structures. IEEE Trans. Computing 22, 67-92 (1973)
9. Myers, R., Wilson, R.C., Hancock, E.R.: Bayesian graph edit distance. IEEE Trans. Patt. Anal. Mach. Intell. 22, 628-635 (2000)
10. Lovasz, L., Plummer, M.D.: Matching Theory. Elsevier Science Publishing Company, New York (1986)
11. Blum, N.: A Simplified Realization of the Hopcroft-Karp Approach to Maximum Matching in General Graphs. Univ. of Bonn, Computer Science V, 85232-CS (2001)
12. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, The Bellman-Ford algorithm, pp. 588-592. MIT Press and McGraw-Hill, New York, USA (2001)
13. Pardalos, P.M., Xue, J.: The maximum clique problem. Journal of Global Optimization 4(3), 301-328 (1994)
14. Khot, S.: Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring. In: Proceedings of the 42nd IEEE Symposium on the Foundations of Computer Science 600, Washington, DC, USA (2001)
15. Mehlhorn, K., Naeher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
16. Andrew, M.: GNU Linear Programming Kit, Version 4.22. http://www.gnu.org/software/glpk/glpk.html
17. Bonami, P., et al.: Research Report RC 23771, An Algorithmic Framework For Convex Mixed Integer Nonlinear Programs. IBM T. J. Watson Research Center, Yorktown, USA (2005)