Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Kotecha, K. Shah, A. |
| Copyright Year | 2008 |
| Description | Author affiliation: G H Patel Coll. of Eng. & Tech., Vidyanagar (Kotecha, K.) |
| Abstract | EDF (earliest deadline first) has been proved to be optimal scheduling algorithm for single processor realtime operating systems when the systems are preemptive and underloaded. The limitation of this algorithm is, its performance decreases exponentially when system becomes slightly overloaded. Authors have already proved ability of ACO (Ant Colony Optimization) based scheduling algorithm for real-time operating system which is optimal during underloaded condition and it gives outstanding results in overloaded condition. The limitation of this algorithm is, it takes more time for execution compared to EDF algorithm. In this paper, an adaptive scheduling algorithm is proposed which is combination of both of these algorithms. Basically the new algorithm uses EDF algorithm but when the system becomes overloaded, it will switch to ACO based scheduling algorithm. Again, when the overload disappears, the system will switch to EDF algorithm. Therefore, the proposed algorithm takes the advantages of both algorithms and overcomes the limitations of each other. The proposed algorithm along with EDF algorithm and ACO based scheduling algorithm, is simulated for real-time system and the results are obtained. The performance is measured in terms of Success Ratio and Effective CPU Utilization. Execution Time taken by each scheduling algorithm is also measured. From analysis and experiments it reveals that the proposed algorithm is fast as well as very efficient in both underloaded and overloaded conditions. |
| Starting Page | 2109 |
| Ending Page | 2112 |
| File Size | 88588 |
| Page Count | 4 |
| File Format | |
| ISBN | 9781424418220 |
| DOI | 10.1109/CEC.2008.4631078 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2008-06-01 |
| Publisher Place | China |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Real time systems Heuristic algorithms Scheduling algorithm Algorithm design and analysis Dynamic scheduling Scheduling Operating systems |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|