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.
This paper considers the scheduling of parallel real-time tasks with implicit deadlines. Each parallel task is characterized as a general directed acyclic graph (DAG). We analyze three different real-time scheduling strategies: two well known algorithms, namely global earliest-deadline-first and global rate-monotonic, and one new algorithm, namely federated scheduling. The federated scheduling algorithm...
This paper presents an efficient way to maximize the throughput of mixed batch/continuous process based on integrated hybrid time Petri nets and genetic algorithm. The scheduling problem of process is mapped as the solution of the optimal regional state sequence in HTPNs. The transition firing decision model is developed according to the enabling and firing rules, and a genetic algorithm of scheduling...
Space-ground cooperative Tracking Telemetry and Command (TT&C) Resources scheduling is a constraint satisfaction problem based on complicated more tasks and more resources and more windows. Considering general task requirements and space-based TT&C characteristics about more available passes and longer visible window time, a heuristic algorithm of space-ground cooperative TT&C resources...
Reasonable scanning task scheduling strategy can improve the scanning efficiency of vulnerability detection systems at a large extent. Task scheduling problem has been proved to be an NP-complete problem. Based on the request and characteristics of vulnerability detection technology, this paper establishes a distributed scanning task scheduling model, and describes a scanning task distributing algorithm...
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.