| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | |||
| 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| 12 | 13 | 14 | 15 | 16 | 17 | 18 |
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 26 | 27 | 28 | 29 | 30 |
- 리플렉션
- 자바
- 스프링
- Deadlock
- test
- 스프링 시큐리티
- Python
- 백준
- redis
- 모던자바
- 최소 신장 트리
- spring security
- java
- MST
- 다이나믹 프록시
- 프록시
- 운영체제
- Junit5
- 문자열
- Reflection
- OS
- 모던 자바 인 액션
- 객체지향
- proxy
- 알고리즘
- Spring
- CS
- BOJ
- 파이썬
- 약수
- Today
- Total
목록Deadlock (3)
Dev 달팽이 @_''
Deadlock (Part 2) Deadlocks (Part 2) Deadlock Avoidance - The Demerits of the Deadlock Prevention: - It prevents deadlocks by limiting how requests can made, - ensuring that at least one of the necessary conditions cannot occur. - However, possible side effects of preventing deadlocks are - low device utilization and reduces system throughput. - Deadlock Avoidance - Let the system to decide for ..
Deadlock(Part 1) System Model - A deadlock is - a situation in which - every process in a set of processes is waiting for - an event that can be caused only by another process in the set. - an event that can be caused only by another process in the set. - a situation in which - a waiting thread (or process) can never again change state, - because theresources it has requested - are held by other..
Synchronization Tool(Part 4) Monitors - The difficulty of using semaphores: - The semaphore is convenient and effective for synchronization. - However, timing errors can happen - if particular execution sequences take place. - these sequences do not always occur, - and it is hard to detect. - An illustrative example of semaphores's problem - All processes share a binary semaphore mutex initializ..