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.
A discrete scheduling algorithm basing on DP-Wrap(DDP) for multiprocessor real-time systems is proposed in this paper. As fairness is a popular concept used in most of the published optimal algorithms(e.g., Pfair, Bfair), many of the scheduling produced by these algorithms leads to much run-time overhead such as preemptions and migrations. Meanwhile, many of the scheduling algorithms(e.g., LLREF,...
The main challenges for embedded real-time systems which use battery as their power supply are both to satisfy the requirements of real-time systems and minimize the energy consumption. This paper studies the energy saving problem for DAG (Directed Acyclic Graph) tasks in soft real-time systems with heterogeneous multicore processors. Since soft real-time systems can tolerate occasional time violations...
Virtualization technology and MapReduce program model are sharp swords for the big data and cloud computing era. The combination of them exhibits powerful ability of easy-management, fast-deployment, feasible-scalability and high-efficiency. However, the downside is that the performance is limited by the I/O bottleneck of Virtual Machine(VM). A huge number of data should be handled in MapReduce cluster...
As a packet is distributed along its path in a wormhole network-on-chip (NoC), the individual link schedulers can hardly fulfill packet-based allocation without synchronization, to achieve lower average latency than flit-based one does. Reverse anchored round-robin (RARR) is proposed as hybrid of flit and packet based schemes. The unique highest-priority fragment is reserved as anchor at each link...
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.