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

Welcome Guest
Create Account
Logon

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.