Reference Hub2
Synchronization-Aware Task Allocation Techniques for Preemption Control to Reduce Blocking Time in Multiprocessor Real-Time System

Synchronization-Aware Task Allocation Techniques for Preemption Control to Reduce Blocking Time in Multiprocessor Real-Time System

Ajitesh Kumar, Sanjai Kumar Gupta
Copyright: © 2020 |Volume: 11 |Issue: 4 |Pages: 20
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781799807025|DOI: 10.4018/IJERTCS.2020100104
Cite Article Cite Article

MLA

Kumar, Ajitesh, and Sanjai Kumar Gupta. "Synchronization-Aware Task Allocation Techniques for Preemption Control to Reduce Blocking Time in Multiprocessor Real-Time System." IJERTCS vol.11, no.4 2020: pp.60-79. http://doi.org/10.4018/IJERTCS.2020100104

APA

Kumar, A. & Gupta, S. K. (2020). Synchronization-Aware Task Allocation Techniques for Preemption Control to Reduce Blocking Time in Multiprocessor Real-Time System. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 11(4), 60-79. http://doi.org/10.4018/IJERTCS.2020100104

Chicago

Kumar, Ajitesh, and Sanjai Kumar Gupta. "Synchronization-Aware Task Allocation Techniques for Preemption Control to Reduce Blocking Time in Multiprocessor Real-Time System," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 11, no.4: 60-79. http://doi.org/10.4018/IJERTCS.2020100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Multiprocessor real-time systems receive a great deal of attention. For better utilization of multiprocessors in a real-time context, an optimal approach for scheduling, allocation, and synchronization is required. In this research, a novel heuristic synchronization-aware scheduling has been proposed to reduce the blocking delays in a critical section and also bound to minimize multiple priority inversion. The key idea of this technique is to assign the task set in the same processor that accesses a common shared resource and also access them for the longest period of time; thereby, the global sharing of resource transforms into local sharing. From simulation results, it was concluded that the duration of blocking overheads should be minimized up to 25% to 30% and context switching between processors also reduced up to 10% to 15%. On the basis of result analysis, schedulability, minimization of context switching, and reduced blocking time indicate that the proposed method outperforms the existing methods and does not affect the task completion time.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.