Embedded systems are increasingly becoming a key technological component of all kinds of complex technical systems, ranging from vehicles, telephones, audio-video equipment, aircraft, toys, security systems, medical diagnostics, to weapons, pacemakers, climate control systems, manufacturing systems, intelligent power systems etc. IJES addresses the state of the art of all aspects of embedded computing systems with emphasis on algorithms, systems, models, compilers, architectures, tools, design methodologies, test and applications. Contents: IJES is a refereed international journal providing an international forum to report, discuss and exchange experimental or theoretical results, novel designs, work-in-progress, experience, case studies, and trend-setting ideas. Papers should be of a quality that represents the latest advances in embedded systems in time-to-market, cost, code size, weight, testability, power, real-time behaviour, and stimulating future trends.

In this paper, the authors present a self-organized approach for scheduling tasks on processors in embedded real-time systems. For such a mapping, two conflicting objectives have to be optimized: the reliability and the schedule length. Since the scheduling problem is NP-hard, a heuristic algorithm is used to produce schedules achieving different trade-offs between the two objectives. Moreover, a self-organization strategy based on dynamic crowding distance is adopted. This allows a better exploration of the objective space as well as an enhanced solution diversity. The proposed algorithm, reliability schedule length trad-offs algorithm (RSTA), is tested and compared with the popular SPEA2 algorithm where experimental results are promising on both quality and diversity of solutions.

In this paper, we propose a fault-tolerant scheduling heuristic that achieves low energy consumption and high reliability efficiency. Our scheduling algorithm is dedicated to multi-bus heterogeneous architectures, which take as input a given system description and a given fault hypothesis. It is based on active redundancy to mask a fixed number k of failures supported in the system, so that there is no need for detecting and handling such failures. In order to maximize the system's reliability, the replicas of each operation are scheduled on different reliable processors. Finally, we show with an example that our approach can maximize reliability and reduce energy consumption when using active redundancy. 

This paper proposes Makespan and Reliability based approach, a static sheduling strategy for distributed real time embedded systems that aims to optimize the Makespan and the reliability of an application. This scheduling problem is NP-hard and we rely on a heuristic algorithm to obtain efficiently approximate solutions. Two contributions have to be outlined: First, a hierarchical cooperation between heuristics ensuring to treat alternatively the objectives and second, an Adapatation Module allowing to improve solution exploration by extending the search space. It results a set of compromising solutions offering the designer the possibility to make choices in line with his (her) needs. The method was tested and experimental results are provided

No abstract