Task scheduling by Mean Field Annealing algorithm in grid computing
暂无分享,去创建一个
[1] Kassem Saleh,et al. Distributed gang scheduling in networks of heterogenous workstations , 1997, Comput. Commun..
[2] Miron Livny,et al. Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.
[3] Yueh-Min Huang,et al. Multiconstraint task scheduling in multi-processor system by neural network , 1998, Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294).
[4] Warren Smith,et al. A Resource Management Architecture for Metacomputing Systems , 1998, JSSPP.
[5] John F. Karpovich,et al. The Legion Resource Management System , 1999, JSSPP.
[6] Edward A. Lee,et al. A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..
[7] Ian T. Foster,et al. The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.
[8] J. J. Hopfield,et al. “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.
[9] Gregor von Laszewski,et al. QoS guided Min-Min heuristic for grid task scheduling , 2003, Journal of Computer Science and Technology.