
Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1882
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ajmani, Prerna | - |
dc.date.accessioned | 2025-04-04T07:44:44Z | - |
dc.date.available | 2025-04-04T07:44:44Z | - |
dc.date.issued | 2013-12 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/1882 | - |
dc.description.abstract | In the era of supercomputers multiprogramming operating system has emerged. Multiprogramming operating system allows more than one ready to execute processes to be loaded into memory. CPU scheduling is the process of selecting from among the processes in memory that are ready to execute and allocate the processor time (CPU) to it. Many conventional algorithms have been proposed for scheduling CPU such as FCFS, shortest job first (SJF), priority scheduling etc. But no algorithm is absolutely ideal in terms of increased throughput, decreased waiting time, decreased turnaround time etc. In this paper, a new fuzzy logic based CPU scheduling algorithm has been proposed to overcome the drawbacks of conventional algorithms for efficient utilization of CPU. | en_US |
dc.language.iso | en | en_US |
dc.publisher | BVICAM’s International Journal of Information Technology | en_US |
dc.subject | CPU scheduling, fuzzy logic, Multiprogramming Operating System | en_US |
dc.subject | process, turnaround time, and throughput | en_US |
dc.title | Proposed Fuzzy CPU Scheduling Algorithm (PFCS) for Real-Time Operating Systems BIJIT | en_US |
dc.type | Article | en_US |
Appears in Collections: | VSIT |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Proposed Fuzzy CPU Scheduling Algorithm (PFCS) for Real-Time Operating Systems.pdf | 382.51 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.