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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,990 篇 会议
32 篇 期刊文献
1 册 图书

馆藏范围

2,023 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,268 篇 工学
- 1,122 篇 计算机科学与技术...
- 546 篇 软件工程
- 495 篇 电气工程
- 185 篇 控制科学与工程
- 151 篇 信息与通信工程
- 58 篇 电子科学与技术（可...
- 53 篇 动力工程及工程热...
- 37 篇 机械工程
- 31 篇 仪器科学与技术
- 22 篇 生物工程
- 22 篇 安全科学与工程
- 16 篇 光学工程
- 16 篇 交通运输工程
- 16 篇 生物医学工程（可授...
- 12 篇 网络空间安全
- 10 篇 航空宇航科学与技...
- 9 篇 力学（可授工学、理...
- 8 篇 建筑学
177 篇 管理学
- 154 篇 管理科学与工程(可...
- 83 篇 工商管理
- 37 篇 图书情报与档案管...
153 篇 理学
- 83 篇 数学
- 31 篇 系统科学
- 30 篇 物理学
- 25 篇 生物学
- 19 篇 统计学（可授理学、...
- 12 篇 化学
19 篇 医学
- 17 篇 临床医学
- 9 篇 基础医学(可授医学...
11 篇 经济学
- 11 篇 应用经济学
7 篇 法学
4 篇 农学
3 篇 军事学
2 篇 教育学
1 篇 文学

主题

429 篇 real time system...
321 篇 real-time system...
180 篇 embedded systems
137 篇 processor schedu...
105 篇 timing
103 篇 embedded system
101 篇 hardware
90 篇 computational mo...
82 篇 embedded computi...
74 篇 computer archite...
72 篇 resource managem...
68 篇 protocols
68 篇 delay
62 篇 scheduling algor...
62 篇 energy consumpti...
61 篇 program processo...
59 篇 computer science
58 篇 scheduling
57 篇 control systems
56 篇 application soft...

机构

9 篇 department of co...
8 篇 college of compu...
8 篇 city university ...
7 篇 department of co...
6 篇 department of co...
6 篇 department of co...
6 篇 malardalen univ ...
6 篇 uppsala universi...
6 篇 department of co...
6 篇 mälardalen unive...
5 篇 department of co...
5 篇 chongqing univ c...
5 篇 mälardalen real-...
5 篇 northeastern uni...
5 篇 ieee
5 篇 information and ...
5 篇 department of co...
5 篇 scuola super san...
5 篇 department of co...
5 篇 malardalen univ ...

作者

16 篇 thomas nolte
16 篇 nolte thomas
12 篇 jian-jia chen
12 篇 anderson james h...
11 篇 tei-wei kuo
11 篇 james h. anderso...
10 篇 nakajima tatsuo
10 篇 chen jian-jia
9 篇 nobuyuki yamasak...
8 篇 tovar eduardo
8 篇 chun jason xue
8 篇 nan guan
7 篇 shinpei kato
7 篇 kato shinpei
7 篇 dakai zhu
7 篇 kuo tei-wei
7 篇 xue chun jason
7 篇 tatsuo nakajima
7 篇 cheng albert m. ...
6 篇 bril reinder j.

语言

1,961 篇 英文
60 篇 其他
2 篇 中文

检索条件"任意字段=13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications"

共 2023 条记录，以下是1241-1250 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Generalizing Response-time Analysis

Generalizing Response-Time Analysis

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Pollex, Victor Kollmann, Steffen Slomka, Frank Ulm Univ Inst Embedded Syst Real Time Syst Ulm Germany

ISBN: (纸本)9780769541556

In real-time theory, basically two approaches for the computation of response-times exist. One of them is the busy window method, the other is the real-time calculus, an extension of the network calculus. While both can be used to compute the bounds of response-times, they have different properties that make them suitable for different system architectures. the busy window approach on the one hand is able to obtain tight bounds for scheduling policies like round-robin. It is also capable of considering offsets, therefore delivering better results in the relevant cases. Hierarchical scheduling on the other hand can be better accounted for by the real-time calculus, where this is an inherent feature of the underlying concept. the approach we present in this paper takes the theory of hierarchy from the real time calculus and uses it to generalize the response-time analysis. this is implemented as an extension of the busy window method, which enables it to analyze scheduling hierarchies of an arbitrary depth.

关键词： hierarchical scheduling real-time analysis real-time analysis time series analysis Reaction time Calculus Calculi window method Social Hierarchy real time

来源：评论

学校读者我要写书评

暂无评论

Sensitivity Analysis for EDF Scheduled Arbitrary Deadline real-time systems

Sensitivity Analysis for EDF Scheduled Arbitrary Deadline Re...

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Zhang, Fengxiang Burns, Alan Baruah, Sanjoy Southwest Univ Chongqing Peoples R China Univ York York N Yorkshire England Univ N Carolina Chapel Hill NC USA

ISBN: (纸本)9780769541556

the correctness of a real-time system depends on not only the system's output but also on the time at which results are produced. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set it is useful to know what is the minimum speed of the processor that will deliver a schedulable system. It is also beneficial in an engineering context to know what changes to computation time can be made to a task that will result in a system that is borderline schedulable. In this paper, we address the sensitivity analysis (parameter calculations) for task execution times and speed of the processor for EDF-scheduled systems on a uniprocessor. We prove that an optimal (minimum or maximum) task parameter can be determined by a single pass of the QPA algorithm. this algorithm provides efficient and exact sensitivity analysis for arbitrary deadline real-time systems. the approaches developed for task parameter computations are therefore as efficient as QPA, and are easily incorporated into a system design support tool.

关键词： embedded systems performance and reliability real-time systems scheduling analysis real-time systems embedded systems Sensitivity analysis Interleukin-5 European Development Fund schedule analysis hard real-time system minimal speed PROCESSOR Uniprocessor

来源：评论

学校读者我要写书评

暂无评论

Towards a Cache-aware Development of High Integrity real-time systems

Towards a Cache-aware Development of High Integrity Real-tim...

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Mezzetti, Enrico Vardanega, Tullio Univ Padua Dept Pure & Appl Math Padua Italy

ISBN: (纸本)9780769541556

the job description of caches is to speed up memory accesses in the average case. their intrinsic unpredictability however can seriously hamper the practicality and trustworthiness of system analysis and validation. In effect, this conflict asks system designers to take side between best average-case performance and maximum assurance, since both can't be had. In this paper we study the I-cache predictability problem from a system-level perspective. We identify some sources of cache-related variability that can be addressed whilst considering the architectural specification of the system and thus at an early stage of development. We discuss an example of what we call a "cache-aware" software architecture and experimentally evaluate its effectiveness on a representative application.

关键词： Timing analysis caches WCET software architectures

来源：评论

学校读者我要写书评

暂无评论

real-time Communication for Multicore systems with Multi-domain Ring Buses

Real-time Communication for Multicore Systems with Multi-dom...

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Bui, Bach D. Pellizzoni, Rodolfo Chivukula, Deepti K. Caccamo, Marco Univ Illinois Dept Comp Sci Champaign IL 61820 USA

ISBN: (纸本)9780769541556

We address the problem of scheduling real-time data transactions on a multicore processor bus. In particular, to increase system predictability and tighten WCET estimation, we propose to employ a software-controllable Multi-Domain Ring Bus (MDRB) architecture. the problem of scheduling periodic real-time transactions on MDRB is challenging because the bus allows multiple non-overlapping transactions to be executed concurrently, and because the degree of concurrency depends on the topology of the bus and of executed transactions. We propose a practical abstraction mechanism for the scheduling problem together with two novel scheduling algorithms. the first algorithm is optimal for transaction sets under restrictive assumptions while the second one induces a competitive sufficient schedulable utilization bound for more general transaction sets.

关键词： Multi-domain ring bus real-time scheduling real-time systems WCET estimation abstraction mechanism multicore processor bus multidomain ring buses architecture multiprocessing systems periodic real-time transaction scheduling processor scheduling real-time communication real-time data transaction scheduling real-time systems system predictability

来源：评论

学校读者我要写书评

暂无评论

Exact Fault-Tolerant Feasibility Analysis of Fixed-Priority real-time Tasks

Exact Fault-Tolerant Feasibility Analysis of Fixed-Priority ...

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Pathan, Risat Mahmud Jonsson, Jan Chalmers Univ Technol SE-41296 Gothenburg Sweden

ISBN: (纸本)9780769541556

In this paper, a necessary and sufficient (exact) feasibility test is proposed for fixed-priority scheduling of a periodic task set to tolerate multiple faults on uniprocessor. We consider a fault model such that multiple faults can occur in any task and at any time, even during recovery operations. the proposed test considers tolerating a maximum of f faults that can occur within any time interval equal to the largest relative deadline of the task set. the feasibility of the task set is checked based on the maximum workload requested by the higher-priority jobs within the released time and deadline of the job of each task that is released at the critical instant. the maximum workload is calculated using a novel technique to compose the execution time of the higher-priority jobs. To the best of our knowledge, no other work (assuming the same fault model as ours) has derived an exact feasibility test for periodic task sets having a lower time complexity than that of the test proposed in this paper.

关键词： real-time systems real-time scheduling transient faults fault-tolerance exact feasibility analysis

来源：评论

学校读者我要写书评

暂无评论

Modeling of real-time System Designs for Parametric Analysis

Modeling of Real-Time System Designs for Parametric Analysis

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Sathawornwichit, Chaiwat Aoki, Toshiaki Katayama, Takuya Japan Adv Inst Sci & Technol Nomi Ishikawa 9231292 Japan

ISBN: (纸本)9780769541556

In designing realtime software, system designers need to find out the time budget to allocate to each action of realtime tasks so that the tasks can meet their deadlines. Our solution to this problem involves representing the execution time of the actions as parameters, then analyzing the collaborative behavior of those realtime tasks. this paper proposes parametric timed models of realtime tasks whose executions are controlled by a scheduler. We develop an algorithm to synthesize a coherent model which represents the possible behavior from a set of realtime tasks by exhaustively searching their reachable states. A set of linear inequalities are then derived on the fly from the synthesized model as the condition of parameters for schedulability. By solving the inequalities using a constraint solver, we can obtain desirable values of the parameters. In addition, we have implemented the algorithm in a tool and conducted some experiments to show the effectiveness of our approach.

关键词： model checking model composition modeling parameter synthesis parametric analysis real-time system design schedulability time parameter Parametric analysis time parameters Model checking real-time systems Modeling Religious Missions time budget

来源：评论

学校读者我要写书评

暂无评论

A Library-based Tool to Improve CPU Assignment for Multicore Processor-based Pervasive Servers

A Library-based Tool to Improve CPU Assignment for Multicore...

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Ohno, Yuki Akioka, Sayaka Sugaya, Midori Nakajima, Tatsuo Waseda Univ Dept Comp Sci & Engn Shinjuku Ku 3-4-1 Okubo Tokyo 1698555 Japan

ISBN: (纸本)9780769541556

this paper proposes SPLiT (Scalable Performance Library Tool) as the methodology to improve performance of applications on multicore processors, through CPU, and cache optimizations. SPLiT analyzes applications based on cycle counts, and cache misses, and predicts behavior of the applications according to the analysis. With these acquired knowledge on the target application, SPLiT improves CPU resource allocation determined by operating systems. SPLiT, and SPLiT library are designed to achieve resource optimizations based on the combination of hardware information collected by Operating System kernel, and software information collected by applications. Additionally, all the features of SPLiT are immediately available with the small modifications to the application source codes, and the modifications are basically to implant SPLiT library calls into the source code. this simple requirement diminishes programmers' difficulties for performance tuning of multicore applications. through empirical experiments, we validated the efficiency of SPLiT, and observed that performance of the web application was improved by 26%.

关键词： Multi-core processors central processing units web applications Operating systems Source code Servers Libraries Cache memory

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Scheduling for real-time embedded systems with QoS Guarantee

Energy Efficient Scheduling for Real-Time Embedded Systems w...

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Niu, Linwei Claflin Univ Dept Math & Comp Sci Orangeburg SC 29115 USA

ISBN: (纸本)9780769541556

While the dynamic voltage scaling (DVS) techniques are efficient in reducing the dynamic energy consumption for the processor, varying voltage alone becomes less effective for the overall energy reduction as the static power is growing rapidly. On the other hand, Quality of Service (QoS) is also a primary concern in the development of today's pervasive computing systems. In this paper, we propose a dynamic approach to minimize the overall energy consumption for soft real-time systems while ensuring the QoS-guarantee. the QoS requirements are deterministically quantified with the window-constraints, which require that at least m out of each non-overlapped window of k consecutive jobs of a task meet their deadlines. Necessary and sufficient conditions for checking the feasibility of task sets with arbitrary service times and periods are developed to ensure that the window-constraints can be guaranteed in the worst case. And efficient scheduling techniques based on pattern variation and dynamic slack reclaiming extensions are proposed to combine the task procrastination and dynamic slowdown to minimize the energy consumption. In contrast to the previous leakage-aware slack reclaiming work which never scales the job speed below the critical speed, we will show that it can be more energy efficient to reclaim the slack with speed lower than the critical speed when necessary. through extensive simulations, our experiment results demonstrate that the proposed techniques significantly outperformed the previous research in both overall and idle energy reduction.

关键词： Energy conservation energy consumption Quality of service critical velocity Pulverized coal Energy efficiency soft real-time system embedded systems real-time systems

来源：评论

学校读者我要写书评

暂无评论

Towards Pervasive Mashups in embedded Devices

Towards Pervasive Mashups in Embedded Devices

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Mikkonen, Tommi Salminen, Arto Tampere Univ Technol Dept Software Syst POB 553 FIN-33101 Tampere Finland

ISBN: (纸本)9780769541556

the Web has become pervasive. this has led to a paradigm shift, where applications live on the Web as services, where they can be accessed using terminals of different types, such as regular computers, mobile devices, game consoles, and so on. the ability to dynamically combine data, code and other content from numerous web sites all over the world, and the ability to instantly publish services worldwide has opened up entirely new possibilities for software development. Such applications, referred to as mashups, are content aggregates that leverage the power of the Web to support instant, worldwide sharing of content. Unfortunately, for various reasons, the browser that is commonly used as the run-time environment of mashups is inadequate for hosting complex applications, in particular when considering embedded devices and subsystems that are not readily available in the web. In this paper, we introduce a runtime environment, intended for embedded devices, that is able to host mashups that combine data from the web and device specific peripherals, thus enabling context-aware mashups. As an example, we describe a mashup that combines map data from an existing map service and GPS data available from an external system.

关键词： Mobile runtime mashup environment embedded devices

来源：评论

学校读者我要写书评

暂无评论

A Type-theoretic Framework for Efficient and Safe Colocation of Periodic real-time systems

A Type-Theoretic Framework for Efficient and Safe Colocation...

引用

16th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Ishakian, Vatche Bestavros, Azer Kfoury, Assaf Boston Univ Dept Comp Sci 111 Cummington St Boston MA 02215 USA

ISBN: (纸本)9780769541556

Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. the mapping between what constitutes desirable performance and SLAs is not unique: multiple SLA expressions might be functionally equivalent. Having the flexibility to transform SLAs from one form to another in a manner that is provably safe would enable hosting solutions to achieve significant efficiencies. this paper demonstrates the promise of such an approach by proposing a type-theoretic framework for the representation and safe transformation of SLAs. Based on that framework, the paper describes a methodical approach for the inference of efficient and safe mappings of periodic, real-time tasks to the physical and virtual hosts that constitute a hierarchical scheduler. Extensive experimental results support the conclusion that the flexibility afforded by safe SLA transformations has the potential to yield significant savings.

关键词： real-time Type-theoretic colocation Co-location SLA gene Safes Flexibility real time functionally equivalent real-time systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共203页 << < 121 122 123 124 125 126 127 128 129 130 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：