Limitation of the hyper-period in real-time periodic task set generation

Abstract

: This paper presents a method used in order to generate arbitrary task systems, compound of periodic and independent tasks. The originality of this methods relays on a judicious choice of the periods of the tasks in order to reduce the lcm of the periods (and the simulation duration required in order to study such a system). The authors prove that the lcm of n integers might be very high: they propose an upper bound of the lcm of n integers, given by e