Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Cheng, A.M.K. Wang, R. |
| Copyright Year | 2004 |
| Description | Author affiliation: Dept. of Comput. Sci., Houston Univ. (Cheng, A.M.K.; Wang, R.) |
| Abstract | The periodic multiframe task models and the imprecise computation techniques have been developed for scheduling real-time tasks. We introduce the imprecise computation concept into the periodic multiframe task model and derive a novel scheduling algorithm and an error compensation strategy. The paper also pays attention to the imprecise computation input error, which was often neglected in previous studies. The scheduling algorithm employs an error compensation strategy that based on the traditional largest-weight-first algorithm (LWF). The LWF algorithm guarantees that the largest weighted task executes first, thus minimizing the weighted total error in the task set. Our error compensation strategy enhances the error tolerance during the scheduling and takes maximum advantage of the processor idle time to improve the processor utilization. The experimental results show that the new task model and the new compensation strategy are practical in improving the schedulability and the processor utilization. The high error tolerance results in high schedulability and 100% processor utilization can be achieved in our algorithm. Moreover,, the scheduling algorithm is able to deal with tasks whose laxities are loose or light. Using both the error tolerance coefficient and the error compensation strategy leads to a good tradeoff between the result qualities (QoS) and the available processor time |
| Starting Page | 167 |
| Ending Page | 172 |
| File Size | 283586 |
| Page Count | 6 |
| File Format | |
| ISBN | 0769522092 |
| ISSN | 07303157 |
| DOI | 10.1109/CMPSAC.2004.1342822 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2004-09-28 |
| Publisher Place | China |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Scheduling algorithm Processor scheduling Real time systems Error compensation Optimal scheduling Computer errors Timing Laboratories Computer science Degradation |
| Content Type | Text |
| Resource Type | Article |
| Subject | Computer Science Applications Software |
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...
|