ECE 697: Real-Time Systems Homework 3 Solutions
Random Number Generator: The classic reference for random number generators is D.
E. Knuth, The Art of Computer Programming, Volume 2. (If you have never read anyr
of these volumes, I strongly rec0mmend sca
ECE 697O: Solutions to Real-Time Systems Homework 5
(1) If you need to transmit at least once every ms, TTRT=0.5 ms. Since token passing
takes 0.1 ms, this leaves 0.4 ms for data transmission (we are assuming here that transmission latency is negligible).
ECE 6970: Solutions to Homework 2
(1a) The largest number of iterations will arrive if one iteration of each task arrives at
time a. The deadlines of the task Ti iterations are n+di, a+P+ d1, - - - ,a+[ki1]Pi+di.
The result follows immediately from the fa
ECE 697O: Solutions to Homework 4
(1) The fastest good clock can drift fast by 106 and the slowest by 106 . So, the drift
rate dierence may be as large as 2 106 . Since the resynchronization period is 103 ,
the total additional skew at the end of this per
RealtimeHW3
Name:yanlongheID:28407798
Q1:
Section1:
Pseudo-random number generators (PRNGs) are algorithms that can
automatically create long runs of numbers with good random properties but
eventually the sequence repeats (or the memory usage grows withou
ECE 697O: Real-Time Systems Homework 6
Due on December 5, 2014
Please upload the pdf of your homework on Moodle. Make sure your scan is legible and
write clearly.
(1) This question relates to the checkpointing model we derived in class. Suppose the
transi
ECE 697O: Real-Time Systems Homework 5
Due on November 12, 2014
Please upload the pdf of your homework on Moodle. Make sure your scan is legible and
write clearly.
(1) This question deals with the assignment of bandwidth quota in the timed token
protocol.