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.
Simulation is a significant way for performancespsila evaluations in switching and scheduling. The simulation software currently being existed has somewhat limitations in inheritability and extensibility. Based on current switching fabrics, by employing system level design method and object oriented technology, we designed and implemented a simulation platform called SPES for switching and scheduling...
Time Petri net and timed Petri net, in which transactions are constrained with time info, are widely used in task scheduling and performance analysis, whereas they are not effective enough for project performance analysis. Timing constraint Petri net (TcPN for short) is proposed in which places are endued with time delaying domain and time persisting domain simultaneously. Furthermore, all time constraints...
Multiprocessor task scheduling problem has become increasingly interesting, for both theoretical study and practical applications. Theoretical study of the problem has made significant progress recently. However, it seems not to imply practical algorithms for the problem yet. In this paper, the offline version of the Multiprocessor scheduling problem on m-processor system is discussed for the case...
The university course timetabling problem is a combinatorial optimization problem concerning the scheduling of a number of subjects into a finite number of timeslots in order to satisfy a set of specified constraints. The timetable problem can be very hard to solve, especially when attempting to find a near-optimal solutions, with a large number of instances. This paper presents a combination of particle...
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.