• 沒有找到結果。

Progress Report

N/A
N/A
Protected

Academic year: 2022

Share "Progress Report"

Copied!
6
0
0

加載中.... (立即查看全文)

全文

(1)

Progress Report

2015/03/16

(2)

Last Year

Design a three-phase scheduling al gorithm to generate scheduling pla ns periodically.

Implement a scheduler based on Xen scheduling framework.

Experiments on ARM Juno board.

2

(3)

Current Status

Short-term goal : improve the curr ent scheduler.

Reduce Dom0 overhead.

Debugging and optimization.

(4)

Reduce Dom0 Overhead

Problem

Physical cores are always busy and wa ste a lot of energy.

[Idle:

credit]

[Idle:

asym]

(5)

Reduce Dom0 Overhead(Con t.)

Suspect:

if( !vcpu_runnable(current) )

// next = idle_vcpu; /* increase Dom0 response time

*/ next = current;

Tried solution:

next = idle_vcpu;

next_timeslice = (is_idle_vcpu(next) ? -1 : tslice); /* cr edit-base scheduler */

Not working.

(6)

Other Progress

Set up the new Juno board

Update the firmware.

Able to boot Xen and VMs.

Revising the JDPC paper.

Interim Decision

參考文獻

相關文件

 make a big stink about refusing to put it on their tim esheet, just letting the feature they were working on slip, because they refuse to pad their estimates which were

It provides (1) the rate monotonic scheduling algorithm, (2) support for multiple processors (SMP model), (3) limited overrun protection among real- time(RT) processes,

The key to the performance of the agent-based multicast strategy is the scheduling of message forwarding between agents as well as between an agent and the destination processors

◦ An online stage for scheduling an applicat ion to the most appropriate core type base d on predicted performance interference.  The proposed scheduler can improve ove rall

 Propose eQoS, which serves as a gene ral framework for reasoning about th e energy efficiency trade-off in int eractive mobile Web applications.  Demonstrate a working prototype and

ƒ Preemptive scheduling – CPU scheduling is invoked whenever a process arrives at the ready queue, or the running process relinquishes the CPU.. ƒ Non-preemptive scheduling – CPU

ƒ Preemptive scheduling – CPU scheduling is invoked whenever a process arrives at the ready queue, or the running process relinquishes the CPU.. ƒ Non-preemptive scheduling – CPU

efficient scheduling algorithm, Smallest Conflict Points Algorithm (SCPA), to schedule.. HPF2 irregular