1 / 39

Yi-Neng ’ s Weekly Report

Yi-Neng ’ s Weekly Report. Half-year Plan (2004/01~2004/06). *See the footnote section for further notes. Weekly Report (1/5/ ’ 04~1/9/ ’ 04). Work done last week (12/29/03~12/31/03) Lab Modify the code according to the refined transition Status: not finished. L7

marlo
Télécharger la présentation

Yi-Neng ’ s Weekly Report

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. Yi-Neng’s Weekly Report

  2. Half-year Plan (2004/01~2004/06) *See the footnote section for further notes

  3. Weekly Report (1/5/’04~1/9/’04) • Work done last week (12/29/03~12/31/03) • Lab • Modify the code according to the refined transition • Status: not finished. • L7 • Comparison table between NetScreen 5GT and IXP@L7 • Try to modify the kernel configuration for the upgraded mass prod. board • Plans in this week • Lab • Please see the footnote for details • L7 • Help test the functionalities of the ported WALL • Prepare for the demo for Intel visitors • Status: Done today • Submit Tunnel-Min. paper • Status: Done today

  4. Weekly Report (1/12/’04~1/16/’04) • Work done last week (01/05/’04~12/31/’04) • Lab • Finish (2,2) simulation model generation • Modify the code according to the refined transition • Status: not finished. • L7 • Presentation for Intel visitors • Identify the cause of memory shortage. • Plans in this week • Lab • Submit the Tunnel Min. paper (will discuss it in Thu.’s meeting) • Help Chiuan-Hung on his slides and presentation skills • Please see the footnote for other details • L7 • Help test the functionalities of the ported WALL

  5. Weekly Report (02/02/’04~02/06/’04) • Work done last week (01/12/’04~01/16/’04) • Lab • Submit the Tunnel Min. paper (will discuss it in Thu.’s meeting) • Help Chiuan-Hung on his slides and presentation skills • L7 • Help test the functionalities of the ported WALL • Plans in this week • Register the Embedded System Contest (including the 3-page 創意構想書)– Done • Discuss with Chiuan-Hung on the external benchmark items • Study the IXP425 documents for internal benchmark • Please see the footnote for other details

  6. Weekly Report (02/09/’04~02/13/’04) • Work done last week (02/02/’04~02/06/’04) • Register the Embedded System Contest (including the 3-page 創意構想書)– Done • Discuss with Chiuan-Hung on the external benchmark items • Study the IXP425 documents for internal benchmark • Plans in this week • Refine the 創意構想書 and finish the registration • Done • Prepare for the 卓越計畫 review demo • Discuss with Chiuan-Hung on the internal benchmark items • Please see the footnote for other details

  7. Weekly Report (02/16/’04~02/20/’04) • Plans in last week • Refine the 創意構想書 and finish the registration (done) • Prepare for the 卓越計畫 review demo (done) • Discuss with Chiuan-Hung on the internal benchmark items (not finished yet) • Detailed outline of my paper (done) • Explain the mismatch between sim. and ana. results. • Plans for this week • Finish the methodology for internal benchmark • Please see the footnote for other details

  8. Weekly Report (02/23/’04~02/27/’04) • Plans in last week • Finish the methodology for internal benchmark • Discuss with Chiuan-Hung • Refine the detailed outline of my paper • Plans for this week • Identify the target of Chiuan-Hung’s thesis • Done. It will be HPCA-11 which dues in mid-July • Please see the footnote for other details

  9. Weekly Report (03/01/’04~03/05/’04) • Plans in last week • Verify again the target of my paper • Discuss with Chiuan-Hung • Complete chapter 1 • Expand (I,J) • Plans for this week • Discuss with Chiuan-Hung (Wed.) • Please see the footnote for other details

  10. Weekly Report (03/08/’04~03/12/’04) • Plans in last week • Discuss with Chiuan-Hung on the benchmark results • Verify in detail and logically the possible figures to have • Adjust the tunnel_min paper for Globecom ‘04 • Plans for this week • Discuss with Chiuan-Hung on internal benchmark items • Please see the footnote for other details

  11. Weekly Report (03/15/’04~03/19/’04) • Plans in last week • Discuss with Chiuan-Hung on the internal benchmark items • Compute the total cycle counts of IP Forwarding and DiffServ • Extend the simulation model from (1,1) to (1,4) • Implement some other statistic scripts • Plans for this week • Chiuan-Hung: detailed outline and review his introduction • Interview with Intel crew • Please see the footnote for other details

  12. Weekly Report (03/22/’04~03/26/’04) • Plans in last week • Prepare for the Intel’s interview • Refine the simulation model • Chiuan-Hung: detailed outline and review his introduction • Plans for this week • Hacking of the porting: come up with the overview • Review chapter 2 of Chiuan-Hung’s thesis • Please see the footnote for other details

  13. Weekly Report (03/29/’04~04/02/’04) • Plans in last week • Section 2 of my paper, almost done • Solve the un-dividable problem (# of mem acc vs. # of thd) • Porting hacking • Discussed with Chiuan-Hung. Have come up with an overview. • Plans for this week • Please refer to the footnote for details

  14. Weekly Report (04/05/’04~04/09/’04) • Plans in last week • Solve the “un-dividable” problem • Implement memory disk • Extend (2,J)’s • Regular discussion with Chiuan-Hung • Plans for this week • Revise Chiuan-Hung’s paper: he has not finished it yet • Finalize related figures with Chiuan-Hung • Slides for presentation at Intel • Please refer to the footnote for details

  15. Weekly Report (04/12/’04~04/16/’04) • Plans in last week • Discussions with Chiuan-Hung on the performance figures • Reformat, reorganize Chiuan-Hung’s slides for Intel presentation; redraw some figures • Prepare for the midterm of data mining • Plans for this week • Revise Chiuan-Hung’s chapter 2 • Please see the footnotes for details

  16. Weekly Report (04/19/’04~04/23/’04) • Plans in last week • Revise Chiuan-Hung’s chpt 2; • Prepare for the presentation in group meeting • Plans for this week • Finish revising Chiuan-Hung’s chpt2 • Discuss Chiuan-Hung’s progress of chpt3 • Review Globecom paper • Please refer to the footnote for details

  17. Weekly Report (05/03/’04~05/07/’04) • Plans in last week • Contest report • Simulation based on parameters of IXP2400 • Discussion with Chiuan-Hung on the porting details • Course presentation (生物資訊導論) • Plans for this week • 5/15 presentation & demo at 雲科大 for contest • Please refer to the footnote for details

  18. Weekly Report (05/17/’04~05/21/’04) • Plans in last week • Presentation in group meeting • Contest presentation and demo • Review the analytical & simulation models of blocking case • Plans for this week • Data Mining final (Monday, done)

  19. Weekly Report (06/07/’04~06/11/’04) • Plans in last week • Submit the paper to MICRO37 • Revise Chiuan-Hung’s thesis • Plans for this week • Data Mining term project • 生物資訊 term paper

  20. Weekly Report (07/26/’04~07/30/’04) • Plans in last week • Submit Chiuan-Hung’s paper to IEEE Comm. Mag. • Revise I-Wei’s paper. NP-Complete proof • State-space reduction • Plans for this week • Re-submit I-Wei’s paper to TDSC • Transition rates for the reduced state space

  21. Weekly Report (08/02/’04~08/06/’04) • Plans in last week • Revise I-Wei’s paper. NP-Complete proof • State-space reduction • Status: came up with a new model • Try out WorkBench • Plans for this week • Re-submit I-Wei’s paper to TDSC • Have asked TDSC for another weeks of extension • State-space reduction (ex: merging) • Discussion with Yao-Chung; survey of related works

  22. Weekly Report (08/09/’04~08/13/’04) • Plans in last week • State-space reduction • Status: came up with a new model • Try out Teja software • Plans for this week • Paper review • State-space reduction • Discussion with Yao-Chung: Inside the Snort • Re-submit I-Wei’s paper to TDSC

  23. Weekly Report (08/23/’04~08/27/’04) • Plans in last week • State-space reduction • Status: came up with a new model • Try out Teja software • Plans for this week • Camera-ready version for Globecom • State-space reduction • Discussion with Yao-Chung: Thread/ME allocation

  24. Weekly Report (08/30/’04~09/03/’04) • Plans in last week • Think/Discussion over the review comments • Globecom: camera-ready version • Discussion/Review on Yao-Chung’s proposal • Plans for this week • Discussion with Yao-Chung • Study the Jackson Networks and Mean Value Analysis • Please see the footnote for details

  25. Weekly Report (10/04/’04~10/08/’04) • Plans in last week • Submission to ISPASS and RTAS • State & transition diagram for the new model • Discussion with Yao-Chung over the implementation method • Plans for this week • Matrix generation, preliminary result for the new model • Discussion with Yao-Chung: new data structure for implementing AC algorithm • Please see the footnote for details

  26. Weekly Report (10/11/’04~10/15/’04) • Plans last week • Model determination, matrix generation • Done • Discussion with Yao-Chung: new data structure for implementing AC algorithm • Please see the footnote for details • Plans for this week • Preliminary result for the new model • Please see next three slides for the details of the new model

  27. Mem subsystem … B memory banks (M/M/c) Simplified Model (040924 ) Modeling granularity: single thread State def: , where : num of pkts in the queue of the thread : arrival state; 0 or 1 : service state; 0 or 1 Arrival rate = 0: switched out MMPP , where , 0: switched out MMPP

  28. State def: : mean # of non-empty idle threads 3. Repeat until is stable Two Kinds of Transitions only changes q does not change q => q+1: rate = 0 (0,0) (0,0) q => q -1: rate = 0 (if q<>0) q => q+1: rate = 0 (0,1) (if q=0) q => q -1: rate = q => q+1: rate = (0,1) (1,0) (1,0) q => q -1: rate = 0 else: rate = 0 ＊(1,1) is illegal ! To obtain: 1. => get s-s 2. , get

  29. Results to Obtain Let be the steady-state prob of being in state , we can have: 1. Queue size distribution : , and therefore mean queue size , processor queue size = 2. Mean thread service time = , system time = 3. Prob that a thread is busy: active: , 4. Processor utilization:

  30. Weekly Report (10/25/’04~10/29/’04) • Plans last week • Determine the transition rate of the new model • Discuss with Yao-Chung on the description of the dispatching algorithm • No finished yet since there are still some unresolved design issues • Plans for this week • Preliminary analytical results for the new model • Please see the next three slides for details

  31. Simplified Model (041015 ) Modeling granularity: single thread State def: , where : num of pkts in the queue of the thread : arrival state; {0, 1} : service state; 0 to (round it to an integer) : thread state; {0, 1, 2} Transition of : (assume ) mem inst mem rdy inst (2,0) (2,1) (2,2) (1,0) (1,1) (0,0) (2,0)

  32. 1. Arrival: Only changes Two Types of Transitions (1/2) 0: switched out MMPP Arrival rate , where , : idle MMPP : inst processing : memory access : ready 2. Departure: : rate = , where : (1,1) => (0,0) rate = , where

  33. : mean # of non-empty idle threads 3. Repeat until is stable Two Types of Transitions (2/2) q does not change changes (0,0,0) 1. (if q<>0) rate = , where (if q=0) 2. (1,0,0) rate = To obtain: rate = 1. => get s-s 2. , get

  34. Weekly Report (11/08/’04~11/12/’04) • Plans last week • Obtain the analytical result • Discuss with Yao-Chung • Plans for this week • Debug/Refine the model/code • Please see the next five slides for details

  35. Simplified Model (041103 ) Modeling granularity: single thread State def: , where : num of pkts in the thread system : arrival state; {0, 1} (round it off) : num of mem accesses for the thread; 0 to : thread state; {0, 1, 2} 0: switched out MMPP Arrival rate , where , : idle : inst processing MMPP : memory access (I,J)=1x2 : ready

  36. Model Details Example transition for : (assume ) rdy inst mem idle mem inst Illegal states: : no such states : two threads are working concurrently : no such states : no such states

  37. rate = , where Types of Transitions (1/2) 1. Arrival: 2. Departure: rate = 3. Memory access: rate =

  38. : mean # of ready threads Types of Transitions (2/2) 4. Context switch: To obtain: use first 1. Get s-s , 2. 3. Repeat 1, 2 until is stable

  39. Results to Obtain Let be the steady-state prob of being in state , we can have: 1. Queue size distribution : , and therefore mean queue size , processor queue size = 2. Mean thread service time = , system time = 3. Prob that a thread is busy: active: 4. Processor utilization:

More Related