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.
The applicability and strength of heterogeneous computing systems are derived from their ability to match computing nodes to appropriate tasks since a suite of different machines are interconnected. A good mapping algorithm offers minimal expected completion time and machine idle time. In this paper we propose a new task scheduling algorithm allowing higher performance than the existing algorithms...
Multi-agent system consists of a number of cooperative agents which have agreed to work together for a common goal. When scheduling the messages in an agent system, if the same priority is assigned to all the agents without considering the importance of their role, the performance may not be maximized. In this paper we propose a new priority-based message scheduling scheme. It enables the agent system...
Recently, WiBro has been developed to efficiently support broadcasting via wireless network. MBS (multicast broadcast service) based on WiBro has numerous applications including DMB. Since the current MBS implementation uses only common channel which is managed by scheduling, it cannot effectively support many users requesting the service at the same time. This paper proposes a new counting scheme...
Presents a simple model that combines the failure to meet deadlines with hardware/software failures in computing the reliability of a real-time system. We define the performability as the probability of meeting deadlines by real-time tasks in the presence of hardware and software failures. Deadline-driven schedules rely on worst-case task execution time. This may be necessary for hard real-time systems,...
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.