1[1]Valiant L G. Bridging model for parallel computation. Communications of the ACM, 1990, 33(8):103-111
2[2]Culler D, Richard Karp R M et al. LogP: Towards a realistic model of parallel computation. In: Proc the 4th ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, San Diego, USA, 1993.1-12
3[3]Rodriguez C, Roda J L, Sande F et al. A new parallel model for the analysis of asynchronous algorithms. Parallel Computing, 2000, 26(6):753-767
4[4]Behrooz Parhami, Yeh Chi-Hsiang. Why network diameter is still important. In: Proc International Conference Communications in Computing, Las Vegas,USA, 2000. 26-29
5[5]Wilkinson B, Allen M. Parallel Programming. Englewood Cliffs, NJ: Prentice Hall, USA, 1999
6[6]Alpern B, Carter L et al. The uniform memory hierarchy model of computation. Algorithmica, 1994, 27(12):72-109
7[7]Matteo Frigo. Cache-Oblivous Algorithm[Ph D Dissertation]. MIT, USA, 1999
8[8]Liu Fang-Ai, Liu Zhi-Yong, Qiao Xiang-Zhen. The cache performance analysis of algorithms. In: Proc the 3rd International Conference on Computer-Aided Industrial Design and Conceptual Design, Hong Kong, 2000. 313-317
9Saab C B, Bonnaire X. A Flexible Monitoring Platform to Build Cluster Management Services[C].Cluster Computing Proceedings.IEEE International Conference,2000.258-265.
10De Mello R F,Paiva M S V. A Java Cluster Management Service[C].Network Computing and Applications NCA 2001.IEEE International Symposium,2001.238-241.
