FPT Approximation Algorithm for Scheduling with Memory Constraints
In this paper we study a scheduling problem motivated by performing intensive numerical simulations on large meshes. In order to run the simulation as fast as possible, we must allocate computations on different processors such that the makespan is minimized, but also take care of the limited memory on each processor. We present a dynamic programming based algorithm that ensures that both of these objectives are satisfied, within a ratio of 1 + \(\varepsilon \). Our algorithm is fixed-parameter tractable (FPT) with respect to the path-width of the graph. For sake of readability, the algorithm is presented for two identical machines, but it can be generalized for a fixed number of unrelated processors.
KeywordsScheduling Approximation algorithm Dynamic programming Fixed-parameter tractable
- 12.Saha, B., Srinivasan, A.: A new approximation technique for resource-allocation problems. In: Proceeding of Innovations in Computer Science (ICS), 342–357 (2010)Google Scholar