1. High-performance schedulers;Berman,1998
2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
3. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems;Tracy;Journal of Parallel and Distributed Computing,2001
4. A. Mandal, K. Kennedy, C. Koelbel, G. Marin, J. Mellor-Grummey, B. Liu, L. Johnsson, Scheduling solutions for mapping application workflows onto the grid, in: Proceedings of the 14th IEEE International Symposium on High Performance Distributed Computing, 24–27 July 2005, HPDC-14, 2005, pp. 25–134.
5. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems;Maheswaran;Journal of Parallel and Distributed Computing,1999