Change search
ReferencesLink to record
Permanent link

Direct link
Parallel distributed algorithms of the beta-model of the small world graphs
Number of Authors: 4
2003 (English)Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
2003, 2.
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14620OAI: diva2:1035909
9th International Euro-Par Conference on Parallel and Distributed Computing
Lecture Notes in Computer Science; 2790 978-3-540-40788-1Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(36 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 36 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link