Batch Coloring Flat Graphs and Thin

A batch is a set of jobs that start execution at the same time; only when the last job is completed can the next batch be started. When there are constraints or conflicts between the jobs, we need to ensure that jobs in the same batch be non-conflicting. That is, we seek a coloring of the conflict graph. The two most common objectives of schedules and colorings are the makespan, or the maximum job completion time, and the sum of job completion times. This gives rise to two types of batch coloring problems: max-coloringand batch sum coloring, respectively. We give the first polynomial time approximation schemesfor batch sum coloring on several classes of "non-thick" graphs that arise in applications. This includes paths, trees, partial k-trees, and planar graphs. Also, we give an improved O(nlogn) exact algorithm for the max-coloring problem on paths.

[1]  Rajiv Gandhi,et al.  Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria , 2004, WAOA.

[2]  Vangelis Th. Paschos,et al.  Weighted Coloring: further complexity and approximability results , 2006, Inf. Process. Lett..

[3]  Andrew S. Tanenbaum,et al.  Distributed operating systems , 2009, CSUR.

[4]  Erik D. Demaine,et al.  Equivalence of local treewidth and linear local treewidth and its algorithmic applications , 2004, SODA '04.

[5]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[6]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[7]  Kang G. Shin,et al.  On slot reuse for isochronous services in DQDB networks , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[8]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[9]  Vangelis Th. Paschos,et al.  Weighted Coloring: Further Complexity and Approximability Results , 2005, ICTCS.

[10]  Arie M. C. A. Koster,et al.  Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..

[11]  Guy Kortsarz,et al.  Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees , 2002, J. Algorithms.

[12]  Eyal Amir,et al.  Efficient Approximation for Triangulation of Minimum Treewidth , 2001, UAI.

[13]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[14]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[15]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[16]  Frank Harary,et al.  Graph Theory , 2016 .

[17]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[18]  Rajiv Raman,et al.  Buffer minimization using max-coloring , 2004, SODA '04.

[19]  D. de Werra,et al.  Time slot scheduling of compatible jobs , 2007, J. Sched..

[20]  B. R. Peek.  High performance optical network architecture , 2002, IEEE/LEOS Summer Topi All-Optical Networking: Existing and Emerging Architecture and Applications/Dynamic Enablers of Next-Generation Optical Communications Systems/Fast Optical Processing in Optical.

[21]  Leah Epstein,et al.  Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs , 2006, Algorithmica.

[22]  Xuding Zhu,et al.  A Coloring Problem for Weighted Graphs , 1997, Inf. Process. Lett..

[23]  梅村 恭司.  Andrew S.Tanenbaum 著, "Operating systems, Design and implementation", PRENTICE-HALL, INC., Englewood Cliffs, B5変形判, 719p., \4,120 , 1988 .

[24]  Guy Kortsarz,et al.  Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs , 2003, Algorithmica.

[25]  Luca Trevisan,et al.  On the Efficiency of Polynomial Time Approximation Schemes , 1997, Inf. Process. Lett..

[26]  Guy Kortsarz,et al.  Sum Multicoloring of Graphs , 2000, J. Algorithms.

[27]  Jian Huang,et al.  Dynamic co-scheduling of distributed computation and replication , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[28]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[29]  Rajiv Gandhi,et al.  Improved bounds for scheduling conflicting jobs with minsum criteria , 2008, TALG.

[30]  Rajiv Raman,et al.  Approximation Algorithms for the Max-coloring Problem , 2005, ICALP.

[31]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[32]  Satish Rao,et al.  Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.