International audience; —Symbiotic job scheduling exploits the fact that in a system with shared resources, the performance of jobs is impacted by the behavior of other co-running jobs. By coscheduling combinations of jobs that have low interference, the performance of ... View more
M. Banikazemi, D. Poff, and B. Abali, “PAM: a novel performance/power aware meta-scheduler for multi-core systems,” in Supercomputing (SC), 2008.
M. Becchi and P. Crowley, “Dynamic thread assignment on heterogeneous multiprocessor architectures,” in Proc. of the 3rd Conf. on Computing Frontiers (CF), 2006.
 S. Blagodurov, S. Zhuravlev, and A. Fedorova, “Addressing shared resource contention in multicore processors via scheduling,” in ASPLOS, 2010.
Reuther, J. P. Robertson, M. D. Theys, and B. Yao, “A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems,” Journal of Parallel and Distributed Computing, vol. 61, no. 6, pp. 810-837, Jun. 2001.
 J. R. Bulpin and I. A. Pratt, “Hyper-Threading aware process scheduling heuristics,” in Proc. of the USENIX Annual Technical Conference, 2005.
Code Optim., vol. 11, no. 3, Aug. 2014.
T. Creech, A. Kotha, and R. Barua, “Efficient multiprogramming for multicores with SCAF,” in MICRO, 2013.
M. DeVuyst, R. Kumar, and D. M. Tullsen, “Exploiting unbalanced thread scheduling for energy and performance on a cmp of smt processors,” in IPDPS, 2006.
A. El-Moursy, R. Garg, D. H. Albonesi, and S. Dwarkadas, “Compatible phase co-scheduling on a CMP of multi-threaded processors,” in IPDPS, 2006.
 S. Eyerman and L. Eeckhout, “Probabilistic job symbiosis modeling for SMT processor scheduling,” in ASPLOS, 2010.