@inproceedings{74c11aecfbe146ae8369ee7e3f5641e4,
title = "The buffer minimization problem for multiprocessor scheduling with conflicts",
abstract = "We consider the problem of scheduling a sequence of tasks in a multi-processor system with conflicts. Conflicting processors cannot process tasks at the same time. At certain times new tasks arrive in the system, where each task specifies the amount of work (processing time) added to each processor{\textquoteright}s workload. Each processor stores this workload in its input buffer. Our objective is to schedule task execution, obeying the conflict constraints, and minimizing the maximum buffer size of all processors. In the off-line case, we prove that, unless P = NP, the problem does not have a polynomial-time algorithm with a polynomial approximation ratio. In the on-line case, we provide the following results: (i) a competitive algorithm for general graphs, (ii) tight bounds on the competitive ratios for cliques and complete k-partite graphs, and (iii) a (¿/2 + 1)-competitive algorithm for trees, where ¿ is the diameter. We also provide some results for small graphs with up to 4 vertices.",
author = "M. Chrobak and J. Csirik and Cs. Imreh and J. Noga and J. Sgall and G.J. Woeginger",
year = "2001",
doi = "10.1007/3-540-48224-5\_70",
language = "English",
isbn = "978-3-540-42287-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "862--874",
editor = "F. Orejas and P.G. Spirakis and \{Leeuwen, van\}, J.",
booktitle = "Automata, languages and programming : proceedings 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001",
address = "Germany",
}