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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,993 篇 会议
32 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

429 篇 real time system...
323 篇 real-time system...
180 篇 embedded systems
137 篇 processor schedu...
105 篇 timing
103 篇 embedded system
102 篇 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,949 篇 英文
75 篇 其他
2 篇 中文

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

共 2026 条记录，以下是1331-1340 订阅

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

详细简洁

排序：

Using SMT to Hide Context Switch times of Large real-time Tasksets

Using SMT to Hide Context Switch Times of Large Real-Time Ta...

引用

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

作者： Jorg Mische Sascha Uhrig Florian Kluge theo Ungerer Department of Computer Science University of Augsburg Germany

theoretical real-time research generally neglects context switch times. But in recent embedded applications which consist of dozens of threads with very short execution times, their impact is too serious to be ignored. We present a hard real-time scheduling algorithm that perfectly hides the context switch times of an arbitrary number of threads. It requires a Simultaneous Multithreaded (SMT) processor with at least two hardware thread slots and achieves a utilisation of 100%. the schedulability test is the same as for Earliest Deadline First (EDF) with a context switch time of zero. the hard real-time threads are executed alternately in the two slots of the processor. the inactive slot is used to unload the preceding thread context to memory and to load the subsequent thread context from memory. By hardware the active slot is completely isolated, in order to avoid any influence of the context switch on the execution of the active thread. this isolation is extensive, hence if further SMT thread slots are available, they can be used to execute threads with lower real-time demands. Even the context switch hardware can be re-used for them, enabling a very high throughput of mixed real-time tasksets.

关键词： Instruction sets Context real time systems Switches Hardware Pipelines Registers

来源：评论

学校读者我要写书评

暂无评论

real-time Activity Recognition in Wireless Body Sensor Networks: From Simple Gestures to Complex Activities

Real-Time Activity Recognition in Wireless Body Sensor Netwo...

引用

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

作者： Liang Wang Tao Gu Hanhua Chen Xianping Tao Jian Lu State Key Laboratory of Novel Software Technology Nanjing University China Department of Mathematics and Computer Science University of Southern Denmark Denmark Services Computing Technology and System Laboratory Huazhong University of Science and Technology China

real-time activity recognition using body sensor networks is an important and challenging task and it has many potential applications. In this paper, we propose a real time, hierarchical model to recognize both simple gestures and complex activities using a wireless body sensor network. In this model, we first use a fast, lightweight template matching algorithm to detect gestures at the sensor node level, and then use a discriminative pattern based real-time algorithm to recognize high-level activities at the portable device level. We evaluate our algorithms over a real-world dataset. the results show that the proposed system not only achieves good performance (an average precision of 94.9%, an average recall of 82.5%, and an average real-time delay of 5.7 seconds), but also significantly reduces the network communication cost by 60.2%.

关键词： real time systems Body sensor networks Acceleration Wireless communication Algorithm design and analysis Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

Exploiting the Interplay between Memory and Flash Storage in embedded Sensor Devices

Exploiting the Interplay between Memory and Flash Storage in...

引用

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

作者： Devesh Agrawal Boduo Li Zhao Cao Deepak Ganesan Yanlei Diao Prashant Shenoy University of Massachusetts Amherst USA

Although memory is an important constraint in embedded sensor nodes, existing embedded applications and systems are typically designed to work under the memory constraints of a single platform and do not consider the interplay between memory and flash storage. In this paper, we present the design of a memory-adaptive flash-based embedded sensor system that allows an application to exploit the presence of flash and adapt to different amounts of RAM on the embedded device. We describe how such a system can be exploited by data-centric sensor applications. Our design involves several novel features: flash and memory-efficient storage and indexing, techniques for efficient storage reclamation, and intelligent buffer management to maximize write coalescing. Our results show that our system is highly energy-efficient under different workloads, and can be configured for embedded sensor platforms with memory constraints ranging from a few kilobytes to hundreds of kilobytes.

关键词： Ash Indexes Memory management Resource management Data structures Construction industry Random access memory

来源：评论

学校读者我要写书评

暂无评论

Necessary and Sufficient Conditions for Non-preemptive Robustness

Necessary and Sufficient Conditions for Non-preemptive Robus...

引用

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

作者： Wing-Chi Poon Aloysius K. Mok VMware Inc. Palo Alto CA USA Department of Computer Sciences University of Texas Austin USA

A real-time scheduler is robust (sustainable) for a certain task set if its schedulability is preserved under lighter system load by the scheduler. the first part of this paper shows that NPr (non-preemptive) robustness of a zero-concrete periodic task set against increase in period is sufficient to guarantee NPr robustness for all variants of the task set. this proof includes the corresponding concrete or non-concrete periodic and sporadic task sets against any kind of reduction in system load. Based on this result, the second part of this paper gives the necessary and sufficient conditions for robustness for both NPr fixed-priority (NPFP) and NPr earliest-deadline first (NPEDF) schedulers under both discrete time and dense time assumption separately.

关键词： Robustness Concrete real time systems TV Load modeling Zero current switching Analytical models

来源：评论

学校读者我要写书评

暂无评论

Combining Prefetch with Instruction Cache Locking in Multitasking real-time systems

Combining Prefetch with Instruction Cache Locking in Multita...

引用

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

作者： Luis C. Aparicio Juan Segarra Clemente Rodríguez Victor Viñals Instituto de Investigación en Ingeniería de Aragón (13A) Universidad de Zaragoza Network of Excellence on High Performance and Embedded Architecture and Compilation (HiPEAC) Spain Dpt. Arquitectura y Tecnología de Computadores Universidad del País Vasco España

In multitasking real-time systems it is required to compute the WCET of each task and also the effects of interferences between tasks in the worst case. this is complex with variable latency hardware usually found in the fetch path of commercial processors. Some methods disable cache replacement so that it is easier to model the cache behavior. Lock-MS is an ILP based method to obtain the best selection of memory lines to be locked in a dynamic locking instruction cache. In this paper we first propose a simple memory architecture implementing the next-line tagged prefetch, specially designed for hard real-time systems. then, we extend Lock-MS to add support for hardware instruction prefetch. Our results show that the WCET of a system with prefetch and an instruction cache with size 5 % of the total code size is better than that of a system having no prefetch and cache size 80 % of the code. We also evaluate the effects of the prefetch penalty on the resulting WCET, showing that a system without prefetch penalties has a worst-case performance 95% of the ideal case. this highlights the importance of a good prefetch design. Finally, the computation time of our analysis method is relatively short, analyzing tasks of 96 KB with 106B paths in less than 3 minutes.

关键词： Prefetching Hardware real time systems Memory management Timing Context

来源：评论

学校读者我要写书评

暂无评论

Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points

Feasibility Analysis under Fixed Priority Scheduling with Fi...

引用

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

作者： Gang Yao Giorgio Buttazzo Marko Bertogna Scuola Superiore Sant'' Anna Pisa Italy

Limited preemption models have been proposed as a viable alternative between the two extreme cases of fully preemptive and non-preemptive scheduling. In particular, allowing preemption to occur only at predefined preemption points reduces context switch costs, simplifies the access to shared resources, and allows more predictable estimations of worst-case execution times. Current results related to such a model, however, exhibit two major deficiencies: (i) the exact response time analysis has a high computational complexity; (ii) the maximum lengths of then on-preemptive regions was not completely investigated in all possible scenarios. In this paper, we address the problem of scheduling a set of real-time tasks having fixed priorities and fixed preemption points. In particular, under specific but not restrictive assumptions we simplified the feasibility analysis and proposed an efficient feasibility test. Finally, an algorithm for computing the maximum length of fixed non-preemptive regions for each task is described, and some simulation experiments are presented to validate the proposed approach.

关键词： time factors Computational modeling Processor scheduling Analytical models Switches real time systems Context

来源：评论

学校读者我要写书评

暂无评论

Semi-Fixed-Priority Scheduling: New Priority Assignment Policy for Practical Imprecise Computation

Semi-Fixed-Priority Scheduling: New Priority Assignment Poli...

引用

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

作者： Hiroyuki Chishiro Akira Takeda Kenji Funaoka Nobuyuki Yamasaki School of Science for Open and Environment Systems Keio University Yokohama Japan Toshiba Corporation Japan

this paper proposes semi-fixed-priority scheduling to achieve both low-jitter and high schedulability. Semi-fixed-priority scheduling is for the extended imprecise computation model, which has a wind-up part as a second mandatory part and schedules the part of each extended imprecise task with fixed-priority. this paper also proposes a novel semi-fixed-priority scheduling algorithm based on Rate Monotonic (RM), called Rate Monotonic with Wind-up Part (RMWP). RMWP limits executable ranges of wind-up parts to minimize jitter. the schedulability analysis proves that one task set is feasible by RMWP if the task set is feasible by RM. Simulation results show that RMWP has both lower jitter and higher schedulability than RM.

关键词： Computational modeling Processor scheduling Jitter Adaptation model Interference real time systems Schedules

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： Risat Mahmud Pathan Jan Jonsson Chalmers University of Technology Goteborg Sweden

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.

关键词： Fault tolerant systems Silicon Software Transient analysis Redundancy real time systems

来源：评论

学校读者我要写书评

暂无评论

Sensitivity Analysis for EDF Scheduled Arbitrary Deadline real-time systems

Sensitivity Analysis for EDF Scheduled Arbitrary Deadline Re...

引用

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

作者： Fengxiang Zhang Alan Burns Sanjoy Baruah Southwest University Chongqing China University of York York UK North Carolina State University Chapel Hill USA

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.

关键词： Sensitivity analysis real time systems Upper bound Processor scheduling Algorithm design and analysis Electric breakdown Batteries

来源：评论

学校读者我要写书评

暂无评论

Towards Pervasive Mashups in embedded Devices

Towards Pervasive Mashups in Embedded Devices

引用

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

作者： Tommi Mikkonen Arto Salminen Department of Software Systems Tampere University of Technology Tampere Finland

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.

关键词： Mashups Global Positioning System Browsers Mobile handsets Sockets Mobile communication Runtime environment

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共203页 << < 130 131 132 133 134 135 136 137 138 139 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：