ترجمه مقاله الگوریتم ژنتیک تحملپذیر خطا برای زمانبندی کارها با استفاده از تکنیک نقطهبررسی
١- ایده اصلی مقاله
در این مقاله یک روش در سطح-وظیفه[1] برای تحملپذیری خطا در گرید مطرح
شدهاست. تکنیکی که برای تحملپذیری خطا در این مقاله از آن استفاده شده،
تکنیک نقطهبررسی است که به صورت ترکیبی با الگوریتم ژنتیک مورد استفاده
قرار گرفتهاست. که در ادامه تک تک آنها شرح داده شدهاست.
6. References
[1]
S. Hwang and C. Kesselman. Grid Workflow: A Flexible Failure Handling
Framework for the Grid. In 12th IEEE International Symposium on High
Performance Distributed Computing (HPDC’03), Seattle, Washington, USA,
IEEE CS Press, Los Alamitos, CA, USA, June 22 - 24, 2003.
[2]
“An efficient coordinated check pointing scheme for multi computers”,
Debendara Das Sharma , Dhiraj K Pradhan. Proceedings of IEEE Workshop on
Fault-Tolerant Parallel and Distributed Systems, pp. 36-42, 1995.
[3]
R. Braun, H. Siegel, N. Beck, L. Boloni, M. Maheswaran, A. Reuther, J.
Robertson, M. Theys, B. Yao, D. Hensgen and R. Freund, A Comparison of
Eleven Static Heuristics for Mapping a Class of Independent Tasks onto
Heterogeneous Distributed Computing Systems, in J. of Parallel and
Distributed Computing, vol.61, No. 6, pp. 810-837, 2001.
[4]
Y.-K. Kwok, S. Song, and K. Hwang, “Non-Cooperative Grids:
Game-Theoretic Modeling and Strategy Optimization,” submitted to IEEE
Trans. Parallel and Distributed Systems, Dec. 2004
[5]
A.Y. Zomaya, R.C. Lee, and S. Olariu, “An Introduction to Genetic-Based
Scheduling in Parallel-Processor Systems,” Solutions to Parallel and
Distributed Computing Problems: Lessons from Biological Science, A.Y.
Zomaya, F. Ercal, and S. Olariu, eds.,pp. 111-133, chapter 5. New York:
Wiley, 2001.
[6]
T.D. Braun, D. Hensgen, R. Freund, H.J. Siegel, N. Beck, L. Boloni, M.
Maheswaran, A. Reuther, J. Robertson, M. Theys, and B. Yao, “A
Comparison of Eleven Static Heuristics for Mapping a Class of
Independent Tasks onto Heterogeneous Distributed Computing Systems,” J.
Parallel and Distributed Computing, vol. 61, no. 6, pp. 810-837, 2001.
[7]
I. Foster and C. Kesselman (editors), The Grid: Blueprint for a Future
Computing Infrastructure, Morgan Kaufmann Publishers, USA, 1999.
[8]
I. Foster, C. Kesselman and S. Tuecke, The Anatomy of the Grid:
Enabling Scalable Virtual Organizations, in the International J.
Supercomputer Applications, 15(3), pp.200-220, fall 2001.
[9]
M. Baker, R. Buyya and D. Laforenza, Grids and Grid Technologies for
Wide-area Distributed Computing, in J. of Software-Practice &
Experience, Vol. 32, No.15, pp: 1437-1466, December 2002.
[10]
J. Schopf, Ten Actions When SuperScheduling, document of Scheduling
Working Group, Global Grid Forum,
http://www.ggf.org/documents/GFD.4.pdf, July 2001.
[11]
N. Fujimoto and K. Hagihara, “Near-Optimal Dynamic Task Scheduling of
Independent Coarse-Grained Tasks onto a Computational Grid,” Proc. Int’l
Conf. Parallel Processing, 2003.
[12]
K. Hwang and Z. Xu, Scalable Parallel Computing: Technology,
Architecture, Programming. San Francisco: McGraw-Hill, Feb. 1998.
[13]
K. Krauter, R. Buyya, and M. Maheswaran, “A Taxonomy of Grid Resource
Management Systems for Distributed Computing,” Software-Practice and
Experience, vol. 32, no. 2, pp. 135-164, 2002.
6. References[1] S. Hwang and C. Kesselman. Grid Workflow: A Flexible
Failure Handling Framework for the Grid. In 12th IEEE International
Symposium on High Performance Distributed Computing (HPDC’03), Seattle,
Washington, USA, IEEE CS Press, Los Alamitos, CA, USA, June 22 - 24,
2003.[2] “An efficient coordinated check pointing scheme for multi
computers”, Debendara Das Sharma , Dhiraj K Pradhan. Proceedings of IEEE
Workshop on Fault-Tolerant Parallel and Distributed Systems, pp. 36-42,
1995.[3] R. Braun, H. Siegel, N. Beck, L. Boloni, M. Maheswaran, A.
Reuther, J. Robertson, M. Theys, B. Yao, D. Hensgen and R. Freund, A
Comparison of Eleven Static Heuristics for Mapping a Class of
Independent Tasks onto Heterogeneous Distributed Computing Systems, in
J. of Parallel and Distributed Computing, vol.61, No. 6, pp. 810-837,
2001.[4] Y.-K. Kwok, S. Song, and K. Hwang, “Non-Cooperative Grids:
Game-Theoretic Modeling and Strategy Optimization,” submitted to IEEE
Trans. Parallel and Distributed Systems, Dec. 2004[5] A.Y. Zomaya, R.C.
Lee, and S. Olariu, “An Introduction to Genetic-Based Scheduling in
Parallel-Processor Systems,” Solutions to Parallel and Distributed
Computing Problems: Lessons from Biological Science, A.Y. Zomaya, F.
Ercal, and S. Olariu, eds.,pp. 111-133, chapter 5. New York: Wiley,
2001.[6] T.D. Braun, D. Hensgen, R. Freund, H.J. Siegel, N. Beck, L.
Boloni, M. Maheswaran, A. Reuther, J. Robertson, M. Theys, and B. Yao,
“A Comparison of Eleven Static Heuristics for Mapping a Class of
Independent Tasks onto Heterogeneous Distributed Computing Systems,” J.
Parallel and Distributed Computing, vol. 61, no. 6, pp. 810-837,
2001.[7] I. Foster and C. Kesselman (editors), The Grid: Blueprint for a
Future Computing Infrastructure, Morgan Kaufmann Publishers, USA,
1999.[8] I. Foster, C. Kesselman and S. Tuecke, The Anatomy of the Grid:
Enabling Scalable Virtual Organizations, in the International J.
Supercomputer Applications, 15(3), pp.200-220, fall 2001.[9] M. Baker,
R. Buyya and D. Laforenza, Grids and Grid Technologies for Wide-area
Distributed Computing, in J. of Software-Practice & Experience, Vol.
32, No.15, pp: 1437-1466, December 2002.[10] J. Schopf, Ten Actions
When SuperScheduling, document of Scheduling Working Group, Global Grid
Forum, http://www.ggf.org/documents/GFD.4.pdf, July 2001.[11] N.
Fujimoto and K. Hagihara, “Near-Optimal Dynamic Task Scheduling of
Independent Coarse-Grained Tasks onto a Computational Grid,” Proc. Int’l
Conf. Parallel Processing, 2003.[12] K. Hwang and Z. Xu, Scalable
Parallel Computing: Technology, Architecture, Programming. San
Francisco: McGraw-Hill, Feb. 1998.[13] K. Krauter, R. Buyya, and M.
Maheswaran, “A Taxonomy of Grid Resource Management Systems for
Distributed Computing,” Software-Practice and Experience, vol. 32, no.
2, pp. 135-164, 2002.
[1] - task-level
