سال انتشار: ۱۳۸۵

محل انتشار: دوازدهمین کنفرانس سالانه انجمن کامپیوتر ایران

تعداد صفحات: ۵

نویسنده(ها):

Abolfazl Haghighat – Department of Computer Engineering Qazvin Azad University , Qazvin , Iran
Shabnam Asbaghi – Department of Computer Engineering Qazvin Azad University , Qazvin , Iran
Slomaz Pourmahmud – Department of Computer Engineering Qazvin Azad University , Qazvin , Iran
Sanya Attari – Department of Computer Engineering Qazvin Azad University , Qazvin , Iran

چکیده:

This paper is focused communication – induced check pointing (CIC)method works with the concepts of Z-path and Z-cycle . the Z-cycle recognized in the systems are useless checkpoint and will never become apart of global consistent state. This can be solved by forced checkpoints. In this paper by recognizing Z-cycle , the number of appropriate place to force the additional checkpoints is calculated so that the best place for adding just on checkpoint to remove each Z-cycle is obtained. Additionally , a method is introduced in this paper in which it find shared parts between Z-cycle and calculates the best place to force only one additional checkpoint, so that all the nested Z-cycle are removed. Since forcing additional checkpoints cause an overhead, we have attempted to force checkpoints as fewer as possible.