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.
Changing conditions for manufacturing enterprises cause an increasing complexity in assembly processes by product customization and cost pressure. Coinstantaneous, the demographic changes exacerbate the harmonization of the different performances between employees. This causes wastage of productivityatinterfaces between process steps.The Cyber Physical Assembly System (CyPAS) extends the concept of...
This article studies the scheduling of critical embedded systems, which consist of a set of communicating periodic tasks with constrained deadlines. Currently, tasks are usually sequenced manually, partly because available scheduling policies do not ensure the determinism of task communications. Ensuring this determinism requires scheduling policies supporting task precedence constraints (which we...
This paper introduces I-MAC a new hybrid medium access control protocol for wireless sensor networks (WSNs). I- MAC combines both CSMA and TDMA techniques while introducing prioritization. It aims to improve energy efficiency as well as channel utilization. I-MAC is composed of two phases: a setup phase and a transmission phase. During the setup phase, several operations such as neighborhood discovery,...
As Grid networks grows, the complexity of resource management in Grid networks dramatically increases. To manage the Grid resources efficiently, policy based resource management system is suitable. However, the policy which made at a moment could not be appropriate to other time because the condition of the grid resources with time space changes. Thus, in this paper, we propose asynchronous policy-based...
We study two parallel scheduling problems and their use in designing parallel algorithms. First, we define a novel scheduling problem; it is solved by repeated, rapid, approximate reschedulings. This leads to a first optimal PRAM algorithm for list ranking, which runs in logarithmic time. Our second scheduling result is for computing prefix sums of logn bit numbers. We give an optimal parallel 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.