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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,168 篇 会议
25 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

1,361 篇 工学
- 1,219 篇 计算机科学与技术...
- 606 篇 软件工程
- 485 篇 电气工程
- 196 篇 信息与通信工程
- 177 篇 控制科学与工程
- 70 篇 电子科学与技术（可...
- 56 篇 动力工程及工程热...
- 48 篇 网络空间安全
- 41 篇 机械工程
- 33 篇 交通运输工程
- 32 篇 安全科学与工程
- 31 篇 仪器科学与技术
- 29 篇 生物工程
- 19 篇 建筑学
- 17 篇 生物医学工程（可授...
- 15 篇 光学工程
- 15 篇 土木工程
- 11 篇 环境科学与工程（可...
- 8 篇 石油与天然气工程
177 篇 管理学
- 156 篇 管理科学与工程(可...
- 99 篇 工商管理
- 35 篇 图书情报与档案管...
171 篇 理学
- 86 篇 数学
- 33 篇 系统科学
- 32 篇 物理学
- 32 篇 生物学
- 13 篇 统计学（可授理学、...
- 11 篇 化学
22 篇 法学
- 21 篇 社会学
11 篇 经济学
- 11 篇 应用经济学
10 篇 医学
8 篇 军事学
6 篇 农学
3 篇 教育学
1 篇 文学

主题

432 篇 real time system...
351 篇 real-time system...
196 篇 embedded systems
143 篇 processor schedu...
115 篇 embedded system
107 篇 hardware
106 篇 timing
97 篇 computational mo...
82 篇 computer archite...
80 篇 embedded computi...
74 篇 resource managem...
74 篇 energy consumpti...
68 篇 control systems
66 篇 computer science
66 篇 protocols
65 篇 scheduling algor...
64 篇 delay
60 篇 schedules
60 篇 program processo...
60 篇 scheduling

机构

10 篇 department of co...
8 篇 city university ...
7 篇 department of co...
7 篇 college of compu...
7 篇 eindhoven univer...
7 篇 malardalen univ ...
6 篇 department of co...
6 篇 department of co...
6 篇 uppsala universi...
6 篇 malardalen univ ...
6 篇 department of co...
5 篇 department of co...
5 篇 evidence srl pis...
5 篇 chongqing univ c...
5 篇 information and ...
5 篇 department of co...
5 篇 scuola super san...
5 篇 department of co...
5 篇 univ york dept c...
5 篇 mälardalen unive...

作者

15 篇 nolte thomas
14 篇 thomas nolte
12 篇 jian-jia chen
12 篇 tei-wei kuo
12 篇 anderson james h...
11 篇 james h. anderso...
10 篇 nakajima tatsuo
10 篇 chen jian-jia
9 篇 nobuyuki yamasak...
8 篇 dakai zhu
8 篇 tovar eduardo
8 篇 chun jason xue
8 篇 shao zili
8 篇 cheng albert m. ...
8 篇 nan guan
8 篇 wei zhang
7 篇 shinpei kato
7 篇 kato shinpei
7 篇 kuo tei-wei
7 篇 xue chun jason

语言

2,182 篇 英文
11 篇 其他
1 篇 中文

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

共 2194 条记录，以下是191-200 订阅

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

详细简洁

排序：

An Experimental Evaluation of the Cache Partitioning Impact on Multicore real-time Schedulers

An Experimental Evaluation of the Cache Partitioning Impact ...

引用

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

作者： Gracioli, Giovani Froehlich, Antonio Augusto Univ Fed Santa Catarina Software Hardware Integrat Lab Florianopolis SC Brazil

ISBN: (纸本)9781479908516

Shared cache partitioning is a well-known technique used in multicore real-time systems to isolate task workloads and improve system predictability. Presently, the state-of-the-art studies that evaluate shared cache partitioning on multicore processors lack two key issues. First, the cache partitioning mechanism is typically implemented either in a simulation environment or in a general-purpose OS, and so the impact of kernel activities, such as interrupt handlers and context switching, on the task partitions tend to be overlooked. Second, the evaluation is typically restricted to either a global or partitioned scheduler, thereby by falling to compare the performance of cache partitioning when tasks are scheduled by different schedulers. In this work, we design and implement a shared cache partitioning mechanism in a multicore component-based RTOS capable of assigning partitions to internal OS data structures, including task and system stacks and interrupt handlers data. We evaluate our shared cache partitioning mechanism running task sets under global (G-EDF) and partitioned (P-EDF) mIllticore real-time scheduling algorithms. Our results indicate that a lightweight RTOS does not impact real-time tasks, and shared cache partitioning has different behavior depending on the scheduler and the task's working set size.

关键词： shared cache partitioning real-time operating systems global scheduling partitioned scheduling

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Regularity-Based real-time Virtual Resources 25

Fault-Tolerant Regularity-Based Real-Time Virtual Resources

引用

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

作者： Cheng, Albert M. K. Dai, Guangli Paluri, Pavan Kumar Ansari, Mansoor Knape, Darrel Li, Yu Univ Houston Dept Comp Sci Houston TX 77004 USA Houston Mechatron Webster TX 77598 USA Virginia Tech Blacksburg VA 24060 USA

ISBN: (纸本)9781728131979

Many safety-critical applications employ embedded real-time systems where both timing and fault tolerance requirements must be continually satisfied. the Regularity-based Resource Partition Model (RRP), which is known for its code level independence between resource level and task level, is used to schedule resource partitions in virtualized real-time systems. this paper presents a fault tolerance model for Regularity-based real-time Virtual Resources to recover from transient hardware faults without modifying user applications. the proposed framework consists of a checkpointing mechanism called Fault-Tolerant RRP with a checkpointing partition followed by a redundancy partition prepared for re-execution to satisfy task deadlines despite the occurrence of faults. the frequency of checkpoints and the number of time slices in the redundancy partition are parameterized by the fault rate of the hardware resource and the sum of the availability factors of the original partition sets. Extensive theoretical analysis and simulation-based experiments show the effectiveness of the proposed framework while incurring minimal overhead.

关键词： Task analysis Fault tolerance Fault tolerant systems real-time systems Checkpointing Transient analysis Schedules

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Generalized Standby-Sparing Techniques for Energy-Efficient Fault Tolerance in Multiprocessor real-time systems

Generalized Standby-Sparing Techniques for Energy-Efficient ...

引用

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

作者： Guo, Yifeng Zhu, Dakai Aydin, Hakan Univ Texas San Antonio San Antonio TX 78249 USA George Mason Univ Fairfax VA 22030 USA

ISBN: (纸本)9781479908509

the Standby-Sparing (SS) technique has been previously explored to improve energy efficiency while providing fault tolerance in dual-processor real-time systems. In this paper, by considering both transient and permanent faults, we develop energy-efficient fault tolerance techniques for real-time systems deploying an arbitrary number of identical processors. First, we study the Paired-SS technique, where processors are organized as groups of two (i.e., pairs) and SS is applied within each pair of processors directly after partitioning tasks to the pairs. then, we propose a Generalized-SS technique that partitions processors into two groups containing primary and secondary processors, respectively. the main and backup copies of tasks are executed on the primary and secondary processors under the partitioned-EDF and partitioned-EDL scheduling policies, respectively. the objective is to reduce the overlapped executions of the main and backup copies in order to improve energy savings. Our experimental evaluations show that, for a given system with fixed number of processors, typically there exists a configuration of primary and secondary processors under the Generalized-SS technique that can lead to better energy savings when compared to the Paired-SS technique.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

Towards an analysis of garbage collection techniques for embedded real-time Java systems

Towards an analysis of garbage collection techniques for emb...

引用

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

作者： Higuera-Toledano, M. Teresa Univ Complutense Madrid Fac Informat DACYA E-28040 Madrid Spain

ISBN: (纸本)0769526764

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 embedded real-time systems.

关键词： Java embedded real-time write barriers memory management garbage collection

来源：评论

学校读者我要写书评

暂无评论

Optimal Recharging of Teams of Mobile Robots 27

Optimal Recharging of Teams of Mobile Robots

引用

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

作者： Vu, Anh-Duy Bonakdarpour, Borzoo Ford Motor Co Oakville ON Canada Michigan State Univ Dept Comp Sci & Engn E Lansing MI USA

ISBN: (纸本)9781665441889

In this paper, we propose an approach to extend the operational time of teams of battery-based robots by introducing a set of charging stations. We assume that the robots are heterogeneous (having different energy limits and being able to service different types of customers) and have access to a priori known map of the environment. the map is modeled as a directed, connected, and finite graph whose nodes are charging stations or customers, and arcs denote the possibility of traveling. To this end, we first formulate a task assignment and path planning problem that aims at optimizing energy consumption as well as the time needed to complete the tasks, including the time spent for recharging. Next, we propose four offline optimization techniques and one online algorithm, where the robots can dynamically adjust their paths in response to the presence of uncertainties imposed by the physical environment. Our proposed algorithms are validated through both simulation and a real-world case study on a team of unmanned aerial vehicles (UAVs) performing a joint search mission.

关键词： Energy consumption Uncertainty Heuristic algorithms Charging stations Unmanned aerial vehicles real-time systems Path planning

来源：评论

学校读者我要写书评

暂无评论

Improving OCBP-based Scheduling for Mixed-Criticality Sporadic Task systems

Improving OCBP-based Scheduling for Mixed-Criticality Sporad...

引用

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

作者： Gu, Chuancai Guan, Nan Deng, Qingxu Yi, Wang Northeastern Univ Shenyang Peoples R China Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781479908509

Scheduling mixed-criticality systems is a challenging problem. Recently a number of new techniques are developed to schedule such systems, among which an approach called OCBP has shown interesting properties and drawn considerable attentions. OCBP explores the job-level priority order in a very flexible manner to drastically improve the system schedulability. However, the job priority exploration in OCBP involves nontrivial overheads. In this work, we propose a new algorithm LPA (Lazy Priority Adjustment) based on the OCBP approach, which improves the state-of-the-art OCBP-based scheduling algorithm PLRS in both schedulability and run-time efficiency. Firstly, while the time-complexity of PLRS' online priority management is quadratic, our new algorithm LPA has linear time-complexity at run-time. Secondly, we present an approach to calculate tighter upper bounds of the busy period size, and thereby can greatly reduce the run-time space requirement. thirdly, the tighter busy period size bounds also improve the schedulability in terms of acceptance ratio. Experiments with synthetic workloads show improvements of LPA in all the above three aspects.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Dependable TCB based on the Cell Broadband Engine™Isolation Facility

Dependable TCB based on the Cell Broadband Engine™Isolation...

引用

1st international Workshop on Cyber-Physical systems, Networks, and applications (CPSNA) held during 17th ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Murase, Masana Tokuda, Hideyuki Keio Univ IBM Res Tokyo IBM Japan Ltd Grad Sch Media & Governance Keio Japan Keio Univ Fac Environm & Informat Studies Tokyo Japan

ISBN: (纸本)9780769545028

A Trusted computing Base (TCB) such as a Trusted Platform Module (TPM) or a Mobile Trusted Module plays an essential role for security and privacy applications in embedded systems such as cell phones, smart sensors, and actuators. However, existing hardware-based TCBs lack flexibility for function updates, bug fixes, and feature updates. In this paper, we present a dependable TCB on a Cell Broad-band Engine (TM) processor by providing a hardware and software hybrid TPM. Unlike prior approaches, we provide three new features: (1) TPM functions are implemented in software running in memory isolated by hardware, (2) our software TPM is launched and establishes a chain of trust from the hardware using a secure boot method, and (3) a new TPM command provides dynamic patching to the running software TPM and secure code overlays for the efficient use of the limited resources. We show the feasibility of this hybrid implementation of the TPM by assessing its performance and security properties.

关键词： Cell Broadband Engine embedded system security SPE isolation mode Trusted Platform Module

来源：评论

学校读者我要写书评

暂无评论

Global Semi-Fixed-Priority Scheduling on Multiprocessors

Global Semi-Fixed-Priority Scheduling on Multiprocessors

引用

作者： Chishiro, Hiroyuki Yamasaki, Nobuyuki Keio Univ Sch Sci & Technol Yokohama Kanagawa Japan

ISBN: (纸本)9780769545028

Current real-time systems such as robots have multiprocessors and the number of processors tends to be increased. In order to achieve these real-time systems, global real-time scheduling has been required. Many real-time scheduling algorithms are usually based on Liu and Layland's model. Compared to Liu and Layland's model, the imprecise computation model is one of the techniques to overcome the gap between theory and practice. Semi-fixed-priority scheduling is part-level fixed-priority scheduling in the extended imprecise computation model, which has a second mandatory part to terminate an optional part. Unfortunately, current semi-fixed-priority scheduling is only adapted to uniprocessors. this paper presents a global semi-fixed-priority scheduling algorithm, called Global Rate Monotonic with Wind-up Part (G-RMWP). G-RMWP calculates the optional deadline, the termination time of each optional part, by Response time Analysis for Global Rate Monotonic (G-RM). the schedulability analysis shows that one task set is schedulable by G-RMWP if the task set is schedulable by G-RM. Simulation results show that G-RMWP has higher schedulability than G-RM.

关键词： Imprecise Computation Multiprocessor systems real-time Scheduling Semi-Fixed-Priority Scheduling

来源：评论

学校读者我要写书评

暂无评论

An Open-World time-Series Sensing Framework for embedded Edge Devices 28

An Open-World Time-Series Sensing Framework for Embedded Edg...

引用

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

作者： Bukhari, Abdulrahman Hosseinimotlagh, Seyedmehdi Kim, Hyoseung Univ Calif Riverside Riverside CA 92521 USA

ISBN: (数字)9781665453448

ISBN: (纸本)9781665453448

the rapid advancement of IoT technologies has generated much interest in the development of learning-based sensing applications on embedded edge devices. However, these efforts are being challenged by the need to adapt to unforeseen conditions in an open-world environment. Updating a learning model suffers from the lack of training data as well as the high computational demand beyond that available on edge devices. In this paper, we propose an open-world time-series sensing framework for making inferences from time-series sensor data and achieving incremental learning on an embedded edge device with limited resources. the proposed framework is able to achieve two essential tasks, inference and learning, without requiring access to a powerful cloud server. We discuss the design choices made to ensure satisfactory learning performance and efficient resource usage. Experimental results demonstrate the ability of the system to incrementally adapt to unforeseen conditions and to effectively run on a resource-constrained device.

关键词： IoT embedded edge devices time-series sensing open-world learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共220页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：