The problem of guaranteeing "meet row n in m" weakly hard real-time constraint is addressed in this paper. The paper first analyzes characters of ?-pattern and gives out the definition of "unsatisfied ?-pattern". Then, it enumerates and proves several properties of unsatisfied ?-pattern. According to the properties, length of unsatisfied ?-pattern can indicate whether the ?-pattern satisfies the meet row constraint, therefore, a scheduling algorithm named Meet Row Algorithm is presented based on the properties. Meet Row Algorithm tries to find out the probabilities of tasks breaking constraints and increase task?s priority in advance. Simulation results show that Meet Row Algorithm is better than other scheduling algorithms for meet row constraints and can largely decrease the worst-case computation time of real-time tasks.