Bandwidth-Constrained Allocation in Grid Computing
暂无分享,去创建一个
[1] Rafail Ostrovsky,et al. Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[2] Richard Wolski,et al. Analyzing Market-Based Resource Allocation Strategies for the Computational Grid , 2001, Int. J. High Perform. Comput. Appl..
[3] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[4] Warren Smith,et al. A Resource Management Architecture for Metacomputing Systems , 1998, JSSPP.
[5] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[6] Sudipto Guha,et al. Approximating the throughput of multiple machines under real-time scheduling , 1999, STOC '99.
[7] Tad Hogg,et al. Spawn: A Distributed Computational Economy , 1992, IEEE Trans. Software Eng..
[8] Ian T. Foster,et al. On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing , 2003, IPTPS.
[9] John F. Karpovich,et al. The Legion Resource Management System , 1999, JSSPP.
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] David E. Culler,et al. Market-based Proportional Resource Sharing for Clusters , 2000 .
[12] Sudipto Guha,et al. Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..
[13] Sanjeev Khanna,et al. A PTAS for the multiple knapsack problem , 2000, SODA '00.
[14] Miron Livny,et al. Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.