Sciweavers

252 search results - page 23 / 51
» Task Assignment and Scheduling under Memory Constraints
Sort
View
AROBOTS
2011
13 years 2 months ago
Time-extended multi-robot coordination for domains with intra-path constraints
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
Edward Gil Jones, M. Bernardine Dias, Anthony Sten...
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...
RTSS
2007
IEEE
14 years 1 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns
RTCSA
2006
IEEE
14 years 1 months ago
Maximizing Guaranteed QoS in (m, k)-firm Real-time Systems
(m,k)-firm constraints have been used to schedule tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guara...
Jian (Denny) Lin, Albert M. K. Cheng
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
14 years 25 days ago
Interconnect design methods for memory design
- This paper presents a solution to the problem of designing interconnects for memory devices. More precisely, it solves the automatic routing problem of memory peripheral circuits...
Chanseok Hwang, Massoud Pedram