Mutual Exclusion Constraints and Scheduling Problems Quiz

Which type of problem is the multiprocessor scheduling problem with two processors, no resources, independent tasks, and arbitrary task computation times?

What is the difficulty of deciding whether it is possible to schedule a set of periodic tasks that use only semaphores to enforce mutual exclusion?

What is the difficulty of finding a totally online optimal run-time scheduler when there are mutual exclusion constraints?

What type of relation is indicated by a partial-order relation in the context of multiprocessor scheduling?

What is the difficulty of the multiprocessor scheduling problem with two processors, no resources, arbitrary partial-order relations, and every task having a 1-unit computation time?

According to Amdahl's Law, what does it measure?

Which type of computer system is Amdahl's Law still relevant in today?

What is the current usage of multi-core processors in real-time systems similar to?

What is the term used to describe multi-core processors with an increasing number of parallel on-chip cores?

Where are multi-core processors with an increasing number of parallel on-chip cores used in significant quantities?