کد مقاله کد نشریه سال انتشار مقاله انگلیسی ترجمه فارسی نسخه تمام متن
4950276 1364283 2018 15 صفحه PDF ندارد دانلود رایگان
عنوان انگلیسی مقاله
MigPF: Towards on self-organizing process rescheduling of Bulk-Synchronous Parallel applications
کلمات کلیدی
Bulk Synchronous Parallel; Process migration; Load balancing; Self-organizing;
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
MigPF: Towards on self-organizing process rescheduling of Bulk-Synchronous Parallel applications
چکیده انگلیسی

•We are proposing MigPF, a migration model for Bulk-Synchronous Parallel programs on heterogeneous environments.•Using ideas from the TCP protocol, MigPF adapts the interval between migration calls.•Scientific contribution includes a new algorithm that self-organizes process migration.•We implemented a prototype running over AMPI and evaluated against other proposals.•Shear-sort and Image Compression applications were tested in a heterogeneous cluster.

Migration is a known technique to offer process rescheduling, being especially pertinent for Bulk Synchronous Parallel (BSP) programs. Such programs are organized in a set of supersteps, in which the slowest process always determines the synchronization time. This approach motivated us to develop a first model called MigBSP, which combines computation, communication, and migration costs metrics for process rescheduling decisions. In this paper, a new model named MigPF enhances our previous work in three aspects: (i) a different algorithm for detecting imbalance situations, which considers the performance of each processor, including its enclosed processes, instead of individual times of each process; (ii) an improvement on the rescheduling reactivity through shortening the interval for the next migration call when imbalance situations arise; (iii) a new algorithm for self-organizing the migratable processes and their destinations. Particularly, this third item represents our main scientific contribution, not only in terms of the MigBSP context, but also in a broader one that covers the entire BSP landscape. The algorithm assembles n possible rescheduling plans (where n is the number of processes) and provides a prediction function (pf) that chooses the most profitable rescheduling plan when compared to the current mapping. We developed a MigPF prototype with the Adaptive MPI (AMPI) library, which offers a standard framework for implementing migration-based load balancing policies. We tested this prototype against other built-in AMPI rescheduling policies with two scientific applications: shear sorting and fractal image compression. The results revealed performance gains up to 41% and an overhead limited to 5% when migrations do not take place.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Future Generation Computer Systems - Volume 78, Part 1, January 2018, Pages 272-286
نویسندگان
, , , , , , ,