Evgeny Ivashko

Partition Algorithm for Association Rules Mining in BOINC---based Enterprise Desktop Grid

The paper describes an approach to association rules mining from big data sets using BOINC---based Enterprise Desktop Grid. An algorithm of data analysis and a native BOINC---based application are developed. Several experiments with the aim of validation and performance evaluation of the algorithm implementation are performed. The results of the experiments show that the approach is promising; it could be used by small and medium businesses, scientific groups and organizations.

Congestion game scheduling for virtual drug screening optimization

In virtual drug screening, the chemical diversity of hits is an important factor, along with their predicted activity. Moreover, interim results are of interest for directing the further research, and their diversity is also desirable. In this paper, we consider a problem of obtaining a diverse set of virtual screening hits in a short time. To this end, we propose a mathematical model of task scheduling for virtual drug screening in high-performance computational systems as a congestion game between computational nodes to find the equilibrium solutions for best balancing the number of interim hits with their chemical diversity. The model considers the heterogeneous environment with workload uncertainty, processing time uncertainty, and limited knowledge about the input dataset structure. We perform computational experiments and evaluate the performance of the developed approach considering organic molecules database GDB-9. The used set of molecules is rich enough to demonstrate the feasibility and practicability of proposed solutions. We compare the algorithm with two known heuristics used in practice and observe that game-based scheduling outperforms them by the hit discovery rate and chemical diversity at earlier steps. Based on these results, we use a social utility metric for assessing the efficiency of our equilibrium solutions and show that they reach greatest values.

Congestion Game Scheduling Implementation for High-Throughput Virtual Drug Screening Using BOINC-Based Desktop Grid

Virtual drug screening is one of the most common applications of high-throughput computing. As virtual screening is time consuming, a problem of obtaining a diverse set of hits in a short time is very important. We propose a mathematical model based on game theory. Task scheduling for virtual drug screening in high-performance computational systems is considered as a congestion game between computing nodes to find the equilibrium solutions for best balancing between the number of interim hits and their chemical diversity. We present the developed scheduling algorithm implementation for Desktop Grid and Enterprise Desktop Grid, and perform comprehensive computational experiments to evaluate its performance. We compare the algorithm with two known heuristics used in practice and observe that game-based scheduling outperforms them by the hits discovery rate and chemical diversity at earlier steps.

Task Scheduling in Desktop Grids: Open Problems

Abstract We survey the areas of Desktop Grid task scheduling that seem to be insufficiently studied so far and are promising for efficiency, reliability, and quality of Desktop Grid computing. These topics include optimal task grouping, “needle in a haystack” paradigm, game-theoretical scheduling, domain-imposed approaches, special optimization of the final stage of the batch computation, and Enterprise Desktop Grids.

Hierarchical two-level game model for tasks scheduling in a desktop grid

Desktop grids utilize idle computational resources within a research organization. Task scheduling is a very important issue for a desktop grid due to its significant impact on computational performance. In the paper we propose a game-theoretical model of task scheduling in a desktop grid. The model allows to consider the trade-off between the server load and the total time of computations. The numerical results based on a virtual drug screening project are presented, and the Nash equilibrium is found.

Improving “tail” computations in a BOINC-based Desktop Grid

Abstract A regular Desktop Grid bag-of-tasks project can take a lot of time to complete computations. An important part of the process is tail computations: when the number of tasks to perform becomes less than the number of computing nodes. At this stage, a dynamic replication could be used to reduce the time needed to complete computations. In this paper, we propose a mathematical model and a strategy of dynamic replication at the tail stage. The results of the numerical experiments are given.

Task Scheduling in a Desktop Grid to Minimize the Server Load

Desktop Grids utilize computational resources of desktop computers in their idle time. The BOINC middleware for organizing Desktop Grids has an architecture developed to unite a large number of computing nodes. However, a large flow of server requests may limit the Desktop Grid performance. In the paper we present a game-theoretical model of task scheduling in a Desktop Grid. The model allows to consider the trade-off between the server load and the total time of computations. The solution is illustrated on examples.

A Behavioral Modeling Approach to Prevent Unauthorized Large-Scale Documents Copying from Digital Libraries

There are many issues concerning information security of digital libraries. Apart from traditional information security problems there are some specific ones for digital libraries. In this work we consider a behavioral modeling approach to discover unauthorized copying of a large amount of documents from a digital library. Supposing the regular user has interest in semantically related documents, we treat referencing to semantically unrelated documents as anomalous behavior that may indicate attempt of unauthorized large-scale copying. We use an adapted anomaly detection approach to discover attempts of unauthorized large-scale documents copying. We propose a method for constructing classifiers and profiles of regular users’ behavior based on application of Markov chains. We also present the results of experiments conducted within development of a prototype digital library protection system. Finally, examples of a normal profile and an automatically detected anomalous session derived from the real data logs of a digital library illustrate the suggested approach to the problem.

Web service of access to computing resources of BOINC based desktop grid

In the paper we describe a web service of access to computing resources of a desktop grid built in the High-performance Data Center of Karelian Research Centre of the RAS. The grid is based on lightweight, highly scalable BOINC platform. We present the architecture of the system, the current results of implementation and plans for the future. We also present the overview of a scientific research that was carried out with use of the system.