Abstract
Acharya et al.'s broadcast disks (BD) are periodic dissemination architecture in the context of mobile systems. However, BD has the empty slot problem, resulting in the waste of bandwidth and the increase of access time. Therefore, in this paper, we propose an efficient broadcast program, the binary-number-based (BNB) approach, in which no empty slot is wasted with a restriction on the broadcast frequency. Next, we propose a generalized BNB (GBNB) approach in which no empty slot is wasted and the frequency of each disk is decided by the given access probabilities of pages on the disk. From our experimental results, we show that both our BNB and GBNB have shorter mean access time than BD.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
