concurrency (λμμ±)
2κ° μ΄μμ μ€λ λ (νΉμ νλ‘μΈμ€)κ° λμμ μ€νλλ μνμ΄λ€.
1κ°μ CPUκ° μ¬λ¬ μ€λ λλ₯Ό λ²κ°μ μ€νν λ λνλλ€.
parallelism (λ³λ ¬μ±)
2κ° μ΄μμ μ€λ λκ° μλ‘ λ€λ₯Έ CPU μμμ κ°μ μκ°μ λμμ μ€νλλ λ³λ ¬μ±μ΄λ€.
π‘ a set of processes is deadlocked when each process in the set is blocked awaiting an event (or a recource) that can only be triggered (released) by another blocked process in the set
βοΈ Reusable resource
βοΈ Consumable resource
λ°λλ½μ΄ λ°μνλ 쑰건!
The first three conditions are necessary but not sufficient conditions for a deadlock.
The fourth condition is actually a consequence of the first three.
Given that the first three condition exist, a sequence of events may occur that lead to an unresolvable circular wait.
βοΈ Mutual exclusion
βοΈ Hold and wait
βοΈ No preemption
βοΈ Circular wait
λ°λλ½μ ν΄κ²°νκΈ° μν 3κ°μ§ λ°©μ
βοΈ Deadlock prevention
βοΈ Deadlock avoidance
βοΈ Deadlock detection
[KUOCW] μ΅λ¦° κ΅μλμ μ΄μ체μ κ°μλ₯Ό μκ°νκ³ μ 리ν λ΄μ©μ λλ€. μλͺ»λ λ΄μ©μ΄ μλ€λ©΄ λκΈλ‘ μλ €μ£Όμλ©΄ κ°μ¬νκ² μ΅λλ€ π