non-preemptive scheduling
[/nɑn-priˈɛmptɪv ˈʃɛdjuːlɪŋ/]
nounpl: non-preemptive schedulings
escalonamento não preemptivo
1. A scheduling algorithm where a process, once assigned to the CPU, runs to completion or until it voluntarily yields control, without being interrupted by the operating system
In non-preemptive scheduling, a long-running process cannot be interrupted even if a higher priority task arrives.
No escalonamento não preemptivo, um processo de longa duração não pode ser interrompido mesmo se uma tarefa de prioridade mais alta chegar.
2. A CPU scheduling method where the scheduler cannot forcibly remove a running process from the processor
Non-preemptive scheduling is simpler to implement but may cause delays for urgent tasks.
O escalonamento não preemptivo é mais simples de implementar, mas pode causar atrasos para tarefas urgentes.
This is a technical term primarily used in computer science education and software development. In Brazil, it is commonly taught in courses on Operating Systems and Real-Time Systems in engineering and computer science programs. The term is standardized across Portuguese-speaking countries and the USA, with no significant regional variations in meaning or usage.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →