Pinned Repositories
ReactGames
Basic Games in React (eg. TicTacToe)
background-generator
this gives various combination of background color
CH9_PyIOT
Cypher hack Hackathon
Data-Structures-in-Python
Python data structures demo is shown in this repo
first-contributions
🚀✨ Help beginners to contribute to open source projects
My-First-React-App
my first react app ROBO FRND
my-profile
Profile Page Development
ng-tcs-assignment
Training
OS-Preemitive-priority-sheduling
Fixed-priority preemptive scheduling is a scheduling system commonly used in real-time systems. With fixed priority preemptive scheduling, the scheduler ensures that at any given time, the processor executes the highest priority task of all those tasks that are currently ready to execute. The preemptive scheduler has a clock interrupt task that can provide the scheduler with options to switch after the task has had a given period to execute—the time slice. This scheduling system has the advantage of making sure no task hogs the processor for any time longer than the time slice. However, this scheduling scheme is vulnerable to process or thread lockout: since priority is given to higher-priority tasks, the lower-priority tasks could wait an indefinite amount of time. One common method of arbitrating this situation is aging, which gradually increments the priority of waiting processes and threads, ensuring that they will all eventually execute. Most real-time operating systems (RTOSs) have preemptive schedulers. Also turning off time slicing effectively gives you the non-preemptive RTOS.
ReactGames-Server
Server for react games repo
sureshkumarjha's Repositories
sureshkumarjha/my-profile
Profile Page Development
sureshkumarjha/Spring-microservices
sureshkumarjha/Workshop-Cryptex
Cryptex Workshop react app
sureshkumarjha/My-First-React-App
my first react app ROBO FRND
sureshkumarjha/vue-profile-app
Profile page using Vue js
sureshkumarjha/Hack-CP-DSA
A repo for Competitive Programming and Data Structures & Algorithms problems and solutions.
sureshkumarjha/ng-tcs-assignment
Training
sureshkumarjha/Distributed-Multi-Camera-Synchronization
sureshkumarjha/ReactGames-Server
Server for react games repo
sureshkumarjha/ReactGames
Basic Games in React (eg. TicTacToe)
sureshkumarjha/first-contributions
🚀✨ Help beginners to contribute to open source projects
sureshkumarjha/CH9_PyIOT
Cypher hack Hackathon
sureshkumarjha/Symboisis-1
sureshkumarjha/Data-Structures-in-Python
Python data structures demo is shown in this repo
sureshkumarjha/textsimilarity
sureshkumarjha/OS-Preemitive-priority-sheduling
Fixed-priority preemptive scheduling is a scheduling system commonly used in real-time systems. With fixed priority preemptive scheduling, the scheduler ensures that at any given time, the processor executes the highest priority task of all those tasks that are currently ready to execute. The preemptive scheduler has a clock interrupt task that can provide the scheduler with options to switch after the task has had a given period to execute—the time slice. This scheduling system has the advantage of making sure no task hogs the processor for any time longer than the time slice. However, this scheduling scheme is vulnerable to process or thread lockout: since priority is given to higher-priority tasks, the lower-priority tasks could wait an indefinite amount of time. One common method of arbitrating this situation is aging, which gradually increments the priority of waiting processes and threads, ensuring that they will all eventually execute. Most real-time operating systems (RTOSs) have preemptive schedulers. Also turning off time slicing effectively gives you the non-preemptive RTOS.
sureshkumarjha/background-generator
this gives various combination of background color