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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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
67 篇 delay
62 篇 scheduling algor...
62 篇 energy consumpti...
61 篇 program processo...
59 篇 computer science
57 篇 control systems
57 篇 scheduling
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 条记录，以下是1321-1330 订阅

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

详细简洁

排序：

Generalizing Response-time Analysis

Generalizing Response-Time Analysis

引用

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

作者： Victor Pollex Steffen Kollmann Frank Slomka Institute of Embedded Systems Real-Time Systems Ulm University Germany

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.

关键词： real time systems Calculus time factors Scheduling Processor scheduling Computational modeling Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerant Scheduling on Controller Area Network (CAN)

Fault Tolerant Scheduling on Controller Area Network (CAN)

引用

ieee international Symposium on Object/Component/Service-Oriented real-time Distributed computing Workshops (ISORCW)

作者： Hüseyin Aysan Radu Dobrin Sasikumar Punnekkat Mälardalen Real-Time Research Centre Mälardalen University Vasteras Sweden

Dependable communications is becoming a critical factor due to the pervasive usage of networked embedded systems that increasingly interact with human lives in one way or the other in many real-time applications. though many smaller systems are providing dependable services employing uniprocesssor solutions, stringent fault containment strategies etc., these practices are fast becoming inadequate due to the prominence of COTS in hardware and component based development (CBD) in software as well as the increased focus on building 'system of systems'. Hence the repertoire of design paradigms, methods and tools available to the developers of distributed real-time systems needs to be enhanced in multiple directions and dimensions. In future scenarios, potentially a network needs to cater to messages of multiple criticality levels (and hence varied redundancy requirements) and scheduling them in a fault-tolerant manner becomes an important research issue. We address this problem in the context of Controller Area Network (CAN), which is widely used in automotive and automation domains, and describe a methodology which enables the provision of appropriate scheduling guarantees. the proposed approach involves definition of fault-tolerant windows of execution for critical messages and the derivation of message priorities based on earliest deadline first (EDF).

关键词： Fault tolerance real time systems Communication system control embedded system Humans Application software Hardware Buildings Design methodology Redundancy

来源：评论

学校读者我要写书评

暂无评论

Wi-Fi Fingerprint-Based Topological Map Building for Indoor User Tracking

Wi-Fi Fingerprint-Based Topological Map Building for Indoor ...

引用

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

作者： Hyojeong Shin Hojung Cha Department of Computer Science Yonsei University Seoul South Korea

Estimating the geographical position of mobile device such as Smart phone in an indoor environment is not easy without the use of specific infrastructures. In this article, we introduce an indoor user tracking system. the system constructs a topological map with Wi-Fi signal calibrations, assigns semantically meaningful labels into the map, and estimates the semantic location of the user based on the current Wi-Fi observation. the system does not require a geometric map, or costly radio map building process. We implemented the system with the off-the-shelf Smart phone and experimentally validated the scheme.

关键词： ieee 802.11 Standards Simultaneous localization and mapping Fingerprint recognition Calibration Mobile handsets Buildings

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： Bach D. Bui Rodolfo Pellizzoni Deepti K. Chivukula Marco Caccamo Department of Computer Science University of Illinois Urbana-Champaign Urbana-Champaign USA

We address the problem of scheduling real-time data transactions on a multicore processor bus. In particular, to in-crease 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.

关键词： real time systems Schedules Scheduling Scheduling algorithm Multicore processing

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： Vatche Ishakian Azer Bestavros Assaf Kfoury Computer Science Department Boston University USA

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.

关键词： Resource management real time systems Schedules Processor scheduling USA Councils Computer science Transforms

来源：评论

学校读者我要写书评

暂无评论

Dynamic Binding and Scheduling of Firm-Deadline Tasks on Heterogeneous Compute Resources

Dynamic Binding and Scheduling of Firm-Deadline Tasks on Het...

引用

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

作者： Hsiang-Kuo Tang Kyle Rupnow Parmesh Ramanathan Katherine Compton Electrical and Computer Engineering University of Wisconsin Madison Madison WI USA

embedded systems increasingly include heterogeneous compute resources. Yet the vast majority of real-time scheduling methods are designed for single-resource or homogeneous multi-resource systems. Heterogeneity complicates scheduling; task execution time is resource-dependent. Furthermore, the best resource for one task may not necessarily be the best resource for all tasks, so one resource may not be universally more valuable than another. this paper presents new algorithms designed specifically for heterogeneous real-time scheduling. We evaluate the algorithms' deadline miss rates for heterogeneous task sets that represent a variety of execution scenarios, and show that two of our algorithms have lower deadline miss rates than the Earliest Deadline First or Least Laxity First approaches. We also discuss how task set and system characteristics affect the schedulers' abilities to achieve a quality schedule.

关键词： Processor scheduling Mathematical model real time systems Dynamic scheduling Program processors Computational modeling

来源：评论

学校读者我要写书评

暂无评论

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

Towards a Cache-Aware Development of High Integrity Real-Tim...

引用

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

作者： Enrico Mezzetti Tullio Vardanega Department of Pure and Applied Mathematics University of Padua Italy

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.

关键词： Software architecture Timing Layout Memory management Software Instruments

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：