Consider a single server queue serving a multiclass population. Some popular scheduling policies for such a system (and of interest in this paper) are the discriminatory processor sharing (DPS), discriminatory random order service (DROS), generalized processor sharing (GPS) and weighted fair queueing (WFQ). The aim of this paper is to show a certain equivalence between these scheduling policies...

A cloud system environment is considered as the framework to provide resource and service distribution to the users. These different environment forms are accessed by different users under the service specification. The constraints at different levels are negotiated between the providers and the users. The paper has defined the different cloud services relative to the SLA behavior. The paper al...

A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a so...

In this paper we study the performance of a distributed system which is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. System performance is examined and compared in cases where different distribution...

We study one of the most basic online scheduling models, online one machine scheduling with delivery times where jobs arrive over time. We provide the rst randomized algorithm for this model, show that it is 1.55370-competitive and show that this analysis is tight. The best possible deterministic algorithm is 1:61803-competitive. Our algorithm is a distribution between two deterministic algorit...

The optimization problem of relief supplies distribution for large-scale emergencies is discussed in this paper. Under the situation that the needs for relief supplies are more numerous and urgency, the optimization goal should be minimum disaster loss instead of minimum delivery cost or shortest travel distance. By setting objective function about minimum disaster loss, scheduling model of rel...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...