بناء عنقود حسابي لحل المسائل المتوازية (دراسة حالة: مسألة أحجية الخمسة عشرة قطعة)

• تاريخ النشر: 31 - ديسمبر - 2010

ملخص البحث:

A Beowulf cluster has been built. The cluster contains five similar nodes working under fedora 11 OS. Algorithms of finding the shortest distance between two points that are used to solve (N²-1)-Puzzle have been studied for an initial test of the cluster.

الناشرون: