Approximating the Discrete Resource Sharing Scheduling Problem

The goal of this work is to study the portfolio problem which consists in finding a good combination of multiple heuristics given a set of a problem instances to solve. We are interested in a parallel context where the resources are assumed to be discrete and homogeneous, and where it is not possible to allocate a given resource (processor) to more than one heuristic. The objective is to minimize the average completion time over the whole set of instances. We extend in this paper some existing analysis on the problem. More precisely, we provide a new complexity result for the restricted version of the problem, then, we generalize previous approximation schemes. In particular, they are improved using a guess approximation technique. Experimental results are also provided using a benchmark of instances on SAT solvers.

[1]  Stephen F. Smith,et al.  Combining Multiple Heuristics Online , 2007, AAAI.

[2]  John R. Rice,et al.  PYTHIA: a knowledge-based system to select scientific algorithms , 1996, TOMS.

[3]  Marin Bougeret,et al.  The guess approximation technique and its application to the Discrete Resource Sharing Scheduling Problem , 2009 .

[4]  Stephen F. Smith,et al.  Boosting stochastic problem solvers through online self-analysis of performance , 2003 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Hadas Shachnai,et al.  Polynomial-Time Approximation Schemes , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[7]  Nancy M. Amato,et al.  STAPL: An Adaptive, Generic Parallel C++ Library , 2001, LCPC.

[8]  Pedro S. de Souza,et al.  Asynchronous Teams: Cooperation Schemes for Autonomous Agents , 1998, J. Heuristics.

[9]  C.J.H. Mann,et al.  Handbook of Approximation: Algorithms and Metaheuristics , 2008 .

[10]  Philippe Chatalic,et al.  SatEx: A Web-based Framework for SAT Experimentation , 2001, Electron. Notes Discret. Math..

[11]  Tad Hogg,et al.  An Economics Approach to Hard Computational Problems , 1997, Science.

[12]  Victor Eijkhout,et al.  Application of Alternating Decision Trees in Selecting Sparse Linear Solvers , 2010, Software Automatic Tuning, From Concepts to State-of-the-Art Results.

[13]  Marin Bougeret,et al.  Combining multiple heuristics on discrete resources , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[14]  Bart Selman,et al.  Algorithm portfolios , 2001, Artif. Intell..

[15]  Harry M. Markowitz,et al.  The Early History of Portfolio Theory: 1600–1960 , 1999 .

[16]  Yishay Mansour,et al.  Combining Multiple Heuristics , 2006, STACS.

[17]  Andrzej Pelc,et al.  Oracle size: a new measure of difficulty for communication tasks , 2006, PODC '06.

[18]  Yin-Feng Xu,et al.  How much can lookahead help in online single machine scheduling , 2008, Inf. Process. Lett..

[19]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[20]  Gerhard J. Woeginger,et al.  Approximation schemes-a tutorial , 2001 .

[21]  Susanne Albers,et al.  On the Influence of Lookahead in Competitive Paging Algorithms , 1997, Algorithmica.

[22]  Andrzej Pelc,et al.  Distributed computing with advice: information sensitivity of graph coloring , 2007, Distributed Computing.

[23]  Victor Eijkhout,et al.  Self-adapting numerical software (SANS) effort , 2006, IBM J. Res. Dev..