An effective and efficient parallel approach for random graph generation over GPUs

Journal of Parallel and Distributed Computing

Volumn 73, Issue 3, 2013, Pages 303-316

  Bressan, Stéphane ^a   Cuzzocrea, Alfredo ^b   Karras, Panagiotis ^a   Lu, Xuesong ^a   Nobari, Sadegh Heyrani ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

GPU; Parallel algorithm; Random graph; Random graph generation

Indexed keywords

COMPLEX NETWORKS; COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; COMPUTER HARDWARE; GRAPH THEORY; GRAPHIC METHODS; PARALLEL ALGORITHMS; PROGRAM PROCESSORS;

CLASSICAL APPROACH; DATABASE APPLICATIONS; EXPERIMENTAL ASSESSMENT; PARALLEL PROCESSING; RANDOM GRAPHS; RANDOMIZED ALGORITHMS;

GRAPHICS PROCESSING UNIT;

EID: 84886776151     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2012.09.010     Document Type: Article

References (46)

1. V. Batagelj, U. Brandes, Efficient generation of large random networks, Physical Review E 71 (3) (2005) 036113.
2. B. Bollobas, Random Graphs, second ed., Academic Press, 2001.
3. P. Bratley, B.L. Fox, L.E. Schrage, A Guide to Simulation, second ed., Springer, 1987, p. 397.
4. A.Z. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, J.L. Wiener, Graph structure in the web, Computer Networks 33 (1-6) (2000) 309-320.
5. G. Ciriello, C. Guerra, A review on models and algorithms for motif discovery in protein-protein interaction networks, Briefings in Functional Genomics and Proteomics 7 (2) (2008) 147-156.
6. S. Crisóstomo, U. Schilcher, C. Bettstetter, J. Barros, Analysis of probabilistic flooding: how do we choose the right coin, in: IEEE ICC, 2009.
7. CUDA Zone: Toolkit & SDK. http://www.nvidia.com/object/what-is-cuda- new.html.
8. J. Dean, S. Ghemawat, MapReduce: simplified data processing on large clusters, in: OSDI, 2004.
9. P. Erdo{combining double acute accent}s, A. Rényi, On random graphs, I, Publicationes Mathematicae 6 (1959) 290-297.
10. J.H. Fowler, C.T. Dawes, N.A. Christakis, Model of genetic variation in human social networks, Proceedings of the National Academy of Sciences of the United States of America 106 (6) (2009) 1720-1724.
11. A.J. Ganesh, L. Massoulié, D.F. Towsley, The effect of network topology on the spread of epidemics, in: INFOCOM, 2005.
12. E.N. Gilbert, Random graphs, The Annals of Mathematical Statistics 30 (4) (1959) 1141-1144.
13. A. Gionis, H. Mannila, T. Mielikäinen, P. Tsaparas, Assessing data mining results via swap randomization, ACM Transactions on Knowledge Discovery from Data 1 (3) (2007).
14. J. Gomez-Gardenes, Y. Moreno, From scale-free to Erdo{combining double acute accent}s-Rényi networks, Physical Review E 73 (5) (2006) 1-8.
15. D. Gregor, A. Lumsdaine, The parallel BGL: a generic library for distributed graph computations, in: Parallel Object-Oriented Scientific Computing (POOSC), 2005.
16. S. Hanhijärvi, G.C. Garriga, K. Puolamäki, Randomization techniques for graphs, in: SDM, 2009.
17. M. Hay, G. Miklau, D. Jensen, D.F. Towsley, P. Weis, Resisting structural re-identification in anonymized social networks, Proceedings of the VLDB Endowment 1 (1) (2008) 102-114.
18. J. Hensley, T. Scheuermann, G. Coombe, M. Singh, A. Lastra, Fast summed-area table generation and its applications, Computer Graphics Forum 24 (3) (2005) 547-555.
19. D. Horn, Stream reduction operations for GPGPU applications, in: M. Pharr (Ed.), GPU Gems 2, Addison Wesley, 2005.
20. L. Howes, D. Thomas, Efficient random number generation and application using CUDA, in: H. Nguyen (Ed.), GPU Gems 3, Addison Wesley, 2007.
21. A. Inokuchi, T. Washio, H. Motoda, Complete mining of frequent patterns from graphs: mining graph data, Machine Learning 50 (3) (2003) 321-354.
22. Y.M. Ioannides, Random graphs and social networks: an economics perspective, Technical Report 0518, Department of Economics, Tufts University, 2005.
23. K.E. Iverson, A Programming Language, Wiley, 1962.
24. M. Kaiser, R. Martin, P. Andras, M.P. Young, Simulation of robustness against lesions of cortical networks, European Journal of Neuroscience 25 (10) (2007) 3185-3192.
25. J.M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins, The web as a graph: measurements, models, and methods, in: COCOON, 1999.
26. D.E. Knuth, The linear congruential method, in: The Art of Computer Programming, Volume 2: Seminumerical Algorithms, third ed., Addison Wesley, 1997, pp. 10-26.
27. W.B. Langdon, A fast high-quality pseudo-random number generator for graphics processing units, in: IEEE Congress on Evolutionary Computation, 2008.
28. W.B. Langdon, A fast high-quality pseudo-random number generator for nVidia CUDA, in: GECCO, Companion, 2009.
29. W.B. Langdon, A many-threaded CUDA interpreter for genetic programming, in: EuroGP, 2010.
30. Q. Lv, P. Cao, E. Cohen, K. Li, S. Shenker, Search and replication in unstructured peer-to-peer networks, in: SIGMETRICS, 2002.
31. A. Ma'ayan, A. Lipshtat, R. Iyengar, E. Sontag, Proximity of intracellular regulatory networks to monotone systems, IET Systems Biology 2 (3) (2008) 103-112.
32. G. Marsaglia, W.W. Tsang, The ziggurat method for generating random variables, Journal of Statistical Software 5 (8) (2000) 1-7.
33. D. McDonald, L. Waterbury, R. Knight, M. Betterton, Activating and inhibiting connections in biological network dynamics, Biology Direct 3 (1) (2008) 49.
34. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
35. M. Newman, Power laws, pareto distributions and Zipf's law, Contemporary Physics 45 (5) (2005) 323-351.
36. M.E.J. Newman, D.J. Watts, S.H. Strogatz, Random graph models of social networks, Proceedings of the National Academy of Sciences of the United States of America 99 (Suppl. 1) (2002) 2566-2572.
37. S.K. Park, K.W. Miller, Random number generators: good ones are hard to find, Communications of the ACM 31 (10) (1988) 1192-1201.
38. S. Pettie, V. Ramachandran, Randomized minimum spanning tree algorithms using exponentially fewer random bits, ACM Transactions on Algorithms 4 (1) (2008) 5:1-5:27.
39. C.P. Robert, G. Casella, Monte Carlo Statistical Methods, in: Springer Texts in Statistics, Springer, 2005.
40. S. Sengupta, M. Harris, M. Garland, Efficient parallel scan algorithms for GPUs, Technical Report NVR-2008-003, NVIDIA Corporation, 2008.
41. S. Sengupta, M. Harris, Y. Zhang, J.D. Owens, Scan primitives for GPU computing, in: ACM SIGGRAPH/EUROGRAPHICS Symposium on Graphics Hardware, 2007.
42. S. Sengupta, A. Lefohn, J.D. Owens, A work-efficient step-efficient prefix sum algorithm, in: Proceedings of the Workshop on Edge Computing Using New Commodity Architectures, EDGE, 2006.
43. M. Sussman, W. Crutchfield, M. Papakipos, Pseudorandom number generation on the GPU, in: ACM SIGGRAPH/EUROGRAPHICS Symposium on Graphics Hardware, 2006.
44. C.E. Tsourakakis, U. Kang, G.L. Miller, C. Faloutsos, DOULION: counting triangles in massive graphs with a coin, in: KDD, 2009.
45. J.S. Vitter, Random sampling with a reservoir, ACM Transactions on Mathematical Software 11 (1) (1985) 37-57.
46. X. Ying, X. Wu, Graph generation with prescribed feature constraints, in: SDM, 2009.