با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
دسته بندی:
الگوریتم ها - algorithms
سال انتشار:
2018
عنوان انگلیسی مقاله:
Parallel algorithms for fitting Markov arrival processes
ترجمه فارسی عنوان مقاله:
الگوریتم های موازی برای متناسب سازی فرآیندهای ورود مارکوف
منبع:
Performance Evaluation Volumes 123–124, July 2018, Pages 50-67
نویسنده:
Mindaugas Bražėnas, Gábor Horváth, Miklós Telek
چکیده انگلیسی:
The fitting of Markov arrival processes (MAPs) with the expectation–maximization (EM) algorithm is a computationally demanding task. There are attempts in the literature to reduce the computational complexity by introducing special MAP structures instead of the general representation. Another possibility to improve the efficiency of MAP fitting is to reformulate the inherently serial classical EM algorithm to exploit modern, massively parallel hardware architectures.
In this paper we present three different EM-based fitting procedures that can take advantage of the parallel hardware (like Graphics Processing Units, GPUs) and apply a special MAP structure, the Erlang distributed-continuous-time hidden Markov chain (ER-CHMM) structure for reducing the computational complexity.
All the proposed parallel algorithms have their strengths: the first one traverses the samples only once per iteration, the second one is memory efficient (far more than the classical serial algorithm), and the third one has exceptionally low execution times.
These procedures are compared with the standard serial forward–backward procedure for performance comparison. The new algorithms are orders of magnitudes faster than the standard serial procedure, while (depending on the variant) using less memory.
keywords: Markov arrival process |Traffic model fitting |EM algorithm |Parallel computation |GPU
قیمت: رایگان
توضیحات اضافی: نظر
تعداد نظرات : 0