Rafea, Mahmoud and Popov, Konstantin and Brand, Per and Holmgren, Fredrik (2003) Parallel distributed algorithms of the beta-model of the small world graphs. In: 9th International Euro-Par Conference on Parallel and Distributed Computing, 26-29 Aug 2003, Klagenfurt, Austria.
|PDF - Accepted Version|
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 Beta-model. The first algorithm serializes the graph construction, while the second constructs the graph in parallel.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||Lecture Notes in Computer Science; 2790 978-3-540-40788-1|
|Deposited By:||INVALID USER|
|Deposited On:||13 Jun 2008|
|Last Modified:||12 Sep 2016 09:56|
Repository Staff Only: item control page