Abstract
The research goal is to develop a large-scale agent-based simulation environment to support implementations of Internet simulation applications. The Small Worlds (SW) graphs are used to model Web sites and social networks of Internet users. Each vertex represents the identity of a simple agent. In order to cope with scalability issues, we have to consider distributed parallel processing. The focus of this paper is to present two parallel-distributed algorithms for the construction of a particular type of SW graph called β-model. The first algorithm serializes the graph construction, while the second constructs the graph in parallel. © Springer-Verlag 2003.
Cite
CITATION STYLE
Rafea, M., Popov, K., Brand, P., Holmgren, F., & Haridi, S. (2004). Parallel Distributed Algorithms of the β-Model of the Small World Graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 675–680. https://doi.org/10.1007/978-3-540-45209-6_95
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
