M. Ajtai, J. Aspnes, M. Naor, Y. Rabani, L. Schulman, and O. Waarts. Fairness in scheduling. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms,January 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fairness in Periodic Real-Time Scheduling - Baruah (1995) (9 citations) (Correct)
....the attempt is to minimize the length of time during whichatask is denied service, then S2istheschedule of choice, since it is, in an intuitive sense, fairer. Temporal fairness. This issue of fairness in resource allocation and scheduling has recently been attracting considerable attention [1, 2,3,4]. Motivated no doubt in part by applications, suchasmultimedia, which are characterized by fairly regular resource requirements over extended intervals, attempts have been made to formalize and characterize notions of temporal fairness. This research addresses the issue of designing fair ....
....by a problem instance Phi, ensures that Algorithm WM will schedule Phi in a pfair manner. 2 Pfairness: Definitions, and related work We start with some conventions: ffl We adopt the standard notation of having [a# b) denote the contiguous natural numbers a# a 1#: #b; 1. slots: 0] [1] [2] t ; 1] t] instants: 0 1 2 3 t ; 1 t t 1 Figure 1: Notation: Time instants and time slots ffl Scheduling decisions are made at integral values of time, numbered from 0. The real interval between time t and time t 1 (including t, excluding t 1) will be referred to as slot t, t 2 N (see ....
M. Ajtai, J. Aspnes, M. Naor, Y. Rabani, L. Schulman, and O. Waarts. Fairness in scheduling. In Proceedings of the Sixth Annual ACMSIAM SymposiumonDiscrete Algorithms,Jan- uary 1995.
Randomized Allocation Processes (Extended Abstract) - Czumaj, al. (1997) (Correct)
....al. 6] showed that, independently of the initial distribution of the balls, after O(n 3 ) steps the maximum load in any bin will be ln ln n= ln d O(1) w.h.p. Another infinite model of randomized on line load balancing, called the dynamic edge orientation problem, was studied by Ajtai et al. [2]. Mitzenmacher [21] analyzed a similar infinite and continuous randomized allocation process for the so called supermarket model, in which the balls arrive as a Poisson stream and each nonempty bin removes the balls with exponential distribution with mean one. All of the above allocation ....
....a disk, etc. The user may check the load of all servers and put the task into the least loaded server. Although this process leads to ideally balanced distribution of the tasks, it is expensive, since it requires sending a message to each server in the system and interrupting its work. The ABKU[2] scheme can be used to obtain a more efficient solution. In a system with n tasks and n servers, if each user samples the load of two resources chosen i.u.r. and submits the task to the least loaded one, then the total overhead caused by communication with the 3 servers is 2n, and the load of the ....
[Article contains additional citation context not shown here]
M. Ajtai, J. Aspnes, M. Naor, Y. Rabani, L. J. Schulman, and O. Waarts. Fairness in scheduling. In Pro9 ceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 477--485, 1995.
On Fairness in the Carpool Problem - Naor (2004) Self-citation (Naor) (Correct)
No context found.
M. Ajtai, J. Aspnes, M. Naor, Y. Rabani, L. J. Schulman and O. Waarts, Fairness in Scheduling, J. Algorithms 29(2), 1998, pp. 306--357.
Real-Time Mutable Broadcast Disks - Baruah, Bestavros (1997) (5 citations) (Correct)
No context found.
M. Ajtai, J. Aspnes, M. Naor, Y. Rabani, L. Schulman, and O. Waarts. Fairness in scheduling. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms,January 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC