Российские распределенные вычисления на платформе BOINC
Berkeley Open Infrastructure for Network Computing

Welcome Guest
Create Account
Logon
http://gerasim.boinc.ru/sched/gsm.sched
Join
 Read our rules and policies
 Download BOINC
When prompted, enter
http://gerasim.boinc.ru/
 Applications
Community
 User search
 Team search
 Participant profiles
 Message boards
Project
 Top Users
 Top Teams
 Top Computers
 Top Countries
 Top Accelerators
About Gerasim@home
 Science
 FAQ
 Contacts
Misc
 Links

Thank you for your interest in Gerasim@home !

The project uses Internet-connected computers to do research in discrete mathematics and logic control.
The current goal: testing and comparison of heuristic methods for getting separations of parallel algorithms working in the CAD system for designing logic control systems.

You can participate by downloading and running a free program on your computer.


Project News
Saturday, November 07, 2015 evatutin#68

 

По результатам конференции BOINC:FAST 2015 опубликована работа

Vatutin E.I., Valyaev S.Yu., Titov V.S. Comparison of Sequential Methods for Getting Separations of Parallel Logic Control Algorithms Using Volunteer Computing // CEUR Workshop Proceedings. Proceedings of the Second International Conference BOINC-based High Performance Computing: Fundamental Research and Development (BOINC:FAST 2015). Vol. 1502. Technical University of Aachen, Germany, 2015. P. 37–51. urn:nbn:de:0074-1502-3.

В ней сделан краткий обзор того, что сделано в проекте по задаче поиска разбиений (на английском, как недавно просили забугорные кранчеры). Основной упор в работе сделан на последовательные методы, в ближайшей перспективе нужно попробовать различные итерационные методы.

 

After BOINC:FAST 2015 conference was published article


Vatutin E.I., Valyaev S.Yu., Titov V.S. Comparison of Sequential Methods for Getting Separations of Parallel Logic Control Algorithms Using Volunteer Computing // CEUR Workshop Proceedings. Proceedings of the Second International Conference BOINC-based High Performance Computing: Fundamental Research and Development (BOINC:FAST 2015). Vol. 1502. Technical University of Aachen, Germany, 2015. P. 37–51. urn:nbn:de:0074-1502-3.

This work aimed to show the brief review of experimental results within getting separations problem (in english as requested by some crunchers). Main result is directed to comparison of different known consecutive methods. At the nearest future we plan to organize additional set of experiments with iterative methods.


Monday, July 06, 2015 evatutin#67

В проект добавлено более 1 млн. WU'шек, можно начинать считать. Цель текущего (№ 24) и следующего (№ 25, он уже готов и на очереди) экспериментов заключается в попытке расширить область сравнения методов в задаче поиска разбиений как минимум до N=800.

Over 1 million WUs was added, we are working again. Aim of current (№ 24) and next (№ 25, it is also ready but not added yet) is to expand analazed area for heuristic methods of getting separations at least to the N=800.


All news

News is available as an RSS feed
User of the day
RNagibovich
Project status
Last update: 27 Apr 2016 23:52:00 UTC
 State: Alpha 
 Account creation: Enabled 
 Credits total: 414,557,545 
 Participants total: 3,136 
 Teams total: 415 
 Countries total: 129 
 Computers total: 7,390 
Tasks
 Ready to send: 79,980 
 In progress: 0 
 Send work: Disabled 
Go to server status page