1Sims K. IBM introduces ready-to-use cloud computing col- laboration services get clients started with cloud computing [EB/OL]. (2007) [2012-02]. http://www.03.ibm.com/press/us/en/pressrelease/22613.wss.
2Zaharia M, Konwinski A, Joseph A D, et al. Improving Map- Reduce performance in heterogeneous environments[C]// Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI '08). Berkeley, CA, USA: USENIX Association, 2008: 29-42.
3Chandra P, Kumar B. Modeling and analysis to estimate the performance of heterogeneous cluster[C]//Proceedings of the 50th Technical Review of Institution of Engineers, 2009: 113-118.
4Morton K, Balazinska M, Grossman D. ParaTimer: a pro- gress indicator for MapReduce DAGs[C]//Proceedings of the 2010 International Conference on Management of Data (SIGMOD ' 10). New York, NY, USA: ACM, 2010:507-518.
5Verbauwhede I, Schaumont E The happy marriage of archi- tecture and application in next-generation reconfigurable system[C]//Proceedings of the 1st Conference on Computing Frontiers (CF '04), Ischia, Italy, 2004. New York, NY, USA: ACM, 2004: 363-376.
6Moulitsas I, Karypis G. Architecture aware partitioning algorithms[C]//Proceedings of the 8th International Confer- ence on Algorithms and Architectures for Parallel Processing (ICA3PP '08), Agia Napa, Cyprus, 2008. Berlin, Heidel- berg: Springer-Verlag, 2008: 42-53.
7Raymond J W, Gardiner E J, Willett P. RASCAL: calcula- tion of graph similarity using maximum edge subgraphs[J]. The Computer Journal, 2002, 45(6): 631-644.
8Kuramochi M, Karypis G. Finding frequent patterns in a large sparse graph[J]. Data Mining and Knowledge Discovery, 2005,11(3): 243-271.
9Yan Xifeng, Zhu Feida, Yu P S, et al. Feature-based similarity search in graph structures[J]. ACM Transactions on Database Systems, 2006, 31(4): 1418-1453.