create account

[Eng-Spa] Real-Time Systems - EDF Dynamic Priority Scheduling Algorithm by alfonsoalfonsi

View this thread on: hive.blog |  peakd.com |  ecency.com
hive-196387 · @alfonsoalfonsi ·
$10.46
[Eng-Spa] Real-Time Systems - EDF Dynamic Priority Scheduling Algorithm
<center>

![Título.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/242YWywn5hvUxMYd6XXcddLeesTG8syptKLQo5zGj3UosYFA82Hn5EijF43mvvMdJqgmo.jpg)
</center>

<div class="text-justify">

<div class=pull-left>

#### Hello Friends of Hive, Happy New Year 2022.
</div>

<div class=pull-right>

#### Hola Amigos de Hive, Feliz Año 2022.
</div>
<hr>

<div class=pull-left>

I give continuity to the series concerning <b>Real-Time Systems</b> (<b>RTS</b>), in the framework of topics related to science, research, technology, and innovation.
</div>

<div class=pull-right>

Doy continuidad a la serie concerniente a los <b>Sistemas de Tiempo Real</b> (<b>STR</b>), en el marco de temas relacionados a la ciencia, investigación, tecnología e innovación.
</div>
<hr>

<div class=pull-left>

In previous posts, I presented the context of offline and online real-time scheduling in [Real-Time Systems: Scheduling - Context and Cyclic Executive]( https://hive.blog/hive-196387/@alfonsoalfonsi/eng-spa-real-time-systems-priority-based-real-time-scheduling-static-algorithms). As well as [Real-Time Scheduling Based on Static Priorities](https://hive.blog/hive-196387/@alfonsoalfonsi/eng-spa-real-time-systems-priority-based-real-time-scheduling-static-algorithms)
</div>

<div class=pull-right>

En publicaciones anteriores, presenté el contexto de la planificación de tiempo real <i>fuera de línea</i> y <i>en línea</i> en [Sistemas de Tiempo Real: Planificación – Contexto y Ejecutivo Cíclico](https://hive.blog/hive-196387/@alfonsoalfonsi/eng-spa-real-time-systems-scheduling-context-and-cyclic-executive). Así como también, la [Planificación de Tiempo Real Basados en Prioridades Estáticas](https://hive.blog/hive-196387/@alfonsoalfonsi/eng-spa-real-time-systems-priority-based-real-time-scheduling-static-algorithms).
</div>
<hr>

<div class=pull-left>

This post I will dedicate to the EDF (Earliest Deadline First) Dynamic Priority Scheduling Algorithm.
</div>

<div class=pull-right>

Este post lo dedicaré al Algoritmo de Planificación de Prioridades Dinámicas EDF (Earliest Deadline First).
</div>
</div>
<hr>

<center>

![Separador 2.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wWpWoU3soCsKCuDtjegfFvuWwiTJUQXF1b4u4Qpv9uqv3xozWuFQcj7RHa2oLpsxNVL.jpg)

<div class=pull-left>

#### EDF Dynamic Priority Scheduling Algorithm
</div>

<div class=pull-right>

#### Algoritmo de Planificación de Prioridades Dinámicas EDF
</div>

![Separador 2.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wWpWoU3soCsKCuDtjegfFvuWwiTJUQXF1b4u4Qpv9uqv3xozWuFQcj7RHa2oLpsxNVL.jpg)

</center>

<div class="text-justify">

<div class=pull-left>

The main dynamic prioritization algorithm was introduced by Horn in 1974, called Earliest Deadline First (EDF), which allows scheduling a set of n independent tasks on a processor when the tasks have dynamic arrival time and preemption is allowed. This result can be expressed by the following theorem.
</div>

<div class=pull-right>

El principal algoritmo de asignación de prioridades dinámico fue introducido por Horn en 1974, llamado Earliest Deadline First (EDF), el cual permite planificar un conjunto de n tareas independientes sobre un procesador, cuando las tareas tienen tiempo de llegada dinámica y el adelanto es permitido. Este resultado puede ser expresado por el siguiente teorema.
</div>
<hr>

<div class=pull-left>

<blockquote>
<i>Given a set of n independent tasks with arbitrary arrival time, an algorithm that at some instant executes the task with the smallest absolute deadline among all ready tasks is optimal for minimizing the maximum delay.</i>
</blockquote>
</div>

<div class=pull-right>

<blockquote>

<i>Dado un conjunto de n tareas independientes con tiempo de llegada arbitrario, un algoritmo que en algún instante ejecute la tarea con plazo absoluto más pequeño entre todas las tareas listas, es óptimo con respecto a la minimización del máximo retraso.</i>
</blockquote>
</div>
<hr>

<div class=pull-left>

To ensure the feasibility of the scheduler produced by the EDF algorithm, it must be verified that all tasks must be completed before their completion deadline (<i>Di</i>), which is given by the following <i>n</i> conditions:
</div>

<div class=pull-right>

Para garantizar la factibilidad del planificador producido por el algoritmo EDF, se debe verificar que todas las tareas deben ser completadas antes de su plazo de finalización (<i>Di</i>), lo cual está dado por las siguientes <i>n</i> condiciones:
</div>
</div>
<hr>

<center>

![Ecu1.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/EoEwkAwNmZr3USL466XeZZRYP3VKoMa8TQVBQm7hsof14jMvSpthWLt7E32kkti3DRK.jpg)
</center>
<hr>

<div class="text-justify">

<div class=pull-left>

Where <i>Ci</i> is the remaining execution time in the worst case of the task <i>Ti</i>, note that it has an initial value equal to <i>Ci</i> and must be updated when the task is evicted.
</div>

<div class=pull-right>

donde <i>Ci</i> es el tiempo restante de ejecución en el peor caso de la tarea <i>Ti</i>, note que tiene un valor inicial igual a <i>Ci</i> y debe ser actualizado cuando la misma es desalojada.
</div>
<hr>

<div class=pull-left>

EDF is a dynamic scheduler that selects tasks according to their absolute deadline, uses advance, and can be used for periodic as well as aperiodic task scheduling since it does not make use of task periodicity for task scheduling.
</div>

<div class=pull-right>

EDF es un planificador dinámico que selecciona las tareas de acuerdo a su plazo absoluto, utiliza adelanto y puede ser usado para planificación de tareas periódicas como aperiódicas ya que no hace uso de la periodicidad de las tareas para la planificación de las mismas.
</div>
<hr>

<div class=pull-left>

For this case the lowest bound for the processor utilization factor is 1, therefore tasks can use 100% of the processor and still be schedulable. In particular, the following theorem of Liu and Lailand (1973) holds:
</div>

<div class=pull-right>

Para este caso la menor cota para el factor de utilización del procesador es 1, por lo tanto las tareas pueden utilizar el 100% del procesador y aún ser planificable. En particular el siguiente teorema de Liu y Lailand (1973) se mantiene:
</div>
</div>
<hr>

<center>

<blockquote>

<i>A set of tasks is schedulable with EDF if and only if: / Un conjunto de tareas es planificable con EDF si y sólo si</i>
</blockquote>

![Ecu2.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23uFwS9uoRRSd3s8WYHZZNXch2AXhM1LYDQng8A3qWyLsno8Ngw719UoMoPxQ1hb11sT8.jpg)
<hr>

<div class=pull-left>

##### EDF Method
</div>

<div class=pull-right>

##### El Método EDF
</div>
</center>
<hr>
<div class="text-justify">

<div class=pull-left>

The EDF scheduling method consists of assigning the highest priority at each instant to the task whose absolute completion time is closest. The absolute completion time of <i>Ti</i> at instant <i>t</i> is:
</div>

<div class=pull-right>

El método de planificación EDF consiste en asignar en cada instante la prioridad más alta a la tarea cuyo plazo de finalización absoluto está más próximo. El plazo de finalización absoluto de <i>Ti</i> en un instante <i>t</i> es:
</div>
</div>
<hr>

<center>

![Ecu3.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/EouEyXJLeMrUHtZVoMR2AtaGV6DrJbUoqNLdKs2Ck5qGpbhhVh27q7vxMSajcBNvKqz.jpg)
</center>
<hr>

<div class="text-justify">

<div class=pull-left>

where <i>Pi,k</i> is the instant <i>k</i> at which the last activation of <i>Ti</i> not yet satisfied at <i>t</i> has occurred. If <i>Ti</i> has no activation pending at <i>t</i>, it is assumed that <i>Li,k=∞</i>. Therefore, the task running at instant <i>t</i> is the one whose value of <i>Li,k</i> is minimum.
</div>

<div class=pull-right>

donde <i>Pi,k</i> es el instante <i>k</i> en que se ha producido la última activación de <i>Ti</i> aún no satisfecha en <i>t</i>. Si <i>Ti</i> no tiene ninguna activación pendiente en <i>t</i>, se supone que <i>Li,k=∞</i>. Por tanto, la tarea que se ejecuta en el instante <i>t</i> es aquel cuyo valor de <i>Li,k</i> es mínimo.
</div>
</div>
<hr>

<center>

<div class=pull-left>

#### Example
</div>

<div class=pull-right>

#### Ejemplo
</div>
<hr>
</center>

<div class="text-justify">

<div class=pull-left>

To illustrate the above, I take the temporal characteristics of three tasks outlined in <b>Table 1</b>.
</div>

<div class=pull-right>

Para ilustrar lo anterior, tomo las características temporales de tres tareas señaladas en la <b>Tabla 1</b>.
</div>
</div>
<hr>

<center>

<sub><b>Table 1</b>. Temporal characteristics of three tasks.</sub>
<sup><b>Tabla 1</b>. Características temporales de tres tareas.</sup>
![Tabla1.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/EnqUvHBYV146u8v58Yfy9XPqgeEnd8SFijf6fmuk1UfgZFqWvP4wnwL5bou3HJ99ZQc.jpg)
</center>
<hr>
<div class="text-justify">

<div class=pull-left>

Doing the schedulability analysis based on Liu and Lailand's (1973) System Utilization shows:
</div>

<div class=pull-right>

Al hacer el análisis de planificabilidad basado en la Utilización del Sistema de Liu y Lailand (1973) se demuestra: 
</div>
</div>
<hr>

<center>

![Ecu4.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/Eo6S6U3zf8So1EKTD9u8UNowHmejrN81yYY7vgSTnm39x4AXoMavShYir4CfU63xMkC.jpg)
</center>
<hr>

<div class="text-justify">

<div class=pull-left>

Whose scheduling with EDF is shown in <b>Figure 1</b>.
</div>

<div class=pull-right>

Cuya planificación con EDF se muestra en la <b>Figura 1</b>.
</div>
</div>
<hr>

<center>

![Figura 1.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wgoGsNctbi8uEAdnpSGDeg8XhuJ8sUqbpdBdFTkmw7UoyrLpY9qPAqas2v2HFpiwtcw.jpg)
<sub><b>Figure 1</b>. Three-task scheduling diagram with EDF. </sub>
<sup><b>Figura 1</b>. Diagrama de planificación de tres tareas con EDF.</sup>
</center>
<hr>

<center>

![Separador 2.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wWpWoU3soCsKCuDtjegfFvuWwiTJUQXF1b4u4Qpv9uqv3xozWuFQcj7RHa2oLpsxNVL.jpg)

<div class=pull-left>

### By way of closing
</div>

<div class=pull-right>

### A manera de cierre
</div>

![Separador 2.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wWpWoU3soCsKCuDtjegfFvuWwiTJUQXF1b4u4Qpv9uqv3xozWuFQcj7RHa2oLpsxNVL.jpg)
</center>

<div class="text-justify">

<div class=pull-left>

In this post, I explained the EDF dynamic scheduler algorithm for RTSs. I accompanied it with an example for better understanding, where the preceding relationship between the Schedulability Analysis and the respective dynamic execution is highlighted.
</div>

<div class=pull-right>

En este post expliqué el algoritmo de planificador dinámico EDF para los STR. Lo acompañé con un ejemplo para una mejor comprensión, donde se pone de manifiesto la relación precedente entre el Análisis de Planificabilidad y la ejecución dinámica respectiva.
</div>
<hr>

<div class=pull-left>

It is worth mentioning that this scheduler is available in texts and publications about RTSs. Therefore, below I leave references where you can find them. Also, most of the Real-Time Operating Systems host it.
</div>

<div class=pull-right>

Vale la pena mencionar, que este planificador está disponibles en los textos y publicaciones acerca de los STR. Por tanto, abajo dejo referencias donde los podrán encontrar. También, la mayoría de los Sistemas Operativos de Tiempo Real lo alojan.
</div>
</div>

<center>

![Separador AA.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/245n3kx1X7gX2BxfKAWydArJPGYezZChwuxNiiDtGF5dzPGMMQaxLsTCJpGKHNPBhzMfV.jpg)
</center>

<div class="text-justify">

<div class=pull-left>

See you soon, I hope the reading has been enriching.
</div>

<div class=pull-right>

Nos vemos pronto, espero que la lectura haya sido enriquecedora.
</div>
<hr>

<div class=pull-left>

I invite you to visit and follow me at @alfonsoalfonsi.
</div>

<div class=pull-right>

Los invito a visitarme y seguirme en @alfonsoalfonsi.
</div>
<hr>

<div class=pull-left>

Thank you for your time and comments.
</div>

<div class=pull-right>

Gracias por su tiempo y comentarios.
</div>
</div>


<center>

![Separador AA.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/245n3kx1X7gX2BxfKAWydArJPGYezZChwuxNiiDtGF5dzPGMMQaxLsTCJpGKHNPBhzMfV.jpg)

<div class=pull-left>

##### References
</div>

<div class=pull-right>

##### Referencias
</div>

![Separador 2.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wWpWoU3soCsKCuDtjegfFvuWwiTJUQXF1b4u4Qpv9uqv3xozWuFQcj7RHa2oLpsxNVL.jpg)
</center>
<hr>

<div class="text-justify">

Alfonsi, A. (2021). <i>Unidad II: Restricciones de los Sistemas Empotrados</i>. [Material educativo para la asignatura Proyecto de Digitales Avanzados, Semestre 1-2020]. (Disponible: Grupo de Investigación de Arquitecturas de Sistemas de Control, Departamento de Computación y Sistemas, EICA, Universidad de Oriente, Barcelona, Venezuela).

Butazzo, G. (2011). <i>Hard Real-Time Computing Systems: Predictable Scheduling Algoritms and Applications</i> (3rd ed.). Springer Science/Business Media.

Horn, W. (1974). Some simple scheduling algorithms. <i>Naval Research Logistics Quarterly, 21</i> (1), 177-185. https://doi.org/10.1002/nav.3800210113

Liu, C. & Layland, J. (1973). Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. <i>Journal of the ACM, 201</i>, 46-61. https://doi.org/10.1145/321738.321743

Shirvaikar, M. & Elbert, T. (2018). <i>Fundamentals of Real Time Systems</i>. Cognella, Inc.
</div>

<center>

![Separador 2.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wWpWoU3soCsKCuDtjegfFvuWwiTJUQXF1b4u4Qpv9uqv3xozWuFQcj7RHa2oLpsxNVL.jpg)

<div class=pull-left>

###### Figures and Images
</div>

<div class=pull-right>

###### Figuras e Imágenes
</div>

![Separador 2.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wWpWoU3soCsKCuDtjegfFvuWwiTJUQXF1b4u4Qpv9uqv3xozWuFQcj7RHa2oLpsxNVL.jpg)
</center>

<div class="text-justify">

<div class=pull-left>

<sub>The Home or Title image was made by @alfonsoalfonsi using</sub> <sup>CANVAS.</sup>
</div>

<div class=pull-right>

<sub>La imagen de Inicio o Título fue realizado por @alfonsoalfonsi</sub> <sup>usando CANVAS.</sup>
</div>
<hr>

<div class=pull-left>

<sub>The separator used is my own and is made using CANVAS and</sub> <sup>an image from [klipartz](https://c0.klipartz.com/pngpicture/342/164/gratis-png-halo-de-iluminacion-de-escenario-efecto-de-luz-de-brillo-ilustracion-de-chispa-amarilla.png).</sup>
</div>

<div class=pull-right>

<sub>El separador es de mi propiedad y está realizado usando</sub> <sup>CANVAS e imagen de [klipartz](https://c0.klipartz.com/pngpicture/342/164/gratis-png-halo-de-iluminacion-de-escenario-efecto-de-luz-de-brillo-ilustracion-de-chispa-amarilla.png)</sup>.
</div>
</div>
<hr>

<center>

![Baner ENG SPN.jpg](https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23tw429B2LDqyMwhEjMFnA93h4XEByJepLdBNY3nbatBYPJPd75DDt9wg4UPxnTRDJRe7.jpg)
</center>

<div class="text-justify">

<div class=pull-left>

<sub>The banner and the photographs on it are my property. Made</sub> <sup>with Paint and the Linerock Investment LTD ToonMe App.</sup>
</div>

<div class=pull-right>

<sub>El banner y las fotografías son de mi propiedad. Realizado con</sub> <sup> Paint y Linerock Investment LTD Aplicación ToonMe.</sup>
👍  , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , and 157 others
properties (23)
authoralfonsoalfonsi
permlinkeng-spa-real-time-systems-edf-dynamic-priority-scheduling-algorithm
categoryhive-196387
json_metadata{"app":"peakd/2021.09.1","format":"markdown","tags":["stem-espanol","technology","spanish","education","engineering","science","cervantes","ocdb","stemgeeks","enlace"],"users":["alfonsoalfonsi","alfonsoalfonsi."],"image":["https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/242YWywn5hvUxMYd6XXcddLeesTG8syptKLQo5zGj3UosYFA82Hn5EijF43mvvMdJqgmo.jpg","https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wWpWoU3soCsKCuDtjegfFvuWwiTJUQXF1b4u4Qpv9uqv3xozWuFQcj7RHa2oLpsxNVL.jpg","https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/EoEwkAwNmZr3USL466XeZZRYP3VKoMa8TQVBQm7hsof14jMvSpthWLt7E32kkti3DRK.jpg","https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23uFwS9uoRRSd3s8WYHZZNXch2AXhM1LYDQng8A3qWyLsno8Ngw719UoMoPxQ1hb11sT8.jpg","https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/EouEyXJLeMrUHtZVoMR2AtaGV6DrJbUoqNLdKs2Ck5qGpbhhVh27q7vxMSajcBNvKqz.jpg","https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/EnqUvHBYV146u8v58Yfy9XPqgeEnd8SFijf6fmuk1UfgZFqWvP4wnwL5bou3HJ99ZQc.jpg","https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/Eo6S6U3zf8So1EKTD9u8UNowHmejrN81yYY7vgSTnm39x4AXoMavShYir4CfU63xMkC.jpg","https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23wgoGsNctbi8uEAdnpSGDeg8XhuJ8sUqbpdBdFTkmw7UoyrLpY9qPAqas2v2HFpiwtcw.jpg","https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/245n3kx1X7gX2BxfKAWydArJPGYezZChwuxNiiDtGF5dzPGMMQaxLsTCJpGKHNPBhzMfV.jpg","https://files.peakd.com/file/peakd-hive/alfonsoalfonsi/23tw429B2LDqyMwhEjMFnA93h4XEByJepLdBNY3nbatBYPJPd75DDt9wg4UPxnTRDJRe7.jpg"]}
created2022-01-07 17:18:39
last_update2022-01-07 17:18:39
depth0
children4
last_payout2022-01-14 17:18:39
cashout_time1969-12-31 23:59:59
total_payout_value5.302 HBD
curator_payout_value5.158 HBD
pending_payout_value0.000 HBD
promoted0.000 HBD
body_length15,387
author_reputation12,520,973,524,509
root_title"[Eng-Spa] Real-Time Systems - EDF Dynamic Priority Scheduling Algorithm"
beneficiaries[]
max_accepted_payout1,000,000.000 HBD
percent_hbd10,000
post_id109,255,014
net_rshares6,255,043,104,178
author_curate_reward""
vote details (221)
@alfonsoalfonsi · 
https://twitter.com/lfonsi3/status/1479503840818958339?s=20
👍  
properties (23)
authoralfonsoalfonsi
permlinkr5cou4
categoryhive-196387
json_metadata{"app":"hiveblog/0.1"}
created2022-01-07 17:23:54
last_update2022-01-07 17:23:54
depth1
children0
last_payout2022-01-14 17:23:54
cashout_time1969-12-31 23:59:59
total_payout_value0.000 HBD
curator_payout_value0.000 HBD
pending_payout_value0.000 HBD
promoted0.000 HBD
body_length59
author_reputation12,520,973,524,509
root_title"[Eng-Spa] Real-Time Systems - EDF Dynamic Priority Scheduling Algorithm"
beneficiaries[]
max_accepted_payout1,000,000.000 HBD
percent_hbd10,000
post_id109,255,174
net_rshares1,962,996,853
author_curate_reward""
vote details (1)
@poshtoken · 
https://twitter.com/lfonsi3/status/1479503840818958339
<sub> The rewards earned on this comment will go directly to the person sharing the post on Twitter as long as they are registered with @poshtoken. Sign up at https://hiveposh.com.</sub>
👍  
properties (23)
authorposhtoken
permlinkre-alfonsoalfonsi-eng-spa-real-time-systems-edf-dynamic-priority-sch28925
categoryhive-196387
json_metadata"{"app":"Poshtoken 0.0.1"}"
created2022-01-07 17:30:09
last_update2022-01-07 17:30:09
depth1
children0
last_payout2022-01-14 17:30:09
cashout_time1969-12-31 23:59:59
total_payout_value0.000 HBD
curator_payout_value0.000 HBD
pending_payout_value0.000 HBD
promoted0.000 HBD
body_length242
author_reputation5,252,233,959,178,063
root_title"[Eng-Spa] Real-Time Systems - EDF Dynamic Priority Scheduling Algorithm"
beneficiaries
0.
accountreward.app
weight10,000
max_accepted_payout1,000,000.000 HBD
percent_hbd0
post_id109,255,407
net_rshares1,922,766,474
author_curate_reward""
vote details (1)
@steemstem ·
re-alfonsoalfonsi-eng-spa-real-time-systems-edf-dynamic-priority-scheduling-algorithm-20220109t135229517z
<div class='text-justify'> <div class='pull-left'>
 <img src='https://stem.openhive.network/images/stemsocialsupport7.png'> </div>

Thanks for your contribution to the <a href='/trending/hive-196387'>STEMsocial community</a>. Feel free to join us on <a href='https://discord.gg/9c7pKVD'>discord</a> to get to know the rest of us!

Please consider delegating to the @stemsocial account (85% of the curation rewards are returned).

You may also include @stemsocial as a beneficiary of the rewards of this post to get a stronger support.&nbsp;<br />&nbsp;<br />
</div>
properties (22)
authorsteemstem
permlinkre-alfonsoalfonsi-eng-spa-real-time-systems-edf-dynamic-priority-scheduling-algorithm-20220109t135229517z
categoryhive-196387
json_metadata{"app":"stemsocial"}
created2022-01-09 13:52:30
last_update2022-01-09 13:52:30
depth1
children1
last_payout2022-01-16 13:52:30
cashout_time1969-12-31 23:59:59
total_payout_value0.000 HBD
curator_payout_value0.000 HBD
pending_payout_value0.000 HBD
promoted0.000 HBD
body_length565
author_reputation262,017,435,115,313
root_title"[Eng-Spa] Real-Time Systems - EDF Dynamic Priority Scheduling Algorithm"
beneficiaries[]
max_accepted_payout1,000,000.000 HBD
percent_hbd10,000
post_id109,314,169
net_rshares0
@alfonsoalfonsi · 
Thank you @steemstem for supporting me. We remain in communication.
properties (22)
authoralfonsoalfonsi
permlinkr5i5im
categoryhive-196387
json_metadata{"users":["steemstem"],"app":"hiveblog/0.1"}
created2022-01-10 16:11:57
last_update2022-01-10 16:11:57
depth2
children0
last_payout2022-01-17 16:11:57
cashout_time1969-12-31 23:59:59
total_payout_value0.000 HBD
curator_payout_value0.000 HBD
pending_payout_value0.000 HBD
promoted0.000 HBD
body_length67
author_reputation12,520,973,524,509
root_title"[Eng-Spa] Real-Time Systems - EDF Dynamic Priority Scheduling Algorithm"
beneficiaries[]
max_accepted_payout1,000,000.000 HBD
percent_hbd10,000
post_id109,350,049
net_rshares0
Help/Feedback