Conference Paper

Realtss: a real-time scheduling simulator

Inst. Tecnologico de Mexicali, Mexicali
DOI: 10.1109/ICEEE.2007.4344998 Conference: Electrical and Electronics Engineering, 2007. ICEEE 2007. 4th International Conference on
Source: IEEE Xplore

ABSTRACT Real-time scheduling theory has shown an impressive evolution in the past few years. As a consequence of the intensive research done in this area a lot of new scheduling policies had been proposed to date. Nevertheless, just a few of such scheduling policies are available in existing real-time operating systems (RTOS). In this paper, we describe Realtss, an open source realtime scheduling simulator which is suited to simulate real-time scheduling algorithms without the need of implement them in a RTOS. Realtss is an invaluable teaching and researching tool since existing and new real-time scheduling policies can be easily evaluated.

1 Bookmark
 · 
426 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Este trabajo presenta una extensión a un modelo de eventos discretos para el diseño de simuladores de Sistemas de Tiempo Real con tareas periódicas, incorporando tareas de tipo esporádico y aperiódico. Además, se estudia el soporte para jitter y offset. El modelo de eventos discretos elegido se ajusta a los sistemas dinámicos discretos como lo son los Sistemas de Tiempo Real. El uso de simuladores para realizar comprobaciones de algoritmos, modelos, técnicas y para evaluar métricas de rendimiento, es una práctica extendida e importante en la disciplina. El modelo, es diseñado empleando la técnica de grafo de eventos.
    JAIIO 42 - Simposio de Informática Industrial 2013, Cordoba; 01/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Real-time systems demand guaranteed and predictable run-time behaviour in order to ensure that no task has missed its deadline. Over the years we are witnessing an ever increasing demand for functionality enhancements in the embedded real-time systems. Along with the functionalities, the design itself grows more complex. Posed constraints, such as energy consumption, time, and space bounds, also require attention and proper handling. Additionally, efficient scheduling algorithms, as proven through analyses and simulations, often impose requirements that have significant run-time cost, specially in the context of multi-core systems. In order to further investigate the behaviour of such systems to quantify and compare these overheads involved, we have developed the SPARTS, a simulator of a generic embedded real- time device. The tasks in the simulator are described by externally visible parameters (e.g. minimum inter-arrival, sporadicity, WCET, BCET, etc.), rather than the code of the tasks. While our current implementation is primarily focused on our immediate needs in the area of power-aware scheduling, it is designed to be extensible to accommodate different task properties, scheduling algorithms and/or hardware models for the application in wide variety of simulations. The source code of the SPARTS is available for download at [1].
    Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Increasing Deadline Meeting Rate (DMTR) during overload is a concern of Soft Real Time (SRT) Scheduling. Here we present our non-preemptive non-resource constraint scheduling model implemented on an open source discrete event simulator named OmNET. The model is simple, yet it fulfill the simulation purpose, which mimics execution of jobs schedule under non-preemptive and non-resource constraint system within usual real time timing parameters namely release time, execution time, deadline and period. We show that OmNET is capable to be used as a real time scheduling simulator. Along with, we also present the approach we undertook to design our novel SRT scheduling algorithm. The simulation result presented here shows the effect of Deadline Tolerance (SRT parameter) and Deadline size on DMTR. We conclude that our algorithm named gutEDF could produce higher DMTR as compared to Earliest Deadline First (EDF) algorithm during overload while maintaining optimum performance under normal load.
    Computational Intelligence, Modelling and Simulation (CIMSiM), 2012 Fourth International Conference on; 01/2012

Full-text (2 Sources)

Download
14 Downloads
Available from
Dec 4, 2014