This paper presents the simulation results of comparison of three Round Robin (RR) based QSD (Queue scheduling algorithms). For the first time we propose the comparison of WRR (Weighted Round Robin), WRR/SB (Weighted ...
详细信息
As a key element in cloud computing, with the increasing uncertainty and complexity, task scheduling becomes more and more import. How to perform cloud scheduling effectively while safeguarding the data and informatio...
详细信息
Smart Environment aims to improve humans' quality of life. IoT is an emerging paradigm that makes the environment smart by using sensing technologies in IoT devices and cloud computing technology. Various surveys ...
详细信息
In this paper, we investigate the use of application-specific hints when scheduling jobs on a Computational Grid, as these jobs can expose widely differing characteristics regarding CPU and I/O requirements. Specifica...
详细信息
ISBN:
(纸本)3540221166
In this paper, we investigate the use of application-specific hints when scheduling jobs on a Computational Grid, as these jobs can expose widely differing characteristics regarding CPU and I/O requirements. Specifically, we consider hints that specify the relative importance of network and computational resources w.r.t. their influence on the associated application's performance. Using our ns-2 based Grid Simulator (NSGrid), we compare schedules that were produced by taking application-specific hints into account to schedules produced by applying the same strategy for all jobs. The results show that better schedules can be obtained when using these scheduling hints intelligently.
In this paper we study a class of scheduling algorithms for multiprocessors computing systems which we call level algorithms. These algorithms are simple and easy to implement. They produce optimal schedules in some c...
详细信息
The task scheduling is an important issue of grid workflow. This paper based on several existing scheduling algorithms, aims at the task characteristics of the grid workflow, and presents a heuristic scheduling algori...
详细信息
We consider a model where multiple queues are served by a server whose capacity varies randomly and asynchronously with respect to different queues. The problem is to optimally control large deviations of the queues i...
详细信息
ISBN:
(纸本)9781604237924
We consider a model where multiple queues are served by a server whose capacity varies randomly and asynchronously with respect to different queues. The problem is to optimally control large deviations of the queues in the following sense: find a scheduling rule maximizing min i h lim n!1 1 n log P (aiQi n) i , (1) where Qi is the length of i-th queue in a stationary regime, and ai 0 are parameters. Thus, we seek to maximize the minimum of the exponential decay rates of the tails of distributions of weighted queue lengths aiQi. We give a characterization of the upper bound on (1) under any scheduling rule, and of the lower bound on (1) under the exponential (EXP) rule. For the case of two queues, we prove that the two bounds match, thus proving optimality of EXP rule in this case. The EXP rule is not asymptotically invariant with respect to scaling of the queues, which complicates its analysis in large deviations regime. To overcome this, we introduce and prove a refined sample path large deviations principle, or refined Mogulsky theorem, which is of independent interest.
Computational grid has the potential for solving large-scale scientific problems using distributed resources. Grid scheduling is a vital component of a Computational Grid infrastructure. In this paper, we evaluate our...
详细信息
Improving energy efficiency has become necessary to enable sustainable computational science. At the same time, scientific workflows are key in facilitating distributed computing in virtually all domain sciences. As d...
详细信息
We propose two efficient scheduling algorithms for OFDMA networks based on graph theory. The algorithms overcome many drawbacks of previously proposed algorithms such as assuming a single service scenario, limiting th...
详细信息
暂无评论