TY - CONF T1 - Decentralized dynamic scheduling across heterogeneous multi-core desktop grids T2 - 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW) Y1 - 2010 A1 - Jaehwan Lee A1 - Keleher,P. A1 - Sussman, Alan KW - backfill jobs KW - bounded waiting time KW - Computer science KW - decentralized dynamic scheduling KW - desktop grid resource management KW - Dynamic scheduling KW - Educational institutions KW - Environmental management KW - grid computing KW - heterogeneous multicore desktop grid KW - job assignment KW - job migration KW - load balancing KW - Load management KW - multicore computing environment KW - Peer to peer computing KW - Processor scheduling KW - residual resources KW - resource allocation KW - Resource management KW - scheduling KW - Scheduling algorithm KW - Throughput AB - The recent advent of multi-core computing environments increases both the heterogeneity and complexity of managing desktop grid resources, making efficient load balancing challenging even for a centralized manager. Even with good initial job assignments, dynamic scheduling is still needed to adapt to dynamic environments, as well as for applications whose running times are not known a priori. In this paper, we propose new decentralized scheduling schemes that backfill jobs locally and dynamically migrate waiting jobs across nodes to leverage residual resources, while guaranteeing bounded waiting times for all jobs. The methods attempt to maximize total throughput while balancing load across available grid resources. Experimental results via simulation show that our scheduling scheme has performance competitive with an online centralized scheduler. JA - 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW) PB - IEEE SN - 978-1-4244-6533-0 M3 - 10.1109/IPDPSW.2010.5470877 ER -