公开(公告)号：US20130232500A1

公开(公告)日：2013-09-05

申请号：US13853734

申请日：2013-03-29

Applicant: VMWARE, INC.

Inventor： Puneet ZAROO ,  Richard WEST ,  Carl A. WALDSPURGER ,  Xiao ZHANG

IPC: G06F9/48 ,  G06F9/50

CPC classification number: G06F9/48 ,  G06F9/4881 ,  G06F9/50 ,  G06F9/5005 ,  G06F9/5011 ,  G06F9/5016 ,  G06F9/5022 ,  G06F9/5027 ,  G06F9/5033 ,  G06F9/5044 ,  G06F9/505 ,  G06F9/5055 ,  G06F11/3409 ,  G06F11/3442 ,  G06F11/3452 ,  G06F11/3466 ,  G06F12/08 ,  G06F12/0802 ,  G06F12/0804 ,  G06F12/0806 ,  G06F12/0815 ,  G06F12/084 ,  G06F2201/88 ,  G06F2209/483 ,  G06F2209/501

Abstract: A method is described for scheduling in an intelligent manner a plurality of threads on a processor having a plurality of cores and a shared last level cache (LLC). In the method, a first and second scenario having a corresponding first and second combination of threads are identified. The cache occupancies of each of the threads for each of the scenarios are predicted. The predicted cache occupancies being a representation of an amount of the LLC that each of the threads would occupy when running with the other threads on the processor according to the particular scenario. One of the scenarios is identified that results in the least objectionable impacts on all threads, the least objectionable impacts taking into account the impact resulting from the predicted cache occupancies. Finally, a scheduling decision is made according to the one of the scenarios that results in the least objectionable impacts.

Abstract translation: 描述了一种以智能方式调度具有多个核的处理器上的多个线程和共享的最后一级高速缓存（LLC）的方法。 在该方法中，识别具有对应的第一和第二线程组合的第一和第二情景。 预测每个场景的每个线程的高速缓存占用。 预测的高速缓存占用是根据特定场景与处理器上的其他线程一起运行时每个线程将占用的LLC的量的表示。 确定了一种情景，对所有线程造成的影响最小，最不令人反感的影响考虑到预测的缓存占用引起的影响。 最后，根据导致最不利影响的情景之一进行调度决策。