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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

429 篇 real time system...
320 篇 real-time system...
180 篇 embedded systems
137 篇 processor schedu...
105 篇 timing
103 篇 embedded system
101 篇 hardware
90 篇 computational mo...
82 篇 embedded computi...
73 篇 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.

语言

2,010 篇 英文
12 篇 其他
2 篇 中文

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

共 2024 条记录，以下是1551-1560 订阅

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

详细简洁

排序：

A new approach to memory partitioning in on-board spacecraft software

A new approach to memory partitioning in on-board spacecraft...

引用

13th Ada-Europe international conference on Reliable Software Technologies

作者： Uruena, Santiago Pulido, Jose A. Lopez, Jorge Zamorano, Juan de la Puente, Juan A. Univ Politecn Madrid E-28040 Madrid Spain

ISBN: (纸本)9783540686217

the current trend to use partitioned architectures in on,board spacecraft software requires applications running on the same computer platform to be isolated from each other both in the temporal and memory domains. Memory isolation techniques currently used in Integrated Modular Avionics for Aeronautics usually require a Memory Management Unit (MMU), which is not commonly available in the kind of processors currently used in the Space domain. Two alternative approaches are discussed in the paper, based on some features of Ada and state-of-the art compilation tool-chains. Both approaches provide safe memory partitioning with less overhead than current IMA techniques. Some footprint and performance metrics taken on a prototype implementation of the most flexible approach are included.

关键词： Ravenscar Ada high-integrity hard real-time embedded systems integrated modular avionics

来源：评论

学校读者我要写书评

暂无评论

Avoiding the WCET Overestimation on LRU Instruction Cache

Avoiding the WCET Overestimation on LRU Instruction Cache

引用

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

作者： L. C. Aparicio J. Segarra C. Rodríguez J. L. Villarroel V. Viñals DIIS Universidad de Zaragoza DATC Universidad del País Vasco DIIS Universidad de Zaragoza Spain

ISBN: (纸本)9780769533490

the WCET computation is one of the main challenges in hard real-time systems, since all further analysis is based on this value. the complexity of this problem leads existing analysis methods to compute WCET bounds instead of the exact WCET. In this work we propose a technique to compute the exact instruction fetch contribution to the WCET (IFC-WCET) in presence of a LRU instruction cache. We prove that an exact computation does not need to analyze the full exponential number of possible execution paths, but only a bounded subset of them. In the benchmark codes we have studied, the IFC-WCET is up to 62% lower than a bound computed with a widely used approach, and the difference between the number of possible execution paths and the ones relevant for the analysis is extremely large.

关键词： Benchmark testing Hardware Program processors Explosions real time systems Lead Timing

来源：评论

学校读者我要写书评

暂无评论

EcoDAQ: A Case Study of a Densely Distributed real-time System for High Data Rate Wireless Data Acquisition

EcoDAQ: A Case Study of a Densely Distributed Real-Time Syst...

引用

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

作者： Chong-Jing Chen Pai H. Chou Center for Embedded Computer Systems University of California Irvine CA USA Department of Computer Science National Tsing Hua University Hsinchu Taiwan

ISBN: (纸本)9780769533490

Densely distributed wireless real-time system must perform communication scheduling and protocols in addition to task scheduling to achieve schedulability and reliable communication. While many wireless sensor networks are densely distributed, they assume low duty cycling and trivial data packet rates, and they cannot handle many real-world applications. To highlight these design issues, this paper presents a case study with EcoDAQ, a wireless data acquisition system with 50 sensor nodes streaming real-time data over the same frequency channel. To achieve reliable communication, we define a pulling protocol that minimizes node complexity while guaranteeing collision freedom on a given frequency channel. Our case study illustrates the impact of communication requirements on the rest of the systems including bus and processing speeds. Experimental results show that our monitoring station can sustain gathering accelerometer data from up to 50 nodes in one square meter area at up to 15,000 samples per second with minimal latency and show very high expandability, flexibility and reliability.

关键词： Wireless sensor networks time division multiple access Wireless communication Base stations Protocols throughput Multiaccess communication

来源：评论

学校读者我要写书评

暂无评论

Control-Based real-time Metadata Matching for Information Dissemination

Control-Based Real-Time Metadata Matching for Information Di...

引用

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

作者： Ming Chen Xiaorui Wang Raghul Gunasekaran Hairong Qi Mallikarjun Shankar Department of Electrical Engineering and Computer Science University of Tennessee Knoxville TN USA Computational Sciences and Engineering Oak Ridge National Laboratory Oak Ridge TN USA

ISBN: (纸本)9780769533490

real-time information dissemination is of increasing importance to our society. Existing work mainly focuses on delivering information from sources to sinks in a timely manner based on established subscriptions, with the assumption that those subscriptions are persistent. However, the bottleneck of many real-time information dissemination systems is actually the matching process to continuously reevaluate such subscriptions between numerous sources and numerous sinks, in response to dynamically varying information attributes at runtime. In this paper, we propose a feedback controller to adaptively meet the response time constraints on metadata matching in an example information dissemination system. Our controller features a rigorous design based on well-established feedback control theory for guaranteed control accuracy and system stability. Empirical results on a physical test-bed demonstrate that our controller outperforms both an open-loop solution and a typical heuristic solution, by having more accurate control and better system quality of service.

关键词： time factors Subscriptions Mathematical model real time systems Databases Feedback control Servers

来源：评论

学校读者我要写书评

暂无评论

real-time Scheduling Using Credit-Controlled Static-Priority Arbitration

Real-Time Scheduling Using Credit-Controlled Static-Priority...

引用

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

作者： Benny Akesson Liesbeth Steffens Eelke Strooisma Kees Goossens Technische Universiteit Eindhoven Eindhoven Netherlands NXP Semiconductors Research Eindhoven Netherlands Delft University of Technology Netherlands

ISBN: (纸本)9780769533490

the convergence of application domains in new systems-on-chip (SoC) results in systems with many applications with a mix of soft and hard real-time requirements. To reduce cost, resources, such as memories and interconnect, are shared between applications. However, resource sharing introduces interference between the sharing applications, making it difficult to satisfy their real-time requirements. Existing arbiters do not efficiently satisfy the requirements of applications in SoCs, as they either couple rate or allocation granularity to latency, or cannot run at high speeds in hardware with a low-cost implementation. the contribution of this paper is an arbiter called credit- controlled static-priority (CCSP), consisting of a rate regulator and a static-priority scheduler. the rate regulator isolates applications by regulating the amount of provided service in a way that decouples allocation granularity and latency. the static-priority scheduler decouples latency and rate, such that low latency can be provided to any application, regardless of the allocated rate. We show that CCSP belongs to the class of latency-rate servers and guarantees the allocated rate within a maximum latency, as required by hard real-time applications. We present a hardware implementation of the arbiter in the context of a DDR2 SDRAM controller. An instance with six ports running at 200 MHz requires an area of 0.0223 mm 2 in a 90 nm CMOS process.

关键词： real time systems Resource management Servers Regulators System-on-a-chip Hardware Clocks

来源：评论

学校读者我要写书评

暂无评论

real-time Enhancements for embedded Linux

Real-Time Enhancements for Embedded Linux

引用

international conference on Parallel and Distributed systems (ICPADS)

作者： N. Vun H.F. Hor J.W. Chao School of Computer Engineering Nanyang Technological University Singapore

With the popularity of using Linux for embedded systems, its real-time performance is increasingly becoming an importance issue for applications that require short latency and task execution predictability as commonly encountered in many embedded systems. this paper presents a survey of the approaches used by commercial vendors and open source community to enhance the real-time performance of the Linux kernel. It outlines some of the main factors that affect the real-time performance of the Linux kernel and describes the two general approaches that are used to improve the real-time performance of the kernel, follows by a comparative study of the various real-time enhanced versions of the Linux that are created for embedded systems.

关键词： Linux Kernel real time systems Delay embedded system Operating systems Job shop scheduling embedded computing Timing Switches

来源：评论

学校读者我要写书评

暂无评论

Spinning Sensors: A Middleware for Robotic Sensor Nodes with Spatiotemporal Models

Spinning Sensors: A Middleware for Robotic Sensor Nodes with...

引用

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

作者： Soko Aoki Jin Nakazawa Hideyuki Tokuda Graduate School of Media and Governance Keio University Fujisawa Kanagawa Japan

ISBN: (纸本)9780769533490

this paper proposes Spinning Sensors middleware that realizes a robotic sensor node mechanism comprised of a sensor node and a robotic actuator node such as a motor or a mobile robot. We can increase sensing space, time, and accuracy of a sensor node by attaching them onto robotic actuators. To realize a robotic sensor node, we need to achieve collaborative utilization of arbitrary sensors and actuators, and automated calculation of sensing area and time. We stated these problems as spontaneous coordination problem and sensing area calculation problem. the Spinning Sensors middleware provides the mechanism of device coordination, data processing, and management of spatiotemporal model of robotic sensor nodes. In this paper, we discuss a robotic sensor node model, and design and implementation of the middleware. We introduce three kinds of applications using the middleware such as environment monitoring, sensor controlled robot, and context-aware service. the experiments using the robotic sensor node and the middleware are conducted to evaluate and measure the possibility, performance, and practicality of a robotic sensor node mechanism.

关键词： Sensors Robot sensing systems Actuators Robots Mathematical model Middleware Sensor systems

来源：评论

学校读者我要写书评

暂无评论

Parametric Timing Analysis for Complex Architectures

Parametric Timing Analysis for Complex Architectures

引用

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

作者： Sebastian Altmeyer Christian Hümbert Björn Lisper Reinhard Wilhelm Department of Computer Science University of Saarland Germany AbsInt GmbH Saarbrucken Germany School of Innovation Designand Engineering Mälardalen University Macao China

ISBN: (纸本)9780769533490

Hard real-time systems have stringent timing constraints expressed in units of time. To ensure that a task finishes within its time-frame, the designer of sucha system must be able to derive upper bounds on the task's worst-case execution time (WCET). To compute such upper bounds, timing analyses are used. these analyses require that information such as bounds on the maximum numbers of loop iterations are known statically, i.e. during design time. Parametric timing analysis softens these requirements: it yields symbolic formulas instead of single numeric values representing the upper bound on the task's execution time. In this paper, we present a new parametric timing analysis that is able to derive safe and precise results. Our method determines what the parameters ofthe program are, constructs parametric loop bounds, takes processor behavior into account and attains a formula automatically. In the end, we present tests to show that the precision and runtime of our analysis are very close to those of numeric timing analysis.

关键词： Timing Upper bound Registers Radiation detectors Pipelines Vectors real time systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling real-time Multi-item Requests in On-Demand Broadcast

Scheduling Real-Time Multi-item Requests in On-Demand Broadc...

引用

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

作者： Jun Chen Victor C. S. Lee Joseph Kee-Yin Ng School of Information Management Wuhan University of China Wuhan Hubei China Department of Computer Science City University of Hong Kong Kowloon Hong Kong China

ISBN: (纸本)9780769533490

On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and capability to handle dynamic user access patterns. Previous studies on time-critical on-demand data broadcast were under the assumption that each client requests only one data item at a time. With rapid growth of time-critical information dissemination services in emerging applications, there is an increasing need for systems to support efficient processing of real-time multi-item requests. Little work, however, has considered on-demand broadcast environment with time-critical multi-item requests. In this paper, we investigate the scheduling problem arising in this new environment and observe that existing single item request based algorithms are unable to manage multi-item requests efficiently. thus, an innovative algorithm that combines the strengths of data item scheduling and request scheduling is proposed. the performance results of our simulation show that the proposed algorithm is superior to other classical algorithms under a variety of circumstances. Our algorithm not only reduces deadline miss ratio of requests, but also saves broadcast channel bandwidth.

关键词： Scheduling algorithm real time systems Servers Algorithm design and analysis time factors Bandwidth Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Testing Interval Trees for real-time Scheduling systems

Testing Interval Trees for Real-Time Scheduling Systems

引用

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

作者： Xinfa Hu Joseph Y.-T. Leung Department of Computer Science New Jersey Institute of Technology Newark NJ USA

ISBN: (纸本)9780769533490

In real-time systems, the efficiency of scheduling modules (SM) is of critical importance. While efficient algorithms result in efficient SMs, this will not occur without appropriate implementations of the algorithms. Moreover, an algorithm with good implementation could further improve the efficiency of the SM. therefore, creative implementations of algorithms are well worthy of exploring. In this paper, we propose novel data structures (i.e., testing interval trees (TIT)) to help build efficient algorithms for schedulability test and admission control in some real-time SMs. With the testing interval tree for vacancy analysis (TIT-V), the complexities of the schedulability tests in a class of parallel/distributed real-time systems can be effectively reduced from O(m 2 nlogn) to O(mlogn+mlogm) (where m is the number of processors, and n is the number of tasks). Similarly, with the testing interval tree for release time and laxity analysis (TIT-RL), the complexity of the online admission control in a uni-processor based real-time system can be reduced from O(n 2 ) to O(nlogn) (where n is the number of tasks). Furthermore, the TIT-RL tree can also be applied to a class of parallel/distributed real-time systems. therefore, the TIT trees are effective approaches to building efficient real-time SMs.

关键词： Program processors Pediatrics Complexity theory real time systems Algorithm design and analysis Testing Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共203页 << < 152 153 154 155 156 157 158 159 160 161 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：