Yoyo@home/en: Unterschied zwischen den Versionen
Zur Navigation springen
Zur Suche springen
Odicin (Diskussion | Beiträge) K (fix runtime) |
Odicin (Diskussion | Beiträge) K (Inst upped) |
||
(2 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt) | |||
Zeile 5: | Zeile 5: | ||
|Project description=[[image:yoyo-logo.png|yoyo-logo.jpg]] | |Project description=[[image:yoyo-logo.png|yoyo-logo.jpg]] | ||
'''Subprojects''' | '''Subprojects''' | ||
'''[http://www.oddperfect.org/ ECM]''' | '''[http://www.oddperfect.org/ ECM]''' | ||
Zeile 29: | Zeile 26: | ||
'''Finished subprojects:''' | '''Finished subprojects:''' | ||
* OGR25 | * [http://stats.distributed.net/project/ogr_status.php?project_id=25 OGR25] | ||
* OGR26 | * [http://stats.distributed.net/project/ogr_status.php?project_id=26 OGR26] | ||
* OGR27 | * [http://stats.distributed.net/project/ogr_status.php?project_id=27 OGR27] | ||
* [http://stats.distributed.net/project/ogr_status.php?project_id=28 OGR28] | |||
* EvoRobots (was active only a short time) | * EvoRobots (was active only a short time) | ||
* [http://euler.free.fr/ Euler]<br>Euler (6,2,5) computes minimal equal sums of power 6. The project is dedicated to all those who are fascinated by powers and integers. | * [http://euler.free.fr/ Euler]<br>Euler (6,2,5) computes minimal equal sums of power 6. The project is dedicated to all those who are fascinated by powers and integers. | ||
Zeile 37: | Zeile 35: | ||
* Odd Weird Search<br>This project is a number-theoretic project which searches for odd weird numbers. In fact, no odd weird number is known. Previous effort searches up to 1017. The project continues this effort of searching for odd weird numbers up to 1021. | * Odd Weird Search<br>This project is a number-theoretic project which searches for odd weird numbers. In fact, no odd weird number is known. Previous effort searches up to 1017. The project continues this effort of searching for odd weird numbers up to 1021. | ||
* [http://www.stephenbrooks.org/muon1/ Muon]<br>Muon simulates and designs parts of a particle accelerator. You are simulating the part of the process where the proton beam hits the target rod and causes pions to be emitted, which decay into muons. | * [http://www.stephenbrooks.org/muon1/ Muon]<br>Muon simulates and designs parts of a particle accelerator. You are simulating the part of the process where the proton beam hits the target rod and causes pions to be emitted, which decay into muons. | ||
* [http://www.evolutionary-research.net/index.html evolution@home]<br> evolution@home represents the first and so far only distributed computing project addressing evolutionary research. It simulates different types of populations and focuses on the analysis of human mitochondrial DNA. | * [http://www.evolutionary-research.net/index.html evolution@home]<br> evolution@home represents the first and so far only distributed computing project addressing evolutionary research. It simulates different types of populations and focuses on the analysis of human mitochondrial DNA. | ||
* Nontrivial Collatz Cycles<br> Nontrivial Collatz Cycle wants to prove that there are no [https://en.wikipedia.org/wiki/Collatz_conjecture#Cycles Collatz Cycles] with length < 17*10^9 other than 1 - 4 - 2. Therefore it searches for [http://www.ericr.nl/wondrous/pathrecs.html Path Records] with start numbers up tp 10^21. | * Nontrivial Collatz Cycles<br> Nontrivial Collatz Cycle wants to prove that there are no [https://en.wikipedia.org/wiki/Collatz_conjecture#Cycles Collatz Cycles] with length < 17*10^9 other than 1 - 4 - 2. Therefore it searches for [http://www.ericr.nl/wondrous/pathrecs.html Path Records] with start numbers up tp 10^21. | ||
* Perfect Cuboids<br> Aims to find [https://en.wikipedia.org/wiki/Euler_brick#Perfect_cuboid Perfect Cuboid] or prove that if it exists, his space diagonal must be greater than 2^63. During the moving up we also will find almost perfect cuboids: Edge and Face cuboids (completely) and some kinds of cuboids in complex numbers (Perfect Complex, Imaginary and Twilight). | * Perfect Cuboids<br> Aims to find [https://en.wikipedia.org/wiki/Euler_brick#Perfect_cuboid Perfect Cuboid] or prove that if it exists, his space diagonal must be greater than 2^63. During the moving up we also will find almost perfect cuboids: Edge and Face cuboids (completely) and some kinds of cuboids in complex numbers (Perfect Complex, Imaginary and Twilight). | ||
Zeile 47: | Zeile 45: | ||
|Status= | |Status= | ||
|Admin=yoyo | |Admin=yoyo | ||
|Institution= | |Institution=Rechenkraft.net e.V. | ||
|Country=Germany | |Country=Germany | ||
|Area=[[BOINC-Projects/en#Mathematics|Mathematics]] | |Area=[[BOINC-Projects/en#Mathematics|Mathematics]] | ||
|Windows= | |Windows=ecm 705.02<br>ecm P2 705.2 | ||
|Linux= | |Linux=ecm 705.01<br>ecm P2 705.1 | ||
|Mac= | |Mac=ecm 705.01<br>ecm P2 705.1 | ||
|64bit= | |64bit=ecm 705.02/705.01 [win/linux/mac]<br>Siever 145.04/145.02 [win/linux]<br>M Queens 0.01/0.02 [win/linux]<br>ecm P2 705.02/705.01 [win/linux/mac] | ||
|PS3= | |PS3= | ||
|ATI= | |ATI= | ||
|CUDA= | |CUDA= | ||
Zeile 64: | Zeile 62: | ||
|SP=no | |SP=no | ||
|DP=no | |DP=no | ||
|RAM= | |RAM=252MB (ECM)<br>6-8 GB (ecm P2) | ||
|Runtime= | |Runtime=3,5h (ecm_es)<br>5,5min (ecm_op)<br>1h (ecm_nr)<br>7h (ecm_ru)<br>2h (ecm_cw)<br>1-2h (ecm P2) | ||
|Diskspace=MB | |Diskspace=MB | ||
|Traffic=kb | |Traffic=kb | ||
|Deadline= | |Deadline=1-5 days (ECM) | ||
|Checkpoints=yes | |Checkpoints=yes | ||
}} | }} | ||
{{Languages|Yoyo@home}} | {{Languages|Yoyo@home}} |
Aktuelle Version vom 3. Juni 2023, 21:03 Uhr
Subprojects
Siever
M Queens
|
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||