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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

852 篇 会议
791 篇 期刊文献
14 册 图书

馆藏范围

1,657 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

969 篇 工学
- 584 篇 计算机科学与技术...
- 430 篇 软件工程
- 248 篇 信息与通信工程
- 227 篇 电气工程
- 175 篇 电子科学与技术（可...
- 144 篇 控制科学与工程
- 92 篇 光学工程
- 82 篇 生物工程
- 64 篇 生物医学工程（可授...
- 62 篇 材料科学与工程（可...
- 59 篇 化学工程与技术
- 58 篇 机械工程
- 54 篇 仪器科学与技术
- 52 篇 动力工程及工程热...
- 32 篇 航空宇航科学与技...
- 24 篇 安全科学与工程
- 24 篇 网络空间安全
648 篇 理学
- 298 篇 数学
- 277 篇 物理学
- 100 篇 统计学（可授理学、...
- 98 篇 生物学
- 76 篇 化学
- 53 篇 系统科学
- 28 篇 地球物理学
183 篇 管理学
- 133 篇 管理科学与工程(可...
- 73 篇 工商管理
- 52 篇 图书情报与档案管...
64 篇 医学
- 55 篇 临床医学
- 49 篇 基础医学(可授医学...
25 篇 法学
17 篇 经济学
12 篇 农学
9 篇 教育学
4 篇 军事学

主题

120 篇 real time system...
109 篇 laboratories
63 篇 control systems
58 篇 application soft...
53 篇 processor schedu...
53 篇 delay
48 篇 computer archite...
47 篇 distributed comp...
41 篇 hardware
40 篇 power systems
39 篇 computational mo...
38 篇 computer science
36 篇 fault tolerance
34 篇 timing
31 篇 neural networks
29 篇 scheduling algor...
29 篇 particle swarm o...
26 篇 protocols
25 篇 resource managem...
25 篇 artificial intel...

机构

94 篇 real-time comput...
33 篇 department of ph...
33 篇 faculty of scien...
33 篇 departamento de ...
33 篇 department for p...
33 篇 department of ph...
33 篇 dipartimento di ...
33 篇 yerevan physics ...
33 篇 institute of phy...
33 篇 institute of phy...
32 篇 lehrstuhl für ex...
32 篇 west university ...
32 篇 kirchhoff-instit...
32 篇 graduate school ...
32 篇 tomsk state univ...
31 篇 department of mo...
31 篇 research center ...
31 篇 fakultät für phy...
30 篇 faculté des scie...
30 篇 department of ph...

作者

106 篇 k.g. shin
54 篇 ganesh k. venaya...
37 篇 niyato dusit
29 篇 venayagamoorthy ...
29 篇 shin kang g.
25 篇 f. buehrer
25 篇 m. khader
25 篇 a. t. law
25 篇 c. alexa
25 篇 j. d. mansour
25 篇 j. m. izen
25 篇 s. veneziano
25 篇 d. di valentino
25 篇 g. bella
25 篇 j. strandberg
25 篇 d. calvet
25 篇 c. amelung
25 篇 a. grummer
25 篇 k. j. r. cormier
25 篇 n. orlando

语言

1,526 篇 英文
114 篇 其他
17 篇 中文

检索条件"机构=Real Time Computing Laboratory Department of Electrical Engineering and Computer Science"

共 1657 条记录，以下是1411-1420 订阅

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

详细简洁

排序：

Experimental evaluation of failure-detection schemes in real-time communication networks 27

Experimental evaluation of failure-detection schemes in real...

引用

27th Annual International Symposium on Fault-Tolerant computing, FTCS 1997

作者： Han, Seungjae Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0818678313

An effective failure-detection scheme is essential for reliable communication services. Most computer network rely on behavior-based detection schemes: each node uses heartbeats to detect the failure of its neighbor nodes, and the transport protocol (like TCP) achieves reliable communication by acknowledgment/retransmission. In this paper, we experimentally evaluate the effectiveness of such behavior-based detection schemes in real-time communication. Specifically, we measure and analyze the coverage and latency of two failure-detection schemes-neighbor detection and end-to-end detection-through fault-injection experiments. The experimental results have shown that a significant portion of failures can be detected very quickly by the neighbor detection scheme, while the end-to-end detection scheme uncovers the remaining failures with larger detection latencies. © 1997 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fast restoration of real-time communication service from component failures in multi-hop networks 97

Fast restoration of real-time communication service from com...

引用

Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication

作者： Seungjae Han Kang G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor Michigan

ISBN: (纸本)9780897919050

For many applications it is important to provide communication services with guaranteed timeliness and fault-tolerance at an acceptable level of overhead. In this paper, we present a scheme for restoring real-time channels, each with guaranteed timeliness, from component failures in multi-hop networks. To ensure fast/guaranteed recovery, backup channels are set up a priori in addition to each primary channel. That is, a dependable real-time connection consists of a primary channel and one or more backup channels. If a primary channel fails, one of its backup channels is activated to become a new primary channel. We describe a protocol which provides an integrated solution to the failure-recovery problem (i.e., channel switching, resource re-allocation, ...). We also present a resource sharing method that significantly reduces the overhead of backup channels. The simulation results show that good coverage (in recovering from failures) can be achieved with about 30% degradation in network utilization under a reasonable failure condition. Moreover, the fault-tolerance level of each dependable connection can be controlled, independently of other connections, to reflect its criticality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient semaphore implementation scheme for small-memory embedded systems

An efficient semaphore implementation scheme for small-memor...

引用

real-time Technology and Applications Symposium

作者： K.M. Zuberi K.G. Shin Real Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

In object-oriented programming, updates to the state variables of objects (by the methods of the object) have to be protected through semaphores to ensure mutual exclusion. Semaphore operations are invoked each time an object is accessed, and this represents significant run-time overhead. This is of special concern in cost-conscious, small-size embedded systems-such as those used in automotive applications-where costs must be kept to an absolute minimum. Object-oriented programming can be feasible in such applications only if the OS provides efficient, low-overhead semaphores. The authors present a new semaphore implementation scheme which saves one context switch per semaphore lock operation in most circumstances and gives performance improvements of 18-25% over traditional semaphore implementation schemes.

关键词： Embedded system Costs real time systems Object oriented programming Automotive applications Switches Microcontrollers Yarn Embedded computing Laboratories

来源：评论

学校读者我要写书评

暂无评论

Experimental evaluation of failure-detection schemes in real-time communication networks

Experimental evaluation of failure-detection schemes in real...

引用

International Symposium on Fault-Tolerant computing (FTCS)

作者： Seungjae Han K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

关键词： Intelligent networks Communication networks computer network reliability Delay Fault detection Telecommunication network reliability Application software Hardware Control systems computer networks

来源：评论

学校读者我要写书评

暂无评论

Scalable hardware priority queue architectures for high-speed packet switches

Scalable hardware priority queue architectures for high-spee...

引用

3rd IEEE real-time Technology and Applications Symposium

作者： Moon, SW Shin, KG Rexford, J Real-Time Computing Laboratory Dept. of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109 United States Network Mathematics Research Networking and Distributed Systems ATandT Labs Research Murray Hill NJ 07974 United States

ISBN: (纸本)0818680164

In packet-switched networks, queueing of packets at the switches can result when multiple connections share the same physical link. To accommodate a large number of connections, a switch can employ link-scheduling algorithms to prioritize the transmission of the queued packets. Due to the high-speed links and small packet sizes, a hardware solution is needed for the priority queue in order to make the link schedulers effective. But for good performance, the switch should also support a large number of priority levels (P) and be able to buffer a large number of packets (N). So a hardware priority queue design must be both fast and scalable (with respect to N and P) in order to be implemented effectively. In this paper, we first compare four existing hardware priority queue architectures, and identify scalability limitations on implementing these existing architectures for large N and P. Based on our findings, we propose two new priority queue architectures, and evaluate them using simulation results from Verilog HDL and Epoch implementations.

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

Schedule revision in a distributed job shop with the makespan objective

Schedule revision in a distributed job shop with the makespa...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： T. Tsukada K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

This paper examines the problem of schedule revision in a distributed job shop where the object is to minimize the global makespan. Schedules of work cells may interact through precedence constraints, and a work cell's response to a local schedule disruption may affect schedules of other cells. Complete knowledge about how local schedule changes affect the global schedule may require global knowledge about the schedule. Here, we show that knowledge of only local constraints may be almost as useful as global knowledge for the revision of one cell's schedule. We present simulation results from a general distributed job shop model.

关键词： Job shop scheduling Processor scheduling Manufacturing systems electrical capacitance tomography Distributed computing Laboratories Computational modeling computer integrated manufacturing Problem-solving Flexible manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

Efficient spare-resource allocation for fast restoration of real-time channels from network component failures

Efficient spare-resource allocation for fast restoration of ...

引用

real-time Systems Symposium (RTSS)

作者： S. Han K.G. Shin Real Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Since real-time applications usually require not only timeliness but also fault-tolerance, it is essential to incorporate fault-tolerance into real-time communication services that are indispensable to distributed real-time applications. The techniques for failure recovery in datagram communication are not adequate for real-time communication, because they cannot provide recovery-delay guarantees. To ensure fast recovery of a real-time channel from network component failures, we need to reserve network resources (spare resources) along a backup route before failures actually occur. The focus of this paper is on minimizing the amount of spare resources while meeting the fault-tolerance requirement. Specifically, we present resource sharing mechanisms and backup-route selection algorithms, and evaluate their efficiency with extensive simulations.

关键词： Fault tolerance Spread spectrum communication Throughput computer networks Laboratories Radio access networks Whales IP networks Delay Bandwidth

来源：评论

学校读者我要写书评

暂无评论

QoS negotiation in real-time systems and its application to automated flight control

QoS negotiation in real-time systems and its application to ...

引用

real-time Technology and Applications Symposium

作者： T.F. Abdelzaher E.M. Atkins K.G. Shin Department of Electrical Engineering and Computer Science Real-time Computing Laboratory University of Michigan Ann Arbor MI USA

We propose a model for quality-of-service (QoS) negotiation in building real-time services to meet both predictability and graceful degradation requirements. QoS negotiation is shown to (i) outperform conventional "binary" admission control schemes (either guaranteeing the required QoS or rejecting the service request), and (ii) achieve higher application-perceived system utility. We incorporated the proposed QoS-negotiation model into an example real-time middleware service, called RTPOOL, which manages a distributed pool of shared computing resources (processors) to guarantee timeliness QoS for real-time applications. The efficacy and power of QoS negotiation are demonstrated for an automated flight control system implemented on a network of PCs running RT-POOL. This system is used to fly an F-16 fighter aircraft modeled using the Aerial Combat (ACM) F-16 Flight Simulator. Experimental results indicate that QoS negotiation, while maintaining real-time guarantees, enables graceful QoS degradation under conditions in which traditional schedulability analysis and admission control schemes fail.

关键词： real time systems Degradation Admission control Power system modeling Predictive models Quality of service Middleware Resource management Power system management Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Scalable hardware earliest-deadline-first scheduler for ATM switching networks

Scalable hardware earliest-deadline-first scheduler for ATM ...

引用

real-time Systems Symposium (RTSS)

作者： Byung Kook Kim K.G. Shin Department of Electrical Engineering Korea Advanced Institute of Science and Technology Taejon South Korea Real Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

A fast, scalable hardware earliest deadline first (EDF) link scheduler for ATM switching network is developed. This EDF scheduler is a fast hardware solution suitable for real time scheduler on nodes in ATM switching networks up to 2.5 Gbps switching speed (scheduling within 0.17 /spl mu/s), capable of performing simultaneous input and output operations within two clock cycles (mostly in one clock cycle). The designed hardware is efficient since the architecture employs the minimum size EDF priority queue, combined with variable size FIFO queues for channels implemented with a two port memory buffer. Early traffic can be simply checked and delayed. Also, it is scalable with respect to the number of channels C and the total number of buffers N. Moreover, deadline folding technique eliminates the need to extend the deadline resolution. Simulation studies and layout design demonstrate the efficiency and utility of the proposed architecture.

关键词： Hardware Asynchronous transfer mode Communication switching Delay Traffic control Switches Bandwidth Processor scheduling Clocks Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Exact and efficient analysis of schedulability in fixed-packet networks: a generic approach

Exact and efficient analysis of schedulability in fixed-pack...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： S. Gorinsky S. Baruah T.J. Marlowe A.D. Stoyenko Real Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology Newark NJ USA Department of Computer Science and Electrical Engineering University of Vermont Burlington VT USA Department of Mathematics and Computer Science Seton Hall University South Orange NJ USA Real Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology Newark NJ USA

A general model for traffic flows on packet-switched, virtual-circuit based, fixed-packet networks is introduced, and an exact schedulability test is obtained for systems of such flows. Rules are derived that make the evaluation of this schedulability test feasible and efficient under certain circumstances. The practical relevance of this approach is demonstrated by applying it to a number of standard traffic models.

关键词： Intelligent networks Processor scheduling Telecommunication traffic Traffic control computer networks Delay Laboratories Information science computer science real time systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共166页 << < 138 139 140 141 142 143 144 145 146 147 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：