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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

380 篇 会议
13 篇 期刊文献

馆藏范围

393 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

164 篇 工学
- 158 篇 计算机科学与技术...
- 61 篇 软件工程
- 10 篇 电气工程
- 10 篇 控制科学与工程
- 8 篇 信息与通信工程
- 7 篇 安全科学与工程
- 4 篇 机械工程
- 2 篇 冶金工程
- 2 篇 网络空间安全
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 建筑学
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
- 1 篇 核科学与技术
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
100 篇 管理学
- 97 篇 管理科学与工程(可...
- 10 篇 工商管理
- 6 篇 图书情报与档案管...
21 篇 理学
- 12 篇 数学
- 6 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 地质学
- 1 篇 生物学
2 篇 法学
- 2 篇 社会学
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 经济学
- 1 篇 应用经济学

主题

117 篇 distributed comp...
111 篇 real time system...
56 篇 object oriented ...
52 篇 embedded system
39 篇 real-time system...
38 篇 hardware
37 篇 middleware
31 篇 application soft...
29 篇 timing
26 篇 quality of servi...
25 篇 computer archite...
25 篇 java
22 篇 resource managem...
20 篇 computer science
20 篇 unified modeling...
19 篇 runtime
19 篇 computational mo...
18 篇 fault tolerance
18 篇 protocols
17 篇 operating system...

机构

7 篇 univ leeds sch c...
6 篇 okuma corporatio...
5 篇 graduate school ...
5 篇 octopath corpora...
4 篇 vienna universit...
4 篇 college of compu...
4 篇 aerospace corpor...
4 篇 department of in...
3 篇 department of ee...
3 篇 graduate school ...
3 篇 konkuk universit...
3 篇 department of el...
3 篇 institute for so...
3 篇 univ potsdam d-1...
3 篇 school of comput...
3 篇 lero-the irish s...
3 篇 fujitsu ten limi...
2 篇 mälardalen real-...
2 篇 get-télécom pari...
2 篇 vanderbilt univ ...

作者

10 篇 xu jie
8 篇 takuya azumi
8 篇 karsai gabor
7 篇 aniruddha gokhal...
7 篇 gokhale aniruddh...
7 篇 martin schoeberl
7 篇 hiroshi oyama
6 篇 jie xu
6 篇 dubey abhishek
6 篇 gabor karsai
5 篇 k.h. kim
5 篇 schmidt douglas ...
5 篇 douglas c. schmi...
4 篇 uwe brinkschulte
4 篇 hiroaki takada
4 篇 abhishek dubey
4 篇 polze a
4 篇 schoeberl martin
4 篇 doo-hyun kim
4 篇 mahadevan nagabh...

语言

393 篇 英文

检索条件"任意字段=9th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing"

共 393 条记录，以下是361-370 订阅

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

详细简洁

排序：

State-Based Search Strategy in Unstructured P2P

State-Based Search Strategy in Unstructured P2P

引用

international symposium on object-oriented real-time distributed computing

作者： Kaigui Wu Changze Wu Lu Liu Jie Xu College of Computer Science Chongqing University ChongQing China School of Computing University of Leeds Leeds UK

ISBN: (纸本)9781424470839;9780769540375

Efficient resource search in large-scale unstructured peer-to-peer (P2P) systems remains a fundamental challenge. In order to improve search performance, interest-based search is a good way to tackle the challenge. However, the existing interest-based search algorithms pay attention to user interest model and search history, but ignore some influence factors of improving performance. In this paper, through analysis of node's multi-dimensional quality-of-service (QoS) for search, it is found that node state's information is essential for improving search performance. So a State-Based Search (SBS) strategy is presented by improving Sripanidkulchai's interest-based search model, where Node's state evaluation is based on node's QoS fuzzification. the SBS enhances the methods of shortcuts adding, ranking and selecting, and state's life-cycle is predicted by grey theory. the experimental results show that the SBS can improve performance by reducing search response time and achieving load balance.

关键词： Peer to peer computing distributed computing Performance analysis Routing Filters Large-scale systems History Delay Condition monitoring Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Model-Driven Runtime Resource Predictions for Advanced Mechatronic Systems with Dynamic Data Structures

Model-Driven Runtime Resource Predictions for Advanced Mecha...

引用

international symposium on object-oriented real-time distributed computing

作者： Stefan Henkler Simon Oberthür Holger Giese Andreas Seibel Software Engineering Group University of Paderborn Paderborn Germany Design of Distrib. Embedded Syst. Res. Group Univ. of Paderborn Paderborn Germany System Analysis and Modeling Group University of Potsdam Potsdam Germany

the next generation of advanced mechatronic systems is expected to enhance their functionality and improve their performance by context-dependent behavior. therefore, these systems require to represent information about the complex environment and changing sets of collaboration partners internally. this requirement is in contrast to the usually assumed static structures for embedded systems. In this paper, we present a model-driven approach which overcomes this situation by supporting dynamic data structures while still guaranteeing that valid worst-case execution times can be derived. It supports a flexible resource management which avoids to operate with the prohibitive coarse worst-case boundaries but instead supports to run applications in different profiles which guarantee different resource requirements and put unused resources in a profile at other applications' disposal. By supporting the proper estimation of worst case execution time (WCET) and worst case number of iteration (WCNI) at runtime, we can further support to create new profiles, add or remove them at runtime in order to minimize the over-approximation of the resource consumption resulting from the dynamic data structures required for the outlined class of advanced systems.

关键词： Predictive models Runtime Mechatronics Data structures Embedded system Resource management object oriented modeling real time systems object oriented programming distributed computing

来源：评论

学校读者我要写书评

暂无评论

WCET-Driven Cache-Aware Memory Content Selection

WCET-Driven Cache-Aware Memory Content Selection

引用

international symposium on object-oriented real-time distributed computing

作者： Sascha Plazar Paul Lokuciejewski Peter Marwedel Computer Science 12 Technical University Dortmund Dortmund Germany

Caches are widely used to bridge the increasingly growing gap between processor and memory performance. they store copies of frequently used parts of the slow main memory for faster access. Static analysis techniques allow the estimation of the worst case cache behavior and enable the computation of an upper bound of the execution time of a program. this bound is called worst-case execution time (WCET). Its knowledge is crucial to verify if hard real-time systems satisfy their timing constraints and the WCET is a key parameter for the design of embedded systems. In this paper, we propose a new WCET-driven cache-aware memory content selection algorithm, which allocates functions whose WCET highly benefits from a cached execution to cached memory areas. Vice versa, rarely used functions which do not benefit from a cached execution are allocated to non-cached memory areas. As a result of this, unfavorable functions w. r. t. a program's WCET can not evict beneficial functions from the cache. this can lead to a reduced cache miss ratio and a decreased WCET. the effectiveness of our approach is demonstrated by results achieved on real-life benchmarks. In a case study, our greedy algorithm is able to reduce the benchmarks' WCET by up to 20%.

关键词： Bridges Upper bound real time systems Timing Embedded system Hardware distributed computing Computer science Greedy algorithms Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

On Best-Effort real-time Assurances for Recovering from Distributable thread Failures in distributed real-time Systems

On Best-Effort Real-Time Assurances for Recovering from Dist...

引用

international symposium on object-oriented real-time distributed computing

作者： Binoy Ravindran Edward Curley Jonathan S. Anderson E. Douglas Jensen ECE Department Virginia Polytechnic Institute and State University Blacksburg VA USA MITRE Corporation Bedford MA USA

We consider the problem of recovering from failures of distributable threads in distributed real-time systems that operate under run-time uncertainties including those on thread execution times, thread arrivals, and node failure occurrences. When a thread encounters a node failure, it causes orphans. Under a termination model, the orphans must be detected and aborted, and exceptions must be delivered to farthest, contiguous surviving thread segment for resuming thread execution. Our application/scheduling model includes distributable threads and their exception handlers that are subject to time/utility function (TUF) time constraints and a utility accrual (UA) optimality criterion. A key underpinning of the TUF/UA scheduling paradigm is the notion of "best-effort" where high importance threads are always favored over low importance ones, irrespective of thread urgency. We present a scheduling algorithm called HUA and a thread integrity protocol called TPR. We show that HUA and TPR bound the orphan cleanup and recovery time with bounded loss of the best-effort property. Our implementation experience of HUA/TPR within Sun's distributed real-time specification for Java demonstrates the algorithm/protocol's effectiveness

关键词： real time systems Yarn time factors Uncertainty Scheduling algorithm Subscriptions Protocols Sun Java Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Compositional Schedulability Analysis of Hierarchical real-time Systems

Compositional Schedulability Analysis of Hierarchical Real-T...

引用

international symposium on object-oriented real-time distributed computing

作者： Arvind Easwaran Insup Lee Insik Shin Oleg Sokolsky Department of Computer and Information Science University of Pennsylvania Philadelphia PA USA

Embedded systems are complex as a whole but consist of smaller independent modules interacting with each other. this structure makes them amenable to compositional design. real-time embedded systems consist of realtime workloads having deadlines. Compositional design of such systems can be done using real-time components arranged in a scheduling hierarchy. Each component consists of some real-time workload and a scheduling policy for the workload. To simplify schedulability analysis for such systems, analysis should be done compositionally using interfaces that abstract timing requirement of components. To facilitate analysis of dynamically changing systems, the framework should also support incremental analysis. In this paper, we overview our approach to compositional and incremental schedulability analysis of hierarchical real-time systems. We describe a compositional analysis technique that abstracts resource requirement of components using periodic resource models. To support incremental analysis and resource bandwidth minimization, we describe an extension to this interface model. Each extended interface consists of multiple periodic resource models for different periods. this allows the selection of a periodic model that can schedule the system using minimum bandwidth. We also account for context switch overhead of components in these extended interfaces. We then describe an associative composition technique for such interfaces, that supports incremental analysis

关键词： real time systems Switches Resource management Timing Bandwidth Independent component analysis Embedded system Open systems Processor scheduling Abstracts

来源：评论

学校读者我要写书评

暂无评论

HRMP3+TECS: component Framework for Multiprocessor real-time Operating System with Memory Protection

HRMP3+TECS: Component Framework for Multiprocessor Real-time...

引用

international symposium on object-oriented real-time distributed computing

作者： Yoshitada Takaso Hiroshi Oyama Hiroaki Takada Takuya Azumi Graduate School of Science and Engineering Saitama University OKUMA Corporation Institutes of Innovation for Future Society Nagoya University

the scale and demand for protection functionalities in embedded systems continue to grow as Internet of things technology develops. Simultaneously, multiprocessor real-time operating systems (RTOSs) with memory protection functionalities are broadening in use. On the other hand, the large development effort and poor reusability of multiprocessor RTOS-based development remain hindrances to their use. To solve this problem, this paper proposes a component framework for multiprocessor RTOSs that includes memory protection. In the proposed framework, OS functionalities are reframed as components. the allocation of objects to processors and protection settings, which are supported by the OS, can then be configured based on the component description. Plugins are implemented here to generate files for object generation from component descriptions of OS functionalities. In addition, access to the protection domain can be defined based on the component description. Finally, test programs are used in a performance evaluation. the proposed framework enables extensions to the component-based OS while maintaining most of the functionality and performance of the target OS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

XtreemOS: A Grid Operating System Making your Computer Ready for Participating in Virtual Organizations

XtreemOS: A Grid Operating System Making your Computer Ready...

引用

international symposium on object-oriented real-time distributed computing

作者： Christine Morin Paris Project-Team XtreemOS Scientific Coordinator IRISA/INRIA France

the overall objective of the XtreemOS project is the design, implementation, evaluation and distribution of an open source grid operating system (named XtreemOS) with native support for virtual organizations (VO) and capable of running on a wide range of underlying platforms, from clusters to mobiles. the approach we propose is to investigate the design of a grid OS, XtreemOS, based on the Linux existing general purpose OS. A set of system services, extending those found in the traditional Linux, will provide users with all the grid capabilities associated with current grid middleware, but fully integrated into the OS. the underlying Linux will be extended as needed to support VOs spanning across many machines and to provide appropriate interfaces to the Grid OS services. Installed on each participating machine, the XtreemOS system will provide for the grid what an operating system offers for a single computer: abstraction from the hardware, and secure resource sharing between different users. It would thus considerably ease the work of users belonging to VOs by giving them (as far as possible) the illusion of using a traditional computer, and releasing them from dealing with the complex resource management issues of a grid environment. By integrating grid capabilities into the kernel, XtreemOS will also provide a robust, secure and easy to manage infrastructure for system administrators

关键词： Operating systems Grid computing distributed computing Linux Middleware Resource management Kernel Programming profession Mobile computing Hardware

来源：评论

学校读者我要写书评

暂无评论

A Software-Pipelined Approach to Multicore Execution of Timing Predictable Multi-threaded Hard real-time Tasks

A Software-Pipelined Approach to Multicore Execution of Timi...

引用

international symposium on object-oriented real-time distributed computing

作者： Marco Paolieri Eduardo Quiñones Francisco J. Cazorla Julian Wolf theo Ungerer Sascha Uhrig Zlatko Petrov Universitat Politecnica de Catalunya Spain Barcelona Supercomputing Center (BSC) Spain Spanish National Research Council (IIIA-CSIC) Spain University of Augsburg Germany Germany Technical University Dortmund Germany Germany Honeywell International Inc. Czech Republic Honeywell International s.r.o. Czech Republic

Multicore processors can deliver higher performance than single-core processors by exploiting thread level parallelism (TLP): applications are split into independent threads, each of which is mapped into a different core, reducing the execution time and potentially its worst-case execution time (WCET). Unfortunately, inter-thread interferences generated by simultaneous accesses to shared resources from different threads may completely destroy the performance benefits brought by TLP. this paper proposes a software/hardware cache partitioning approach that reduces the inter-thread memory interferences generated in hard real-time software-pipelined parallel applications. Our results show that our approach effectively reduces memory interferences, while still guaranteeing a predictable timing behaviour, achieving a WCET estimation reduction of 28% for a software pipelined version of the LU decomposition application with respect to the single-threaded version.

关键词： Instruction sets Multicore processing Pipeline processing Estimation real time systems

来源：评论

学校读者我要写书评

暂无评论

On Dynamic Replication Strategies in Data Service Grids

On Dynamic Replication Strategies in Data Service Grids

引用

international symposium on object-oriented real-time distributed computing

作者： Xiaohua Dong Ji Li Zhongfu Wu Dacheng Zhang Jie Xu Chongqing University China University of Leeds UK

ISBN: (纸本)9780769531328

Service oriented architecture (SOA) allows multiple and heterogeneous data resources to be integrated within a single service while hiding the implementation details and formats of data resources from users of the service. However, data sources for a service are often distributed geographically and connected with long-latency networks; time and bandwidth consumption of data transportation may have an impact on the system performance. Dynamic data replication is a practical solution to this problem. By replicating data copies to appropriate sites, this approach aims to reduce time and bandwidth consumptions over networks. Existing strategies for dynamic replication are typically based on so-called single-location algorithms for identifying a single site for data replication. In this paper we discuss the issues with single-location strategies in large-scale data integration applications, and examine potential multiple-location schemes. Dynamic multiple-location replication is NP-complete in nature. We therefore transform the multiple-location problem into several classical mathematical problems with different parameter settings, for which efficient approximation algorithms exist. Experimental results indicate that unlike single-location strategies our multiple-location schemes are efficient with respect to access latency and bandwidth consumption, especially when the requesters of a data set are distributed over a large scale of locations.

关键词： Service oriented architecture Bandwidth Approximation algorithms Large-scale systems Transportation Large scale integration distributed computing System performance Delay Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

An Optimized Compilation of UML State Machines

An Optimized Compilation of UML State Machines

引用

international symposium on object-oriented real-time distributed computing

作者： Asma Charfi Chokri Mraidha Pierre Boulet LIST Laboratory of model driven engineering for embedded systems CEA Gif-sur-Yvette France Sciences et Technologies Cité scientifique Université Lille Villeneuve d'Ascq France

Due to the definition of fUML (Foundational Subset for Executable UML Models) along with its action language Alf (Action Language for fUML), UML (Unified Modeling Language) allows the production of executable models on which early verification and validation activities can be conducted. Despite this effort of standardization and the large use of UML in industry, developers still hand tune the code generated from models to correct, enhance or optimize it. this results in a gap between the model and the generated code. Manual code tuning except from being error prone can invalidate all the analysis and validations already done in the model. To avoid the code hand tuning drawbacks and, since UML is becoming an executable language, we propose a new Model Based Development (MBD) approach that skips the code generation step by compiling directly UML models. the biggest challenge for this approach - tackled in this paper is to propose a model compiler that is more efficient than a code compiler for UML models. Our model compiler performs optimizations that code compilers are unable to perform resulting in a more compact assembly code.

关键词： Unified modeling language Optimization Assembly Semantics object oriented modeling Switches

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共40页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：