检索结果-内蒙古大学图书馆

15th ieee international conference on embedded and real-time computing systems and applications

作者： Zeng, Gang Yokoyama, Tetsuo Tomiyama, Hiroyuki Takada, Hiroaki Nagoya Univ Grad Sch Informat Sci Chikusa Ku Furo Cho Nagoya Aichi 4648603 Japan Nanzan Univ Seto Aichi 4890863 Japan

ISBN: (纸本)9780769537870

Energy-aware real-time multiprocessor scheduling has been studied extensively so far. However, some of the constraints associated with the practical DVS applications have been ignored for simplicity. these constraints include discrete speed, idle power, inefficient speed, and application-specific power characteristics etc. this work targets energy-aware scheduling of periodic real-time tasks on the DVS-equipped multiprocessor systems with practical constraints. An adaptive minimal bound first-fit (AMBFF) algorithm with consideration of these realistic constraints is proposed for both dynamic-priority and fixed-priority multiprocessor scheduling. Simulation results on three commercial processor models show that our algorithm can save significantly more energy than existing algorithms.

关键词： energy optimization task scheduling multiprocessor real-time systems

来源：评论

学校读者我要写书评

暂无评论

A Scheduling Algorithm for Execution-Instant Sensitive real-time systems

A Scheduling Algorithm for Execution-Instant Sensitive Real-...

引用

15th ieee international conference on embedded and real-time computing systems and applications

作者： Farzinvash, Leili Kargahi, Mehdi Univ Tehran Dept Elect & Comp Engn Tehran Iran

ISBN: (纸本)9780769537870

Most of the previous studies on real-time systems focus on the satisfaction of completion-time constraints of jobs. A lot of them consider pure deadline, where the real-time jobs should be completed before their respective deadline. Sonic others consider time/utility functions for their jobs, which specifies the benefit that a job can accrue according to its exact completion time. However, we propose a different type of timing constraints for real-time jobs called Instant Value Function OM. According to IVF, the exact instant where a job is executed affects the value that the job can accrue. therefore, the IVF specifies that which instants are the most appropriate ones to execute the job. this type of timing constraints can express the behavior of specific applications in a more precise manner. Furthermore, we have presented a scheduling algorithm that tries to maximize the accrued value of real-time systems with IVF-constrained jobs. the experimental results show that the proposed method considerably outperforms EDF.

关键词： real-time scheduling Instant Value Function value accrual scheduling

来源：评论

学校读者我要写书评

暂无评论

Allocating Software With Improved Resource Usage and Scheduling For Vehicle Control System Development

Allocating Software With Improved Resource Usage and Schedul...

引用

15th ieee international conference on embedded and real-time computing systems and applications

作者： Wang, Shige Jiang, Shengbing Gen Motors R&D Warren MI 48090 USA

ISBN: (纸本)9780769537870

Allocating software components and messages to computing devices and their interconnecting networks is a great challenge in vehicle control system development. the allocation decisions arc usually made at an early development stage without the implementation details of the computing platform. To produce low-cost products with correct vehicle control, the software allocation must facilitate the final system scheduling with better resource utilization and the presence of platform implementation uncertainties. In this paper, we present an allocation method to improve the resource utilization and scheduling while keeping the decisions independent of delayed platform implementation. Our method determines the allocation using a genetic algorithm with an optimization function combining the peak usage request and the usage request density to minimize the potential contentions on shared resources. the preliminary evaluation using the representative synthetic systems has shown the effectiveness and applicability of the method.

关键词： software allocation heuristic search embedded control vehicle systems

来源：评论

学校读者我要写书评

暂无评论

Task Partitioning and Platform Synthesis for Energy Efficiency

Task Partitioning and Platform Synthesis for Energy Efficien...

引用

15th ieee international conference on embedded and real-time computing systems and applications

作者： Chen, Jian-Jia thiele, Lothar Swiss Fed Inst Technol Comp Engn & Networks Lab TIK Zurich Switzerland

ISBN: (纸本)9780769537870

Energy-efficient and power-aware designs have played important roles in modern computing systems to reduce the power hills for server systems or prolong the lifetime of embedded devices. Moreover systems with multiple heterogeneous processing units have been widely adopted to enhance the computing capability or reduce the power consumption. this work explores how to synthesize a heterogeneous multiprocessor platform or select processing units with the partitioning of. real-time tasks so that the energy consumption is minimized. Given a set of processing unit types, characterized by the power consumption for maintaining activeness and executing jobs, this paper proposes an efficient and effective algorithm to allocate processing units with energy-efficient task partitioning. We show that the algorithm is with a (1 + ln n)-approximation factor in worst cases, for processing unit types with a variety of power consumption models, where n is the number of tasks. the approximation factor is asymptotically optimal for polynomial-time approximation algorithms unless P = NP. Experimental results show that the proposed algorithm is effective for energy consumption minimization.

关键词： Power-aware design Task partitioning Processing unit allocation Platform synthesis real-time embedded systems Heterogeneous processing units

来源：评论

学校读者我要写书评

暂无评论

A real-time Service-Oriented Architecture for Industrial Automation

引用

ieee TRANSACTIONS ON INDUSTRIAL INFORMATICS 2009年第3期5卷 267-277页

作者： Cucinotta, Tommaso Mancina, Antonio Anastasi, Gaetano F. Lipari, Giuseppe Mangeruca, Leonardo Checcozzo, Roberto Rusina, Fulvio Scuola Super Sant Anna Real Time Syst Lab I-56124 Pisa Italy PARADES Scarl I-00168 Rome Italy COMAU Body Welding & Assembly I-10095 Grugliasco To Italy

Industrial automation platforms are experiencing a paradigm shift. New technologies are making their way in the area, including embedded real-time systems, standard local area networks like Ethernet, Wi-Fi and ZigBee, IP-based communication protocols, standard Service Oriented Architectures (SOAs) and Web Services. An automation system will be composed of flexible autonomous components with Plug & Play functionality, self configuration and diagnostics, and autonomic local control that communicate through standard networking technologies. However, the introduction of these new technologies raises important problems that need to be properly solved, one of these being the need to support real-time and quality-of-service (QoS) for real-time applications. this paper describes a SOA enhanced with real-time capabilities for Industrial Automation. the proposed architecture allows for negotiation of the QoS requested by clients from web services, and provides temporal encapsulation of individual activities. this way, it is possible to perform an a priori analysis of the temporal behavior of each service, and to avoid unwanted interference among them. After describing the architecture, experimental results gathered on a real implementation of the framework (which leverages a soft real-time scheduler for the Linux kernel) are presented, showing the effectiveness of the proposed solution. the experiments were performed on simple case studies designed in the context of industrial automation applications.

关键词： Industrial automation real-time embedded systems service-oriented architectures (SOAs)

来源：评论

学校读者我要写书评

暂无评论

Optimal Assignment of real-time systems into Multi-context Dynamically Reconfigurable Processors

Optimal Assignment of Real-time Systems into Multi-context D...

引用

15th ieee international conference on embedded and real-time computing systems and applications

作者： Kitani, Tomoya Nakahashi, Ryo El-Fakih, Khaled Higashino, Teruo Shizuoka Univ Shizuoka 4228529 Japan Osaka Univ Suita Osaka 565 Japan Amer Univ Washington DC 20016 USA

ISBN: (纸本)9780769537870

In this paper, we focus on the problem of implementing a periodic concurrent system with timing constraints into multi-context dynamically reconfigurable processors (DRP). A concurrent system has multiple tasks that can be executed in parallel. Moreover, some tasks in a specific set of processes might be required to synchronize each other. We propose a method for assigning tasks into a multi-context DRP such that timing constraints of the system are satisfied and the size of the program area required on each context for implementing the given system is minimized. We formulate the problem as an ILP problem and propose a heuristic algorithm for solving the ILP problem efficiently. Experimental results and a case study using ubiquitous sensor devices arc given.

关键词： task assignment multi-context dynamically reconfigurable processor ILP formulation heuristic approach

来源：评论

学校读者我要写书评

暂无评论

A Novel Adaptive Scratchpad Memory Management Strategy

A Novel Adaptive Scratchpad Memory Management Strategy

引用

15th ieee international conference on embedded and real-time computing systems and applications

作者： Deng, Ning Ji, Weixing Li, Jiaxin Shi, Feng Wang, Yizhuo Beijing Inst Technol Sch Comp Sci & Technol Beijing 100081 Peoples R China

ISBN: (纸本)9780769537870

Scratchpad Memory (SPM) is a fast and small software-managed SRAM. Its current extensive uses in embedded processors are motivated by the advantages of power saving, small area and low access time compared with cache. However, existing SPM management methods depend heavily on profiling and compilers. the dependence on compiler also makes embedded applications hard to transplant. this paper presents a novel strategy to manage the scratchpad memory without compiler support. Based on the memory reference locality theory, a hardware random sampling module is adopted to dynamically identify the frequently accessed addresses at runtime. the consequential data movement and address redirection are handled by software operation with the assistance of memory management unit (MMU). We evaluate our method on 10 typical embedded applications and compare the results to a cache reference system. Experimental results show that, on average, our scheme can achieve 33.5% reduction in energy consumption with only slight (<1%) decrease in throughput versus the reference system.

关键词： Scratchpad memory virtual memory embedded processor

来源：评论

学校读者我要写书评

暂无评论

On Component-Based Development and High-Integrity real-time systems

On Component-Based Development and High-Integrity Real-Time ...

引用

15th ieee international conference on embedded and real-time computing systems and applications

作者： Panunzio, Marco Vardanega, Tullio Univ Padua Dept Pure & Appl Math I-35121 Padua Italy

ISBN: (纸本)9780769537870

Component-based development approaches are becoming commonplace in business applications: they must therefore have some merit. In striking contrast to that, their penetration in the industrial practice of high-integrity real-time systems is virtually nil. this oddity needs explaining. In this paper we reflect on the presumed reasons of this situation and elaborate on possible systematic remedies. We contend that in order to make it in the high-integrity real-time systems domain, a component-based development approach must be constructed around four fundamental ingredients: a component model, a computational model, a programming model, and a congruent execution platform. Of those four ingredients, the computational model is key to bridging the lack of architectural concerns that afflicts the real-time workload models. We relate the component model to real-time systems theories. We illustrate how those elements could be neatly encased in a development method centred on model-driven engineering. We conclude by noting that the incorporation of component-based development methods, augmented with the cited ingredients, into model-driven engineering promises important savings in the development time and cost and also facilitates the industrial adoption of state-of-the-art techniques off real-time theory.

关键词： Component model Computational model Model-Driven Engineering Composability Compositionality

来源：评论

学校读者我要写书评

暂无评论

Bounding the Maximum Length of Non-Preemptive Regions Under Fixed Priority Scheduling

Bounding the Maximum Length of Non-Preemptive Regions Under ...

引用

15th ieee international conference on embedded and real-time computing systems and applications

作者： Yao, Gang Buttazzo, Giorgio Bertogna, Marko Scuola Super Sant Anna Pisa Italy

ISBN: (纸本)9780769537870

the question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time literature and still some issues remain open. In filet, each approach has advantages and disadvantages, and no one dominates the other when both predictability and efficiency have to be taken into account in the system design. In particular;limiting preemptions allows increasing program locality, making timing analysis more predictable with respect to the Ally preemptive case. In this paper we integrate the features of both preemptive and non-preemptive scheduling by considering that each task can switch to non-preemptive mode, at any time, for a bounded interval. three methods (with different complexity and performance) are presented to calculate the longest non-preemptive interval that can be executed by each task, under fixed priorities, without degrading the schedulability of the task set, with respect to the fully preemptive case. the methods are also compared by simulations to evaluate their effectiveness in reducing the number of preemptions.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

Power-aware Scheduling for Multiple Feasible Interval Jobs

Power-aware Scheduling for Multiple Feasible Interval Jobs

引用

15th ieee international conference on embedded and real-time computing systems and applications

作者： Lin, Jian (Denny) Cheng, Albert M. K. Univ Houston Dept Comp Sci Houston TX 77204 USA

ISBN: (纸本)9780769537870

time-critical jobs in many real-time applications have more than one feasible interval. Such jobs can be executed in any of their feasible intervals. Given a Multiple Feasible Interval (MFI) job set that is schedulable, energy can be saved by carefully selecting the executing interval for each job. In this paper, we explore the energy minimization problem for real-time systems in which jobs have multiple feasible intervals. the static and dynamic energy management schemes are both investigated to minimize the energy consumption while preserving the system's feasibility. Focusing on the EDF scheduling algorithm, we first study reducing the dynamic power consumption. We show that the static optimal speed assignment problem is NP-Hard and propose a Simulated Annealing (SA) based approach to solve it. then, we develop an on-line greedy algorithm to exploit the run-time slacks by "fetching" the eligible job from a hot spot to execute earlier, thus, reducing the dynamic energy consumption. In addition, a leakage-aware version is discussed to improve the overall energy efficiency as well. Simulation results show that all the proposed schemes can achieve significant improvements on energy efficiency while the system remains schedulable.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：