参考文献
[1]周涛,张子柯,陈观荣,等.复杂网络研究的机遇与挑战[J].电子科技大学学报,2014,43(1):1-5.
[2]Bader D A,Madduri K.Designing Multithreaded Algo-rithms for Breadth-first Search and st-connectivity on the Cray MTA-2[C]//Proceedings of ICPP’06.Washington D.C.,USA:IEEE Press,2006:523-530.
[3]Bader D A,Madduri K.Parallel Algorithms for Evaluat-ing Centrality Indices in Real-world Networks[C]//Proceedings of ICPP’06.Washington D.C.,USA:IEEE Press,2006:539-550.
[4]Zhao Xiaohan,Sala A,Zheng Haitao,et al.Efficient Shortest Paths on Massive Social Graphs[C]//Proceedings of the 7th International Conference on Collaborative Computing:Networking,Applications and Worksharing.Orlando,USA:
[s.n.],2011:77-86.
[5]Hardin D S,Hardin S S.ACL2 Meets the GPU:Formalizing a CUDA-based Parallelizable All-pairs Shortest Path Algorithm in ACL2[C]//Proceedings of ACL2’13.[S.l.]:EPTCS,2013:127-142.
[6]郭绍忠,王伟,周刚,等.基于 GPU 的单源最短路径算法设计与实现[J].计算机工程,2012,38(2):42-44.
[7]Pandey M,Pandey H,Sharma S.In-place Recursive Approach for All-pairs Shortest-path Problem Using OPENCL[C]//Proceedings of ICIT’13.Washington D.C.,USA:IEEE Press,2013.
[8]Ortega-Arranz H,Torres Y,Llanos D R,et al.The All-pair Shortest-path Problem in Shared-memory Hetero-geneous Systems[EB/OL].(2013-01-03).http://www. infor.uva.es/~yuri.torres/docs/hector_Complex_2013.pdf.
(下转第93页)
(上接第76页)
[9]Sariyüce A E.Betweenness Centrality on GPUs and Heterogeneous Architectures[C]//Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units.New York,USA:ACM Press,2013.
[10]Aapo K,Blelloch G E,Guestrin C.GraphChi:Large-scale Graph Computation on Just a PC[C]//Proceedings of OSDI’12.Washington D.C.,USA:IEEE Press,2012:31-46.
[11]Ediger D,Jiang K,Riedy J,et al.GraphCT:Multi-threaded Algorithms for Massive Graph Analysis[J].IEEE Transactions on Parallel and Distributed Systems,2013,24(11):2220-2229.
[12]Kang U,Tsourakakis C E.PEGASUS:A Peta-scale Graph Mining System Implementation and Observa-tions[C]//Proceedings of ICDM’09.Washington D.C.,USA:IEEE Press,2009:229-238.
[13]Kang U,Tsourakakis C E,Appel A P,et al.HADI:Mining Radii of Large Graphs[J].ACM Transactions on Knowledge Discovery from Data,2011,5(8):1-8.
[14]Anderson D P.BOINC:A System for Public-resource Computing and Storage[C]//Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing.Washington D.C.,USA:IEEE Press,2004:4-10.
[15]Anderson D P,Fedak G.The Computational and Storage Potential of Volunteer Computing[C]//Proceedings of the 6th IEEE International Symposium on Cluster Computing and the Grid.Washington D.C.,USA:IEEE Press,2006:73-80.
[16]Latora V,Marchiori M.Efficient Behavior of Small-world Networks[J].Physical Review Letters,2001,87(19):1-4.
[17]Marquezan C,Righi R,Schnorr L M,et al.ICE:A Service Oriented Approach to Uniform the Access and Management of Cluster Environments[C]//Proceedings of Conference on Cluster Computing and the Grid.Washington D.C.,USA:IEEE
Press,2006:54.
[18]张俊军,章旋.ICE中间件技术及其应用研究[J].计算机与现代化,2012,(5):192-194.
编辑金胡考 |