Change miniapp URLs to GitHub

Author: rbuch

content/miniApps.html

@@ -55,7 +55,7 @@ <h2>LeanMD</h2>
   atoms – acceleration, velocity and positions.
 
   <div class="features"><p>Features: Automated load balancing, fault tolerance, multicast manager.</p></div>
-  <div class="giturl"><a href="http://charm.cs.illinois.edu/gerrit/gitweb?p=benchmarks/leanmd.git">http://charm.cs.illinois.edu/gerrit/benchmarks/leanmd.git</a></div>
+  <div class="giturl"><a href="https://github.com/UIUC-PPL/leanmd">https://github.com/UIUC-PPL/leanmd</a></div>
 
 <center>
   <div id="multi_figure">
@@ -110,7 +110,7 @@ <h2>AMR</h2>
   then redistribute the blocks periodically without any change to the logic.
 
   <div class="features"><p>Features: quiescence detection, dynamic chare creation, load balancing.</p></div>
-  <div class="giturl"><a href="http://charm.cs.illinois.edu/gerrit/gitweb?p=benchmarks/amr.git">http://charm.cs.illinois.edu/gerrit/benchmarks/amr.git</a></div>
+  <div class="giturl"><a href="https://github.com/UIUC-PPL/amr">https://github.com/UIUC-PPL/amr</a></div>
 
 <center>
   <div id="multi_figure">
@@ -176,7 +176,7 @@ <h2>Barnes-Hut</h2>
   yields an expected complexity of O(N lg N), making it suitable for
   large systems of particles.
 
-  <div class="giturl"><a href="http://charm.cs.illinois.edu/gerrit/gitweb?p=benchmarks/barnes.git">http://charm.cs.illinois.edu/gerrit/benchmarks/barnes.git</a></div>
+  <div class="giturl"><a href="https://github.com/UIUC-PPL/barnes">https://github.com/UIUC-PPL/barnes</a></div>
 <center>
   <div id="multi_figure">
     <figure>
@@ -211,7 +211,7 @@ <h2>Dense LU</h2>
 
   <div class="features"><p>Features: composable library, flexible data placement,
   block-centric control flow, separation of concerns.
-  <div class="giturl"><a href="http://charm.cs.illinois.edu/gerrit/gitweb?p=charmlu.git">http://charm.cs.illinois.edu/gerrit/charmlu.git</a></div>
+  <div class="giturl"><a href="http://github.com/UIUC-PPL/charmlu">http://github.com/UIUC-PPL/charmlu</a></div>
 <center>
   <div id="multi_figure">
     <figure>
@@ -230,14 +230,14 @@ <h2>Dense LU</h2>
 <div class="benchmark">
   <h2>HPCCG</h2>
   <p>HPCCG is Charm++ implementation of HPCCG mini-application in the Mantevo Suite. It was originally developed as the first Mantevo mini-app in order to be the best representation of an unstructured implicit finite element or finite volume application in 800 lines of code.
-  <div class="giturl"><a href="http://charm.cs.uiuc.edu/gerrit/gitweb?p=users%2Flifflander%2Fhpccg.git">https://charm.cs.illinois.edu/gerrit/hpccg</a></div>
+  <div class="giturl"><a href="http://github.com/UIUC-PPL/hpccg">http://github.com/UIUC-PPL/hpccg</a></div>
 </div>
 
 <a name="kripke"></a>
 <div class="benchmark">
   <h2>Kripke</h2>
   <p>Kripke is a proxy application from Lawrence Livermore National Laboratory (LLNL) for Sn discrete particle transport codes. Given a volume of interest, knowledge of its boundary conditions and the particle-generating sources within and outside the domain, Kripke solves for the flux of particles at every point in the domain at a subsequent time. It does so by decomposing the domain into 3-dimensional subdomains that we call zone sets, and then sweeps the over the zone sets for all energy group sets and angular direction sets. These parallel sweeps are all independent of each other, and so Kripke sweeps from all corners of the domain simultaneously and pipelines sweeps originating from the same domain corner. 
-  <div class="giturl"><a href="https://charm.cs.illinois.edu/gerrit/gitweb?p=benchmarks%2Fkripke.git">https://charm.cs.illinois.edu/gerrit/kripke</a></div>
+  <div class="giturl"><a href="https://github.com/UIUC-PPL/kripke">https://github.com/UIUC-PPL/kripke</a></div>
 </div>
 
 <a name="solver"></a>
@@ -253,7 +253,7 @@ <h2>Triangular Solver</h2>
     its independent parts and waits for its dependency messages from the left.
     Nondiagonal blocks wait for the solution values from their corresponding
     diagonal block, and then start their computation. </p>
-  <div class="giturl"><a href="http://charm.cs.illinois.edu/gerrit/gitweb?p=benchmarks/triangularsolver.git">http://charm.cs.illinois.edu/gerrit/benchmarks/triangularsolver.git</a></div>
+  <div class="giturl"><a href="https://github.com/UIUC-PPL/triangularsolver">https://github.com/UIUC-PPL/triangularsolver</a></div>
 <center>
   <div id="multi_figure">
     <figure>
@@ -277,7 +277,7 @@ <h2>1D FFT</h2>
   (FFTW or ESSL) perform serial FFTs on the rows of the matrix. </p>
 
   <div class"features"><p>Features: interoperability with MPI, adaptive overlap.</div>
-  <div class="giturl"><a href="http://charm.cs.illinois.edu/gerrit/gitweb?p=benchmarks/fft-trans.git">http://charm.cs.illinois.edu/gerrit/benchmarks/fft-trans.git</a></div>
+  <div class="giturl"><a href="https://github.com/UIUC-PPL/fft-trans">https://github.com/UIUC-PPL/fft-trans</a></div>
 <center>
   <div id="multi_figure">
     <figure>
@@ -321,7 +321,7 @@ <h2>Random Access</h2>
 
 
   <div class="features"><p>Features: TRAM, automated topology discovery.</div>
-  <div class="giturl"><a href="http://charm.cs.illinois.edu/gerrit/gitweb?p=benchmarks/randomAccess.git">http://charm.cs.illinois.edu/gerrit/benchmarks/randomAccess.git</a></div>
+  <div class="giturl"><a href="https://github.com/UIUC-PPL/randomAccess">https://github.com/UIUC-PPL/randomAccess</a></div>
 <center>
   <div id="multi_figure">
     <figure>
@@ -338,6 +338,6 @@ <h2>Random Access</h2>
   <h2>EP Stream</h2>
   <p> This benchmark is a simple Charm++ implementation of the HPC Challenge
   stream benchmark.
-  <div class="giturl"><a href="http://charm.cs.illinois.edu/gerrit/gitweb?p=benchmarks/hpccstream.git">http://charm.cs.illinois.edu/gerrit/benchmarks/hpccstream.git</a></div>
+  <div class="giturl"><a href="https://github.com/UIUC-PPL/hpccstream">https://github.com/UIUC-PPL/hpccstream</a></div>
 </div>