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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是871-880 订阅

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

详细简洁

排序：

the Carousel-EDF Scheduling Algorithm for Multiprocessor systems

The Carousel-EDF Scheduling Algorithm for Multiprocessor Sys...

引用

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

作者： Sousa, Paulo Baltarejo Souto, Pedro Tovar, Eduardo Bletsas, Konstantinos CISTER INESC TEC Res Ctr Oporto Portugal ISEP Polytech Inst Porto Oporto Portugal Univ Porto FEUP Fac Engn P-4100 Oporto Portugal

ISBN: (纸本)9781479908509

We present Carousel-EDF, a new hierarchical scheduling algorithm for a system of identical processors, and its overhead-aware schedulability analysis based on demand bound functions. Carousel-EDF is an offshoot of NPS-F and preserves its utilization bounds, which are the highest among algorithms not based on a single dispatching queue and that have few preemptions. Furthermore, with respect to NPS-F, Carousel-EDF reduces by up to 50% the number of context switches and of preemptions caused by the high-level scheduler itself. the schedulability analysis we present in this paper is grounded on a prototype implementation of Carousel-EDF that uses a new implementation technique for the release of periodic tasks. this technique reduces the pessimism of the schedulability analysis presented and can be applied, with similar benefits, to other scheduling algorithms such as NPS-F.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Fifty-percent Rule to Minimize the Energy Consumption of PCM-based Storage systems

A Fifty-percent Rule to Minimize the Energy Consumption of P...

引用

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

作者： Yang, Ming-Chang Kuo, Martin Tsao, Che-Wei Chang, Yuan-Hao Acad Sinica Inst Informat Sci Taipei 115 Taiwan Natl Taiwan Ocean Univ Dept Comp Sci & Engn Taipei 202 Taiwan

ISBN: (纸本)9781479908509

In recent years, phase-change memory (PCM) has drawn a lot of attention because of its byte-addressability and non-volatility. It has become a good alternative storage medium to reduce the performance gap between main memory and secondary storage, but its high energy consumption on writes is a challenging issue in the design of battery-powered mobile computing systems. By utilizing the byte-addressability and the asymmetric read-write energy/latency of PCM, we propose an energy-efficient update scheme with a fifty-percent rnle for journaling file systems to reduce the energy consumption. this scheme only writes the modified data, instead of the whole updated block, to PCM-based storage devices with the guarantee of the sanity/integrity of file systems even if the system crashes or power failure occurs during the process of data updates. A series of experiments based on the implementation on the Linux system was conducted to evaluate the capability of the proposed scheme, and the results are very encouraging.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Online Optimization of Security-Sensitive real-time Storage applications for NAND Flash Memory Storage systems

Online Optimization of Security-Sensitive Real-Time Storage ...

引用

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

作者： Jiang, Wei Ma, Yue Zhang, Xia Wang, Xupeng Shao, Zili Univ Elect Sci & Technol China Coll Comp Sci & Engn Chengdu Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781479908509

With many advantages like low cost, faster and non-volatile, NAND flash memory has become a critical component in building securitycritical real-time embedded devices. In this paper, we are interested in online optimization of securitysensitive storage applications, whose workloads are unpredictable but have explicit deterministic or probabilistic timing constraints and certain security constraints. Sensitive data must be stored before a specific deadline, otherwise it will lose its validity. To address these challenges, this paper presents a Feedback Vulnerability and Utilization Control (FVUC) mechanism. FVUC employs two proportional-integral controllers, the Utilization Controller and Vulnerability Controller, to build a big feedback loop that dynamically monitors the system run-time status as well as decides how many flash pages would be encrypted by a cryptography algorithm. Relied on the accurate model and design, FVUC can make a balance between the utilization and vulnerability, and achieve a better overall performance. the advantages of FVUC are verified by a series of simulation experiments under a broad range of system configurations and run-time uncertainties.

关键词： NAND Flash Memory Storage System real-time System Security-Critical Vulnerability Feedback Control

来源：评论

学校读者我要写书评

暂无评论

Solar Tune: real-time Scheduling with Load Tuning for Solar Energy Powered Multicore systems

Solar Tune: Real-Time Scheduling with Load Tuning for Solar ...

引用

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

作者： Wang, Yi Chen, Renhai Shao, Zili Li, Tao Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA

ISBN: (纸本)9781479908509

In this paper, we target at the direct-coupled solar energy powered multicore architectures that provide direct power supply between photovoltaic (PV) generation and the load without the adoption of battery. We present SolarTune, a real-time scheduling technique with load tuning for sporadic tasks on solar energy powered multicore systems. the objective is to frilly utilize the available solar energy while meeting the deadlines of tasks. To solve the problem, we first perform analysis and formulate the scheduling problem in each duration as an integer linear programming (ILP) model to obtain an optimal schedule. then we present a heuristic algorithm to dynamically refine the task scheduling based on the predictions of the availability of solar energy. We conduct experiments using real-world meteorological data across different geographic sites. the experimental results show that SolarTune can significantly improve the solar energy utilization ratio and reduce the number of deadline misses compared to the conventional task scheduler.

关键词： Solar energy

来源：评论

学校读者我要写书评

暂无评论

Maximizing Online Service Profit for time-Dependent applications

Maximizing Online Service Profit for Time-Dependent Applicat...

引用

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

作者： Li, Shuhui Song, Miao Li, Zheng Ren, Shangping Quan, Gang IIT Dept Comp Sci Chicago IL 60616 USA Florida Int Univ Elect & Comp Engn Dept Miami FL 33174 USA

ISBN: (纸本)9781479908509

As computers and Internet technology advance, many time-dependent applications, such as mobile navigation and online gaming, are emerging. time-dependent applications are associated with a pair of time-dependent functions representing accrued gain at the time when tasks complete or accrued cost when tasks fail to complete, respectively. For systems that provide time-dependent services, the optimization goal is to maximize the system profit when both potential gain and potential cost exist for each request the system accepts. this paper presents two scheduling algorithms, prediction-based highest gain density first (PHGDF) and iterative PHGDF (iPHGDF) scheduling algorithms with the objective to maximize the system's total accrued profit. Simulation results provide clear evidence that, with respect to the system total accrued profit, the proposed PHGDF and iPHGDF algorithms have advantages over other commonly used scheduling algorithm, such as the Earliest Deadline First (EDF), the Generic Utility Scheduling (GUS) and the Profit and Penalty aware scheduling (PP-aware) algorithms.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Branch Prediction Directed Dynamic Instruction Cache Locking for embedded systems

Branch Prediction Directed Dynamic Instruction Cache Locking...

引用

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

作者： Qiu, Keni Zhao, Mengying Xue, Chun Jason Orailoglu, Alex City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China Univ Calif San Diego Dept Comp Sci & Engn San Diego CA 92103 USA

ISBN: (纸本)9781479908509

Cache locking is a cache management technique to preclude the replacement of locked cache contents. Cache locking is often used to improve cache access predictability in Worst-Case Execution time (WCET) analysis. Static cache locking methods have been proposed recently to improve average system performance. this paper presents an approach, Branch Prediction directed Dynamic Cache Locking (BPDCL), to improve average system performance through effective cache conflict miss reduction in different execution regions. In this proposed approach, the control flow graph of a program is partitioned into regions and memory blocks worth locking for each region are calculated during compilation time. At runtime, directed by branch predictions, locking routines are prefetched into a high-speed buffer. the pre-determined cache locking contents are loaded and locked at specific execution points during program execution. Experimental results show that the proposed BPDCL method exhibits an average improvement of 21.8% and 10.3% on cache miss rate reduction in comparison to the case with no cache locking and the static locking method respectively.

关键词： embedded systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Aperiodic Job Handling in Cache-Based real-time systems

Aperiodic Job Handling in Cache-Based Real-Time Systems

引用

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

作者： Motakpalli, Sankalpanand Jain, Vardhman Pukhraj Ramaprasad, Harini So Illinois Univ Carbondale IL 62901 USA

ISBN: (纸本)9781479908516

Providing a-priori temporal guarantees is paramount in real-time systems. Although much of the normal operation in such a system is modeled using sporadic tasks, event-driven behavior is modeled using aperiodic jobs. To ensure an acceptable Quality of Service for aperiodic jobs without jeopardizing safety of sporadic tasks, aperiodic servers were introduced. While aperiodic servers periodically reserve a quota for the execution of aperiodic jobs, they do not take into account, indirect cache-related delays that the execution of aperiodic jobs could impose on sporadic tasks, thereby making their use in systems with caches unsafe. In this paper, we introduce the concept of a Cache Delay Server to solve this problem for sporadic tasks (and thus, for periodic tasks). Every sporadic task is allocated a delay quota to accommodate the cache-related delay that could potentially be imposed due to aperiodic job execution. An aperiodic job is allowed to execute only when all active lower-priority sporadic jobs have sufficient delay quota to accommodate it. We also present a technique to calculate delay quotas for sporadic tasks within a given task set. Simulation results demonstrate that the use of a Cache Delay Server ensures safety of sporadic task execution in systems using caches while providing reasonable average-case response times to aperiodic jobs.

关键词： jobs Quality of service real-time systems Cache memory Legal Executions Religious Missions Servers Task execution Quotas delay normal operation

来源：评论

学校读者我要写书评

暂无评论

Multi-ASIP Platform Synthesis for Event-Triggered applications with Cost/Performance Trade-offs

Multi-ASIP Platform Synthesis for Event-Triggered Applicatio...

引用

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

作者： Gangadharan, Deepak Micconi, Laura Pop, Paul Madsen, Jan Tech Univ Denmark DTU Compute Odense Denmark

ISBN: (纸本)9781479908516

In this paper, we propose a technique to synthesize a cost-efficient distributed platform consisting of multiple Application Specific Instruction Set Processors (multi-ASIPs) running applications with strict timing constraints. Multi-ASIP platform synthesis is a non-trivial task for two reasons. Firstly, we need to know the WCET of tasks in target applications to derive platforms (including synthesized ASIPs) in which the tasks are schedulable. However, the WCET of tasks can be known only after the ASIPs are synthesized. We break this circular dependency by using a probability distribution of the WCET of a task (further referred to as the WCET uncertainty model), which takes into account the underlying microarchitectural configurations for the ASIP implementation. Secondly, the datapath area of the multi-ASIPs synthesized is an important design factor that contributes significantly towards the overall cost of the platform. We propose an area estimation model and a WCET uncertainty model that consider the effect of task datapath similarity. Based on these two models, we support the designer in exploring cost/performance trade-offs during the platform synthesis. We propose an Evolutionary Algorithm-based approach to solve this multiobjective optimization problem. the proposed approach has been evaluated using several benchmarks and it provides a number of multi-ASIP platform solutions exploring the trade-offs in the cost/performance design space.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共203页 << < 84 85 86 87 88 89 90 91 92 93 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：