For those who follow Assemblathon 2, my last run on my testbed (Illumina data from BGI and from Illumina UK for the Bird/Parrot):
(all mate-pairs failed detection because of the many peaks in each library, I will modify Ray to consider that)
Total number of unfiltered Illumina TruSeq v3 sequences: Total: 3 072 136 294, that is ~3 G sequences !
512 compute cores (64 computers * 8 cores/computer = 512)
Typical communication profile for one compute core:
[1,0]
Yes, each core sends an average of 250 M messages during the 18 hours !
Peak memory usage per core: 2.2 GiB
Peak memory usage (distributed in a peer-to-peer fashion): 1100 GiB
The peak occurs around 3 hours and goes down to 1.1 GiB per node immediately because the pool of defragmentation groups for k-mers occuring once is freed.
The compute cluster I use has 3 GiB per compute core. So using 2048 compute cores would give me 6144 GiB of distributed memory.
Number of contigs: 550764
Total length of contigs: 1672750795
Number of contigs >= 500 nt: 501312
Total length of contigs >= 500 nt: 1656776315
Number of scaffolds: 510607
Total length of scaffolds: 1681345451
Number of scaffolds >= 500 nt: 463741
Total length of scaffolds >= 500: 1666464367
k-mer length: 31
Lowest coverage observed: 1
MinimumCoverage: 42
PeakCoverage: 171
RepeatCoverage: 300
Number of k-mers with at least MinimumCoverage: 2453479388 k-mers
Estimated genome length: 1226739694 nucleotides
Percentage of vertices with coverage 1: 83.7771 %
DistributionFile: parrot-Testbed-A2-k31-
[1,0]
[1,0]
[1,0]
[1,0]
[1,0]
[1,0]
[1,0]
[1,0]
[1,0]
[1,0]
[1,0]
[1,0]
[1,0]
10 largest scaffolds:
257646
266905
268737
272828
281502
294105
294106
296978
333171
397201
# average latency in microseconds (10^-6 seconds) when requesting a reply for a message of 4000 bytes
# Message passing interface rank Name Latency in microseconds
0 r107-n24 138
1 r107-n24 140
2 r107-n24 140
3 r107-n24 140
4 r107-n24 141
5 r107-n24 141
6 r107-n24 140
7 r107-n24 140
8 r107-n25 140
9 r107-n25 139
10 r107-n25 138
11 r107-n25 139
Sébastien
No comments:
Post a Comment