کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
396051 | 666111 | 2007 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A comparative study of job allocation and migration in the pancake network
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A comparative study of job allocation and migration in the pancake network A comparative study of job allocation and migration in the pancake network](/preview/png/396051.png)
چکیده انگلیسی
Pancake networks are an attractive class of Cayley graphs functioning as a viable interconnection scheme for large multi-processor systems. The hierarchy of the pancake graph allows the assignment of its special subgraphs, which have the same topological features as the original graph, to a sequence of incoming jobs. We investigate the hierarchical structure of the pancake network and derive a job allocation scheme for assigning processors to incoming jobs. An algorithm is presented for job migration. Finally, we compare the assignment scheme to those derived previously for the star network and address the shortcomings of the pancake network.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 177, Issue 11, 1 June 2007, Pages 2327–2335
Journal: Information Sciences - Volume 177, Issue 11, 1 June 2007, Pages 2327–2335
نویسندگان
Robert Bennes, Shahram Latifi, Naoto Kimura,