Abstract
In ubiquitous and mobile computing environments, most of user requests have timing constraints. Therefore, for their execution, real-time scheduling mechanisms should be employed. In such environments, some mechanisms, such as Earliest Deadline First and Least Slack Time Rate (LSTR), are the most used real-time scheduling algorithms today. However, these existing mechanisms cannot guarantee the execution of the most critical user tasks. Furthermore, the results of executed tasks should also be provided to users on time so as to not waste the resources processing these tasks. The existing scheduling mechanisms, such as Dynamic Adjustment with Time Constraint and Dynamic Priority-based Heuristic action (DPH), are not suitable for this due to some limitations. The current paper proposes two new lightweight real-time mechanisms for scheduling input tasks (received requests) and output tasks (execution results) and evaluates their performance. The first mechanism satisfies users based on the classification of similar tasks and the use of the LSTR algorithm. The second mechanism is an improved form of the combination of the LSTR and DPH algorithms, and aims provide users with the maximum number of services by considering a possibility matrix. Extensive simulation experiments on real workload data demonstrate the superiority of the proposed mechanisms over existing algorithms, in terms of the percentage of executed tasks, makespan, and average turnaround time criteria.
Similar content being viewed by others
References
Weiser, M.: The computer for the 21st century. Mobile Comput. Commun. Rev. 3(3), 3–11 (1999). https://doi.org/10.1145/329124.329126
Sundmaeker, H.; Guillemin, P.; Friess, P.; Woelffle, S.: Vision and challenges for realising the Internet of Things. Cluster of European research projects on the Internet of Things. Eur. Comm. 3(3), 34–36 (2010)
Zaslavsky, A.; Perera, C.; Georgakopoulos, D.: Sensing as a service and big data. In: International Conference on Advances in Cloud Computing (ACC-2012), Bangalore, India, pp. 21–29 (2012)
Li, Z.; Wang, C.; Xu, R.: Computation offloading to save energy on handheld devices: a partition scheme. In: International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, pp. 238–246 (2001). https://doi.org/10.1145/502217.502257
Gubbi, J.; Buyya, R.; Marusic, S.; Palaniswami, M.: Internet of Things (IoT): a vision, architectural elements, and future directions. Future Gen. Comput. Syst. 29(7), 1645–1660 (2013). https://doi.org/10.1016/j.future.2013.01.010
A, Genco; S, Sorce: Pervasive Systems and Ubiquitous Computing. Wit Press, Ashurst (2010)
McNaughton, R.: Scheduling with deadlines and loss funct-ions. Manag. Sci. 6(1), 1–12 (1959). https://doi.org/10.1287/mnsc.6.1.1
Brandt, S.A.; Banachowski, S.; Lin, C.; Bisson, T.: Dynamic integrated scheduling of hard real-time, soft real-time, and non-real-time processes. In: 24th IEEE Real-Time Systems Symposium (RTSS 2003), pp. 396–407 (2003). https://doi.org/10.1109/real.2003.1253287
Sha, L.; Abdelzaher, T.; Arzen, K.E.; Cervin, A.; Baker, T.; Burns, A.; Buttazzo, G.; Caccamo, M.; Lehoczky, J.; Mok, A.K.: Real time scheduling theory: a historical perspective. Real Time Syst. 28(2–3), 101–155 (2004). https://doi.org/10.1023/b:time.0000045315.61234.1e
Blazewicz, J.; Ecker, K.H.; Pesch, E.; Schmidt, G.; Weglarz, J.: Handbook on Scheduling: From Theory to Applications. Springer, Berlin (2007). https://doi.org/10.1007/s10951-008-0099-z
George, L.; Rivierre, N.; Spuri, M.: Preemptive and non-preemptive real-time uniprocessor scheduling. Doctoral dissertation, Inria (1996)
Stankovic, J.A.; Spuri, M.; Ramamritham, K.; Buttazzo, G.: Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms. Springer, Berlin (2012)
Salehan, A.; Deldari, H.; Abrishami, S.: Characteristics and categorization of services in CLOUBI: a CLOud-based UBIquitous architecture. J. Ambient Intell. Smart Environ. 10(2), 195–219 (2018). https://doi.org/10.3233/AIS-180477
Zhou, B.; Dastjerdi, A.V.; Calheiros, R.N.; Buyya, R.: An online algorithm for task offloading in heterogeneous mobile clouds. ACM Trans. Internet Technol. (TOIT) 18(2), 23 (2018). https://doi.org/10.1145/3122981
Jeevan, A.N.G.; Mohamed, M.A.M.: DyTO: Dynamic task offloading strategy for mobile cloud computing using surrogate object model. Int. J. Parallel Program. (2018). https://doi.org/10.1007/s10766-018-0563-0
Gupta, I.; Kumar, M.S.; Jana, P.K.: Efficient workflow scheduling algorithm for cloud computing system: a dynamic priority-based approach. Arab. J. Sci. Eng. (2018). https://doi.org/10.1007/s13369-018-3261-8
Thaman, J.; Singh, M.: Cost-effective task scheduling using hybrid approach in cloud. Int. J. Grid Utility Comput. 8(3), 241–253 (2017). https://doi.org/10.1504/IJGUC.2017.087813
Salehan, A.; Deldari, H.; Abrishami, S.: An online valuation-based sealed winner-bid auction game for resource allocation and pricing in clouds. J. Supercomput. 73(11), 4868–4905 (2017). https://doi.org/10.1007/s11227-017-2059-x
Yang, H.; Zhang, J.; Ji, Y.; He, Y.; Lee, Y.: Experimental demonstration of multi-dimensional resources integration for service provisioning in cloud radio over fiber network. Sci. Rep. 6, 30678 (2016). https://doi.org/10.1038/srep30678
Yang, H.; Zhang, J.; Ji, Y.; Lee, Y.: C-RoFN: multi-stratum resources optimization for cloud-based radio over optical fiber networks. IEEE Commun. Mag. 54(8), 118–125 (2016). https://doi.org/10.1109/MCOM.2016.7537186
Chen, J.: Performance evaluation of scheduling algorithms in aurora. Doctoral dissertation, Brown University (2002)
Audsley, N.C.; Burns, A.; Wellings, A.J.: Deadline monotonic scheduling theory and application. Control Eng. Pract. 1(1), 71–78 (1993). https://doi.org/10.1016/0967-0661(93)92105-D
Lehoczky, J.; Sha, L.; Ding, Y.: The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In: IEEE Real Time Systems Symposium, pp. 166–171 (1989). https://doi.org/10.1109/REAL.1989.63567
Aksoy, D.; Franklin, M.: R\(\times \)W: a scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Trans. Netw. (ToN) 7(6), 846–860 (1999). https://doi.org/10.1109/90.811450
Triantafillou, P.; Harpantidou, R.; Paterakis, M.: High performance data broadcasting: a comprehensive systems’ perspective. In: International Conference on Mobile Data Management, pp. 79–90. Springer, Berlin, Heidelberg (2001)
Triantafillou, P.; Harpantidou, R.; Paterakis, M.: High performance data broadcasting systems. Mob. Netw. Appl. 7(4), 279–290 (2002). https://doi.org/10.1023/A:1015411311496
Worthington, B.L.; Ganger, G.R.; Patt, Y.N.: Scheduling algorithms for modern disk drives. ACM SIGMETRICS Perform. Eval. Rev. 22(1), 241–251 (1994). https://doi.org/10.1145/183019.183045
Lee, D.; Choi, J.; Kim, J.H.; Noh, S.H.; Min, S.L.; Cho, Y.; Kim, C.S.: On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies. ACM SIGMETRICS Perform. Eval. Rev. 27(1), 134–143 (1999). https://doi.org/10.1145/301464.301487
Zhang, F.; Burns, A.: Schedulability analysis for real-time systems with EDF scheduling. IEEE Trans. Comput. 58(9), 1250–1258 (2009). https://doi.org/10.1109/TC.2009.58
Hwang, M.; Choi, D.; Kim, P.: Least slack time rate first: an efficient scheduling algorithm for pervasive computing environment. J. UCS. 17(6), 912–925 (2011). https://doi.org/10.1109/cisis.2010.20
Mok, A.K.L.: Fundamental design problems of distributed systems for the hard-real-time environment. Doctoral dissertation, Massachusetts Institute of Technology (1983)
Hwang, M.; Choi, D.; Kim, P.: Least slack time rate first: new scheduling algorithm for multi-processor environment. In: International Conference on Complex, Intelligent and Software Intensive Systems (CISIS), pp. 806–811 (2010). https://doi.org/10.1109/CISIS.2010.20
Chiang, D.J.; Shih, T.K.: Scheduling data items with time constraint in ubiquitous computing environments. In: First IEEE International Conference on Ubi-Media Computing, pp. 344–349 (2008). https://doi.org/10.1109/UMEDIA.2008.4570914
Xue, W.; Luo, Q.; Ni, L.M.: Real-time action scheduling in pervasive computing. Inform. Int. J. Comput. Inform. 35(2), 269–282 (2011)
The 802 IEEE Standard for Information Technology—Part 11: Wireless medium access control (MAC) and physical layer (PHY) specifications. http://www.ieee802.org/11/index.shtml (2017). Accessed 3 Mar 2017
The 802 IEEE Standard for Information Technology—Part 15.1: Wireless medium access control (MAC) and physical layer (PHY) specifications for wireless personal area networks (WPANs). http://www.ieee802.org/15/pub/TG1.html (2017). Accessed 3 Mar 2017
The 802 IEEE Standard for Information Technology—Part 15.4: Wireless medium access control (MAC) and physical layer (PHY) specifications for wireless personal area networks (WPANs). http://www.ieee802.org/15/pub/TG4.html (2017). Accessed 3 Mar 2017
Infrared short range communications Standards. http://www.irda.org/displaycommon.cfm?an=1&subarticlenbr=7 (2017). Accessed 5 Mar 2017
Radio Frequency Identification Standards http://www.iso.org/iso/iso_catalogue/catalogue_tc/catalogue_detail.htm?csnumber=46145 (2017). Accessed 5 Mar 2017
Senobary, S.; Naghibzadeh, M.: Semi-partitioned scheduling for fixed-priority real-time tasks based on intelligent rate monotonic algorithm. Int. J. Grid Util. Comput. 6(3–4), 184–191 (2015). https://doi.org/10.1504/IJGUC.2015.070674
Flanagan, A.: Nokia context data. http://www.pervasive.jku.at/Research/Context_Database/index.php (2017). Accessed 22 Apr 2017
Flanagan, A.; Murphy, D.; Kaasinen, J.: A Nokia context recording database with synchronized user interaction. In: Benchmarks and a database for context recognition: workshop proceedings pervasive, Linz/Vienna, Austria (2004)
Morreale, P.; Goncalves, A.; Silva, C.: Mobile ad hoc network communication for disaster recovery. Int. J. Space Based Situat. Comput. 5(3), 178–186 (2015). https://doi.org/10.1504/IJSSC.2015.070949
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Salehan, A., Deldari, H. & Abrishami, S. Performance Evaluation of Two New Lightweight Real-Time Scheduling Mechanisms for Ubiquitous and Mobile Computing Environments. Arab J Sci Eng 44, 3083–3099 (2019). https://doi.org/10.1007/s13369-018-3409-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13369-018-3409-6