Yoyo@home/en: Unterschied zwischen den Versionen

Aus BC-Wiki
Zur Navigation springen Zur Suche springen
K (fix runtime)
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://stats.distributed.net/projects.php?project_id=28 OGR-Golomb-Ruler]'''
* The distributed.net client and runs OGR work units. This project searches for the shortest Optimal Golumb Ruler of the length 26.<br>''Note:'' the application has no checkpoints!


'''[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.<br>''Note:'' the application has no checkpoints!
* [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=Team Rechenkraft.net
|Institution=Rechenkraft.net e.V.
|Country=Germany
|Country=Germany
|Area=[[BOINC-Projects/en#Mathematics|Mathematics]]
|Area=[[BOINC-Projects/en#Mathematics|Mathematics]]
|Windows=cruncher 519.01<br>ecm 705.02<br>ecm P2 705.2
|Windows=ecm 705.02<br>ecm P2 705.2
|Linux=cruncher 519.01<br>ecm 705.01<br>ecm P2 705.1
|Linux=ecm 705.01<br>ecm P2 705.1
|Mac=cruncher 519.01<br>ecm 705.01<br>ecm P2 705.1
|Mac=ecm 705.01<br>ecm P2 705.1
|64bit=cruncher 519.01 [win/linux/mac]<br>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]
|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=cruncher 518.01
|PS3=
|ATI=
|ATI=
|CUDA=
|CUDA=
Zeile 64: Zeile 62:
|SP=no
|SP=no
|DP=no
|DP=no
|RAM=9,2MB (OGR)<br>252MB (ECM)<br>6-8 GB (ecm P2)
|RAM=252MB (ECM)<br>6-8 GB (ecm P2)
|Runtime=9h (ecm_mp)<br>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)
|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=20 days (OGR)<br>1-5 days (ECM)
|Deadline=1-5 days (ECM)
|Checkpoints=yes
|Checkpoints=yes
}}
}}
{{Languages|Yoyo@home}}
{{Languages|Yoyo@home}}

Aktuelle Version vom 3. Juni 2023, 21:03 Uhr

yoyo-logo.jpg

Subprojects

ECM

  • ECM is a program for Elliptic Curve Factorization which is used by a couple of projects to find factors for different kind of numbers. Supported ecm projects:
    • Aliquot Sequences
    • Oddperfect
    • ElevenSmooth
    • XYYXF
    • NearRepdigit
    • RepUnit
    • Mersenne-Primzahlen + 2
    • CullenWoodall
    • UpfortheCount

Siever

  • This subproject produces Sieve Files for the CRUS-project. We are sieving for Riesel/Sierpinski to b conjectures where b<1030. (Form: k*b^n-/+1). Sieve files are needed to start testing for primes.

M Queens

  • The M queens puzzle is the problem of placing M chess queens on an M x M chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. It starts with M = 24


Finished subprojects:

  • OGR25
  • OGR26
  • OGR27
  • OGR28
  • EvoRobots (was active only a short time)
  • Euler
    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.
  • Harmonious Trees
    Graham and Sloane proposed in 1980 a conjecture stating that every tree has a harmonious labelling, a graph labelling closely related to additive base. We do a computational approach to this conjecture by checking trees with limited size.
  • Odd Weird Search
    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.
  • Muon
    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.
  • evolution@home
    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
    Nontrivial Collatz Cycle wants to prove that there are no Collatz Cycles with length < 17*10^9 other than 1 - 4 - 2. Therefore it searches for Path Records with start numbers up tp 10^21.
  • Perfect Cuboids
    Aims to find 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).
Project Badges Status
ECM
Euler 625 finished
Evolution finished
EvoRobots finished
Harmonious Trees finished
M Queens
Muon finished
Nontrivial Collatz Cycles finished
Odd Weird Search finished
OGR finished
Perfect Cuboids finished
Siever
yoyo@home
Screensaver
Start 2007
End
Status
Admin yoyo
Institution Rechenkraft.net e.V.
Country Germany
Area Mathematics
Apps
Win ecm 705.02
ecm P2 705.2
Linux ecm 705.01
ecm P2 705.1
Mac ecm 705.01
ecm P2 705.1
64bit ecm 705.02/705.01 [win/linux/mac]
Siever 145.04/145.02 [win/linux]
M Queens 0.01/0.02 [win/linux]
ecm P2 705.02/705.01 [win/linux/mac]
PS3
ATI
CUDA
Intel
Android
RPi
NCI
System-Specs
VRAM SP DP
RAM 252MB (ECM)
6-8 GB (ecm P2)
Runtime 3,5h (ecm_es)
5,5min (ecm_op)
1h (ecm_nr)
7h (ecm_ru)
2h (ecm_cw)
1-2h (ecm P2)
HDD MB
Traffic dl/ul kb
Deadline 1-5 days (ECM)
Checkpoints