How do we measure the throughput of a scheduling algorithm? In every algorithm,the total time will be the sum of the burst times..and the same number of tasks will get executed in that time.? In that case how do we determine which one has maximum throughput?