Our recent Master graduate Matthias Makulla and Prof. Dr. Rudolf Berrendorfhave received a Best Paper Award at the "ComputationWorld 2014" conference which took place in Venice this May.
Their piece of research compared different approaches of a class of efficient algorithms for the management of large graphs on parallel computers. Results showed that for a lesser degree of parallelism, there were little differences between the different approaches. However, when using large parallel computers, the different approaches varied significantly in their efficiency. The structure of the graph is another factor that can influence the performance of the tested class of algorithms.
The two BRSU researchers competed in a strong international field: More than 500 papers had been handed in, 155 of which got accepted for presentation during the multi-conference. At the sub-conference "Sixth International Conference on Future Computational Technologies and Applications" where Makulla and Berrendorf presented their results, the acceptance rate was 26%, of which three teams received an award for their contribution.
Level-Synchronous Parallel Breadth-First Search Algorithms For Multicore and Multiprocessor Systems Proc. Sixth Intl. Conference on Future Computational Technologies and Applications (FUTURE COMPUTING 2014), 2014, pp. 26-31