Sciweavers

280 search results - page 6 / 56
» Quasi-Static Scheduling of Communicating Tasks
Sort
View
CODES
2007
IEEE
14 years 1 months ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...
SIES
2010
IEEE
13 years 5 months ago
Distributed Coordination of Task Migration for Fault-Tolerant FlexRay Networks
In this paper we present an approach to increase the fault tolerance in FlexRay networks by introducing backup nodes to replace defect ECUs (Electronic Control Units). In order to ...
Kay Klobedanz, Gilles B. Defo, Wolfgang Mülle...
INFOCOM
2012
IEEE
11 years 10 months ago
DEOS: Dynamic energy-oriented scheduling for sustainable wireless sensor networks
Abstract—Energy is the most precious resource in wireless sensor networks. To ensure sustainable operations, wireless sensor systems need to harvest energy from environments. The...
Ting Zhu, Abedelaziz Mohaisen, Yi Ping, Don Towsle...
RTAS
2010
IEEE
13 years 6 months ago
Scheduling Dependent Periodic Tasks without Synchronization Mechanisms
—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...
Julien Forget, Frédéric Boniol, Emma...
HCW
2000
IEEE
14 years 22 hour ago
A Heuristic Algorithm for Mapping Communicating Tasks on Heterogeneous Resources
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve ...
Kenjiro Taura, Andrew A. Chien