کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
524498 | 868677 | 2006 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal partitioning of nodes to space-sharing parallel tasks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimal partitioning of nodes to space-sharing parallel tasks Optimal partitioning of nodes to space-sharing parallel tasks](/preview/png/524498.png)
چکیده انگلیسی
This paper focuses on the execution of distributed applications on parallel platforms, such as MPPs or homogeneous clusters. These applications are usually formed by individual tasks, which are each mapped to the nodes available in the parallel platform. When these tasks can execute simultaneously, it may be necessary to space-share the nodes available within the application. In this case, partitioning the nodes among the space-sharing tasks is key in obtaining the best performance. This paper presents a polynomial algorithm to provide an optimal partitioning of nodes to parallel tasks, enabling them to execute simultaneously in minimum time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Parallel Computing - Volume 32, Issue 4, April 2006, Pages 313–324
Journal: Parallel Computing - Volume 32, Issue 4, April 2006, Pages 313–324
نویسندگان
Silvia M. Figueira,