BOINC projects: Difference between revisions

'''''A - BOINC project definition:''''' A [https://boinc.berkeley.edu/ BOINC] project is a website and server set up by an individual or group to distribute applications (software which is a set of instructions for executing tasks in a computing device) to BOINC volunteer computing devices that are deliberately attached to receive, process and return the results of the application for further research.[[File:{{#setmainimage:Banner.png}}|right|frameless|100x63px|BOINC Projects]]

====44 Active BOINC Projects====

|[https://albertathome.org/ Albert@Home]

|Test project for [[Einstein@Home]]. [[Albert@Home|See more...]]

| find new amicable pairs |Amicable numbers are pairs where the sum of the proper divisors of each is equal to the other number. The goal of this project is to collect all amicable numbers up to a very large limit. [[Amicable Numbers|See more...]]

|[https://boinc.berkeley.edu/pubs.php#Asteroids@home 10]

| style="vertical-align:center;text-align:center; background: yellow; color: black;" |GPU CPU NVIDIA

|Black hole collision simulations to maximize the science gained from gravitational wave observations. [[BlackHoles@Home|See more...]]

|Gives scientists access to the power of volunteer computing without having to operate a BOINC project. [[BOINC Central|See more...]]

|[https://boinc.berkeley.edu/pubs.php#Climateprediction.net 142]

|Analyse ways to improve climate prediction models. [[Climateprediction.net|See more...]]

|Test project for [[Climateprediction.net|climate''prediction''.net]]. [[Cpdnboinc dev|See more...]]

|[https://boinc.berkeley.edu/pubs.php#DENIS@home 5]

|Cardiac electrophysiological simulations, studying the electrical activity of the heart. [[DENIS@home|See more...]]

|[https://boinc.berkeley.edu/pubs.php#Einstein@Home 41]

|Search for pulsars using radio signals and gravitational wave data. [[Einstein@Home|See more...]]

| Provide additional computing power | Provide additional computing power to scientists studying the Gaia (spacecraft) data releases. [[Gaia@home|See more...]]

|[https://boinc.berkeley.edu/wiki/Publications_by_BOINC_projects#Gerasim.40home 9]

|Research in discrete mathematics and logic control systems. [[Gerasim@home|See more...]]

|[https://boinc.berkeley.edu/pubs.php#GPUGrid.net 53]

| style="vertical-align:center;text-align:center; background: cyan; color: black;" |GPU only NVIDIA

|Perform full-atom molecular simulations of proteins on Nvidia GPUs for biomedical research. [[GPUGRID|See more...]]

|A computational platform for analysis based on data extracted from iThena.Measurements project applications/sensors. [[IThena.Computational|See more...]]

|Generate a dynamic topological model of the Internet, based on measurements from distributed devices. [[IThena.Measurements|See more...]]

|[https://boinc.berkeley.edu/pubs.php#LHC@home 68]

|Helping physicists compare theory with experiment, in the search for new fundamental particles and answers to questions about the Universe. [[LHC@home|See more...]]

|A BOINC server for LHC@home development.

|Finds new formulas and more efficient algorithms for a wide range of non-trivial integer sequences.

|Create a highly accurate three-dimensional model of the Milky Way galaxy using data collected from the Sloan Digital Sky Survey. [[MilkyWay@home|See more...]]

|Studies questions related to Minecraft, such as the properties of worlds that can be generated from different random seeds. [[Minecraft@Home|See more...]]

|Combines BOINC with distributed.net to try to break the RC5 cipher. [[Moo! Wrapper|See more...]]

| Performs parts of the number field sieve in the factorization of large integers. [[NFS@Home|See more...]]

|[https://boinc.berkeley.edu/pubs.php#NumberFields@Home 3]

|Search for number fields with special properties to assist with the formulation of mathematical conjectures. [[NumberFields@Home|See more...]]

|Compiles a database of canonical forms (CF) of 10th order diagonal Latin squares (DLS) with orthogonal diagonal Latin squares (ODLS). [[ODLK|See more...]]

|Generates a database of canonical forms (CF) of diagonal Latin squares (DLS) of order 10 having orthogonal diagonal Latin squares (ODLS). [[ODLK1|See more...]]

|Investigate the efficiency and behavior of mobile devices as computing nodes on the BOINC platform for solving the Orthogonal Diagonal Latin Squares (ODLS) search problem. [[Parlea|See more...]]

|Search for world record sized prime numbers, search for particular types of primes such as 321 primes, Cullen-Woodall primes, Proth prime, prime Sierpinski numbers, and Sophie Germain primes. Subprojects also include Seventeen or Bust, and the Riesel problem. [[PrimeGrid|See more...]]

|Test project for PrimeGrid.

|This is a PRIVATE SERVER to coordinate distribution of mathematical work on GFN. The server is open for everybody, but some BOINC experience is recommended. [[PRIVATE GFN SERVER|See more...]]

|Real-time radiation monitoring, detected by gamma sensors connected to volunteer computers. [[Radioactive@home|See more...]]

|[https://rake.boincfast.ru/rakesearch/ RakeSearch]

|[https://boinc.berkeley.edu/pubs.php#Rakesearch 4]

|Implement an application that picks up separate pairs of mutually orthogonal DLSs, which allows reconstructing the full graphs of their orthogonality. [[Rakesearch|See more...]]

|[https://ralph.bakerlab.org/ RALPH@home]

|Test project for [[Rosetta@home]]. [[RALPH@home|See more...]]

|Conjecturing new mathematical formulas. [[Ramanujan Machine|See more...]]

|Uses bioinformatics software to study RNA structure. [[RNA World (beta)|See more...]]

|[https://boinc.berkeley.edu/pubs.php#Rosetta@home 181]

|Protein structure prediction for disease research. [[Rosetta@home|See more...]]

|Independent decentralized drug design by volunteer computing. [[SiDock@home|See more...]]

|The Symmetric Prime Tuples (SPT) project is an continuation of the T. Brada Experimental Grid project

| 1030 trying to solve Sierpinski / Riesel Bases up |Trying to solve Sierpinski / Riesel Bases up to 1030. [[SRBase|See more...]]

|[https://boinc.berkeley.edu/pubs.php#TN-Grid 8]

| ''Gene@home'' is a scientific project belonging to the infrastructure ''TrentoGrid''. It aimed expand networks of genes. |''Gene@home'' is a scientific project belonging to the  infrastructure ''TrentoGrid''. It aims to expand networks of genes. [[TN-Grid|See more...]]

|[https://boinc.berkeley.edu/wiki/Publications_by_BOINC_projects#Universe.40home 14]

|[https://universeathome.pl/universe/apps.php Windows, Linux, ARM]

|Computational astrophysics, computer simulation of stars, galaxies and the Universe. [[Universe@Home|See more...]]

|Research in the field of computational materials design. [[USPEX@HOME|See more...]]

|[https://www.worldcommunitygrid.org/ World Community Grid]

| [https://www.worldcommunitygrid.org/about_us/news.s?filterCategory=1_0&filterTags=14&sortBy=&pageNum=1 77]

|Disease research, various worldwide humanitarian problems. Subprojects include(d) GO Fight Against Malaria, Drug Search for Leishmaniasis, Computing for Clean Water, Clean Energy Project, Discovering Dengue Drugs - Together, Help Cure Muscular Dystrophy, Help Fight Childhood Cancer, Help Conquer Cancer, Mapping Cancer Markers, Human Proteome Folding Project, FightAIDS@Home, Uncovering Genome Mysteries, Let's outsmart Ebola together, Help Stop TB, OpenZika, Smash Childhood Cancer, Open Pandemics - COVID-19. [[World Community Grid|See more...]]

|Collect various statistics about other BOINC projects. [[WUProp@Home|See more...]]

|Test BOINC server software, integer factorization. [[YAFU|See more...]]

|[https://boinc.berkeley.edu/pubs.php#Yoyo@home 9]

|Data structure analysis to help prove a conjecture, elliptic curve factorization, pion creation in a particle accelerator, evolution research, find the shortest optimal Golomb ruler of length 28. [[Yoyo@home|See more...]]

!Project Name

!Sponsor

====274 Completed BOINC Projects ====

!Launched Completed

| style="background: lightgrey;" | [https://web.archive.org/web/20040829080146/http://pirates.vassar.edu:80/ Pirates@HomeMission1] [https://web.archive.org/web/20060117061652/http://pirates.spy-hill.net/ Pirates@Home] [http://primates.spy-hill.net/ Primates@Home]

|Vassar College Independent Independent

|[https://boinc.berkeley.edu/pubs.php#Malariacontrol.net 26]

|[https://boinc.berkeley.edu/pubs.php#Ibercivis 18]

|[https://web.archive.org/web/20070209051807/http://boinc.berkeley.edu/cplan/ Cunning Plan]

|[https://web.archive.org/web/20101025171952/http://project.czechnationalteam.cz/cplan/ Czech National Team project]

| The VBOINC project is the first attempt to use virtual machines with BOINC. VBOINC is located at [https://web.archive.org/web/20120908053351/http://homepages.inf.ed.ac.uk/s0678915/vboinc.html] [http://garymcgilvary.co.uk/vboinc.html]

|Algorithm analysis. OProject@Home based at Olin Library (Rollins College). The library is open and available in the Code.google.com SVN repository.

| [https://boinc.berkeley.edu/pubs.php#Quake-Catcher 13]

|2007-12-05 2023-06-01

|[http://starmageddon.dyndns.org/ninjagrid/ NinjaGrid]

|2009

|Vasyl Kuzmenko

|[http://boinc.comcute.com/SIM/ Comcute emBOINC]

|[http://boinc.comcute.com/cc_boinc/ Comcute Boinc]

|

|[https://web.archive.org/web/20090402124145/http://cleanenergy.harvard.edu/ The Clean Energy Project]  

|

|[https://boinc.berkeley.edu/pubs.php#EOn 6]

|[https://www.sciencedirect.com/science/article/pii/S000926141300763X 1]

|2006-09-11 2014-05-23

|[https://web.archive.org/web/20120102114135/http://ui.hpc.iit.bme.hu/wc/ Web Computing]

|Study how people in a certain region evolve ideologically over time with respect to an idea

|- F

| 

|2009-12-24 2012

|Help other factoring projects such as mersenneforum or XYYXf achieve their academic goals. It infamously factored many of the RSA public keys used to sign the firmware of older TI calculators, https://en.wikipedia.org/wiki/Texas_Instruments_signing_key_controversy, but went on to factor many other, less controversial numbers. Merged into [[NFS@Home]].

|Beal's conjecture is a conjecture in number theory: where A, B, C, x, y, and z are positive integers with x, y, z > 2, then A, B, and C have a common prime factor.

|Part of the Master Thesis: '''''<nowiki/>'Testing Beal conjecture using supercomputers and distributed computing platform BOINC''''''. The predecessor of the project was ''Beal@Home'', which tested the application.

|Run legacy science applications *Phylogenetic Analysis - GARLI *Protein Sequence Comparison - HMMPfam *Conservation Reserve Network Design - MARXAN

|[https://boinc.berkeley.edu/pubs.php#POEM@HOME 5]

|#Quantum-mechanical computations on medically relevant biomolecular systems, to help with developing quantum-mechanics-based approaches for computational drug design #Find safer and greener materials for e-vehicle batteries

|2020-06-30 2022-08-02

|2019-02-03 2022-12-24

|[https://boinc.berkeley.edu/pubs.php#QuChemPedIA@home 4]

|2019-07-01 2022-09-29