ملخص
We investigate the possibility of solving problems in completely asynchronous message passing systems where a number of processes may fail prior to execution. By using game-theoretical notions, necessary and sufficient conditions are provided for solving problems is such a model with an without a termination requirement. An upper bound on the message complexity for solving any problem in the model is given, as well as a simple design concept for constructing a solution to any solvable problem.
اللغة الأصلية | الإنجليزيّة |
---|---|
الصفحات (من إلى) | 255-276 |
عدد الصفحات | 22 |
دورية | International Journal of Parallel Programming |
مستوى الصوت | 18 |
رقم الإصدار | 4 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | نُشِر - أغسطس 1989 |
منشور خارجيًا | نعم |