You are here: ABI » ThesesHome » ThesisMCRazer » ThesisMCRazerWeeklyReports » ThesisMCRazerParallelOptions
Page ThesisMCRazerParallelOptions
| Option | Details and Options | Pro | Contra | TBB? |
|---|---|---|---|---|
 |
Filter and verifiere copy per genome | needs a lot of memory | ||
| |
prob. not cache local as it needs to switch between genomes | |||
 |
coupled filter-verifier-pairs | no spin lock for verifier | ||
| |
each pair over a subset of the reads | filter is parallel | ||
| |
a) pairs operate independent from each other | no regulation necessary | one might run away (cache) | |
| |
b) pairs operate in the same window | little regulation, simple find() | waiting times | |
| |
c) Distance between pairs is restricted | waiting times, regulation for more than two pairs get complex | ||
| |
distance between filter and verifier fixed ? | |||
 |
One filter over all reads, verification parallelized | spin locks for verifier necessary, probably bad use of capacity in repeats | ||
| |
a) windows | simple find() | filters are not parallel (problem with high number of cores) | |
| |
c) distance between filter and verifier | complex find() | ||
| Parallelize by Genome | ||||
| Parallelize by Reads | ||||
| Pipeline | ||||
| |
b) tokens | complex find() | TBB | |
Sitemap
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors. Ideas, requests, problems regarding Foswiki? Send feedback