Workflow scheduling on the Grid becomes more challenging when multiple scheduling
criteria are considered. Existing studies provide different approaches to the multi-criteria …

Hundreds of papers on job scheduling for distributed systems are published every year and
it becomes increasingly difficult to classify them. Our analysis revealed that half of these …

Typical patterns of using scientific workflows include their periodical executions using a fixed
set of computational resources. Using the statistics from multiple runs, one can accurately …

In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in
distributed computing with non-dedicated and heterogeneous resources. A single slot is a …

In this paper, we consider the problem of scheduling a special kind of mixed data-parallel
applications arising in the context of Continuous Integration. Continuous integration (CI) is a …

Workflow scheduling on parallel systems has long been known to be a NP-complete
problem. As modern grid and cloud computing platforms emerge, it becomes indispensable …

Many scientific applications can be structured as parallel task graphs (PTGs), that is, graphs
of data-parallel tasks. Adding data parallelism to a task-parallel application provides …

Запропоновано інформаційну технологію розподілу завдань для GRID-систем, яка
заснована на використанні імітаційного середовища моделювання GRASS. GRASS …

Distributed environments with the users decoupling from resource providers are generally
defined as utility Grids. This paper focuses on the problems of an efficient scheduling in …

Coverage estimation for model checking quantifies the completeness of a set of properties.
We present an improved version of the algorithm of Hoskote et al.[7] that applies to a larger …