عنوان فایل ترجمه فارسی: الگوریتم آشکارسازی بن بست موازی.
عنوان نسخه انگلیسی: Parallel Deadlock Detection Algorithm
مرتبط با رشته : ریاضی
تعداد صفحات مقاله فارسی: ۱۵ صفحه
این فایل ترجمه شده به صورت ورد word است و دارای امکان ویرایش می باشد.
و دریافت رایگان متون لاتین در قسمت پایین با فرمت pdf آمده دانلود است.
قسمتی از متن انگلیسی:
(i.e. no one is using it), the resource
will be granted to the requester immediately (line 4). If the resource
is not available, the DAU check the possibility of request deadlock
(R-dl) (line 5). If a request would cause request deadlock (R-dl) (line
5) – note that the DAU tracks all requests and releases – the DAU
compares the priority of the requester with that of the current owner of
the requested resource. If the priority of the requester is higher than
that of the current owner of the resource (line 6), the DAU makes the
request be pending for the requester (line 7), an then the DAU asks the
owner of the resource to give up the resource so that the higher
priority process can proceed (line 8, the current owner may need time to
finish or checkpoint its current processing). On the other hand, if the
priority of the requester is lower than that of the owner of the
resource (line 9), the DAU asks the requester to give up the resource(s)
that the requester already has but is most likely not using yet (since
all needed resources are not yet granted, line 10)
جهت مشاهده ادامه نمونه متن پارسی این مقاله بر روی متن زیر کلیک نمایید.
