SUE YOO: PH.D. STUDENT AT UNIVERSITY OF TORONTO; B.S. AT EWHA WOMANS UNIVERSITY (SEOUL, SOUTH KOREA) ; 2021 FULBRIGHT AWARD CANDIDATE
I'm a 4th-year Ph.D. candidate in Computer Science at the University of Toronto, working with Prof. Khai Truong in the DGP lab.
My research lies at the intersection of human–AI interaction, accessibility, and creativity support, with a special focus on improving music accessibility for d/Deaf and hard-of-hearing (DHH) individuals. My projects include song signing (CHI ’23) to explore how music is experienced and expressed within Deaf culture, and ELMI (CHI ’25), an LLM-supported English lyrics to ASL gloss translation system.
I completed my B.Sc. in Computer Science and Engineering at Ewha Womans University, where I was advised by Prof. Uran Oh (Human-Computer Interaction Lab) and Prof. Hyokyung Bahn (Distributed Computing and Operating Systems Lab).
Additionally, I worked as a research intern at Samsung AI Center Toronto, where I was mentored by Iqbal Mohomed, and at NAVER AI LAB under the supervision of Young-Ho Kim. Most recently, I interned at Adobe Research in the STORIE Lab, supervised by Anh Truong and Justin Salamon .
💼 I am currently exploring academic (Assistant Professor) and industry (Research Scientist) positions starting in Summer/Fall 2026.
<Demand paging>
필요할 때 페이지를 메모리에 올리는것.
invalid: Page Fault
<Page Fault>
MMU의 Trap발생
커널모드 - handler: 빈 프레임 가져오기, 쫓아내기
blocked상태 - 디스크에서 가져와 페이지 테이블에 기록: valid전환 - ready - running
<페이지 교체 알고리즘>
1) Optimal (Belady, MIN): 가장 먼 미래에 참조되는 페이지
2) FIFO
3) LRU: 최근성
4) LFU: 장기적인 시간
doubly linked list: 비교할 필요 없음 O(1)
mean heap: 자식간의 비교 O(logn)
5) CLOCK: second chance, reference bit, dirty bit
++ working set 알고리즘
윈도우: 페이지들의 집합, 워킹 셋에 속한 페이지만 유지.
워킹셋: 한꺼번에 메모리에 올라와야하는 페이지들의 집합
Comments
Post a Comment