An embedded system that extends microprocessor cores with a high-performance Coarse-Grained Reconfigurable Data-Path is introduced. the data-path is composed by computational resources able to realize complex operatio...
详细信息
ISBN:
(纸本)1424400872
An embedded system that extends microprocessor cores with a high-performance Coarse-Grained Reconfigurable Data-Path is introduced. the data-path is composed by computational resources able to realize complex operations which aid in improving the performance of time critical application parts, called kernels. A compilation flow is defined for mapping high-level software descriptions to the microprocessor system. the kernel code is mapped using a properly developed mapping algorithm for the Reconfigurable. Data-Path. Extensive exploration is performed by mapping four real-life applications on three different instances of the system. Important overall application speedups have been reported that range from 1.70 to 3.68 relative to an all-processor execution.
In wireless network environment, different traffic classes exhibit a variety of characteristics and service requirements [4,5,7], such as data rate, maximum tolerable packet error rate and delay bounds. Although ieee ...
详细信息
the next generation of embeddedsystems will be dominated by mobile devices, which are able to deliver communications and rich multimedia content anytime, anywhere. the major themes in these ubiquitous computing syste...
详细信息
ISBN:
(纸本)1595935428
the next generation of embeddedsystems will be dominated by mobile devices, which are able to deliver communications and rich multimedia content anytime, anywhere. the major themes in these ubiquitous computingsystems are applications with increased user control and interactivity withthe environment. therefore, the storage of dynamic data increases, thus making the dynamic memory allocation of heap data at run time a very important component with heavy energy consumption. In this paper, we propose a novel script, which heavily customizes the dynamic memory allocator according to the target application domain and the underlying memory hier-archy of the embedded system. the dynamic memory allocator resides in the middleware level or in the Operating System level (whenever it is available). the result of our script and automated tools is the reduction of energy consumption by 72% on average and the reduction of the execution time by 40% on average, which is demonstrated withthe use of 1 real life wireless network appli-cation and 1 multimedia application. Copyright 2006 ACM.
the following topics are dealt with: adaptive computing; architectures; design evolution; distributed systems design; embedded and real-time software systems; formal methods; model-based system design; modeling and an...
the following topics are dealt with: adaptive computing; architectures; design evolution; distributed systems design; embedded and real-time software systems; formal methods; model-based system design; modeling and analysis of complex systems; product-family models and architectures; reliability, safety, dependability, and security; system on a chip; system assessment, testing, and metrics; verification and validation
In this short paper we illustrate a novel approach that aims to marry reuse-driven and model-driven development principles with engineering considerations of great concern to high-integrity real-timesystems, for whic...
详细信息
In this short paper we illustrate a novel approach that aims to marry reuse-driven and model-driven development principles with engineering considerations of great concern to high-integrity real-timesystems, for which the specification of properties to be preserved at run time is paramount
From a real-time perspective, the garbage collector (GC) introduces unpredictable pauses that are not tolerated by real-time tasks. real-time collectors eliminate this problem but introduce a high overhead. Another ap...
详细信息
From a real-time perspective, the garbage collector (GC) introduces unpredictable pauses that are not tolerated by real-time tasks. real-time collectors eliminate this problem but introduce a high overhead. Another approach is to use memory regions (MR) within which allocation and deallocation are customized. this facility is supported by the memory model of the real-time specification for Java (RTSJ). this paper provides an indepth analytical investigation of the problems and solutions of Java garbage collection techniques regarding it use in embeddedreal-timesystems
the present paper is focused on hierarchical modeling in monoprocessor real-timesystems. In the current scheduling, each system application is isolated through periodic servers. While previous research oriented both ...
详细信息
the present paper is focused on hierarchical modeling in monoprocessor real-timesystems. In the current scheduling, each system application is isolated through periodic servers. While previous research oriented both local and global schedulers to fixed priorities, this study extends the scheduling to dynamic priorities (EDF). the new analysis consists in obtaining the response time for the worst case scenario for each task involved in the system applications
In most real-timeapplications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requirements can be met by assigning suitable rel...
详细信息
In most real-timeapplications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requirements can be met by assigning suitable relative deadlines and guaranteeing the feasibility of the schedule. this paper presents a method (called minD) for calculating the minimum EDF-feasible deadline of a real-time task. More precisely, given a set of periodic tasks with hard real-time requirements, which is feasible under EDF, the proposed algorithm allows computingthe shortest deadline that can be assigned to an arbitrary task in the set, or to a new incoming task (periodic or aperiodic), still preserving the EDF feasibility of the new task set. the algorithm has a pseudo polynomial complexity and handles arbitrary relative deadlines, which can be less than, equal to, or greater than periods
To build a "correct" implementation from a model of a concurrent real-time system, it is important to understand the relation between the properties of the model and of its corresponding implementation. In t...
详细信息
To build a "correct" implementation from a model of a concurrent real-time system, it is important to understand the relation between the properties of the model and of its corresponding implementation. In this paper, the behaviour of a system is described withtimed action sequences. Based on a notion of distance that expresses the observable property preservation between timed action sequences, we show that a stronger observable property preservation between model and implementation is obtained when urgency on the execution of observable actions is imposed over the execution of unobservable ones. Furthermore, we present a model synthesis approach and, by means of a case study, we show how it can be applied in the synthesis of real-timesystems
暂无评论