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.
<데드락>
프로세스들이 서로가 가진 자원을 기다리며 blocked된 상태
*****4가지 조건*****
1. Mutual Exclusion (상호배제) 매 순간 하나의 프로세스
2. No preemtion (비 선점) 자원을 강제로 빼앗을 수 없음
3. Hold and Wait (보유 대기) 기다리면서 자원도 가짐
4. Circular wait (순환 대기) 프로세스간에 사이클 형성
****4가지 해결방법****
1. Prevention (예방): 4가지 조건 중 하나 불만족
2. Avoidance (회피): 데드락 가능성 없을떄에만 자원 할당. Safe 상태.
- 자원 할당 그래프: 사이클이 없어야함.
- Banker's 알고리즘: 요청 자원 <= 가용자원.
3. Detection & Recovery (발견과 회복): detection 루틴, 강제 종료..
- Wait for graph 알고리즘
4. Ignorance (무시): OS가 관여하지 않음
Comments
Post a Comment