QoS provisioning of a task-scheduling algorithm for lightweight devices.
Saved in:
| Title: | QoS provisioning of a task-scheduling algorithm for lightweight devices. |
|---|---|
| Authors: | Kim, Seungku1 kimsk@cbnu.ac.kr |
| Source: | Journal of Parallel & Distributed Computing. Sep2017, Vol. 107, p67-75. 9p. |
| Subjects: | Computer operating system design & construction, Quality of service, Internet of things, Algorithms, Embedded computer systems |
| Abstract: | Task scheduling is a main objective in operating system design. Many operating systems have been designed and applied to various systems. With the upcoming Internet of things, the requirements for the operating system will vary according to the application. We propose a round-robin-based scheduling algorithm to satisfy the quality of service (QoS) of real-time tasks. Many conventional scheduling algorithms have dealt with the real-time issue, but they still require improvement. Moreover, most assume the burst time is known beforehand, an unrealistic assumption in practical implementations. Thus, we present a heuristic method to predict the burst time of each task and a round-robin-based weighted scheduling algorithm providing QoS to real-time tasks for lightweight devices. The performance of the proposed scheduling algorithm is verified on an embedded system. Experimental results proved the QoS of this algorithm was satisfied. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Parallel & Distributed Computing is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 123409247 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: QoS provisioning of a task-scheduling algorithm for lightweight devices. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Kim%2C+Seungku%22">Kim, Seungku</searchLink><relatesTo>1</relatesTo><i> kimsk@cbnu.ac.kr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Parallel+%26+Distributed+Computing%22">Journal of Parallel & Distributed Computing</searchLink>. Sep2017, Vol. 107, p67-75. 9p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Computer+operating+system+design+%26+construction%22">Computer operating system design & construction</searchLink><br /><searchLink fieldCode="DE" term="%22Quality+of+service%22">Quality of service</searchLink><br /><searchLink fieldCode="DE" term="%22Internet+of+things%22">Internet of things</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Embedded+computer+systems%22">Embedded computer systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Task scheduling is a main objective in operating system design. Many operating systems have been designed and applied to various systems. With the upcoming Internet of things, the requirements for the operating system will vary according to the application. We propose a round-robin-based scheduling algorithm to satisfy the quality of service (QoS) of real-time tasks. Many conventional scheduling algorithms have dealt with the real-time issue, but they still require improvement. Moreover, most assume the burst time is known beforehand, an unrealistic assumption in practical implementations. Thus, we present a heuristic method to predict the burst time of each task and a round-robin-based weighted scheduling algorithm providing QoS to real-time tasks for lightweight devices. The performance of the proposed scheduling algorithm is verified on an embedded system. Experimental results proved the QoS of this algorithm was satisfied. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Parallel & Distributed Computing is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=123409247 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.jpdc.2017.04.010 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 67 Subjects: – SubjectFull: Computer operating system design & construction Type: general – SubjectFull: Quality of service Type: general – SubjectFull: Internet of things Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Embedded computer systems Type: general Titles: – TitleFull: QoS provisioning of a task-scheduling algorithm for lightweight devices. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Kim, Seungku IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2017 Type: published Y: 2017 Identifiers: – Type: issn-print Value: 07437315 Numbering: – Type: volume Value: 107 Titles: – TitleFull: Journal of Parallel & Distributed Computing Type: main |
| ResultId | 1 |
