Algorithms for scheduling malleable and nonmalleable parallel tasks
Algorithms for scheduling malleable and nonmalleable parallel tasks
Online computation and competitive analysis
Online computation and competitive analysis
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Off-line admission control for general scheduling problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Wavelength assignment and generalized interval graph coloring
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for Resource Allocation
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Scheduling Algorithms
Making cluster applications energy-aware
ACDC '09 Proceedings of the 1st workshop on Automated control for datacenters and clouds
On the complexity of the regenerator placement problem in optical networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Algorithmic aspects of bandwidth trading
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The regenerator location problem
Networks - Network Optimization (INOC 2007)
Tightness results for malleable task scheduling algorithms
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Minimizing total busy time in parallel scheduling with application to optical networks
Theoretical Computer Science
Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
CLOUDCOM '10 Proceedings of the 2010 IEEE Second International Conference on Cloud Computing Technology and Science
Bag-of-Tasks Scheduling under Budget Constraints
CLOUDCOM '10 Proceedings of the 2010 IEEE Second International Conference on Cloud Computing Technology and Science
Interval scheduling on related machines
Computers and Operations Research
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
An online parallel scheduling method with application to energy-efficiency in cloud computing
The Journal of Supercomputing
| Hi-index | 0.00 |
We consider the following online scheduling problem in which the input consists of n jobs to be scheduled on identical machines of bounded capacity g (the maximum number of jobs that can be processed simultaneously on a single machine). Each job is associated with a release time and a completion time between which it is supposed to be processed. When a job is released, the online algorithm has to make decision without changing it afterwards. We consider two versions of the problem. In the minimization version, the goal is to minimize the total busy time of machines used to schedule all jobs. In the resource allocation maximization version, the goal is to maximize the number of jobs that are scheduled under a budget constraint given in terms of busy time. This is the first study on online algorithms for these problems. We show a rather large lower bound on the competitive ratio for general instances. This motivates us to consider special families of input instances for which we show constant competitive algorithms. Our study has applications in power aware scheduling, cloud computing and optimizing switching cost of optical networks.