In this paper, the problem of fair scheduling in a wireless network is formulated as an assignment problem and an Optimal Radio Channel Allocation (ORCA) strategy is proposed for fair bandwidth allocation in a centralized manner. Simulation results show that the performance improvement due to ORCA can be significant compared to other wireless fairqueuing mechanisms proposed in the literature su...

As high performance computing clusters are getting cheaper, they become more accessible. The various clusters are running a host of workload management software suites, which are getting more complex and offer cluster administrators numerous features, scheduling policies, job prioritization schemes, etc. In this paper we survey some of the common commercial workload managers on the market, cove...

In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly...

There are many different ways to schedule parallel jobs, and the threads which make them up [17]. But only a few mechanisms are used in practice and studied in detail. Two approaches that have dominated the last decade are backfilling and gang scheduling. In this section we review their variants and the connections between them. We then review the special requirements of scheduling parallel job...

We present a new scheduler architecture, which permits adding QoS policies to the scheduling decisions. We also present a new scheduling synthesis method which allows a designer to obtain a safe scheduler for a particular application. Our scheduler architecture and scheduler synthesis method can be used for heterogeneous applications where the tasks communicate through various synchronisation p...

Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimization problems using this novel efficiency measure, with a particular focus on scheduling problems. While we prove a lower bound of Ω(logn) for a very general class of problems, we give a best possible cost sharing method for m...

As multimedia applications with real-time constraints rapidly invade today’s desktops, it becomes increasingly important for the operating system to provide robust resource allocation mechanisms for both multimedia and traditional best-effort workloads. We present a flexible CPU scheduling policy that adjusts the CPU proportion allocated to each application class using recent history as a feedb...

While many researchers believe that multimedia applications are best managed with hard, real-time scheduling mechanisms, models based on application-level adaptation with relaxed scheduling constraints are gaining acceptance. We analyze an existing video conferencing application that was designed without explicit support for CPU resource management , and propose modifications to its architectur...

in this paper, a new approach to overlapping operations in job shop scheduling is presented. in many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. in each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...

O Plan is an AI planning architecture which supports research into a number of aspects of planning scheduling and control It is based on earlier work on the O Plan System which was directed towards plan generation The pa per explores the di erent types of choice or dering decisions which need to be made in an architecture for command and control The mechanisms for choice ordering and selection ...