1. Progress Report 2013/11/07

2. Outline Further studies about heterogeneous multiprocessing other than ARM Cache miss issue Discussion on task scheduling

3. Manufacturers Other than ARM Qualcomm ◦ aSMP(Asynchronous Symmetrical Multi- Processing) ◦ Krait:  Per-core DCVS (Dynamic Clock and Voltage Scaling).  Core that is not being used can be completely collapsed independently.  Reduce the need for hypervisors or more complex software management of disparate cores.

4. Manufacturers Other than ARM Nvidia ◦ vSMP(Variable Symmetric Multiprocessing) ◦ Tegra 3  4 high performance Cortex A9 main processor + 1 energy-efficient Cortex A9 Companion processor.  Cannot active companion processor and main processor simultaneously.  Main processors have to use the same frequency.

5. HSA Foundation

6. Cache Miss Issue “For each switching between big(A15) and A7(LITTLE), the L2 cache is cleaned, thus cause memory access overhead.”

7. Cache Miss Issue Unless a chip(All A15 or All A7) is shutdown, clean L2 cache for each switching between A15 and A7 is weird. A15 L1 A15 L1 A15 L1 A15 L1 A7 L1 A7 L1 A7 L1 A7 L1 L2

8. Task Scheduling Take loading of each task into consideration. For a given task, assume it behavior: ◦ Computation Ops: n time units. ◦ Memory Ops: 1 time unit. Different core frequencies cause different loadings. ◦ F = 1, loading = n/(n+1) ◦ F= 2, loading = n/(n+2) ◦ F= 4, loading = n/(n+4)

9. Single Core For a given set of tasks and their behaviors, find the minimum frequency such the loading of the core is 100%. ◦ Lower frequency: loading = 100%, but the performance decrease. ◦ Higher frequency: loading < 100%, consume more (dynamic) power.

10. Scheduling on HMP According to the core capability, assign processes in the runqueue to core. Each core apply DVFS/DCVS individually. However, this does not apply for big.LITTLE. ◦ Each (pair of) core is homogeneous.

11. Big.LITTLE core Scheduling Assume that we have n pairs of big.LITTLE cores. ◦ Initially all pairs use LITTLE core. Assume we know the following information of a task T k. ◦ Task deadline. ◦ Estimated execution time on big core. ◦ Estimated execution time on LITTLE core.

12. Heuristic Mentioned Last Time First, we define “urgency” U to indicate the priority of a task. For Task T k ◦ 0 ＜ U k ≦ 1, then task T k can be finished before deadline on LITTLE core ◦ U k > 1, then task T k can’t be finished before deadline on LITTLE core.

13. Core Switching Switch one LITTLE core to big core if there exists a task T k with urgency U k > 1. Find all the Tasks {T j, with U j > 0.8}, assign these tasks to big cores. Switch big cores to LITTLE cores if there is no task with urgency greater than 0.8.

14. Discussion