Sciweavers

412 search results - page 21 / 83
» Parallel Machine Scheduling Problems with Controllable Proce...
Sort
View
IPL
2008
80views more  IPL 2008»
13 years 6 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
HPDC
2012
IEEE
11 years 9 months ago
vSlicer: latency-aware virtual machine scheduling via differentiated-frequency CPU slicing
Recent advances in virtualization technologies have made it feasible to host multiple virtual machines (VMs) in the same physical host and even the same CPU core, with fair share ...
Cong Xu, Sahan Gamage, Pawan N. Rao, Ardalan Kanga...
EUROPAR
2007
Springer
14 years 27 days ago
A Framework for Scheduling with Online Availability
Abstract. With the increasing popularity of large-scale distributed computing networks, a new aspect has to be considered for scheduling problems: machines may not be available per...
Florian Diedrich, Ulrich M. Schwarz
DAGSTUHL
2007
13 years 8 months ago
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
Leah Epstein
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
13 years 10 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde