دانلود مقاله ISI انگلیسی شماره 97394
ترجمه فارسی عنوان مقاله

برای به حداکثر رساندن قابلیت اطمینان از سیستم پردازش تراکنش شبکه با توجه به تخصیص وظیفه متوازن با استفاده از بهینه سازی عنکبوت اجتماعی

عنوان انگلیسی
On maximizing reliability of grid transaction processing system considering balanced task allocation using social spider optimization
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
97394 2018 16 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Swarm and Evolutionary Computation, Volume 38, February 2018, Pages 202-217

ترجمه کلمات کلیدی
قابلیت اطمینان، بهینه سازی عنکبوتی اجتماعی، بار تخصیص کار متعادل،
کلمات کلیدی انگلیسی
Reliability; Social spider optimization; Load balanced task allocation;
پیش نمایش مقاله
پیش نمایش مقاله  برای به حداکثر رساندن قابلیت اطمینان از سیستم پردازش تراکنش شبکه با توجه به تخصیص وظیفه متوازن با استفاده از بهینه سازی عنکبوت اجتماعی

چکیده انگلیسی

This paper deals with the problem of task allocation in the grid transaction processing system. There has been quite some research on the development of tools and techniques for grid computing systems, yet some important issues, e.g., service reliability with load balanced transaction allocation in grid computing system, have not been sufficiently studied. Load balanced transaction allocation becomes a challenging job in such a complex and dynamic environment as both the application and computational resources are heterogeneous. The problem is further complicated by the fact that these resources may fail at any point of time. The problem of finding an optimal task allocation solution is known to be an NP-hard. We propose grid transaction allocation based on social spider optimization (LBGTA_SSO) method for this problem. The LBGTA_SSO is based on the cooperative behavior of social spiders to find a collection of task allocation solutions. We also derive reliability formulae for grid transactions considering resource availability. For comparison we modify some existing algorithms to obtain the task allocation algorithms. The results show that our algorithm works better than the modified existing algorithms.