1 / 33

Meeting 09/05/06

Meeting 09/05/06. Xuan Lin. Content. Theoretic Analysis of EDF-K vs. EDFAN Simulation Result of above theory. What is still missing in our paper for RTAS? Introduction to Wiki. Theoretic Analysis of EDF-K vs. EDFAN.

lucian
Download Presentation

Meeting 09/05/06

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Meeting 09/05/06 Xuan Lin

  2. Content • Theoretic Analysis of EDF-K vs. EDFAN • Simulation Result of above theory. • What is still missing in our paper for RTAS? • Introduction to Wiki

  3. Theoretic Analysis of EDF-K vs. EDFAN • Formal proof is available at http://cse.unl.edu/~lxuan/research/doc/edfk-proof.pdf • Bounds are derived for the situation when N is not the multiple of K.

  4. Theoretic Analysis (con’t) • If N is the multiple of K, EDF-K is always better in [K*T(k)/N, T(N) ). • If N is not a multiple of K, - depends on whether K*T(K)/(N-K) is less than T(N) - if so, EDF-K is always better in [K*T(k)/(N-K), T(N) ).

  5. Theoretic Analysis (con’t) • The value of K*T(K)/(N-K) is not guaranteed to be less than the value of T(N) • This means we can not always find such range so that EDF-K can beat EDF-AN • Our theory is sufficient but not necessary. • The bounds are pessimistic.

  6. N=16 (cms=1,cps=100,datasize=200) • N16-K1 [1263,1359) 96 • N16-K2 [1269,1359) 90 • N16-K4 [1282,1359) 77 • N16-K8 [1307,1359) 52

  7. N=32 (cms=1,cps=100,datasize=200) • N32-K1 [632,734) 102 • N32-K2 [635,734) 99 • N32-K3 [704,734) 30 • N32-K4 [641,734) 93 • N32-K8 [654,734) 80 • N32-K16 [680,734) 54

  8. N=64 (cms=1,cps=100,datasize=200) • N64-K1(316,425) 109 • N64-K2(318,425) 107 • N64-K3(335,425) 90 • N64-K4(321,425) 104 • N64-K5(350,425) 75 • N64-K6(357,425) 68 • N64-K7(366,425) 59 • N64-K8(327,425) 98 • N64-K9(383,425) 42 • N64-K10(392,425) 33 • N64-K11(401,425) 24 • N64-K12(411,425) 14 • N64-K13(421,425) 4 • N64-K16(340,425) 85 • N64-K32(367,425) 58

  9. How to increase the length of the range? • Increase datasize (linear proportional) • Increase cluster Size - when k=1, length increases from 96,102 to 109 when cluster size increases from 16,32 to 64 Why not increase cluster size to 128,256… ?

  10. Length of Range (con’t) • We have constraint, Cps > (N-1) Cms • If we increase N to 128, the constraint does not hold. • Future work – to relax such constraint or derive bounds when such range does not hold.

  11. Simulation

  12. Simulation • Periodic Task • Non-periodic tasks

  13. Periodic, N=16

  14. Periodic, N=32, K=3

  15. Pessimistic Bound • From the theory, we have [704,734) • From graph, we see lowbound < 700

  16. Non-periodic • Tasks’ inter-arrival time are forced to be in the range we derived. • Tasks’ inter-arrival time are exponential distributed with mean equal to the median of the range

  17. N=16

  18. N=32

  19. N=64

  20. What is missing in the first paper? • Differentiate EDF and MWF

  21. How MWF work. • Maximum DC first • DC= T(n+1)*(n+1)- T(n)* n - DC is an increasing function of n - DC is an increasing function of datasize

  22. How MWF work (con’t) • Assume two tasks Ti and Tj. • Assume MWF schedule Ti first. DCi>DCj Two scenarios: 1. Datasize(i) <= Datasize(j) 2. Datasize(i) > Datasize(j)

  23. Datasize(i) <= Datasize(j) - Implies Ni > Nj - Implies Deadline(i)<= Deadline(j) The same as EDF!!!

  24. Datasize(i) > Datasize(j) If Deadline(i)<Deadline(j), the same as EDF What if Deadline(i)>=Deadline(j) ?

  25. Introduction to Wiki

  26. Introduction to Wiki • Wiki comes from the Hawaiian term for quick or super-fast • Allows users to freely create and edit page content using any Web browser. • Like an internet forum, but can be edited by any other user. • WYSIWYG

  27. Wiki Name • It must start with an Upper Case character. • It must be a minimum of 3 characters (2 Upper Case, 1 lower case). • It may end with either a Upper Case or lower case character or numeric charcter. • There must be a least one lower case character somewhere between the first Upper Case character and the last Upper Case character. • There can NOT be any numeric characters before the first lower case character.

  28. Wiki Name Example • XuanLin -yes • Lxuan -no • L2xUan -no • LxU -no

  29. Register/Login • User Name must be a wiki Name • The wiki name serves as the page name for your homepage.

  30. How to create a new page • Any Wiki name. Be careful of naming!

  31. WYSIWYG • Double click to edit • FormattingRules

  32. Page ownership • Every Page on a Wikka wiki is owned by someone. There are three different types of ownership:Public, Free,Owned by a registered user • The page ownership determines which person(s) control the rights to read, write and comment on a page .

  33. How to/ why use wiki • A place to store useful resources • A place to record our idea • Easy to cooperate • Easy to maintain multi-task/project -PageHistory, RecentChanges -Good for professors, might be bad for students, 

More Related