The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and Layland's utilization...
In real-time data warehouses, data import is no longer implemented in the batched and periodic way during the idle time of data warehouses, but continuously ongoing. The updates of real-time data warehouses are conflict with queries against data warehouses. Thus the scheduling of updates and queries becomes a key issue. This paper proposes a priority-based balance scheduling algorithm (PBBS). Firstly,...
This paper proposes a framework of change data capture and data extraction, which captures changed data based on the log analysis and processes the captured data further to improve the quality of data. Then processed data are pushed to a data queue and the system processes the data queue using priority-based scheduling algorithm. Ultimately processed data are loaded to real-time data warehouse to...
Complicated real-time application needs operating system providing layered scheduling mechanism to realize two layers scheduling for disjoint tasks subset. For satisfying the running predictability of real-time task under circumstance of layered scheduling, operating system should have corresponding resource access control protocol to avoid infinite priority inversion and deadlock phenomenon while...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.