Filters








1,437 Hits in 2.9 sec

Improved online algorithms for parallel job scheduling and strip packing

J.L. Hurink, J.J. Paulus
2011 Theoretical Computer Science  
The presented algorithm also applies to the online orthogonal strip packing problem.  ...  Since the previous results for this problem assume bounded rectangles, the presented algorithm is the first with a constant competitive ratio for the general online orthogonal strip packing problem.  ...  The presented algorithm for the general online parallel job scheduling problem also applies to the online orthogonal strip packing.  ... 
doi:10.1016/j.tcs.2009.05.033 fatcat:qaqj54vtl5gizleqwmmwitw3fy

Online Algorithm for Parallel Job Scheduling and Strip Packing [chapter]

Johann L. Hurink, Jacob Jan Paulus
Approximation and Online Algorithms  
We consider the online scheduling problem of parallel jobs on parallel machines, P |online − list, m j |C max . For this problem we present a 6.6623-competitive algorithm.  ...  The presented algorithm also applies to the problem where machines are ordered on a line and only adjacent machines can be assigned to a job and, therefore, also to online orthogonal strip packing.  ...  In the schedules created by the online algorithm ON α,β , big jobs are never scheduled in parallel to other jobs, and (where possible) small jobs are put in parallel to other small jobs of the same job  ... 
doi:10.1007/978-3-540-77918-6_6 dblp:conf/waoa/HurinkP07 fatcat:7xng5fyzd5cfvdcphakn52mqty

Online multiple-strip packing

Deshi Ye, Xin Han, Guochuan Zhang
2011 Theoretical Computer Science  
Both randomized and deterministic online algorithms are investigated, all of which are guaranteed a constant competitive ratio.  ...  We study an online multiple-strip packing problem, whose goal is to pack the given rectangles into m vertical strips of unit width such that the maximum height used among the strips is minimized.  ...  Acknowledgments The authors would like to thank the anonymous referees for their helpful comments to improve the presentation of this paper.  ... 
doi:10.1016/j.tcs.2009.09.029 fatcat:c7llrx6olzauzgq3k6iuclupua

On-Line Multiple-Strip Packing [chapter]

Deshi Ye, Xin Han, Guochuan Zhang
2009 Lecture Notes in Computer Science  
Both randomized and deterministic online algorithms are investigated, all of which are guaranteed a constant competitive ratio.  ...  We study an online multiple-strip packing problem, whose goal is to pack the given rectangles into m vertical strips of unit width such that the maximum height used among the strips is minimized.  ...  Acknowledgments The authors would like to thank the anonymous referees for their helpful comments to improve the presentation of this paper.  ... 
doi:10.1007/978-3-642-02026-1_14 fatcat:kni66hjcnvadrlldnfibgevzf4

Preface

Christos Kaklamanis, Martin Skutella
2011 Theoretical Computer Science  
inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications  ...  , and scheduling problems.  ...  The article Improved online algorithms for parallel job scheduling and strip packing by Johann L.  ... 
doi:10.1016/j.tcs.2010.12.050 fatcat:lyktg43elrdyho3uj6xgjm4rei

Smoothing the energy consumption: Peak demand reduction in smart grid

Shaojie Tang, Qiuyuan Huang, Xiang-Yang Li, Dapeng Wu
2013 2013 Proceedings IEEE INFOCOM  
We propose a set of appliance scheduling algorithms to 1) minimize the peak power consumption under a fixed delay requirement, and 2) minimize the delay under a fixed peak demand constraint.  ...  Extensive evaluations verify that the schedules obtained by our methods significantly reduce the peak demand or delay compared with naive greedy algorithm or randomized algorithm.  ...  To the best of our knowledge, the performance ratio of the best algorithm for online orthogonal strip packing is 6.99, which is due to Baker and Schwarz [2] . IX.  ... 
doi:10.1109/infcom.2013.6566904 dblp:conf/infocom/TangHLW13 fatcat:vwifkaqqcba4xmraizkv4uvztu

Scheduling parallel jobs to minimize the makespan

Berit Johannes
2006 Journal of Scheduling  
Still, we present the first online algorithm for scheduling parallel jobs with a constant competitive ratio in this context.  ...  List-scheduling also works in the online setting where jobs arrive over time and the length of a job becomes known only when it completes; it therefore yields a deterministic online algorithm with competitive  ...  Acknowledgments I am grateful to Martin Skutella for directing me to this research area. I also thank him and Rolf Möhring for various helpful comments.  ... 
doi:10.1007/s10951-006-8497-6 fatcat:xs2h2c6gsvfixjmr2yw3eg556q

An Incentive-Compatible Mechanism for Scheduling Non-Malleable Parallel Jobs with Individual Deadlines

Thomas E. Carroll, Daniel Grosu
2008 2008 37th International Conference on Parallel Processing  
We design an incentive-compatible mechanism for scheduling n non-malleable parallel jobs on a parallel system comprising m identical processors.  ...  The user declares the parameters to the mechanism which uses them to compute the schedule and the payments.  ...  A survey of strip packing algorithms is [12] . There are several algorithms for scheduling parallel jobs in the literature.  ... 
doi:10.1109/icpp.2008.27 dblp:conf/icpp/CarrollG08 fatcat:3bnsvjxgtbalpksyz2rf3htxfq

Online Sorting and Translational Packing of Convex Polygons [article]

Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist
2021 arXiv   pre-print
We use this lower bound to prove the non-existence of competitive algorithms for various online translational packing problems of convex polygons, among them strip packing, bin packing and perimeter packing  ...  On the positive side, we present an algorithm with competitive ratio O(n^0.59) for online translational strip packing of convex polygons.  ...  1 On the positive side, we present online algorithms for both online sorting and strip packing.  ... 
arXiv:2112.03791v1 fatcat:y3z5eh6ih5bs7aqi2ke7vbsvxy

Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing [article]

Klaus Jansen, Malin Rau
2019 arXiv   pre-print
We study the Multiple Cluster Scheduling problem and the Multiple Strip Packing problem. For both problems, there is no algorithm with approximation ratio better than 2 unless P = NP.  ...  In this paper, we present an algorithm with approximation ratio 2 and running time O(n) for both problems.  ...  Strip Packing and Parallel Task Scheduling are classical optimization problems and the extension of these problems to multiple strips or clusters comes natural.  ... 
arXiv:1902.03428v1 fatcat:abc66j2lx5eyrohxl7viivg63u

Approximation Algorithms for Multiple Strip Packing [chapter]

Marin Bougeret, Pierre Francois Dutot, Klaus Jansen, Christina Otte, Denis Trystram
2010 Lecture Notes in Computer Science  
Furthermore we present simple shelf-based algorithms with short running-time and an AFPTAS for MSP.  ...  For a given set of rectangles, r1, . . . , rn, with heights and widths ≤ 1, the goal is to find a non-overlapping orthogonal packing without rotations into k ∈ N strips [0, 1] × [0, ∞), minimizing the  ...  [12] achieved ratio 3 for a version of Parallel Job Scheduling in Grids without release times, and ratio 5 with release times.  ... 
doi:10.1007/978-3-642-12450-1_4 fatcat:72meyylz5zcgbbxhi5v2iksrc4

Scheduling jobs with non-uniform demands on multiple servers without interruption

Sungjin Im, Mina Naghshnejad, Mukesh Singhal
2016 IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications  
Building on this intuition and using reduction to geometric packing problems, we develop algorithms that are constant approximation for all instances for the first time.  ...  In this paper we propose novel algorithms for scheduling jobs with non-uniform demands on multiple homogeneous servers without preemption.  ...  In the 2D-strip packing problem, we are asked to pack all given rectangles without rotations into a strip with bounded width but with unbounded height, and the goal is to minimize the strip height.  ... 
doi:10.1109/infocom.2016.7524417 dblp:conf/infocom/ImNS16 fatcat:qe6iexcrjvefdpdthygpv6glqm

Design and Comparison of Resilient Scheduling Heuristics for Parallel Jobs

Anne Benoit, Valentin Le Fevre, Padma Raghavan, Yves Robert, Hongyang Sun
2020 2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)  
This paper focuses on the resilient scheduling of parallel jobs on highperformance computing (HPC) platforms to minimize the overall completion time, or the makespan.  ...  This work generalizes the classical framework where jobs are known offline and do not fail: in this framework, list scheduling that gives priority to longest jobs is known to be a 3-approximation when  ...  for strip packing.  ... 
doi:10.1109/ipdpsw50202.2020.00099 dblp:conf/ipps/BenoitFRRS20 fatcat:mqbsjtm6enhaznqyocr2cgirky

Resilient Scheduling Heuristics for Rigid Parallel Jobs

Anne Benoit, Valentin Le Fèvre, Padma Raghavan, Yves Robert, Hongyang Sun
2021 International Journal of Networking and Computing  
This paper focuses on the resilient scheduling of parallel jobs on high-performance computing (HPC) platforms to minimize the overall completion time, or the makespan.  ...  This work generalizes the classical framework where jobs are known offline and do not fail: in this framework, list scheduling that gives priority to the longest jobs is known to be a 3approximation when  ...  Height (NFDH) [12] algorithm for strip packing.  ... 
doi:10.15803/ijnc.11.1_2 fatcat:yhae6zcrxffy3eb2kcnyw6is54

Scheduling (Dagstuhl Seminar 13111)

Susanne Albers, Onno J. Boxma, Kirk Pruhs, Marc Herbstritt
2013 Dagstuhl Reports  
queuing community, and the worst-case approximation scheduling community.  ...  This report documents the program and the outcomes of Dagstuhl Seminar 13111 "Scheduling".  ...  We will also show how these ideas generalize to online packing problems We consider the problem of scheduling a set of n jobs on m parallel machines with job splitting and setup times.  ... 
doi:10.4230/dagrep.3.3.24 dblp:journals/dagstuhl-reports/AlbersBP13 fatcat:f3jsoas3o5ewdl2wuvwz7kfpte
« Previous Showing results 1 — 15 out of 1,437 results