๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

โญ Group_Study70

[5์ฃผ์ฐจ] Memory Management - Variable Partition Multi-programming Memory Management - Variable Partition Multi-programming Multi-Programming (Variable Partition Multiprogramming) โœ” ์ดˆ๊ธฐ์—๋Š” ์ „์ฒด๊ฐ€ ํ•˜๋‚˜์˜ ์˜์—ญ โœ” ํ”„๋กœ์„ธ์Šค๋ฅผ ์ฒ˜๋ฆฌํ•˜๋Š” ๊ณผ์ •์—์„œ ๋ฉ”๋ชจ๋ฆฌ ๊ณต๊ฐ„์ด ๋™์ ์œผ๋กœ ๋ถ„ํ•  โœ” No internal fragmentation VPM Example โœ” Memory space: 120 MB 1. ์ดˆ๊ธฐ์ƒํƒœ 2. ํ”„๋กœ์„ธ์Šค A(20MB) ์ ์žฌ 3. ํ”„๋กœ์„ธ์Šค B(10MB) ์ ์žฌ 4. ํ”„๋กœ์„ธ์Šค C(25MB) ์ ์žฌ 5. ํ”„๋กœ์„ธ์Šค D(20MB) ์ ์žฌ 6. ํ”„๋กœ์„ธ์Šค B๊ฐ€ ์ฃผ๊ธฐ์–ต์žฅ์น˜ ๋ฐ˜๋‚ฉ 7. ํ”„๋กœ์„ธ์Šค E(15MB) ์ ์žฌ 8. ํ”„๋กœ์„ธ์Šค D๊ฐ€ ์ฃผ๊ธฐ์–ต์žฅ์น˜ ๋ฐ˜๋‚ฉ 9. ์–ด๋””์— ๋ฐฐ์น˜ํ•  ๊ฒƒ์ธ๊ฐ€...? Placemen.. 2023. 1. 4.
[5์ฃผ์ฐจ] Memory Management - Fixed Partition Multiprogramming Memory Management - Fixed Partition Multiprogramming Memory Allocation โœ” Continuous Memory Allocaiotn(์—ฐ์† ํ• ๋‹น) Uni-programming Multi-programmoing Fixed partition(FPM) Variable partition(VPM) โœ” Non-continuous Memory Allocation(๋น„์—ฐ์† ํ• ๋‹น) Chapter.9 Continuous Memory Allocation โœ” ํ”„๋กœ์„ธ์Šค (context)๋ฅผ ํ•˜๋‚˜์˜ ์—ฐ์†๋œ ๋ฉ”๋ชจ๋ฆฌ ๊ณต๊ฐ„์— ํ• ๋‹นํ•˜๋Š” ์ •์ฑ… ํ”„๋กœ๊ทธ๋žจ, ๋ฐ์ดํ„ฐ, ์Šคํƒ ๋“ฑ โœ” ๋ฉ”๋ชจ๋ฆญ ๊ตฌ์„ฑ ์ •์ฑ… ๋™์‹œ์— ์˜ฌ๋ผ๊ฐˆ ์ˆ˜ ์žˆ๋Š” ํ”„๋กœ์„ธ์Šค ์ˆ˜(Multiprogramming degree) ๊ฐ ํ”„๋กœ์„ธ์Šค์—๊ฒŒ ํ• ๋‹น๋˜.. 2023. 1. 3.
[5์ฃผ์ฐจ] Memory Management: Backgrounds Memory Management: Backgrounds ๋ฉ”๋ชจ๋ฆฌ(๊ธฐ์–ต์žฅ์น˜)์˜ ์ข…๋ฅ˜ โœ” ๊ณ„์ธต์  ๊ตฌ์กฐ๋ฅผ ๊ฐ€์ง€๊ณ  ์žˆ๋‹ค!! ๋ฉ”๋ชจ๋ฆฌ(๊ธฐ์–ต์žฅ์น˜) ๊ณ„์ธต๊ตฌ์กฐ Address Binding โœ” ํ”„๋กœ๊ทธ๋žจ์˜๋…ผ๋ฆฌ ์ฃผ์†Œ๋ฅผ ์‹ค์ œ ๋ฉ”๋ชจ๋ฆฌ์˜ ๋ฌผ๋ฆฌ ์ฃผ์†Œ๋กœ ๋งคํ•‘(mapping)ํ•˜๋Š” ์ž‘์—… โœ” Binding ์‹œ์ ์— ๋”ฐ๋ฅธ ๊ตฌ๋ถ„ Compile time binding Load time binding Run time binding โœ” User Program Processing Steps Compile time binding โœ” ํ”„๋กœ์„ธ์Šค๊ฐ€ ๋ฉ”๋ชจ๋ฆฌ์— ์ ์žฌ๋  ์œ„์น˜๋ฅผ ์ปดํŒŒ์ผ๋Ÿฌ๊ฐ€ ์•Œ ์ˆ˜ ์žˆ๋Š” ๊ฒฝ์šฐ ์œ„์น˜๊ฐ€ ๋ณ€ํ•˜์ง€ ์•Š์Œ โœ” ํ”„๋กœ๊ทธ๋žจ ์ „์ฒด๊ฐ€ ๋ฉ”๋ชจ๋ฆฌ์— ์˜ฌ๋ผ๊ฐ€์•ผ ํ•œ๋‹ค Load time binding โœ” ๋ฉ”๋ชจ๋ฆฌ ์ ์žฌ ์œ„์น˜๋ฅผ ์ปดํŒŒ์ผ ์‹œ์ ์—์„œ ๋ชจ๋ฅด๋ฉด, ๋Œ€์ฒด ๊ฐ€๋Šฅํ•œ ์ƒ๋Œ€ ์ฃผ.. 2023. 1. 2.
[4์ฃผ์ฐจ] Deadlock: Deadlock Detection and Recovery Deadlock: Deadlock Detection and Recovery Deadlock Detection โœ” Deadlock ๋ฐฉ์ง€๋ฅผ ์œ„ํ•œ ์‚ฌ์ „ ์ž‘์—…์„ ํ•˜์ง€ ์•Š์Œ Deadlock์ด ๋ฐœ์ƒ ๊ฐ€๋Šฅ โœ” ์ฃผ๊ธฐ์ ์œผ๋กœ deadlock ๋ฐœ์ƒ ํ™•์ธ ์‹œ์Šคํ…œ์ด deadlock ์ƒํƒœ์ธ๊ฐ€? ์–ด๋–ค ํ”„๋กœ์„ธ์Šค๊ฐ€ deadlock ์ƒํƒœ์ธ๊ฐ€? โœ” Resource Allocation Graph(RAG) ์‚ฌ์šฉ Resource Allocation Graph(RAG) โœ” Deadlock ๊ฒ€์ถœ์„ ์œ„ํ•ด ์‚ฌ์šฉ โœ” Directed, Bipartite Graph โœ” Directed graph G = (N, E) N = ${N_p, N_r}$ where $N_p$ is the set of processes = ${P1, P2, ..., P_N}$ and.. 2022. 12. 29.
[4์ฃผ์ฐจ] Deadlock: Deadlock Avoidance Deadlock: Deadlock Avoidance Deadlock Avoidance: ๊ฐœ์š” โœ” ์‹œ์Šคํ…œ์˜ ์ƒํƒœ๋ฅผ ๊ณ„์† ๊ฐ์‹œ โœ” ์‹œ์Šคํ…œ์ด deadlock ์ƒํƒœ๊ฐ€ ๋  ๊ฐ€๋Šฅ์„ฑ์ด ์žˆ๋Š” ์ž์› ํ• ๋‹น ์š”์ฒญ ๋ณด๋ฅ˜ โœ” ์‹œ์Šคํ…œ์„ ํ•ญ์ƒ safe state๋กœ ์œ ์ง€ Safe State โœ” Safe state ๋ชจ๋“  ํ”„๋กœ์„ธ์Šค๊ฐ€ ์ •์ƒ์  ์ข…๋ฃŒ ๊ฐ€๋Šฅํ•œ ์ƒํƒœ Safe sequence๊ฐ€ ์กด์žฌ Deadlock ์ƒํƒœ๊ฐ€ ๋˜์ง€ ์•Š์„ ์ˆ˜ ์žˆ์Œ์„ ๋ณด์žฅ โœ” Unsafe state Deadlock ์ƒํƒœ๊ฐ€ ๋  ๊ฐ€๋Šฅ์„ฑ์ด ์žˆ์Œ ๋ฐ˜๋“œ์‹œ ๋ฐœ์ƒํ•œ๋‹ค๋Š” ์˜๋ฏธ๋Š” ์•„๋‹ˆ๋‹ค ๊ฐ€์ • โœ” ํ”„๋กœ์„ธ์Šค์˜ ์ˆ˜๊ฐ€ ๊ณ ์ •๋จ โœ” ์ž์›์˜ ์ข…๋ฅ˜์™€ ์ˆ˜๊ฐ€ ๊ณ ์ •๋จ โœ” ํ”„๋กœ์„ธ์Šค๊ฐ€ ์š”๊ตฌํ•˜๋Š” ์ž์› ๋ฐ ์ตœ๋Œ€ ์ˆ˜๋Ÿ‰์„ ์•Œ๊ณ  ์žˆ์Œ โœ” ํ”„๋กœ์„ธ์Šค๋Š” ์ž์›์„ ์‚ฌ์šฉ ํ›„ ๋ฐ˜๋“œ์‹œ ๋ฐ˜๋‚ฉ โœ” Not practical Algorit.. 2022. 12. 27.
[4์ฃผ์ฐจ] Deadlock: Deadlock Prevention Deadlock: Deadlock Prevention Deadlock ํ•ด๊ฒฐ ๋ฐฉ๋ฒ• Deadlock prevention methods (์˜ˆ๋ฐฉ) Deadlock avoidance methods(ํšŒํ”ผ) Deadlock detection and deadlock recovery methods(ํƒ์ง€ ๋ฐ ๋ณต๊ตฌ) Deadlock Prevention โœ” 4๊ฐœ์˜ deadlock ๋ฐœ์ƒ ํ•„์š” ์กฐ๊ฑด ์ค‘ ํ•˜๋‚˜๋ฅผ ์ œ๊ฑฐ Exclusive use of resources Non - preemptible resources Hold and Wait(Partial allocation) Circular wait โœ” Deadlock์ด ์ ˆ๋Œ€ ๋ฐœ์ƒํ•˜์ง€ ์•Š๋Š”๋‹ค 1. ๋ชจ๋“  ์ž์› ๊ณต์œ  ํ—ˆ์šฉ โœ” Exclusive use or resources ์กฐ๊ฑด ์ œ๊ฑฐ โœ”.. 2022. 12. 26.