run-to-completion scheduling
[/rʌn tə kəmˈpliːʃən ˈʃɛdʒuːlɪŋ/]
noun
escalonamento até conclusão
1. A scheduling algorithm in computing where a task or process, once started, runs to completion without interruption or context switching
The embedded system uses run-to-completion scheduling to ensure that critical tasks are not interrupted once they begin execution.
O sistema embarcado usa escalonamento até conclusão para garantir que tarefas críticas não sejam interrompidas uma vez que iniciem a execução.
2. A non-preemptive scheduling policy commonly used in real-time and embedded systems where higher-priority tasks cannot preempt lower-priority tasks that are already running
In run-to-completion scheduling, a lower-priority task cannot be interrupted by a higher-priority task, reducing context-switching overhead.
No escalonamento até conclusão, uma tarefa de menor prioridade não pode ser interrompida por uma tarefa de maior prioridade, reduzindo a sobrecarga de troca de contexto.
This is a technical term primarily used in computer science, systems engineering, and software development contexts. It is particularly important in Brazilian universities and tech companies that focus on embedded systems, IoT, and real-time computing. The term reflects scheduling principles crucial for deterministic behavior in critical systems.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →