e machine scheduled computation through re entrant interrupts n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
E-Machine: Scheduled Computation Through Re-entrant Interrupts PowerPoint Presentation
Download Presentation
E-Machine: Scheduled Computation Through Re-entrant Interrupts

Loading in 2 Seconds...

play fullscreen
1 / 13

E-Machine: Scheduled Computation Through Re-entrant Interrupts - PowerPoint PPT Presentation


  • 82 Views
  • Uploaded on

E-Machine: Scheduled Computation Through Re-entrant Interrupts. Paul Griffiths Jason Souder 11 May 2001 EECS 290O. LegOS E-Machine. Introduction E-Machine Tasks E-Machine Scheduling Demo. E-Machine Fundamentals. Scheduled vs. Synchronous Computation Scheduled Given Deadline

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

E-Machine: Scheduled Computation Through Re-entrant Interrupts


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
    Presentation Transcript
    1. E-Machine:Scheduled Computation Through Re-entrant Interrupts Paul Griffiths Jason Souder 11 May 2001 EECS 290O

    2. LegOS E-Machine • Introduction • E-Machine Tasks • E-Machine Scheduling • Demo

    3. E-Machine Fundamentals • Scheduled vs. Synchronous Computation • Scheduled • Given Deadline • Tasks sorted according to some algorithm, e.g. earliest-deadline first • Synchronous Computation • Execute Immediately • Scheduled Computation • Tasks must be able to be interrupted and return to task with next highest priority

    4. E-Machine • Kernel Modifications • Time handler • Interrupt Handler • No task management by native kernel • No program management by native kernel

    5. E-Machine • main() • Scheduler • Interpreter • Dispatcher

    6. E-Machine • Scheduler • Called by timer interrupt handler • Checks *trigger_list • Checks *pre_ready_list for any tasks to add to ready list • Sorts the tasks in a linked list according to EDF • Calls the dispatcher • Returns control to timer interrupt handler

    7. E-Machine • Interpreter • Maintains all op-code implementations • Connection between op-codes and platform

    8. E-Machine • Dispatcher • Called by the scheduler • Checks the *inactive_list for tasks whose deadlines have passed • Navigates to the end of the scheduled list of computations • Calls task on *run_list • Returns to the scheduler

    9. E-Machine Interrupts • Re-entrant interrupts

    10. E-Machine - Demo • Op-Codes int opcode[CODELEN][4] = { { PSH, 10000, 0 , 0}, { CAL, CLOCK, (int)hello, 0}, { ADD, -6000, 0, 0}, { EMP, CLOCK, 6, 0}, { POP, 0, 0, 0}, { RET, 0, 0, 0}, { PSH, 2000, 0, 0}, { CAL, CLOCK, (int)world, 0}, { POP, 0, 0, 0}, { RET, 0, 0, 0}};

    11. E-Machine – Demo • Functions void hello(int *lint_s, int *lint_v ) { int i; long int begin_t = sys_time; while( sys_time-begin_t < 10000 ) { cputs("HELLO"); lcd_refresh(); for( i=0; i<30000; i++) {} } cls(" "); lcd_refresh(); } void world(int *lint_s, int *lint_v ) { int i; long int begin_t = sys_time; while( sys_time-begin_t < 2000 ) { cputs("WORLD"); lcd_refresh(); for( i=0; i<30000; i++ ){} } cls(" "); lcd_refresh(); }

    12. LegOS E-Machine • Task Scheduling in “HELLO WORLD” WORLD HELLO t = 6sec t = 4sec

    13. LegOS E-Machine • Questions