%0 Conference Paper %B 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW) %D 2010 %T Decentralized dynamic scheduling across heterogeneous multi-core desktop grids %A Jaehwan Lee %A Keleher,P. %A Sussman, Alan %K backfill jobs %K bounded waiting time %K Computer science %K decentralized dynamic scheduling %K desktop grid resource management %K Dynamic scheduling %K Educational institutions %K Environmental management %K grid computing %K heterogeneous multicore desktop grid %K job assignment %K job migration %K load balancing %K Load management %K multicore computing environment %K Peer to peer computing %K Processor scheduling %K residual resources %K resource allocation %K Resource management %K scheduling %K Scheduling algorithm %K Throughput %X 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. %B 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW) %I IEEE %P 1 - 9 %8 2010/04/19/23 %@ 978-1-4244-6533-0 %G eng %R 10.1109/IPDPSW.2010.5470877