{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:12:47Z","timestamp":1775326367769,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sc. China"],"published-print":{"date-parts":[[2007,5]]},"DOI":"10.1007\/s11704-007-0016-1","type":"journal-article","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T15:50:30Z","timestamp":1181663430000},"page":"156-165","source":"Crossref","is-referenced-by-count":22,"title":["Models of parallel computation: a survey and classification"],"prefix":"10.1007","volume":"1","author":[{"given":"Yunquan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangzhong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiankun","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. Valiant","year":"1990","unstructured":"Valiant L. A bridging model for parallel computation. Communication of ACM, 1990, 33:103\u2013111","journal-title":"Communication of ACM"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"S. Cook","year":"1973","unstructured":"Cook S, Reckhow R. Time Bounded Random Access Computers. Journal of Computer and Systems Sciences, 1973, 7:354\u2013375","journal-title":"Journal of Computer and Systems Sciences"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Maggs B M, et al. Models of Parallel Computation: A Survey and Synthesis. In: Proceedings of 28th Hawaii Int. Conf. on System Sciences. Wailea, USA. 1995, 61\u201370","DOI":"10.1109\/HICSS.1995.375476"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Fortune S, Wyllie J C. Parallelism in random access computers. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, USA. 1978, 114\u2013118","DOI":"10.1145\/800133.804339"},{"issue":"4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","volume":"29","author":"L. M. Goldschlager","year":"1982","unstructured":"Goldschlager L M. A Universal interconnection pattern for parallel computers. Journal of the ACM, 1982, 29(4):1073\u20131086","journal-title":"Journal of the ACM"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Culler D, et al. LogP: towards a realistic model of parallel computation. In: Proceedings of PPoPP\u201993. USA. May, 1993, 1\u201312","DOI":"10.1145\/155332.155333"},{"issue":"8","key":"16_CR7","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1109\/71.532114","volume":"7","author":"F. J\u00e1J\u00e1 Joseph","year":"1996","unstructured":"J\u00e1J\u00e1 Joseph F, Kwan W R. The block distributed memory model. IEEE Transaction on Distributed and Parallel Systems, 1996, 7(8):830\u2013840","journal-title":"IEEE Transaction on Distributed and Parallel Systems"},{"issue":"1","key":"16_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(90)90188-N","volume":"71","author":"A. Aggarwal","year":"1990","unstructured":"Aggarwal A, et al. Communication complexity of PRAMs. Theoretical Computer Science, 1990, 71(1):3\u201328","journal-title":"Theoretical Computer Science"},{"key":"16_CR9","first-page":"305","volume-title":"Proceedings of the 19th Annual ACM Symp. on Theory of Computing","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal A, ALpern B, Chandra A, et al. A model for hierarchical memory. In: Proceedings of the 19th Annual ACM Symp. on Theory of Computing. New York: ACM, 1987, 305\u2013314"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Aggarwal A, Alpern B., Chandra A., et al. Hierarchical Memory with Block Transfer. In: Proceedings of the 28th IEEE Symp. on Foundations of Computer Science. USA. 1987, 204\u2013216","DOI":"10.1109\/SFCS.1987.31"},{"issue":"2\/3","key":"16_CR11","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BF01185206","volume":"12","author":"B. Alpern","year":"1994","unstructured":"Alpern B, et al. The uniform memory hierarchy model of computation. Algorithmica, 1994, 12(2\/3):72\u2013109","journal-title":"Algorithmica"},{"key":"16_CR12","first-page":"51","volume":"2","author":"Z. Y. Li","year":"1995","unstructured":"Li Z Y, et al. Models and resource metrics for parallel and distributed computation. In: Proceedings of 28th Hawaii International Conference on System Sciences. USA. 1995, Vol. 2, 51\u201360","journal-title":"Proceedings of 28th Hawaii International Conference on System Sciences. USA"},{"key":"16_CR13","volume-title":"Performance optimizations on parallel numerical software package and study on memory complexity","author":"Y. Q. Zhang","year":"2000","unstructured":"Zhang Y Q. Performance optimizations on parallel numerical software package and study on memory complexity. Dissertation of Doctoral Degree. Beijing, P.R. China: Institute of Software, Chinese Academy of Sciences, 2000 (in Chinese)"},{"issue":"1\/2\/3","key":"16_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1504\/IJHPCN.2004.007571","volume":"1","author":"X. Z. Qiao","year":"2004","unstructured":"Qiao X Z, et al. HPM: a hierarchical model for parallel computations. International Journal of High Performance Computing and Networking (IJHPCN), 2004, 1(1\/2\/3):117\u2013127","journal-title":"International Journal of High Performance Computing and Networking (IJHPCN)"},{"issue":"1","key":"16_CR15","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/331605.331607","volume":"47","author":"P. W. Dymond","year":"2000","unstructured":"Dymond P W, et al. Parallel RAMs with owned global memory and deterministic context-free language recognition. Journal of the ACM, 2000, 47(1):16\u201345","journal-title":"Journal of the ACM"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Cole R., et al. The APRAM: incorporating asynchrony into the PRAM model. In: Proceedings of the 1st Annual ACM SPAA\u201989. USA. 1989, 169\u2013178","DOI":"10.1145\/72935.72954"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Gibbons P B. A more practical PRAM model. In: Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, USA. 1989, 158\u2013168","DOI":"10.1145\/72935.72953"},{"key":"16_CR18","first-page":"943","volume-title":"Handbook of theoretical computer science (vol. A): algorithms and complexity","author":"L. G. Valiant","year":"1991","unstructured":"Valiant L G. General Purpose Parallel Architectures. In: Leeuwen J V, ed. Handbook of theoretical computer science (vol. A): algorithms and complexity. Cambridge, MA, USA. MIT Press, 1991, 943\u2013973"},{"issue":"4","key":"16_CR19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00264615","volume":"21","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn K, Vishkin U. Randomized and deterministic simulations of PRAMs by parallel computers with restricted granularity of parallel memories. Acta Informatica, 1984, 21(4):339\u2013374","journal-title":"Acta Informatica"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Gibbons P, et al. The QRQW PRAM: accounting for contention in parallel algorithms. In: Proceedings of the 5th annual ACM-SIAM SODA\u201994, USA. 1994, 638\u2013648","DOI":"10.1145\/181014.181382"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Gibbons P B, Matias Y, Ramachandran V. Can a shared-memory model serve as a bridging model for parallel computation? In: Proceedings of SPAA\u201997, USA, 1997, 72\u201383","DOI":"10.1145\/258492.258500"},{"issue":"1","key":"16_CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(90)90188-N","volume":"71","author":"A. Aggarwal","year":"1990","unstructured":"Aggarwal A, et al. Communications complexity of PRAMs, Theoretical Computer Science, 1990, 71(1):3\u201328","journal-title":"Theoretical Computer Science"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Aggarwal A, etc. On Communication Latencies in PRAM Computations, Proc. of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, USA, 1989, 11\u201321","DOI":"10.1145\/72935.72937"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Mansour Y, et al. Trade-offs between communication throughput and parallel time. In: Proceedings of the 26th Ann. ACM Symposium on Theory of Computing, Canada, 1994, 372\u2013381","DOI":"10.1145\/195058.195199"},{"issue":"4","key":"16_CR25","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0167-739X(92)90071-I","volume":"8","author":"P. Torre de la","year":"1992","unstructured":"de la Torre P, Kruskal C P. Towards a single model of efficient computation in real parallel computers. Future Generation Computer Systems, Elsevier Science Publishers, 1992, 8(4):395\u2013408","journal-title":"Future Generation Computer Systems"},{"issue":"3","key":"16_CR26","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0743-7315(92)90034-K","volume":"16","author":"T. Heywood","year":"1992","unstructured":"Heywood T, Ranka S. A practical hierarchical model of parallel computation: I. the Model. Journal of Parallel and Distributed Computing, 1992, 16(3):212\u2013232","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"16_CR27","unstructured":"Campbell D K G.. A survey of models of parallel computation. Technical Report No.YCS-97-278. Department of Computer Science, University of York, March 1997"},{"key":"16_CR28","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01762110","volume":"3","author":"C. Leiserson","year":"1988","unstructured":"Leiserson C, Maggs B. Communication efficient parallel algorithms for distributed random access computers. Algorithmica, 1988, Vol. 3:53\u201377","journal-title":"Algorithmica"},{"issue":"3","key":"16_CR29","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/828.1892","volume":"31","author":"E. Upfal","year":"1984","unstructured":"Upfal E. Efficient schemes for parallel communication. Journal of the ACM, 1984, 31(3):507\u2013517","journal-title":"Journal of the ACM"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Bar-Noy A, Kipnis S. Designing broadcasting algorithms in the postal model for message passing systems. In: Proceedings of the SPAA\u201992, USA, 1992, 13\u201322","DOI":"10.1145\/140901.140903"},{"key":"16_CR31","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1146\/annurev.cs.01.060186.001445","volume":"1","author":"L. Snyder","year":"1986","unstructured":"Snyder L. Type architectures, shared memory, and the corollary of modest potential. Annu. Review of Computer Science, 1986, Vol. 1:289\u2013317","journal-title":"Review of Computer Science"},{"issue":"14","key":"16_CR32","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1016\/S0167-8191(98)00093-3","volume":"24","author":"J. Hill","year":"1998","unstructured":"Hill J, McColl B, Stefanescu D, et al. BSPlib: the BSP Programming Library, Parallel Computing, 1998, 24(14):1947\u20131980","journal-title":"Parallel Computing"},{"key":"16_CR33","unstructured":"BSP Worldwide: http:\/\/www.bsp-worldwide.org"},{"issue":"3\/4","key":"16_CR34","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/PL00008264","volume":"24","author":"W. F. McColl","year":"1999","unstructured":"McColl W F, Tiskin A. Memory-efficient matrix multiplication in the BSP model. Algorithmica, 1999, 24(3\/4):287\u2013297","journal-title":"Algorithmica"},{"issue":"8","key":"16_CR35","first-page":"695","volume":"20","author":"G. L. Chen","year":"1997","unstructured":"Chen G L, Xu J B. Communication strategy of butterfly computation on LogP model. Chinese Journal of Computer, 1997, 20(8):695\u2013701 (in Chinese)","journal-title":"Chinese Journal of Computer"},{"key":"16_CR36","first-page":"57","volume":"17","author":"G. L. Chen","year":"1996","unstructured":"Chen G L, Li X F, Huang W M. The design and analysis of parallel FFT algorithm on three parallel computational models. Journal of Software, 1996, 17:57\u201363 (in Chinese)","journal-title":"Journal of Software"},{"key":"16_CR37","unstructured":"Li X F, Shou B. Improvement of LogP model and optimization of FFT algorithm. Journal of computer research and development, 1996, 33(6) (in Chinese)"},{"issue":"4","key":"16_CR38","first-page":"365","volume":"25","author":"N. J. Gu","year":"2002","unstructured":"Gu N J, Li W, Liu J. Fibonacci series-based multicast algorithm. Chinese Journal of Computer, 2002, 25(4):365\u2013372 (in Chinese)","journal-title":"Chinese Journal of Computer"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Alexandrov A, Ionescu M, Schauser K E, et al. LogGP: incorporating long messages into the LogP model-one step closer towards a realistic model for parallel computation. In: Proceedings of 7th Annual Symposium on Parallel Algorithms and Architecture, USA, 1995, 95\u2013105","DOI":"10.1145\/215399.215427"},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"Ino F, Fujimoto N, Hagihara K. LogGPS: a parallel computational model for synchronization analysis. In: Proceedings of the PPoPP\u201901, USA, 2001, 133\u2013142","DOI":"10.1145\/379539.379592"},{"key":"16_CR41","unstructured":"Morirz C A, Frank M I. LoGPC: modeling network contention in message passing programs. In: Proceedings of SIGMETRICS\u201998, USA, 1998, 254\u2013263"},{"key":"16_CR42","unstructured":"Campbell D K G. Clumps: a candidate model of efficient, general purpose parallel computation. PhD Thesis. Department of Computer Science, University of Exeter, October, 1994"},{"issue":"4","key":"16_CR43","first-page":"437","volume":"24","author":"Y. C. Ji","year":"2001","unstructured":"Ji Y C, Ding W Q, Chen G L, et al. A realistic parallel computational model. Chinese Journal of Computer, 2001, 24(4):437\u2013441 (in Chinese)","journal-title":"Chinese Journal of Computer"},{"issue":"2","key":"16_CR44","first-page":"63","volume":"37","author":"Y. Yan","year":"1996","unstructured":"Yan Y, Zhang X D, Song Y S. An effective and practical performance prediction model for parallel computing on nondedicated heterogeneous NOW. Journal of Parallel and Distributed Computing, 1996, 37(2):63\u201380","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"4","key":"16_CR45","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF01189854","volume":"26","author":"F. Luccio","year":"1993","unstructured":"Luccio F, Pagli L. A model of sequential computation with pipelined access to memory. Theory of Computing Systems, Springer New York, 1993, 26(4):343\u2013356","journal-title":"Theory of Computing Systems"},{"issue":"2\/3","key":"16_CR46","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01185208","volume":"12","author":"J. Vitter","year":"1994","unstructured":"Vitter J, Shriver E. Algorithms for parallel memory II: hierarchical multi-level memories. Algorithmica, 1994, 12(2\/3):148\u2013169","journal-title":"Algorithmica"},{"key":"16_CR47","doi-asserted-by":"crossref","unstructured":"Cameron K, Sun X H. Quantifying locality effect in data access delay: memory logP. In: Proceedings of the 2003 IEEE International Parallel and Distributed Processing Symposium, France, 2003, 48b","DOI":"10.1109\/IPDPS.2003.1213137"},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"Cameron K W, et al. Lognp and Log3p: accurate analytical model of point-to-point communication in distributed systems. IEEE Transactions on Computers, 2007 (in press)","DOI":"10.1109\/TC.2007.38"},{"key":"16_CR49","doi-asserted-by":"crossref","unstructured":"Cameron K W, Ge R. Predicting and evaluating distributed communication performance. In: Proceedings of the 2004 ACM\/IEEE conference on Supercomputing, USA, 2004, 43","DOI":"10.1109\/SC.2004.40"},{"key":"16_CR50","unstructured":"Zhang Y Q, et al. Memory complexity in high performance computting. In: Proceedings of the Third International Conference on High Performance Computing in Asia-Pacific Region, Singapore, 1998, 142\u2013151"},{"key":"16_CR51","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1146\/annurev.cs.01.060186.001445","volume":"1","author":"L. Snyder","year":"1986","unstructured":"Snyder L. Type architectures, shared memory, and the corollary of modest potential. Annu. Review of Computer Science, 1986, Vol. 1:289\u2013317","journal-title":"Annu. Review of Computer Science"},{"key":"16_CR52","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/3-540-60249-6_68","volume-title":"Proceedings of the 10th International Symposium on Fundamentals of Computation Theory","author":"R. Niedermeier","year":"1995","unstructured":"Niedermeier R, Rossmanith P. PRAM\u2019s towards realistic parallelism: BRAM\u2019s. In: Proceedings of the 10th International Symposium on Fundamentals of Computation Theory, Springer-Verlag Lecture Notes in Computer Science, Germany, 1995, Vol. 965, 363\u2013373"},{"issue":"2","key":"16_CR53","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jpdc.1996.0010","volume":"32","author":"S. E. Hambrusch","year":"1996","unstructured":"Hambrusch S E, Khokhar A. C3: a parallel model for coarse-grained computers. Journal on Parallel and Distributed Computing, 1996, 32(2):139\u2013154","journal-title":"Journal on Parallel and Distributed Computing"},{"issue":"12","key":"16_CR54","first-page":"1660","volume":"26","author":"Y. Q. Zhang","year":"2003","unstructured":"Zhang Y Q. DRAM(h): a parallel computation model for high performance numerical computing. Chinese Journal of Computers, 2003, 26(12):1660\u20131670","journal-title":"Chinese Journal of Computers"},{"key":"16_CR55","unstructured":"Cooperman G, et al. Static performance evaluation for memory-bound computing: the MBRAM model. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004"},{"issue":"3","key":"16_CR56","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1177\/109434200001400303","volume":"14","author":"S. Browne","year":"2000","unstructured":"Browne S, et al. A portable programming interface for performance evaluation on modern processors. The International Journal of High Performance Computing Applications, 2000, 14(3):189\u2013204","journal-title":"The International Journal of High Performance Computing Applications"}],"container-title":["Frontiers of Computer Science in China"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-007-0016-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-007-0016-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-007-0016-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T10:59:34Z","timestamp":1683889174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-007-0016-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["16"],"URL":"https:\/\/doi.org\/10.1007\/s11704-007-0016-1","relation":{},"ISSN":["1673-7350","1673-7466"],"issn-type":[{"value":"1673-7350","type":"print"},{"value":"1673-7466","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5]]}}}