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...

Decentralized scheduling is the problem of allocating resources to alternative possible uses over time, where competing uses are represented by autonomous agents. Market mechanisms use prices derived through distributed bidding protocols to determine schedules. We investigate the existence of equilibrium prices for some general classes of scheduling problems, the quality of equilibrium solution...

Decentralized scheduling is the problem of allocating resources to alternative possible uses over time, where competing uses are represented by autonomous agents. Market mechanisms use prices derived through distributed bidding protocols to determine schedules. We investigate the existence of equilibrium prices for some general classes of scheduling problems, the quality of equilibrium solution...

We investigate the power of online algorithms and mechanisms for two different classic models of preemptive online job scheduling. These two models are resumptive and non-resumptive job scheduling. The distinction is when we decide to allocate a previously preempted job. In the resumptive model we resume the job’s allocation as if no preemption has occurred. In the non-resumptive model the job’...

We consider the problem of designing truthful mechanisms for scheduling selfish tasks (or agents)—whose objective is the minimization of their completion times—on parallel identical machines in order to minimize the makespan. A truthful mechanism can be easily obtained in this context (if we, of course, assume that the tasks cannot shrink their lengths) by scheduling the tasks following the inc...

We have developed SWAP, a system that automatically detects process dependencies and accounts for such dependencies in scheduling. SWAP uses system call history to determine possible resource dependencies among processes in an automatic and fully transparent fashion. Because some dependencies cannot be precisely determined, SWAP associates confidence levels with dependency information that are ...

Proportional share resource management provides a flexible and useful abstraction for multiplexing timeshared resources. However, previous proportional share mechanisms have either weak proportional sharing accuracy or high scheduling overhead. We present VirtualTime Round-Robin (VTRR), a proportional share scheduler that can provide good proportional sharing accuracy with O(1) scheduling overh...

In this paper we deal with the problem of assuring acceptable grade of service and at the same time increasing a total network throughput. This is possible by combining two usually separate switch functions: traffic shaping (policing) and packet scheduling. We have selected a simple packet switch structure with single FIFO (first-in-first-out) queue per input port. Input queuing has an advantag...