An efficient randomized algorithm for real-time process scheduling in PicOS operating system

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

PicOS is an event-driven operating environment designed for use with embedded networked sensors. More specifically, it is designed to support the concurrency in intensive operations required by networked sensors with minimal hardware requirements. Existing process scheduling algorithms of Pi-cOS; a commercial tiny, low-footprint, real-time operating system; have their associated drawbacks. An efficient, alternative algorithm, based on a randomized selection policy, has been proposed, demonstrated, confirmed for efficiency and fairness, on the average, and has been recommended for implementation in PicOS. Simulations were carried out and performance measures such as Average Waiting Time (AWT) and Average Turn-around Time (ATT) were used to assess the efficiency of the proposed randomized version over the existing ones. The results prove that Randomized algorithm is the best and most attractive for implementation in PicOS, since it is most fair and has the least AWT and ATT on average over the other non-preemptive scheduling algorithms implemented in this paper. © Springer Science+Business Media B.V. 2010.

Cite

CITATION STYLE

APA

Helmy, T., Fatai, A., & Sallam, E. S. (2010). An efficient randomized algorithm for real-time process scheduling in PicOS operating system. In Advanced Techniques in Computing Sciences and Software Engineering (pp. 117–122). Springer Publishing Company. https://doi.org/10.1007/978-90-481-3660-5_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free