Heterogeneity has been considered in scheduling, but without taking into account the temporal variation of completion times of the sub-tasks for a divisible, independent task. In ...
This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters. Two scheduling...
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide an user the transparency of anywhere, anyplace, anytime computing. Pervasive comp...
K. Kalapriya, S. K. Nandy, V. Satish, R. Uma Mahes...