Adaptive scheduling for adjusting retrieval process in boinc-based virtual screening

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work describes BOINC-based Desktop Grid implementation of adaptive task scheduling algorithm for virtual drug screening. The algorithm bases on a game-theoretical mathematical model where computing nodes act as players. The model allows to adjust the balance between the results retrieval rate and the search space coverage. We present the developed scheduling algorithm for BOINC-based Desktop Grid and evaluate its performance by simulations. Experimental analysis shows that the proposed scheduling algorithm allows to adjust the results retrieval rate and the search space coverage in a flexible way so as to reach the maximal efficiency of a BOINC-based Desktop Grid.

Cite

CITATION STYLE

APA

Nikitina, N., & Ivashko, E. (2019). Adaptive scheduling for adjusting retrieval process in boinc-based virtual screening. In Communications in Computer and Information Science (Vol. 965, pp. 453–464). Springer Verlag. https://doi.org/10.1007/978-3-030-05807-4_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free