Implementation level

Difference between revisions of "BFS, Java, WebGraph"

From Algowiki
Jump to navigation Jump to search
[checked revision][checked revision]
 
Line 1: Line 1:
 +
{{level-i}}
 +
 
Primary author of this description: [[:ru:Участник:Elijah|I.V.Afanasyev]].
 
Primary author of this description: [[:ru:Участник:Elijah|I.V.Afanasyev]].
  
== Software implementation of the algorithm: BFS, Java, WebGraph ==
+
= Links =
 
 
 
The <code>[http://webgraph.di.unimi.it/docs/it/unimi/dsi/webgraph/algo/ParallelBreadthFirstVisit.html ParallelBreadthFirstVisit]</code> class, multithreaded implementation.
 
The <code>[http://webgraph.di.unimi.it/docs/it/unimi/dsi/webgraph/algo/ParallelBreadthFirstVisit.html ParallelBreadthFirstVisit]</code> class, multithreaded implementation.
  
=== Locality of data and computations ===
+
= Locality of data and computations =
==== Locality of implementation ====
+
== Locality of implementation ==
===== Structure of memory access and a qualitative estimation of locality =====
+
=== Structure of memory access and a qualitative estimation of locality ===
===== Quantitative estimation of locality =====
+
=== Quantitative estimation of locality ===
  
=== Scalability of the algorithm and its implementations ===
+
= Scalability of the algorithm and its implementations =
==== Scalability of the algorithm ====
+
== Scalability of the algorithm ==
==== Scalability of of the algorithm implementation ====  
+
== Scalability of of the algorithm implementation ==
  
=== Dynamic characteristics and efficiency of the algorithm implementation ===
+
= Dynamic characteristics and efficiency of the algorithm implementation =
=== Run results ===
+
= Run results =
  
 
[[Category:Articles in progress]]
 
[[Category:Articles in progress]]
  
 
[[Ru:BFS, Java, WebGraph]]
 
[[Ru:BFS, Java, WebGraph]]

Latest revision as of 10:51, 2 July 2022


Primary author of this description: I.V.Afanasyev.

1 Links

The ParallelBreadthFirstVisit class, multithreaded implementation.

2 Locality of data and computations

2.1 Locality of implementation

2.1.1 Structure of memory access and a qualitative estimation of locality

2.1.2 Quantitative estimation of locality

3 Scalability of the algorithm and its implementations

3.1 Scalability of the algorithm

3.2 Scalability of of the algorithm implementation

4 Dynamic characteristics and efficiency of the algorithm implementation

5 Run results