Across
- 2. Main memory is usually ____ addressable.
- 4. A theoretical model of a computer consisting of four parts: a tape, a head, a state register and a finite table. (2 words)
- 8. A pre-emptive scheduling algorithm where the task that is ready to run with the earliest deadline is selected. (3 words)
- 9. ____ memory allocation is used if the requirements are known ahead of time and the compiler can allocate the memory.
- 10. Memory that is allocated but never properly deallocated causes a ____. (2 words)
Down
- 1. ____ memory allocation is used if the requirements are determined at run time.
- 3. A timer that issues a request to reset the system in the event that it issues an interrupt.
- 5. A dynamic memory allocation strategy where the free block selected is the smallest one that can satisfy the request. (2 words)
- 6. ____ tasks are those that must be run with a fixed cycle.
- 7. The first thread to start executing, usually has the identifier 0. (2 words)