Problem 2 Most scheduling analysis techniques assume the worst-case execution time (WCET) to model the computational demand of a real-time task. Assume that: o Each declaration statement costs 1 us to execute. o Each assignment statement costs 1 us to execute. o The assignment of initial values to elements of arrays also costs 1 us regardless of the number of elements. A function call costs 2 us plus WCET for the function. o Each compare statement costs 2 us. Each addition and subtraction operation costs 3 us. Each multiplication and division operation costs 4 us. o Each return statement costs 2 us. o Each modulo operation costs 5 us. The function abs( ) is predefined and costs 5 us. o Assume that the overhead to call function abs( ) is already included in its WCET estimation. o Reading a value of an array element costs 0 us. I1 % reminder int main( ) char Flag: int result; int P; int Q: int find; int count; int data [6] - {1, 2, 3, 4, 5, 6}; count - 6; P--16; Q = 12; Flag - 'F'; if(abs(P) % Q) !- 0) result - FuncC(data, find, 0, count-1); if (result -1) return -1; else if (result <- 16) Flag = 'T'; return 1; else Flag = "T'; return 2; int FuncC(int data[ ], int x, int y, int z) int start; int end; int mid; start = y; end - z; mid = start + (end - start)/2; if (start > end) return -1; else return x; Drive WCET for function main.
Problem 2 Most scheduling analysis techniques assume the worst-case execution time (WCET) to model the computational demand of a real-time task. Assume that: o Each declaration statement costs 1 us to execute. o Each assignment statement costs 1 us to execute. o The assignment of initial values to elements of arrays also costs 1 us regardless of the number of elements. A function call costs 2 us plus WCET for the function. o Each compare statement costs 2 us. Each addition and subtraction operation costs 3 us. Each multiplication and division operation costs 4 us. o Each return statement costs 2 us. o Each modulo operation costs 5 us. The function abs( ) is predefined and costs 5 us. o Assume that the overhead to call function abs( ) is already included in its WCET estimation. o Reading a value of an array element costs 0 us. I1 % reminder int main( ) char Flag: int result; int P; int Q: int find; int count; int data [6] - {1, 2, 3, 4, 5, 6}; count - 6; P--16; Q = 12; Flag - 'F'; if(abs(P) % Q) !- 0) result - FuncC(data, find, 0, count-1); if (result -1) return -1; else if (result <- 16) Flag = 'T'; return 1; else Flag = "T'; return 2; int FuncC(int data[ ], int x, int y, int z) int start; int end; int mid; start = y; end - z; mid = start + (end - start)/2; if (start > end) return -1; else return x; Drive WCET for function main.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Problem 2
Most scheduling analysis techniques assume the worst-case execution time (WCET) to model the
computational demand of a real-time task. Assume that:
o Each declaration statement costs 1 µs to execute.
o Each assignment statement costs 1 us to execute.
o
The assignment of initial values to elements of arrays also costs 1 us regardless of the
number of elements.
O A function call costs 2 us plus WCET for the function.
o Each compare statement costs 2 us.
o Each addition and subtraction operation costs 3 us.
o Each multiplication and division operation costs 4 us.
o Each return statement costs 2 us.
Each modulo operation costs 5 us.
The function abs( ) is predefined and costs 5 us.
o Assume that the overhead to call function abs( ) is already included in its WCET
estimation.
o Reading a value of an array element costs 0 us.
I/ % reminder
int main()
char Flag;
int result;
int P;
int Q:
int find;
int count;
int data [6] = {1, 2, 3, 4, 5, 6};
count = 6;
P=-163;
Q = 12;
Flag = 'F';
if((abs(P) % Q) != 0)
result = FuncC(data, find, 0, count-1);
if (result == -1)
return -1;
else if (result <= 16)
Flag = 'T';
return 1;
}
else
Flag = 'T';
return 2;
}
}
int FuncC(int data[ ], int x, int y, int z)
{
int start;
int end;
int mid;
start = y;
end = z;
mid = start + (end - start)/2;
if (start > end)
art%3D
return -1;
else
return x;
}
Drive WCET for function main.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8061b66c-ead5-43fa-b078-f1b82ba143ac%2Fa6b6bfdf-5785-4f3d-9532-b29e2ee3ad56%2Fz4wxins_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Problem 2
Most scheduling analysis techniques assume the worst-case execution time (WCET) to model the
computational demand of a real-time task. Assume that:
o Each declaration statement costs 1 µs to execute.
o Each assignment statement costs 1 us to execute.
o
The assignment of initial values to elements of arrays also costs 1 us regardless of the
number of elements.
O A function call costs 2 us plus WCET for the function.
o Each compare statement costs 2 us.
o Each addition and subtraction operation costs 3 us.
o Each multiplication and division operation costs 4 us.
o Each return statement costs 2 us.
Each modulo operation costs 5 us.
The function abs( ) is predefined and costs 5 us.
o Assume that the overhead to call function abs( ) is already included in its WCET
estimation.
o Reading a value of an array element costs 0 us.
I/ % reminder
int main()
char Flag;
int result;
int P;
int Q:
int find;
int count;
int data [6] = {1, 2, 3, 4, 5, 6};
count = 6;
P=-163;
Q = 12;
Flag = 'F';
if((abs(P) % Q) != 0)
result = FuncC(data, find, 0, count-1);
if (result == -1)
return -1;
else if (result <= 16)
Flag = 'T';
return 1;
}
else
Flag = 'T';
return 2;
}
}
int FuncC(int data[ ], int x, int y, int z)
{
int start;
int end;
int mid;
start = y;
end = z;
mid = start + (end - start)/2;
if (start > end)
art%3D
return -1;
else
return x;
}
Drive WCET for function main.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY