SHORTEST JOB FIRST(SJF) PREEMPTIVE AND NON-PREEMPTIVE CPU SCHEDULING ALGORITHM| OPERATING SYSTEM
HTML-код
- Опубликовано: 7 фев 2025
- Hello! Welcome sa ITS Information Technology Skills. Ang video na ito ay may pamagat na: SHORTEST JOB FIRST(SJF) PREEMPTIVE AND NON-PREEMPTIVE CPU SCHEDULING ALGORITHM| OPERATING SYSTEM
SHORTEST REMAINING TIME FIRST (SRTF)
PREEMPTIVE AND NON-PREEMPTIVE SHORTEST JOB FIRST
Tag-lish po ang ginamit ko dito sa video na ito para mas madaling maintindihan.
Ito din ang a una unahang video na mgpakita ako sa video ko so sana manuod parin kayo.. Salamat
Kapag nagustohan at nakatulong po ang video na ito huwag pong kalimutan na iLike at iShare ang video. Salamat
Learn more : / @itsinfotechskills
Must watch -
WHAT ARE THE DIFFERENCES BETWEEN BSCS, BSIT and BSIS? | Ano ang Pinagkaiba Ng Mga Courses Na Ito:
• WHAT ARE THE DIFFERENC...
Introduction to computer programming Tutorials:
• Introduction to progra...
Python Tutorials: • Python Tutorial
PowerPoint tutorials: • PowerPoint
Computer Prank: • Computer Prank | Compu...
HOW COMPUTER WORKS | COMPUTER HARDWARE AND SOFTWARE COMPONENTS: • HOW COMPUTER WORKS | C...
Introduction to Visual Studio | What is Visual Studio TAGALOG: • INTRODUCTION TO VISUAL...
Learn the Basic of C# Programming in 10 Minutes | Write Your First C# Program TAGALOG: • HOW TO LEARN THE BASIC...
Introduction To Algorithm | Algorithm vs Program TAGALOG: • Introduction To Algori...
Introduction to Algorithm | Algorithm vs Program TAGALOG: • Introduction To Algori...
Logic Formulation | Flowchart Tutorial for Beginners: TAGALOG: • HOW TO CREATE FLOWCHAR...
first part of Flowchart and Algorithm Sample Problems TAGALOG | Beginners Guide: • FLOWCHART AND ALGORITH...
DON'T CLICK: bit.ly/2JOHNCW
#computerbasic #cpuscheduling #sfj#srtf #operatingsystem
![Noob To Max With DRAGON REWORK In Blox Fruits [FULL MOVIE]](http://i.ytimg.com/vi/LnBMOinoOvA/mqdefault.jpg)
Congrats ma'am. Monetize kana pala❤️❤️
thank you so much :)
Hi Ma'am. Sana meron pong example din for NONPREEMTIVE AND PREEMTIVE na sabay sabay yung Arrival Time like:
P | AT | BT
P1 | 0 | 12
P2 | 2 | 13
P2 | 2 | 23
P3 | 3 | 20
kung sabay sabay means unahin mo ung pinaka maliikt ang burst time kc po shortest job first po ang algo mo
@@ITSInfoTechSkills thank you ma'am. medyo nalito po kase ako.
Mas gets kopa to kesa prof. Ko huehue
1+ subscribe maam.
i'm glad it helps you. Thank you so much
hi ma'am, sa example 2 po sa non pre, bakit hindi ko nauna si p5 kahit mas maliit po ung cpu burst time niya kaysa kay p4?
Mataas arrival time nya e.
nalilito ako mam haha yung iba turo sa non Preemptive ang una daw sa gantt chart yung P1 di daw least na burst time
hahahaha
saan nakuha yung 6 sa p2 bago maging 7?
hello po, dun sa example 3 ng non-preemptive bkt po naunang matapos yung p1 eh yung burst time nya is 8? pls reply po ayan na lng po sana gagawin kong visual sa report ko sa friday kaso naguguluhan ako sa p1 hahahha
mas naintindihan po kita ma'am kaysa sa prof ko huhuhuh maraming salamat po!
Thank you so much po.. para sa question mo you can use example number 2 for non-preemptive and example number 1 sa preemptive, may mga arrival time po you mga process dun
@@ITSInfoTechSkills thanks po sa pagsagot ma'am. naintindihan ko po at na-solve ko na yung sa non-preemp po. however, medyo naguguluhan po ako kasi sa preemptive na sjf, ang nabigay po kasi sa amin is ganito po
P | Arrival Time | Burst Time
P1 0 10
P2 1 29
P3 2 3
P4 3 7
P5 4 12
question po is magco-continue pa rin po ba still si P1 since mas malaki po ang burst time ni P2?
San po kinuha ang 3 yangbsa 8-3
Ma'am paano naman po kapag si srtf may priorit? Paano po gagawin yung process. Thank you in advance po~
hello, concern ko lang bakit dun sa non-preemptive sabi pag nag-rurun na yung process hindi na siya mapuputol kahit may mas mababa na dumaan na job pero nung nag-arrive yung p5 na may maikling cpu burst is siya yung prinaority ng cpu compare sa ibang process? Please po maam paki-explain po kasi po nagkakaron po ng cofusion sa side ko. Thanks.
walang naiStop na process, mas nauna ung p5 kc mas maliit ang cpu burst nya,, after maprocess ung p4 ung time is 11 and ang arrival time nung p5 is 10.. now ung pinakamaliit na cpu burst sa mga nakapila ang mauuna which is p5
@@ITSInfoTechSkills thank you for clarification.
sa example no.2 bakit po nauna si p4 kahit si p5 yung mas mababa ang cpu burst time?
18:20 pano po naging time 7 po ulet ???
6 (ung arrival time p4) + 1 (ung sa burst time p2) = 7
nalito ako sa SRTF
Pano po if yung burst time po pareho?
arrival time po magtatalo
@@ITSInfoTechSkills Pag hanggang P6 po ang process ID pag kukuha po ng P2 ibabase po parin ba sa P2,P3,P4 kung sino maliit ang Burst time or hanggang P5 po ibabase. katulad po ng example 2 - non- preemtive
meron kang round robin?
here is the video for round robin ruclips.net/video/JtTc6A47vYs/видео.html
Hello po ask lang po, pag po ba walang arrival time both non preemptive and preemptive srtf/sjf is same napo ng sagot?
Hi mam pwede po mahingi ppt?
Paano po pag parehas ang arival time at cpu burst?
process id po ung pagbabasehan kung alin yung mauuna
Ma'am salamat po for this vid! Pwede po ba makahingi ng copy nung ppt? 👉👈
Hello po ask lang po, pag po ba walang arrival time both non preemptive and preemptive srtf/sjf is same napo ng sagot?
Same din po ng given
If wala pong arrival time you can consider po na sabay sabay dumating ung mga process so ung shortest job na ang ifofollow