Performance analysis of dynamic multitasking imprecise computation system

Simple item page
dc.contributor.authorLim, C.C.
dc.contributor.authorZhao, W.
dc.date.issued1991
dc.description.abstractThe scheduling of tasks in dynamic multitasking computer systems using imprecise partial computations is studied. In this system, tasks arrive randomly during run-time, and they are to be processed as quickly as possible. The task is modelled in such a way that each task has two parts of computation: a mandatory part, and an optional part. The tasks are scheduled such that: if the total number of tasks in the system is no more than M (a system parameter), the tasks are executed fully to produce precise results. When the total number of tasks exceeds M, then only the mandatory parts of the tasks are executed. To study this dynamic imprecise computation system, the authors propose three performance metrics to measure responsiveness and quality of computation of tasks. Queueing methods are used to analyse the scheduling problem, and performance metrics are computed numerically. The performance of the scheme is assessed, and found to be effective in keeping the mean task waiting time at a low value when the system is heavily loaded or overloaded.
dc.description.statementofresponsibilityC.C. Lim and W. Zhao
dc.identifier.citationIEE Proceedings E: Computers and Digital Techniques, 1991; 138(5):345-350
dc.identifier.doi10.1049/ip-e.1991.0047
dc.identifier.issn0143-7062
dc.identifier.issn2053-7948
dc.identifier.orcidLim, C.C. [0000-0002-2463-9760]
dc.identifier.urihttp://hdl.handle.net/2440/85338
dc.language.isoen
dc.publisherIET
dc.rightsCopyright status unknown
dc.source.urihttps://doi.org/10.1049/ip-e.1991.0047
dc.titlePerformance analysis of dynamic multitasking imprecise computation system
dc.typeJournal article
pubs.publication-statusPublished

Files

Collections

Electrical and Electronic Engineering publications