Filters








15,298 Hits in 6.1 sec

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling [article]

Spencer Compton, Slobodan Mitrović, Ronitt Rubinfeld
2022 arXiv   pre-print
We develop a set of techniques for partitioning and grouping jobs based on their starting and ending times, that enable us to view an instance of interval scheduling on many jobs as a union of multiple  ...  For (1+ε)-approximation of job scheduling of n jobs on a single machine, we obtain a fully dynamic algorithm with O(logn/ε) update and O(logn) query worst-case time.  ...  Acknowledgements We thank Benjamin Qi (MIT) for helpful discussions. S. Mitrović was supported by the Swiss NSF grant No. P400P2_191122/1, NSF award CCF-1733808, and FinTech@CSAIL. R.  ... 
arXiv:2012.15002v4 fatcat:oval6fmiefekpc7hllwhreqzwa

Page 2744 of Mathematical Reviews Vol. , Issue 99d [page]

1991 Mathematical Reviews  
Uma and Joel Wein, An experi- mental study of LP-based approximation algorithms for scheduling problems (453-462); Richard Cole and Ramesh Hariharan, Ap- proximate string matching: a simpler faster algorithm  ...  994:68012 Maiko Shigeno, A faster algorithm for minimum cost submodu- lar flows (167-174); Derek G. Corneil, Stephan Olariu and Lorna Stewart, The ultimate interval graph recognition algorithm?  ... 

Real-Time Demand Side Management Algorithm Using Stochastic Optimization

Moses Amoasi Acquah, Daisuke Kodaira, Sekyung Han
2018 Energies  
To this end, a dimension-reduction method, termed piecewise peak approximation (PPA), is developed to reduce the dimension of the demand probability distribution (DPD) obtained from DIDF for a faster computational  ...  The proposed method is verified and tested against existing algorithms. Data obtained from a real site in South Korea is used for verification and testing.  ...  Acknowledgments: This work was supported by Korea Electric Power Research Institute (KEPRI) belonging to Korea Electric Power Corporation (KEPCO) for the project no. R16DA01.  ... 
doi:10.3390/en11051166 fatcat:k2ckn2ghtbdtxdlvurfyyy5cma

Non-Preemptive Min-Sum Scheduling with Resource Augmentation

Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Cliff Stein, Baruch Schieber
2007 Foundations of Computer Science (FOCS), IEEE Annual Symposium on  
We give the first O(1)-speed O(1)-approximation polynomial-time algorithms for several nonpreemptive minsum scheduling problems where jobs arrive over time and must be processed on one machine.  ...  More precisely, we give the first O(1)-speed O(1)-approximations for the nonpreemptive scheduling problems and an O(1)-machine, O(1)-speed O(1)-approximation for Our main contribution is an integer programming  ...  Thus we obtain a 24-speed 1-approximation algorithm for maximizing throughput. Broadcast Scheduling We now explain how to extend our technique to broadcast scheduling.  ... 
doi:10.1109/focs.2007.4389530 fatcat:pro7j2k7yrb5tbovfrmi6w3bom

Non-Preemptive Min-Sum Scheduling with Resource Augmentation

Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Cliff Stein, Baruch Schieber
2007 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)  
We give the first O(1)-speed O(1)-approximation polynomial-time algorithms for several nonpreemptive minsum scheduling problems where jobs arrive over time and must be processed on one machine.  ...  More precisely, we give the first O(1)-speed O(1)-approximations for the nonpreemptive scheduling problems and an O(1)-machine, O(1)-speed O(1)-approximation for Our main contribution is an integer programming  ...  Thus we obtain a 24-speed 1-approximation algorithm for maximizing throughput. Broadcast Scheduling We now explain how to extend our technique to broadcast scheduling.  ... 
doi:10.1109/focs.2007.11 dblp:conf/focs/FischerMS07 fatcat:7tbgzvw4o5hohgrjxsdwbiffle

Broad-phase collision detection using semi-adjusting BSP-trees

Rodrigo G. Luque, João L. D. Comba, Carla M. D. S. Freitas
2005 Proceedings of the 2005 symposium on Interactive 3D graphics and games - SI3D '05  
An scheduling algorithm evaluates locations where the BSP-tree becomes unbalanced, uses several strategies to alter cutting planes, and defer updates based on their re-structuring cost.  ...  In this work we propose a new structure called Semi-Adjusting BSP-tree for representing scenes composed of thousands of moving objects.  ...  Acknowledgments The authors would like to thank all reviewers for detailed suggestions and comments on how to improve this final version. The work of R. Luque is supported by a CNPq scholarship.  ... 
doi:10.1145/1053427.1053457 dblp:conf/si3d/LuqueCF05 fatcat:kn6adtzgkvbyvco7wpkykxzfba

SkewTune

YongChul Kwon, Magdalena Balazinska, Bill Howe, Jerome Rolia
2012 Proceedings of the 2012 international conference on Management of Data - SIGMOD '12  
We present an automatic skew mitigation approach for userdefined MapReduce programs and present SkewTune, a system that implements this approach as a drop-in replacement for an existing MapReduce implementation  ...  There are three key challenges: (a) require no extra input from the user yet work for all MapReduce applications, (b) be completely transparent, and (c) impose minimal overhead if there is no skew.  ...  Acknowledgments We thank the anonymous reviewers for their helpful comments on early drafts of this paper.  ... 
doi:10.1145/2213836.2213840 dblp:conf/sigmod/KwonBHR12 fatcat:5zd773zyrjb6bprvgcc2qnf4eq

Scheduling Non-Unit Jobs to Minimize Calibrations

Jeremy T. Fineman, Brendan Sheridan
2015 Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '15  
Then our ISE algorithm finds an O(α)approximation for number of calibrations using O(αm) machines with s-speed augmentation.  ...  Algorithm 4: Partitioning short jobs into length-2γT intervals Let J short be the set of all short-window jobs Allocate disjoint sets of machines M 1 and M 2 t ← 0 while t ≤ max j d j do Let J ′ ⊆ J short  ...  Acknowledgments This research was supported in part by National Science Foundation grants CCF-1218188 and CCF-1314633.  ... 
doi:10.1145/2755573.2755605 dblp:conf/spaa/FinemanS15 fatcat:xcx2cp43dbcitodks3wbr4qhse

Mean Field Annealing for Pattern Classification using different response functions: A Comparative Approach

2010 Journal of the ACS Advances in Computer Science  
The mathematics of MFA is shown to provide a powerful and general tool for deriving optimization algorithms.  ...  Two annealing schedules namely: the Cauchy annealing schedule and the linear annealing schedule are used and compared. The study and results are encouraging and promising.  ...  Differentiating the partition function Z for the energy given in (11) 4.1The mean field approximation In statistical physics the mean-field approximation is one of the most common and easy-to-use  ... 
doi:10.21608/asc.2010.158214 fatcat:qhuey4jqdbes7cgg45tbign76q

Page 1136 of Mathematical Reviews Vol. , Issue 94b [page]

1994 Mathematical Reviews  
; Tel Aviv) Fast exact and approximate algorithms for k-partition and scheduling independent tasks.  ...  While a generalization of the dynamic programming approach yields an O(/‘-'m*) algorithm, the new algorithm is substantially faster.  ... 

Grouping Techniques for Scheduling Problems: Simpler and Faster

Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
2007 Algorithmica  
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems.  ...  We illustrate the technique on two different scheduling problems: scheduling on unrelated parallel machines with costs and the job shop scheduling problem.  ...  In contrast to the approximation schemes introduced in [13, 14] , our algorithm is again extremely simple and even faster.  ... 
doi:10.1007/s00453-007-9086-6 fatcat:h7eqalppgfaf5bu3uuxxs3rfdi

Grouping Techniques for Scheduling Problems: Simpler and Faster [chapter]

Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
2001 Lecture Notes in Computer Science  
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems.  ...  We illustrate the technique on two different scheduling problems: scheduling on unrelated parallel machines with costs and the job shop scheduling problem.  ...  In contrast to the approximation schemes introduced in [13, 14] , our algorithm is again extremely simple and even faster.  ... 
doi:10.1007/3-540-44676-1_17 fatcat:gkwvvgyc55de7jlr7aaxe3smqy

A hybrid method for a Project Scheduling Problem

André Renato Villela da Silva
2014 Pesquisa Operacional  
This problem is known as Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP). Three methods were proposed to divide the problem into smaller parts and solve them separately.  ...  This work deals with a project scheduling problem where the tasks consume resources to be activated, but start to produce them after that.  ...  The scheduling algorithm used by previous partition method is executed for each produced configuration.  ... 
doi:10.1590/s0101-74382014005000005 fatcat:bpadzpcthzgpljati2qp3ca37a

Heterogeneous Clustered VLIW Microarchitectures

Alex Aleta, Josep M. Codina, Antonio Gonzalez, David Kaeli
2007 International Symposium on Code Generation and Optimization (CGO'07)  
Finally, we present a modulo scheduling technique based on graph partitioning that exploits the opportunities presented on heterogeneous clustered microarchitectures.  ...  For this heterogeneous design to be effective, we need to select the most suitable frequencies and voltages for each component.  ...  Note that when a new partition is selected, this new partition induces a new partition in all of the finer graphs. Thus, the partition is improved up to the original graph.  ... 
doi:10.1109/cgo.2007.15 dblp:conf/cgo/AletaCGK07 fatcat:cczgrh2adjbklhjo26da5nqzlq

Tight approximation algorithms for scheduling with fixed jobs and nonavailability

Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson
2012 ACM Transactions on Algorithms  
Both formulations have different applications, e.g. in turnaround scheduling or overlay computing. For both problems we contribute approximation algorithms with an improved ratio of 3/2.  ...  We use dual approximation, creation of a gap structure and a PTAS for the multiple subset sum problem, combined with a postprocessing step to assign large jobs.  ...  Finally, for scheduling with non-availability, our new technique yields an improved approximation ratio independent from ρ which is tight. Theorem 2.  ... 
doi:10.1145/2229163.2229171 fatcat:yci6ux5utzf2rd3clehz44pcsy
« Previous Showing results 1 — 15 out of 15,298 results