 Below is a comparison of different scheduling algorithms.A system that correctly perceives the serialization and timing constraints associated with transactions with soft or firm deadlines, takes advantage of absolute consistency.Another way of making sure that data is absolute is using relative constraints.