Starvation Problem in CPU Scheduling for Multimedia Systems
One of the major tasks of traditional general-purpose operating system is to provide an orderly and controlled allocation of processor among various executing programs competing for it in a fair and efficient manner. Multimedia applications have timing requirements that cannot generally be satisfied...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | article |
| منشور في: |
2002
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/795/1/starvation.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513380386078720 |
|---|---|
| author | Salah, Khaled |
| author2 | unknown |
| author2_role | author |
| author_facet | Salah, Khaled unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Salah, Khaled unknown |
| dc.date.none.fl_str_mv | 2002 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/795/1/starvation.pdf (2002) Starvation Problem in CPU Scheduling for Multimedia Systems. Proceedings of the 4th Workshop on Information and Computer Science: Internet Computing (WICS'2002), Dhahran, Saudi Arabia. pp. 489-497. |
| dc.language.none.fl_str_mv | en |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/795/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | Starvation Problem in CPU Scheduling for Multimedia Systems |
| dc.type.none.fl_str_mv | Article NonPeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | One of the major tasks of traditional general-purpose operating system is to provide an orderly and controlled allocation of processor among various executing programs competing for it in a fair and efficient manner. Multimedia applications have timing requirements that cannot generally be satisfied using the time-sharing algorithms of general-purpose operating systems. Integrating discrete and continuous data of digital audio and video requires additional services from operating systems, especially handling of time-constrained characteristics of continuous media data, which poses a real-time characteristics on the underlying scheduler. Implementing multimedia applications using a real-time scheduler leads to starvation of conventional applications. In this paper, we briefly describe three of the popular multimedia scheduling algorithms. We compare and discuss how adequate each algorithm is in handling the issue of starvation. Additionally, we propose a new improvement for handling starvation for one of the most popular multimedia scheduling algorithms. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_2fe22d503a015fe684150b326f44f749 |
| identifier_str_mv | (2002) Starvation Problem in CPU Scheduling for Multimedia Systems. Proceedings of the 4th Workshop on Information and Computer Science: Internet Computing (WICS'2002), Dhahran, Saudi Arabia. pp. 489-497. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::795 |
| publishDate | 2002 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Starvation Problem in CPU Scheduling for Multimedia SystemsSalah, KhaledunknownComputerOne of the major tasks of traditional general-purpose operating system is to provide an orderly and controlled allocation of processor among various executing programs competing for it in a fair and efficient manner. Multimedia applications have timing requirements that cannot generally be satisfied using the time-sharing algorithms of general-purpose operating systems. Integrating discrete and continuous data of digital audio and video requires additional services from operating systems, especially handling of time-constrained characteristics of continuous media data, which poses a real-time characteristics on the underlying scheduler. Implementing multimedia applications using a real-time scheduler leads to starvation of conventional applications. In this paper, we briefly describe three of the popular multimedia scheduling algorithms. We compare and discuss how adequate each algorithm is in handling the issue of starvation. Additionally, we propose a new improvement for handling starvation for one of the most popular multimedia scheduling algorithms.20022020ArticleNonPeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/795/1/starvation.pdf (2002) Starvation Problem in CPU Scheduling for Multimedia Systems. Proceedings of the 4th Workshop on Information and Computer Science: Internet Computing (WICS'2002), Dhahran, Saudi Arabia. pp. 489-497. enhttps://eprints.kfupm.edu.sa/id/eprint/795/info:eu-repo/semantics/openAccessoai::7952019-11-01T13:25:18Z |
| spellingShingle | Starvation Problem in CPU Scheduling for Multimedia Systems Salah, Khaled Computer |
| status_str | publishedVersion |
| title | Starvation Problem in CPU Scheduling for Multimedia Systems |
| title_full | Starvation Problem in CPU Scheduling for Multimedia Systems |
| title_fullStr | Starvation Problem in CPU Scheduling for Multimedia Systems |
| title_full_unstemmed | Starvation Problem in CPU Scheduling for Multimedia Systems |
| title_short | Starvation Problem in CPU Scheduling for Multimedia Systems |
| title_sort | Starvation Problem in CPU Scheduling for Multimedia Systems |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/795/1/starvation.pdf |