Partial servicing of on-line jobs
نویسندگان
چکیده
منابع مشابه
Partial servicing of on-line jobs
We consider the problem of scheduling jobs online, where jobs may be served partially in order to optimize the overall use of the machines. Service requests arrive online to be executed immediately; the scheduler must decide how long and if it will run a job (that is, it must fix the Quality of Service level of the job) at the time of arrival of the job: preemption is not allowed. We give lower...
متن کاملOn-Line Scheduling of Parallelizable Jobs
Abs t r ac t . We consider the problem of efficiently executing a set of parallel jobs on a parallel machine by effectively scheduling the jobs on the computer's resources. This problem is one of optimization of resource utilization by parallel computing programs and/or the management of multi-users requests on a distributed system. We assume that each job is parallelizable and can be executed ...
متن کاملRandomized On-Line Scheduling of Parallel Jobs
W e study randomized on-line scheduling on mesh machines. W e show that for scheduling independent jobs randomized algorithms can achieve a signijicanily better performance than de iemin i s t i c ones; on the oiher hand with dependencies randomization does not help.
متن کاملOn-Line Scheduling of Parallel Jobs
Abstract. Online scheduling of parallel jobs is a problem where jobs with unit processing time and integer release times and deadlines are scheduled on a set of processors. Every job requests certain number of processors. In our setting processors are organized as a hypercube and jobs are scheduled on subhypercubes of the hypercube. The objective is to schedule as many jobs as possible between ...
متن کاملOn-line scheduling mesh jobs with dependencies
We study an on-line problem of scheduling parallel jobs on two-dimensional meshes. Parallel jobs arrive dynamically according to the dependencies between them, which are unknown before the jobs appear. Each job may need more than one processor simultaneously and is required to be scheduled on a submesh of the processors which are located on a two-dimensional mesh, i.e., a job must be scheduled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2001
ISSN: 1094-6136,1099-1425
DOI: 10.1002/jos.89