Abstract—We simplify the periodic tasks scheduling problem by making a trade off between processor load and computational complexity. A set \big. N\bigr. of periodic tasks, each characterized by its density \big. \rho _i\bigr., contains \big. n\bigr. possibly unique values of \big. \rho _{i}\bigr.. We transform \big. N\bigr. through a process called quantization, in which each \big. \rho _{i}\in_{ } N\bigr. is mapped onto a service level \big. s_{j}\in_{ } L\bigr., where \big. \left|L\right|=l\ll n\bigr. and \big. \rho _{i}\leq s_{j}\bigr. (this second condition differentiates this problem from the p-median problem on the real line). We define the Periodic Task Quantization problem with Deterministic input (PTQ-D) and present an optimal polynomial time dynamic programming solution. We also introduce the problem PTQ-S (with Stochastic input) and present an optimal solution. We examine, in a simulation study, the trade off penalty of excess processor load needed to service the set of quantized tasks over the original set, and find that, through quantization onto as few as 15 or 20 service levels, no more than 5 percent processor load is required above the amount requested. Finally, we demonstrate that the scheduling of a set of periodic tasks is greatly simplified through quantization and we present a fast online algorithm that schedules quantized periodic tasks.