[[abstract]]One of the most well-studied scheduling algorithms for real-time systems is the Rate Monotonic (RM) scheduling for periodic tasks. In this paper we derive a generalized RM schedulability bound by considering relative period ratios among tasks in a system. We show that schedulability bounds published earlier are special cases of our generalized bound. Our new bound may provide a higher value than earlier results.[[incitationindex]]SCI[[booktype]]紙本[[booktype]]電子版[[iscallforpapers]]