کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
432647 689003 2016 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Stochastic-based robust dynamic resource allocation for independent tasks in a heterogeneous computing system
ترجمه فارسی عنوان
تخصیص منابع پویای قوی برای مبتنی بر تصادفی برای وظایف مستقل در یک سیستم محاسباتی ناهمگن
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
چکیده انگلیسی


• Calculating stochastic task completion time in heterogeneous system with task dropping.
• A model to quantify resource allocation robustness and propose mapping heuristics.
• Evaluating immediate and batch mappings and optimizing queue-size limit of batch mode.
• Analyzing impact of over-subscription level on immediate and batch allocation modes.
• Providing a model in the batch mode to run mapping events before machines become idle.

Heterogeneous parallel and distributed computing systems frequently must operate in environments where there is uncertainty in system parameters. Robustness can be defined as the degree to which a system can function correctly in the presence of parameter values different from those assumed. In such an environment, the execution time of any given task may fluctuate substantially due to factors such as the content of data to be processed. Determining a resource allocation that is robust against this uncertainty is an important area of research. In this study, we define a stochastic robustness measure to facilitate resource allocation decisions in a dynamic environment where tasks are subject to individual hard deadlines and each task requires some input data to start execution. In this environment, the tasks that cannot meet their deadlines are dropped (i.e., discarded). We define methods to determine the stochastic completion times of tasks in the presence of the task dropping. The stochastic task completion time is used in the definition of the stochastic robustness measure. Based on this stochastic robustness measure, we design novel resource allocation techniques that work in immediate and batch modes, with the goal of maximizing the number of tasks that meet their individual deadlines. We compare the performance of our technique against several well-known approaches taken from the literature and adapted to our environment. Simulation results of this study demonstrate the suitability of our new technique in a dynamic heterogeneous computing system.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Parallel and Distributed Computing - Volume 97, November 2016, Pages 96–111
نویسندگان
, , , , , , , , , , , , , , ,