کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10331294 | 686668 | 2005 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A mutual exclusion algorithm with optimally bounded bypasses
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A mutual exclusion algorithm with optimally bounded bypasses A mutual exclusion algorithm with optimally bounded bypasses](/preview/png/10331294.png)
چکیده انگلیسی
Peterson's algorithm [G.L. Peterson, Myths about the mutual exclusion problem, Inform. Process. Lett. 12 (3) (1981) 115-116] for mutual exclusion has been widely studied for its elegance and simplicity. In Peterson's algorithm, each process has to cross nâ1 stages to access the shared resource irrespective of the contention for the shared resource at that time, and allows unbounded bypasses. In [K. Block, T.-K. Woo, A more efficient generalization of Peterson's mutual exclusion algorithm, Inform. Process. Lett. 35 (1990) 219-222], Block and Woo proposed a modified algorithm that transforms the number stages to be crossed from fixed nâ1 to t, where 1⩽t⩽n, and bounds the number of possible bypasses by n(nâ1)/2. This paper proposes a simple modification that reduces the bound on the number of possible bypasses to optimal nâ1.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 96, Issue 1, 16 October 2005, Pages 36-40
Journal: Information Processing Letters - Volume 96, Issue 1, 16 October 2005, Pages 36-40
نویسندگان
K. Alagarsamy,