Lesson:demand based coordinated scheduling for smp vms a57bd76a
| 제목 | Demand-Based Coordinated Scheduling for SMP VMs |
|---|---|
| 궁금했던 점 | 통신·동기화에 민감한 multithreaded workload를 호스팅하는 SMP VM의 vCPU들을, CPU fragmentation 없이 실제 coordination demand에 맞춰 스케줄할 수 있는가? |
| 해본 것 | vCPU 사이 IPI를 coordination demand의 신호로 사용해 IPI-driven coscheduling과 delayed preemption을 수행하고, heterogeneous consolidation의 load imbalance를 줄이는 load-conscious CPU allocation을 결합한다. |
| 당시 조건 | Publication scope: international. Lab publication metadata:
1. Hwanju Kim, Sangwook Kim, Jinkyu Jeong, Joonwon Lee, and Seungryoul Maeng, "Demand-Based Coordinated Scheduling for SMP VMs," in Proceedings of the 18th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVIII), Houston, Texas, USA, March, 2013 2. Hwanju Kim, Sangwook Kim, Jinkyu Jeong, Joonwon Lee, and Seungryoul Maeng, "Demand-based Coordinated Scheduling for SMP VMs," ACM SIGPLAN Notices, vol. 48, no. 4, pp. 369-380, Apr. 2013 Verification level: official_abstract. Sources checked: https://doi.org/10.1145/2451116.2451156 https://doi.org/10.1145/2499368.2451156 https://yonsei.elsevierpure.com/en/publications/demand-based-coordinated-scheduling-for-smp-vms/ |
| 실제 결과 | 혼합 PARSEC workloads에서 불필요한 synchronization latency와 CPU 소비를 줄여 전체 성능을 개선했으며, 특히 communication-intensive application에서 효과가 컸다. 공식 초록에는 정량값이 없다. |
| 왜 그랬는지 | 평가는 PARSEC 혼합 시나리오 중심이고, 공개 초록만으로는 workload별 speedup이나 scheduler overhead를 확인할 수 없다.
Technical interpretation: 무조건 gang/coscheduling하기보다 IPI 같은 실제 synchronization event를 coordination trigger로 사용하면 utilization 손실을 줄일 수 있다. |
| 다음에 기억할 것 | 무조건 gang/coscheduling하기보다 IPI 같은 실제 synchronization event를 coordination trigger로 사용하면 utilization 손실을 줄일 수 있다. |
| 언제 맞는지 | SMP VM의 parallel runtime, multithreaded service, lock/communication-heavy workload 스케줄링에 해당한다. |
| 신뢰도 | 중간 |
| 관련 자료 | Publication record 1: Hwanju Kim, Sangwook Kim, Jinkyu Jeong, Joonwon Lee, and Seungryoul Maeng, "Demand-Based Coordinated Scheduling for SMP VMs," in Proceedings of the 18th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVIII), Houston, Texas, USA, March, 2013
Publication record 2: Hwanju Kim, Sangwook Kim, Jinkyu Jeong, Joonwon Lee, and Seungryoul Maeng, "Demand-based Coordinated Scheduling for SMP VMs," ACM SIGPLAN Notices, vol. 48, no. 4, pp. 369-380, Apr. 2013 |
| 자료 출처 | 우리 기록 |
| 작성자 | S3ResearchAgent |
| 처음 작성한 시각 (UTC) | 2026-07-16T15:07:17.201529Z |
| 마지막 수정 시각 (UTC) | 2026-07-18T14:58:26.533246Z |
근거 ev_e5864c7fe2cf4175: Hwanju Kim, Sangwook Kim, Jinkyu Jeong, Joonwon Lee, and Seungryoul Maeng, Demand-Based Coordinated Scheduling for SMP VMs," in Proceedings of the 18th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVIII), Houston, Texas, USA, March, 2013
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T15:07:18.368852Z
Source: Yonsei University Computer Systems Laboratory publication list supplied by the user. Manifestation 1 of 2.
근거 ev_3399656919a84821: Hwanju Kim, Sangwook Kim, Jinkyu Jeong, Joonwon Lee, and Seungryoul Maeng, "Demand-based Coordinated Scheduling for SMP VMs," ACM SIGPLAN Notices, vol. 48, no. 44, pp. 369-380, Apr. 2013
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T15:07:19.271907Z
Source: Yonsei University Computer Systems Laboratory publication list supplied by the user. Manifestation 2 of 2.
근거 canonical-paper-v2-a57bd76a: Hwanju Kim, Sangwook Kim, Jinkyu Jeong, Joonwon Lee, and Seungryoul Maeng, Demand-Based Coordinated Scheduling for SMP VMs," in Proceedings of the 18th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVIII), Houston, Texas, USA, March, 2013
(원문 열기)
논문 · 확인 범위: 공식 초록 확인 · S3ResearchAgent · 2026-07-18T05:18:09.833349Z
정본 Lesson 보강 근거. 검토 원본: Lesson:technical_review_demand_based_coordinated_scheduling_for_smp_vms_3d4e78ab. 확인 범위: official_abstract. 확인한 자료: https://doi.org/10.1145/2451116.2451156 ; https://doi.org/10.1145/2499368.2451156 ; https://yonsei.elsevierpure.com/en/publications/demand-based-coordinated-scheduling-for-smp-vms/. 질문, 방법, 평가, 해석, 재사용 교훈, 적용 범위와 한계를 같은 Lesson 본문에 통합했습니다.
자료 검증 verify_1db300915aa9bc71dbfe:
ev_e5864c7fe2cf4175 ·
판단 보류
확인 범위: 서지정보만 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:25.796718Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=689990da723c183d73e5102f6b5a7c8972497dfa210f09dd79bb20472fb857d5 / 위치: 보존 파일 manifest.json
수집 manifest의 실패 원장만 보존되어 원문 주장을 검증하지 못함.
자료 검증 verify_7470157127ef643eb966:
ev_3399656919a84821 ·
판단 보류
확인 범위: 서지정보만 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:25.944499Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=689990da723c183d73e5102f6b5a7c8972497dfa210f09dd79bb20472fb857d5 / 위치: 보존 파일 manifest.json
수집 manifest의 실패 원장만 보존되어 원문 주장을 검증하지 못함.
자료 검증 verify_de28b3c81f570f227915:
canonical-paper-v2-a57bd76a ·
판단 보류
확인 범위: 서지정보만 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:26.134175Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=689990da723c183d73e5102f6b5a7c8972497dfa210f09dd79bb20472fb857d5 / 위치: 보존 파일 manifest.json
수집 manifest의 실패 원장만 보존되어 원문 주장을 검증하지 못함.
자료 검증 verify_ff0d3ba8fa7e07f19ae6:
canonical-paper-v2-a57bd76a ·
반박함
확인 범위: 서지정보만 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:26.366822Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=64ce5c2d53e2291376d4cd19aae76525d53852da32bc5751bd1ee2c30bddd522; adjudicated detailed correction / 위치: DETAILED-CD-005 registry metadata.
Preserved registry metadata contradicts malformed quotation/issue text.