A Batch-mode Mapping Algorithm in Highly Heterogeneous Computational Grids using Learning Automata

Publish Year: 1384
نوع سند: مقاله کنفرانسی
زبان: English
View: 2,520

This Paper With 8 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ICIKT02_077

تاریخ نمایه سازی: 12 دی 1386

Abstract:

The computational grid is a new paradigm in parallel and distributed computing systems for realizing a virtual supercomputer over idle resources available in a wide area network like the Internet. Computational Grids are characterized for exploiting highly heterogeneous resources; so, one of the main concerns in developing computational grids is how to effectively map tasks onto heterogeneous resources in order to gain high utilization. Two approaches for mapping the tasks exist, online mode and batch mode. In batch-mode at any mapping event, a batch of tasks is mapped, whereas in online mode only one task is mapped. In this paper, two batch-mode algorithms for task mapping based on learning automata are introduced. To show the effectiveness of the proposed algorithms, computer simulations have been conducted. The results of experiments show that the proposed algorithms outperform three best existing mapping algorithms when the heterogeneity of the environment is very high.

Authors

Ghanbari

MS Student, Computer Engineering Department, Amirkabir University، Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University

Meybodi

Professor of Computer Engineering Department, Amirkabir University، Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
  • فناوری‌اطلاعات؛ دانش _ 3-ه‌خرداد 1384 H. Casanova, T.M. Bartol, J. ...
  • L. Rosenberg, "Optimal scheduling for cycle-stealing in a network of ...
  • S. Smallen, W. Cirne, J. Frey, F. Berman, R. Wolski, ...
  • M. Mache sWaran, S. Ali, H.J. Siegel, D. Hensgen, R.F. ...
  • T. D. Braun, H. J. Siegel , and N. Beck, ...
  • T. D. Braun, H. J. Siegel, et al., "Taxonomy for ...
  • Min-You Wu and Wei Shu, "A h i gh -performanc ...
  • H. Chen and M. Maheswaran, "Distributed dynamic scheduling of composite ...
  • O. H. Ibarra and C. E. Kim, "Heuristic algorithms for ...
  • R M irchandaney and J. A. Stankovic. "Using stochastic learning ...
  • A. Glockner and J. Pasquale, "Coadaptive behavior in a simple ...
  • R. D. V enkatarannna and N. Ranganathan, "Multiple cost optimization ...
  • نمایش کامل مراجع