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 PicOS; 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.
* On leave from College of Engineering, Department of Computer and Automatic Control, Tanta University, Egypt.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. Akhmetshina, Pawel Gburzynski, Frederick S. Vizeacoumar, “PicOS: A Tiny Operating System for Extremely Small Embedded Platforms”, Proceedings of the International Conference on Embedded Systems and Applications, ESA '03, June 23 - 26, 2003, Las Vegas, Nevada, USA. CSREA Press 2003, ISBN 1-932415-05-X, Pp. 116–122.
P. Gburzynski, Olsonet Communications, “SIDE/SMURPH: a Modeling Environment for Reactive Telecommunication Systems", Version 3.0 manual, 2007.
Wlodek Dobosiewicz and Pawel Gburzynski, “Protocol Design in SMURPH”, Olsonet Communications, 2007.
Rippert Christophe, Deville Damien and Grimaud Gilles, “Alternative schemes for low-footprint operating systems building”, HAL – CCSD, Institut National de Recherche en Informatique et en Automatique (INRIA), 2007.
Rippert Christophe, Courbot Alexandre, and Grimaud Gilles, “A Low-Footprint Class Loading Mechanism for Embedded Java Virtual Machines”, HAL – CCSD, Institut National de Recherche en Informatique et en Automatique (INRIA), 2006.
Deville Damien, Rippert Christophe and Grimaud Gilles, “Trusted Collaborative Real Time Scheduling in a Smart Card Exokernel”, HAL – CCSD, Institut National de Recherche en Informatique et en Automatique (INRIA), 2007.
Marie-Agnits Pkraldi, Jean-Dominique Decotignie, “A Design Framework for Real-Time Reactive Applications”, IEEE, 1995.
Hui-Ming Su, Jing Chen, “Framework-Based Development of Embedded Real-Time Systems”, RTCSA 2003: 244–253
D. Shah, P. Giaccone, B. Prabhakar, "An efficient randomized algorithm for input-queued switch scheduling", IEEE Micro, 22(1):19–25, January-February 2002.
Cesare Alippi, “Randomized Algorithms: A System-Level, Poly-Time Analysis of Robust Computation”, IEEE Transactions on Computers, Volume 51, Issue 7, Pages: 740 – 749, 2002.
Leen Stougie and Arjen P. A. Vestjens, “Randomized algorithms for on-line scheduling problems: how low can't you go?” Operations Research Letters, Volume 30, Issue 2, April 2002, Pages 89–96.
Amin, A.; Ammar, R.; Sanguthevar Rajasekaran, "A randomized algorithm to schedule real-time task graphs to satisfy a multi-criteria objective function", Proceedings of the Fourth IEEE International Symposium on Signal Processing and Information Technology, vol., no., pp. 381–386, 18–21 Dec. 2004.
Yiwei Jiang, Yong He, “Preemptive online algorithms for scheduling with machine cost”, Acta Informatica 41, 315–340 (2005).
M.H. Alsuwaiyel, “Algorithms Design Techniques and Analysis”, Lecture Notes Series on Computing, Vol. 7, Pp. 371–392, 1999.
Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, John Wiley & Sons, Inc., 3rd Edition, Pp. 158–164, 2005.
Acknowledgment
We would like to thank King Fahd University of Petroleum and Minerals for providing the computing facilities. Special thanks to anonymous reviewers for their insightful comments and feedback
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this paper
Cite this paper
Helmy*, T., Fatai, A., Sallam, ES. (2010). An Efficient Randomized Algorithm for Real-Time Process Scheduling in PicOS Operating System. In: Elleithy, K. (eds) Advanced Techniques in Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3660-5_20
Download citation
DOI: https://doi.org/10.1007/978-90-481-3660-5_20
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3659-9
Online ISBN: 978-90-481-3660-5
eBook Packages: Computer ScienceComputer Science (R0)