Operating Systems For Embedded Systems at Polytechnic Institute Of Turin | Flashcards & Summaries

Select your language

Suggested languages for you:
Log In Start studying!

Lernmaterialien für Operating Systems for Embedded systems an der Polytechnic Institute of Turin

Greife auf kostenlose Karteikarten, Zusammenfassungen, Übungsaufgaben und Altklausuren für deinen Operating Systems for Embedded systems Kurs an der Polytechnic Institute of Turin zu.

TESTE DEIN WISSEN

In an operating system based on the monolithic kernel architecture:


Lösung anzeigen
TESTE DEIN WISSEN

The components of the operating system are normally linked statically to obtain the kernel, and they share the same address space 

Lösung ausblenden
TESTE DEIN WISSEN

Assuming two tasks A and B with different priorities are sharing an exclusive resource, and that the system is composed only of the two tasks A and B: 

Lösung anzeigen
TESTE DEIN WISSEN

Priority inversion may happen depending on the tasks period, and it cannot be solved; 

Lösung ausblenden
TESTE DEIN WISSEN

Assuming three tasks A, B, C, which are scheduled according to timeline scheduling, make use of the same analog to digital converter, priority inversion 

Lösung anzeigen
TESTE DEIN WISSEN

Never happens no matter the period and duration of critical section of each task; 

Lösung ausblenden
TESTE DEIN WISSEN

Given three periodic tasks A(T=10 ms, C = 9ms), B(T=20ms, C=2ms), C(T=30 ms, C=1 ms), can we use Rate Monotonic (RM) scheduling for guaranteeing real-time? 

Lösung anzeigen
TESTE DEIN WISSEN

No, utilization factor is U > 1 

Lösung ausblenden
TESTE DEIN WISSEN

Given a set of periodic tasks, and a single processor system, is it always possible to implement a hard-real time scheduling of the tasks using Earliest Deadline First (EDF) algorithm? 

Lösung anzeigen
TESTE DEIN WISSEN

Yes, provided that the utilization factor is at most 1 

Lösung ausblenden
TESTE DEIN WISSEN

In an operating system based on the flat kernel architecture: 

Lösung anzeigen
TESTE DEIN WISSEN

The application is compiled and link statically with the operating system kernel

Lösung ausblenden
TESTE DEIN WISSEN

To solve a race condition:


Lösung anzeigen
TESTE DEIN WISSEN

We can disable/enable interrupts no matter the CPU cycles of the critical section 

Lösung ausblenden
TESTE DEIN WISSEN

Assuming three tasks A, B, C, (scheduled according to EDF scheduling) make use of an exclusive resource, priority inversion:


Lösung anzeigen
TESTE DEIN WISSEN

May happen depending on the period and duration of critical section of each task 

Lösung ausblenden
TESTE DEIN WISSEN

Given three periodic tasks A(T=10 ms, C = 8ms), B(T=20ms, C=2ms), C(T=30 ms, C=1 ms), can we use timeline scheduling for guaranteeing real-time?


Lösung anzeigen
TESTE DEIN WISSEN

Yes, the sum of the execution time of tasks in each minor cycle is less than 10 ms 

Lösung ausblenden
TESTE DEIN WISSEN

Assuming a time-slice round-robin scheduler is used for scheduling two periodic tasks, where each task has a period of 10ms, execution time of 4ms, and assuming the time slice duration is 1ms, can stack sharing be used?


Lösung anzeigen
TESTE DEIN WISSEN

No, as the task execution interleaves, and the pre-empting task does not terminate before resuming the pre-empted one 

Lösung ausblenden
TESTE DEIN WISSEN

A race condition happens:


Lösung anzeigen
TESTE DEIN WISSEN

Because the instructions that are executed concurrently accessing an exclusive resource are not necessarily atomic 

Lösung ausblenden
TESTE DEIN WISSEN

Assuming three aperiodic tasks A, B, C, (scheduled according to EDD scheduling) make use of an exclusive resource, priority inversion:


Lösung anzeigen
TESTE DEIN WISSEN

Never happens no matter the period and duration of critical section of each task 

Lösung ausblenden
  • 3964 Karteikarten
  • 695 Studierende
  • 2 Lernmaterialien

Beispielhafte Karteikarten für deinen Operating Systems for Embedded systems Kurs an der Polytechnic Institute of Turin - von Kommilitonen auf StudySmarter erstellt!

Q:

In an operating system based on the monolithic kernel architecture:


A:

The components of the operating system are normally linked statically to obtain the kernel, and they share the same address space 

Q:

Assuming two tasks A and B with different priorities are sharing an exclusive resource, and that the system is composed only of the two tasks A and B: 

A:

Priority inversion may happen depending on the tasks period, and it cannot be solved; 

Q:

Assuming three tasks A, B, C, which are scheduled according to timeline scheduling, make use of the same analog to digital converter, priority inversion 

A:

Never happens no matter the period and duration of critical section of each task; 

Q:

Given three periodic tasks A(T=10 ms, C = 9ms), B(T=20ms, C=2ms), C(T=30 ms, C=1 ms), can we use Rate Monotonic (RM) scheduling for guaranteeing real-time? 

A:

No, utilization factor is U > 1 

Q:

Given a set of periodic tasks, and a single processor system, is it always possible to implement a hard-real time scheduling of the tasks using Earliest Deadline First (EDF) algorithm? 

A:

Yes, provided that the utilization factor is at most 1 

Mehr Karteikarten anzeigen
Q:

In an operating system based on the flat kernel architecture: 

A:

The application is compiled and link statically with the operating system kernel

Q:

To solve a race condition:


A:

We can disable/enable interrupts no matter the CPU cycles of the critical section 

Q:

Assuming three tasks A, B, C, (scheduled according to EDF scheduling) make use of an exclusive resource, priority inversion:


A:

May happen depending on the period and duration of critical section of each task 

Q:

Given three periodic tasks A(T=10 ms, C = 8ms), B(T=20ms, C=2ms), C(T=30 ms, C=1 ms), can we use timeline scheduling for guaranteeing real-time?


A:

Yes, the sum of the execution time of tasks in each minor cycle is less than 10 ms 

Q:

Assuming a time-slice round-robin scheduler is used for scheduling two periodic tasks, where each task has a period of 10ms, execution time of 4ms, and assuming the time slice duration is 1ms, can stack sharing be used?


A:

No, as the task execution interleaves, and the pre-empting task does not terminate before resuming the pre-empted one 

Q:

A race condition happens:


A:

Because the instructions that are executed concurrently accessing an exclusive resource are not necessarily atomic 

Q:

Assuming three aperiodic tasks A, B, C, (scheduled according to EDD scheduling) make use of an exclusive resource, priority inversion:


A:

Never happens no matter the period and duration of critical section of each task 

Operating Systems for Embedded systems

Erstelle und finde Lernmaterialien auf StudySmarter.

Greife kostenlos auf tausende geteilte Karteikarten, Zusammenfassungen, Altklausuren und mehr zu.

Jetzt loslegen

Das sind die beliebtesten Operating Systems for Embedded systems Kurse im gesamten StudySmarter Universum

operating system

Misr International University

Zum Kurs
Operating Systems

University of Cape Town

Zum Kurs
Embedded Systems

University of Durham

Zum Kurs
operating systems

Sathyabama University

Zum Kurs

Die all-in-one Lernapp für Studierende

Greife auf Millionen geteilter Lernmaterialien der StudySmarter Community zu
Kostenlos anmelden Operating Systems for Embedded systems
Erstelle Karteikarten und Zusammenfassungen mit den StudySmarter Tools
Kostenlos loslegen Operating Systems for Embedded systems