forked from cms-sw/cmssw
-
Notifications
You must be signed in to change notification settings - Fork 5
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Doublet tuning and new vertex algo #158
Merged
fwyzard
merged 38 commits into
cms-patatrack:CMSSW_10_2_X_Patatrack
from
VinInn:DoubletTuningAndVertex
Sep 12, 2018
Merged
Doublet tuning and new vertex algo #158
fwyzard
merged 38 commits into
cms-patatrack:CMSSW_10_2_X_Patatrack
from
VinInn:DoubletTuningAndVertex
Sep 12, 2018
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
fwyzard
pushed a commit
that referenced
this pull request
Oct 20, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Oct 20, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Oct 20, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Oct 20, 2020
Add a new concurrent vertex algorithm based on DBSCAN (that reuses parts of the pixel cluster algorithm). It still needs to be tuned to reach at least the performance of current DivisiveClustering algorithm used at HLT.
fwyzard
pushed a commit
that referenced
this pull request
Oct 23, 2020
Add a new concurrent vertex algorithm based on DBSCAN (that reuses parts of the pixel cluster algorithm). It still needs to be tuned to reach at least the performance of current DivisiveClustering algorithm used at HLT.
fwyzard
pushed a commit
that referenced
this pull request
Oct 23, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Oct 23, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Nov 6, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Nov 6, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Nov 6, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Nov 6, 2020
Add a new concurrent vertex algorithm based on DBSCAN (that reuses parts of the pixel cluster algorithm). It still needs to be tuned to reach at least the performance of current DivisiveClustering algorithm used at HLT.
fwyzard
pushed a commit
that referenced
this pull request
Nov 6, 2020
Add a new concurrent vertex algorithm based on DBSCAN (that reuses parts of the pixel cluster algorithm). It still needs to be tuned to reach at least the performance of current DivisiveClustering algorithm used at HLT.
fwyzard
pushed a commit
that referenced
this pull request
Nov 16, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Nov 16, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Nov 16, 2020
Add a new concurrent vertex algorithm based on DBSCAN (that reuses parts of the pixel cluster algorithm). It still needs to be tuned to reach at least the performance of current DivisiveClustering algorithm used at HLT.
fwyzard
added a commit
that referenced
this pull request
Nov 27, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
added a commit
that referenced
this pull request
Nov 28, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Dec 25, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Dec 26, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
added a commit
that referenced
this pull request
Dec 26, 2020
Add a new concurrent vertex algorithm based on DBSCAN (that reuses parts of the pixel cluster algorithm). It still needs to be tuned to reach at least the performance of current DivisiveClustering algorithm used at HLT.
fwyzard
added a commit
that referenced
this pull request
Dec 26, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Dec 29, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Dec 29, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Dec 29, 2020
Add a new concurrent vertex algorithm based on DBSCAN (that reuses parts of the pixel cluster algorithm). It still needs to be tuned to reach at least the performance of current DivisiveClustering algorithm used at HLT.
fwyzard
pushed a commit
that referenced
this pull request
Dec 29, 2020
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Jan 13, 2021
Add a new concurrent vertex algorithm based on DBSCAN (that reuses parts of the pixel cluster algorithm). It still needs to be tuned to reach at least the performance of current DivisiveClustering algorithm used at HLT.
fwyzard
pushed a commit
that referenced
this pull request
Jan 15, 2021
Add a new concurrent vertex algorithm based on DBSCAN (that reuses parts of the pixel cluster algorithm). It still needs to be tuned to reach at least the performance of current DivisiveClustering algorithm used at HLT.
fwyzard
pushed a commit
that referenced
this pull request
Jan 15, 2021
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Mar 23, 2021
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
fwyzard
pushed a commit
that referenced
this pull request
Apr 1, 2021
Tune and speed up the pixel doublet alforithm, and take advantage of GPU read-only memory for a further speedup. Includes a python notebook to tune the cuts for doublets and triplets.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR contains two independent components
(it reuses pieces of pixel cluster algo...)
The vertex algorithm will require tuning (to say the least) even to reach the performance of current DivisiveClustering algo used at HLT.
http://innocent.home.cern.ch/innocent/RelVal/gpuverI2/
https://innocent.web.cern.ch/innocent/RelVal/divverI/
Baseline is offline doublets and DA vertexing.
Rebased onto master from #149.