Scheduling Techniques for Operating Systems for Medical and IoT Devices: A Review

1
Vipan Kakkar
Vipan Kakkar
1 Shri Mata Vaishno Devi University, Katra

Send Message

To: Author

GJCST Volume 17 Issue A1

Article Fingerprint

ReserarchID

4Z7A2

Scheduling Techniques for Operating Systems for Medical and IoT Devices: A Review Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Software and Hardware synthesis are the major subtasks in the implementation of hardware/software systems. Increasing trend is to build SoCs/NoC/Embedded System for Implantable Medical Devices (IMD) and Internet of Things (IoT) devices, which includes multiple Microprocessors and Signal Processors, allowing designing complex hardware and software systems, yet flexible with respect to the delivered performance and executed application. An important technique, which affect the macroscopic system implementation characteristics is the scheduling of hardware operations, program instructions and software processes. This paper presents a survey of the various scheduling strategies in process scheduling. Process Scheduling has to take into account the real-time constraints. Processes are characterized by their timing constraints, periodicity, precedence and data dependency, pre-emptivity, priority etc. The affect of these characteristics on scheduling decisions has been described in this paper.

102 Cites in Articles

References

  1. G Micheli,R Gupta (1997). Hardware/Software Codesign.
  2. D Gajski,F Vahid (1994). Specification and design of embedded hardware-software systems.
  3. F Balarin,L Lavagno,P Murthy,A Sangiovanni-Vincentelli,C Systems,A Sangiovanni- (1998). Scheduling for embedded real-time systems.
  4. K Ramamritham,J Stankovic,P Shiah (1989). Efficient scheduling algorithms for real-time multiprocessor systems.
  5. Oscar Plata,Francisco Rivera (1995). Combining static and dynamic scheduling on distributed-memory multiprocessors.
  6. K Ramamritham,J Stankovic Scheduling algorithms and operating systems support for Real-Time Systems.
  7. N Audsley,A Burns,M Richardson,A Wellings (1991). Hard Real-Time Scheduling: The Deadline-Monotonic Approach.
  8. R Bettati (1994). End-to-end scheduling to meet deadlines in distributed systems.
  9. C Liu,James Layland (1973). Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment.
  10. Philip Christopher,Apostolos Dollas (1991). Knowledge based process scheduling on symmetric multiprocessors.
  11. Babak Hamidzadeh,Ying Lau,David Kit,Lilja (2000). Dynamic Task Scheduling Using Online Optimization.
  12. Ragunathan Rajkumar,Lui Sha,John Lehoczky (1988). Real-time synchronization protocols for multiprocessors.
  13. Kwang Hong,Y-T Joseph,Leung (1998). On-line Scheduling of Real-Time Tasks.
  14. John Lehoczky (1990). Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines.
  15. T Baker (1990). A stack-based resource allocation policy for realtime processes.
  16. Chao-Ju Hou,G Kang,Shin (1991). Load Sharing with Consideration of Future Task Arrivals in Heterogeneous Distributed Real-Time Systems.
  17. Kevin Jeffay,Donald Stanat,Charles Martel (1991). On Non-Preemptive Scheduling of Periodic and Sporadic Tasks.
  18. John Lehoczky,Sandra Ramos-Thuel (1992). An Optimal Algorithm for Scheduling soft-Aperiodic Tasks in Fixed-Priority Preemptive Systems.
  19. K Ramamritham (1995). Allocation and scheduling of precedence-related periodic tasks.
  20. N Audsley,A Burns,M Richardson,K Tindell,A Wellings (1993). Applying new scheduling theory to static priority pre-emptive scheduling.
  21. Sandra Ramos-Thuel,John Lehoczky (1993). On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems.
  22. R Davis,K Tindell,A Burns (1993). Scheduling Slack Time in Fixed Priority Pre-emptive Systems.
  23. A Burns,A Wellings (1993). Dual Priority Assignment: A Practical Method For Increasing Processor Utilisation.
  24. Jun Sun,Riccardo Bettati,Jane Liu (1994). An Endto-End Approach to Schedule Tasks with Shared Resources in Multiprocessor Systems.
  25. Thuel,Lehoczky (1994). Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing.
  26. Too-Seng Tia,Jane Liu (1994). Task and Resource Assignment in Distributed Real-Time Systems.
  27. Robert Davis,Andy Wellings (1995). Dual Priority Scheduling.
  28. K Sanjay,Baruah (1995). Fairness in periodic real-time scheduling.
  29. Marco Spuri,Fiorgio Buttazzo,Fabrizio Sensini ; Haken Aydin,Rami Melhem,Daniel Mosse,Pedro Mejia-Alvarez (2001). Optimal Reward-Based Scheduling of Periodic Real-Time Tasks.
  30. Sha,R Rajkumar,J Lehoczky (1999). Priority Inheritance Protocols: An Approach to Real-Time Synchronization.
  31. Satoshi Fujita,Hui Zhou (2000). Multiprocessor Scheduling Problem with Probabilistic Execution Costs.
  32. J Lopez,M Garcia,J Diaz,D Garcia (2000). Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems.
  33. K Sanjay,Baruah (2000). Scheduling Periodic Tasks on Uniform Multiprocessors.
  34. Shu-Ling Lee,Chao-Tung Yang,Shian-Shyong Tseng,Chang-Jiun Tsai (2000). A Cost Effective Scheduling with Load Balancing for Multiprocessor Systems.
  35. B Hamidzadeb,Yacine Atif (1998). Dynamic scheduling of real-time tasks, by assignment.
  36. J Xu,D Parnas (1990). Scheduling processes with release times, deadlines, precedence and exclusion relations.
  37. G Bernat,A Burns (1997). Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling.
  38. Alan Bertossi,Luigi Mancini (1994). Scheduling algorithms for fault-tolerance in hard-real-time systems.
  39. J. -Y Chung,J,-S Liu,K. -J Lin (1990). ™Scheduling Periodic Jobs that Allow Imprecise Results.
  40. W Feng,J,-S Liu (1997). ™Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines.
  41. M Hamdaoui,P Ramanathan (1995). ™A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines.
  42. Jayanta Dey,James Kurose,Don Towsley,C Krishna,Mahesh Girkar (1993). Efficient on-line processor scheduling for a class of IRIS ( <i>increasing reward with increasing service</i> ) real-time tasks.
  43. Kwei-Jay Lin,Jane Liu (1987). Utilizing Imprecise Results in Real-Time Systems.
  44. J,-S Liu,K. -J Lin,W. -K Shih,A,-S Yu,C Chung,J Yao,W Zhao (1991). ™Algorithms for Scheduling Imprecise Computations.
  45. W. -K Shih,J,-S Liu,J. -Y Chung (1991). ™Algorithms for Scheduling Imprecise Computations with Timing Constraints.
  46. Sha,J Goodenough (1990). Real-Time Scheduling Theory and Ada.
  47. Aloysius Mok (1983). Formal Design Methodology for Hard-Real-Time Systems..
  48. Min-Ih Chen,Kwei-Jay Lin (1990). Dynamic priority ceilings: A concurrency control protocol for real-time systems.
  49. Giorgio Buttazzo (1999). Minimizing Aperiodic Response Times in a Firm Real-Time Environment.
  50. Giorgio Buttazzo,F Sensini (1997). Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments.
  51. M Dertouzos,A Mok (1989). Multiprocessor online scheduling of hard-real-time tasks.
  52. M Silly-Chetto (1999). Dynamic acceptance of aperiodic tasks with periodic tasks under resource sharing constraints.
  53. J Dey,J Kurose,D Towsley (1996). On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks.
  54. J Gutierrez,J Garcia,M Harbour (1997). On the schedulability analysis for distributed hard real-time systems.
  55. Nima Homayoun,Parameswaran Ramanathan (1994). Dynamic priority scheduling of periodic and aperiodic tasks in hard real-time systems.
  56. N Audsley (Dec.). Optimal priority assignment and feasibility of static priority tasks with arbitrary start times.
  57. R Rajkumar (1990). Real-Time Synchronization Protocols for Shared Memory Multiprocessors.
  58. M Joseph,P Pandya (1986). Finding Response Times in a Real-Time System.
  59. J Lehoczky,L Sha,J (1987). Enhancing aperiodic responsiveness in hard realtime environment.
  60. B Sprunt,L Sha,J Lehoczky (1989). Aperiodic task scheduling for hard real-time systems.
  61. Null- Leung,Jennifer Whitehead (1982). On the complexity of fixed-priority scheduling of periodic, real-time tasks.
  62. J Lehoczky,L Sha,Y Ding (1989). The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior.
  63. H Singh (1994). Scheduling techniques for real-time applications consisting of periodic task sets.
  64. W Shih,J Liu,C Liu (1993). Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines.
  65. H Chetto,M Chetto (1989). Some Results of the Earliest Deadline Scheduling Algorithm.
  66. J Strosnider,J Lehoczky,Lui Sha (1995). The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments.
  67. T Ghazalie,T Baker (1995). Aperiodic servers in a deadline scheduling environment.
  68. B Sprunt,J Lehoczky,L Sha (1988). Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm.
  69. K Schawan,H Zhou (1992). Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads.
  70. M Caccamo,G Lipari,G Buttazzo (null). Sharing resources among periodic and aperiodic tasks with dynamic deadlines.
  71. M Spuri,G Buttazzo (1994). Efficient Aperiodic Service under Earliest Deadline Scheduling.
  72. Marco Spuri,Giorgio Buttazzo (1996). Scheduling aperiodic tasks in dynamic priority systems.
  73. G Buttazzo,F Sensini (1999). Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments.
  74. K Jeffay (1992). Scheduling sporadic tasks with shared resources in hard-real-time systems.
  75. H Kim,S Lee,J Lee (1995). A soft Aperiodic Task Scheduling Algorithm in Dynamic Priority Systems.
  76. H Kim,S Lee,J Lee (1995). Scheduling of hard Aperiodic Requests in Dynamic Priority Systems.
  77. H Kim,S Lee,J Lee (1996). Alternative Priority Scheduling in Dynamic Priority Systems.
  78. Sudarshan Dhall,C Liu (1978). On a Real-Time Scheduling Problem.
  79. J Sun,J Liu (1996). Synchronization protocols in distributed real-time systems.
  80. Arthur Liestman,Roy Campbell (1988). A fault-tolerant scheduling problem.
  81. Y Oh,S Son (1991). Multiprocessor Support for Real-Time Fault Tolerant Scheduling.
  82. D Pradhan (1986). Fault-Tolerant Computing: Theory and Techniques.
  83. S Ghosh,R Melhem,D Mosse (1997). Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems.
  84. M Maode,H Babak (1996). A Fault-tolerant Strategy for Real-Time Task Scheduling on Multiprocessor System.
  85. F Liberto,S Lauzac,R Melhem,D Mosse (1999). Fault Tolerant Real-Time Global Scheduling on Multiprocessors.
  86. K-G Shin,C-J Hou (1991). Effective load sharing in distributed real-time systems.
  87. K Shin,Y. -C Chang (1989). Load Sharing in distributed real-time systems with state change broadcasts.
  88. D Eager,E Lazowska,J Zahorjan (1986). Adaptive load sharing in homogeneous distributed systems.
  89. S Davari,S Dhall (1986). On a Real-Time Task Allocation Problem.
  90. S Davari,S Dhall (1986). An On Line Algorithm for Real-Time Tasks Allocation.
  91. S Baruah,N Cohen,C Plaxton,D Varvel (1994). Proportionate Progress: A Notion of Fairness in Resource Allocation.
  92. S Baruah,J Gehrke,C Plaxton (1995). Fast scheduling of periodic tasks on multiple resources.
  93. S Ghosh,R Melhem,D Mosse (1994). Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor System.
  94. Wenming Li,Krishna Kavi,Robert Akl (2007). A non-preemptive scheduling algorithm for soft real-time systems.
  95. Q Li,W Ba (2012). A group priority earliest deadline first scheduling algorithm.
  96. Arshjot Kaur,Supriya Kinger (2014). Unknown Title.
  97. Jihye Kwon,Kang-Wook Kim,Sangyoun Paik,Jihwa Lee,Chang-Gun Lee (2015). Multicore scheduling of parallel real-time tasks with multiple parallelization options.
  98. Luyuan Zeng,Pengcheng Huang,Lothar Thiele (2016). Towards the design of fault-tolerant mixed-criticality systems on multicores.
  99. G Dhiman,K Pusukuri,T Rosing (2008). Reinforcement Learning Based Dynamic Power Management with a Hybrid Power Supply.
  100. Umair Khan,Bernhard Rinner (2012). A Reinforcement Learning Framework for Dynamic Power Management of a Portable, Multi-camera Traffic Monitoring System.
  101. M Trikil,A Ammari,Y Wang,M Pedram (2013). Reinforcement Learning-Based Dynamic Power Management of a Battery-Powered System Supplying Multiple Active Modes.
  102. M Triki,Y Wang,A Ammari,M Pedram (2015). Hierarchical power management of a system with autonomously power-managed components using reinforcement learning.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Vipan Kakkar. 2017. \u201cScheduling Techniques for Operating Systems for Medical and IoT Devices: A Review\u201d. Global Journal of Computer Science and Technology - A: Hardware & Computation GJCST-A Volume 17 (GJCST Volume 17 Issue A1): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-A Classification: J.3
Version of record

v1.2

Issue date

December 15, 2017

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 6605
Total Downloads: 1609
2026 Trends
Research Identity (RIN)
Related Research

Published Article

Software and Hardware synthesis are the major subtasks in the implementation of hardware/software systems. Increasing trend is to build SoCs/NoC/Embedded System for Implantable Medical Devices (IMD) and Internet of Things (IoT) devices, which includes multiple Microprocessors and Signal Processors, allowing designing complex hardware and software systems, yet flexible with respect to the delivered performance and executed application. An important technique, which affect the macroscopic system implementation characteristics is the scheduling of hardware operations, program instructions and software processes. This paper presents a survey of the various scheduling strategies in process scheduling. Process Scheduling has to take into account the real-time constraints. Processes are characterized by their timing constraints, periodicity, precedence and data dependency, pre-emptivity, priority etc. The affect of these characteristics on scheduling decisions has been described in this paper.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Scheduling Techniques for Operating Systems for Medical and IoT Devices: A Review

Vipan Kakkar
Vipan Kakkar Shri Mata Vaishno Devi University, Katra

Research Journals