完整後設資料紀錄
DC 欄位語言
dc.contributor.authorTseng, SMen_US
dc.contributor.authorChin, YHen_US
dc.contributor.authorYang, WPen_US
dc.date.accessioned2014-12-08T15:01:12Z-
dc.date.available2014-12-08T15:01:12Z-
dc.date.issued1998-01-01en_US
dc.identifier.issn0916-8532en_US
dc.identifier.urihttp://hdl.handle.net/11536/100-
dc.description.abstractWe present a new scheduling policy named Value-based Processor Allocation (VPA-k) for scheduling value-based transactions in a multiprocessor real-time database system. The value of a transaction represents the profit the transaction contributes to the system if it is completed before its deadline. Using VPA-k policy, the transactions with higher values are given higher priorities to execute first, while at most k percentage of the total processors are allocated to the urgent transactions dynamically. Through simulation experiments, VPA-k policy is shown to outperform other scheduling policies substantially in both maximizing the totally obtained values and minimizing the number of missed transactions.en_US
dc.language.isoen_USen_US
dc.subjectreal-time schedulingen_US
dc.subjecttransaction valuesen_US
dc.subjectmultiprocessor database systemen_US
dc.subjectpriority assignmenten_US
dc.titleValue-based scheduling for multiprocessor real-time database systemsen_US
dc.typeLetteren_US
dc.identifier.journalIEICE TRANSACTIONS ON INFORMATION AND SYSTEMSen_US
dc.citation.volumeE81Den_US
dc.citation.issue1en_US
dc.citation.spage137en_US
dc.citation.epage143en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
顯示於類別:期刊論文