ملخص
We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, and prove several new results. These include improved bounds for election when participation is required and a new adaptive algorithm for starvation-free mutual exclusion in a model with unbounded concurrency. We also explore models where objects stronger than atomic registers, such as testandset bits, semaphores or read-modify- write registers, are used.
اللغة الأصلية | الإنجليزيّة |
---|---|
عنوان منشور المضيف | Distributed Computing-14th InternationalConference, DISC 2000, Proceedings |
المحررون | Maurice Herlihy |
ناشر | Springer Verlag |
الصفحات | 164-178 |
عدد الصفحات | 15 |
رقم المعيار الدولي للكتب (المطبوع) | 3540411437 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | نُشِر - 2000 |
الحدث | 14th International Conference on Distributed Computing, DISC 2000 - Toledo, أسبانيا المدة: ٤ أكتوبر ٢٠٠٠ → ٦ أكتوبر ٢٠٠٠ |
سلسلة المنشورات
الاسم | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
مستوى الصوت | 1914 |
رقم المعيار الدولي للدوريات (المطبوع) | 0302-9743 |
رقم المعيار الدولي للدوريات (الإلكتروني) | 1611-3349 |
!!Conference
!!Conference | 14th International Conference on Distributed Computing, DISC 2000 |
---|---|
الدولة/الإقليم | أسبانيا |
المدينة | Toledo |
المدة | ٤/١٠/٠٠ → ٦/١٠/٠٠ |
ملاحظة ببليوغرافية
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2000.