## 7 Conclusions and Future Work  
To date, the problem of ON-C scheduling algorithms with an objective to minimize the IbFt+E for multiprocessor setting is studied less extensively. A scheduling algorithm multiprocessor with bounded speed (MBS) is proposed, which uses importance-based/weighted round robin (WRR) for job selection. MBS extends the theoretical study of an ON-C multiprocessor DSS scheduling problem with an objective to minimize the IbFt+E using the bounded speed model, where every processor's maximum speed using MBS is \((1+\
icefrac{{\Delta}}{{3m}})\eta\) and using offline adversary Opt is \(\eta\). The speed of any processor  
Figure 11: Total importance-based flow time + energy consumed using MBS and NC-PAR. Figure 10: Importance-based flow time + energy consumed using MBS and NC-PAR. +++ ==ERROR: No output for this page==
changes if there is a variation in the total importance of jobs on that processor. The competitiveness of MBS is \(\big{(}\frac{9}{8}+\frac{3\Delta}{8}\big{)}\big{(}1+\big{(}1+\  
++  
* _[PERSON] and [PERSON] (1995)_ _[PERSON]; [PERSON] Dover: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems._ SIAM J. Comput._**1995**, _24_, 318-339. [CrossRef]
* _[PERSON] and [PERSON] (1997)_ _[PERSON]; [PERSON] Approximating total flow time on parallel machines. In Proceedings of the ACM Symposium on Theory of Computing, El Paso, TX, USA, 4-6 May 1997; pp. 110-119._
* _[PERSON] and [PERSON] (2000)_ _[PERSON]; [PERSON] [PERSON] Speed is as powerful as clairvoyant._ J. ACM_**2000**, _47_, 617-643. [CrossRef]
* _[PERSON] and Scheduling in the dark._ Theor. Comput. Sci._**2000**, _235_, 109-141. [CrossRef]
* _[PERSON] and [PERSON] (2003)_ _[PERSON]; [PERSON] [PERSON] Minimizing flow time nonclairvoyantly._ J. ACM_**2003**, _50_, 551-567. [CrossRef]
* _[PERSON] and [PERSON] (2004)_ _[PERSON]; [PERSON] Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines._ J. ACM_**2004**, _51_, 517-539. [CrossRef]
* _[PERSON] et al. (2004)_ _[PERSON]; [PERSON]; [PERSON]; [PERSON] Multiprocessor scheduling to minimize flow time with epsilon resource augmentation. In Proceedings of the 36 th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13-15 June 2004; pp. 363-372._
* _[PERSON] et al. (2004)_ _[PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Multiprocessor energy efficient scheduling with task migration considerations. In Proceedings of the 16 th Euromicro Conference on Real-Time Systems, Catania, Italy, 2 July 2004; pp. 101-108._
* _[PERSON] and [PERSON] (2007)_ _[PERSON]; [PERSON] [PERSON] Energy-efficient algorithms for flow time minimization._ ACM Trans. Algorithms_**2007**, \(3\), 49. [CrossRef]
* _[PERSON] et al. (2007)_ _[PERSON] [PERSON]; [PERSON]; [PERSON] Speed scaling for weighted flow time. In Proceedings of the 18 th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, 7-9 January 2007; pp. 805-813._
* _[PERSON] et al. (2008)_ _[PERSON]; [PERSON]; [PERSON]; [PERSON]. Competitive non-migratory scheduling for flow time and energy. In Proceedings of the 20 th ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, 14-16 June 2008; pp. 256-264._
* _[PERSON] et al. (2009)_ _[PERSON]; [PERSON]; [PERSON]; [PERSON] A competitive algorithm for minimizing weighted flow time on unrelated processors with speed augmentation. In Proceedings of the Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA, 31 May-2 June 2009; pp. 679-684._
* _[PERSON] et al. (2011)_ _[PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Sleep management on multiple processors for energy and flow time. In Proceedings of the 38 th International Colloquium on Automata, Languages and Programming, Zurich, Switzerland, 4-8 July 2011; pp. 219-231._
* _[PERSON] et al. (2011)_ _[PERSON]; [PERSON]; [PERSON] On multi-processor speed scaling with migration. In Proceedings of the 23 rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, 4-6 June 2011; pp.