In this paper, we present slot selection algorithms in economic models for independent job batch scheduling in distributed computing with non-dedicated resources. Existing approaches towards resource co-allocation and multiprocessor job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requi...

We consider the problem of scheduling family jobs with release dates on a bounded batching machine. Our objective is to minimize the maximum completion time of the jobs (i.e., the makespan). We deal with two variants of the problem. One is the identical job size model, in which the machine can process up to b jobs simultaneously as a batch. The other is the non-identical job size model, in whic...

A database management system (DBMS) performs query optimization based on statistical information about data in the underlying database. Out-of-date statistics may lead to inefficient query processing in the system. The existing utility method, which collects statistics in batch mode, suffers from drawbacks such as heavy administrative burden, high system load and tardy updates. In this paper, w...

In this paper, we consider the scheduling problem of minimizing total weighted completion time on uniform machines with unbounded batch. Each of the machine Ml (l = 1, ⋅ ⋅ ⋅ ,m) has a speed sl and can process up to B(≥ n) jobs simultaneously as a batch. The processing time of a batch denoted by P(B) is given by the processing time of the longest job in it, and the running time of the batch on m...

In this paper, we investigate the differences and similarities in user job submission behavior in High Performance Computing (HPC) and High Throughput Computing (HTC). We consider job submission behavior in terms of parallel batch-wise submissions, as well as delays and pauses in job submission. Our findings show that modeling user-based HTC job submission behavior requires knowledge of the und...

We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and s...

We study the problem of minimizing makespan for part machining on a multi-spindle heads machine with a mobile table. We show that this problem can be formulated as a scheduling problem for a single batch machine with compatibility and precedence constraints between jobs. Jobs grouped in a batch are processed simultaneously, but the difference from considered in the literature max-batch machine ...