Scribd
Upload
46 views5 pages

Goup Assignment EE 8403-2024

Uploaded by

Hezron gibron
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
46 views5 pages

Goup Assignment EE 8403-2024

Uploaded by

Hezron gibron
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

1.

Write short notes on a real-time control system that consists of a controlled plant and a
controller is a typical cyber-physical system (CPS). What are C and P in a real-time
control system, and how are they coupled with each other?

2. Discuss on rate Monotonic Scheduling


i. Optimal fixed priority scheduling algorithm
ii. Sufficient condition based on utilization bound
iii. Necessary & sufficient condition based on time demand analysis

3. Specifying timing constraints is a difficult but important step for designing embedded
real-time systems. Give an example of each. Also, how would you derive (i) inter-task
message deadlines from task deadlines, (ii) memory or disk I/O access deadlines from
task deadlines, and (iii) task deadlines from end-to-end application deadlines. 3.
Construct a sporadic task along with an accompanying periodic task for an application
laymen can understand.

4. List three key approaches to the performance improvement for general-purpose (GP)
computing systems. Why are GP systems unsuitable for real-time systems?

5. Discuss on the basics of machine vision

6. Design the machine vision application

7. Write short notes on serial sensors and actuators


8. Discuss on the digital signal processors (DSP)

9. Describe in detail on device handling and interrupts

10. Describe in detail on Signal representation;

11. Describe in detail on sensor physics

12. Describe in detail on biomedical instruments

13. Design and stimulate on the Speech processing

14. Design and stimulate of the Image recognition systems

15. Discuss and stimulate on the Speech recognition systems

16. Show and stimulate on the Malt-lab image processing toolbox

17. Describe in detail on Z Transform.


18. Write short notes on hold circuit and pulsed transfer functions.

19. Discuss on the closed-loop pulsed control system.

20. Discuss on the pulsed signal flow graphs.

21. Write short notes on response of discrete systems.

22. Discuss on the stability tests.

23. Design of digital control system using State space methods

24. If the deadline is not equal to the task period, RM is not necessarily an optimal static
priority algorithm. Show this by means of an example, that is, construct a task set which
is not RM-schedulable, but is schedulable by some other assignment of static priorities.

25. In case of resource shortage because of failures, one may have to extend task periods or
even skip tasks, e.g., execute the task once every two periods of the task. What does this
imply in physical control systems and when and how to alter task periods during the
operation of the controlled system?
26. Suppose a node accepts periodic real-time tasks from other nodes and soon encounters
the arrival of its own real-time aperiodics whose deadlines can’t be met locally by the
node. In such a case, the late arriving aperiodics must be shipped out. This is obviously
ineffective. Propose how to deal with this problem

27. Propose how to address these unrealistic assumptions. (If you borrowed solutions from
someone else’s paper(s), you should clearly cite them.) (c) Consider a three-task system
where each preemption has an overhead of x. Assuming the three tasks’ periods P1, P2,
P3 and execution times e1, e2, e3 derive the maximum value of x for which the task set is
RM-schedulable. 2. Interrupts typically arrive sporadically. When an interrupt arrives, it
is handled immediately and in a non-preemptive fashion. The effect of interrupt handling
on the schedulability of periodic tasks can be accounted for in the same manner as
blocking time. To illustrate this, consider a system of 4 tasks: T1 = (2.5, 0.5), T2 = (4, 1),
T3 = (10, 1) and T4 = (30, 6). Suppose there are two streams of interrupts. The inter-
release time of interrupts in one stream is never less than 9, and that of the other stream is
never less than 25. Suppose it takes at most 0.2 unit of time to service each interrupt. Like
the periodic tasks, interrupt handler tasks are given fixed priorities higher than the
periodic tasks. The interrupt stream with a shorter inter-release time receives higher
priority. (a) What is the maximum amount of time each job in each periodic task may be
delayed from completion by interrupts? (b) Let the maximum delay suffered by each job
of Ti in part (a) be bi , for i =1,2,3,4. Compute the time-demand functions of the tasks
and determine if every task Ti can meet all its deadlines when the relative deadline of
each task is the same as its period.

28. Quiz #2

29.Show that the priority ceiling protocol is not optimal. Do this by creating a task set which
has unnecessary blocking, i.e., if we removed the blocking, the system would still operate
correctly without any deadlock.

30.Other question

31.(Combined task assignment and scheduling) Is the system hazard higher or lower if the
task precedence constraints are ignored and why? Explain how this information can be
used to solve the combined task assignment and scheduling problem, and propose one
more heuristic (other than relaxing the precedence constraints) to solve the problem.
32.Write an algorithm for generating the preferred list of receivers for a node in an n-
dimensional hypercube. Transform the algorithm into a C program and submit the
program execution results for n = 4 and n = 6.

33.Read and summarize anyone from the following:


1. One (1) paper on small proprietary real-time operating systems;
2. One (1) paper on real-time extensions of general-purpose OSs;
3. One (1) paper on low-power embedded OS/middleware; and
4. One (1) paper on low-power memory or disks
Again, your report must follow the format specified in the Assignments slides, and the
main sources are annual IEEE RTSS and RTAS proceedings, ACM SOSP, USENIX
OSDI and Annual Technical Conference proceedings. (You are NOT restricted to these
sources!)

34.
35.
36.
37.

You might also like