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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,033 篇 会议
685 篇 期刊文献
9 篇 学位论文
5 册 图书

馆藏范围

10,732 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,362 篇 工学
- 1,162 篇 计算机科学与技术...
- 851 篇 电气工程
- 664 篇 信息与通信工程
- 293 篇 软件工程
- 276 篇 电子科学与技术（可...
- 221 篇 控制科学与工程
- 200 篇 仪器科学与技术
- 150 篇 机械工程
- 58 篇 交通运输工程
- 24 篇 材料科学与工程（可...
- 23 篇 网络空间安全
- 21 篇 石油与天然气工程
- 17 篇 光学工程
- 16 篇 动力工程及工程热...
- 15 篇 航空宇航科学与技...
- 7 篇 土木工程
- 6 篇 测绘科学与技术
- 4 篇 化学工程与技术
252 篇 管理学
- 247 篇 管理科学与工程(可...
- 6 篇 工商管理
- 6 篇 图书情报与档案管...
173 篇 理学
- 67 篇 系统科学
- 58 篇 物理学
- 30 篇 数学
- 16 篇 化学
- 9 篇 生物学
48 篇 文学
- 48 篇 新闻传播学
16 篇 医学
- 12 篇 临床医学
9 篇 经济学
- 7 篇 应用经济学
9 篇 军事学
- 9 篇 军队指挥学
5 篇 教育学
1 篇 法学

主题

10,732 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,645 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,303 篇 resource managem...
1,302 篇 real time system...
1,292 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
969 篇 job shop schedul...
946 篇 dynamic scheduli...
782 篇 costs
736 篇 telecommunicatio...
691 篇 switches
677 篇 optimal scheduli...
588 篇 application soft...
582 篇 heuristic algori...
520 篇 hardware

机构

40 篇 department of el...
32 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
29 篇 department of co...
26 篇 department of co...
24 篇 department of co...
24 篇 school of electr...
23 篇 department of co...
22 篇 department of co...
22 篇 department of co...
22 篇 mitre corporatio...
22 篇 beijing universi...
21 篇 institute of com...
19 篇 department of el...
19 篇 bell laboratorie...
18 篇 department of el...

作者

30 篇 m. hamdi
26 篇 tei-wei kuo
25 篇 e. leonardi
21 篇 e.h.-m. sha
19 篇 sanjoy baruah
19 篇 f. neri
19 篇 klaus i. pederse...
18 篇 k.g. shin
18 篇 james h. anderso...
17 篇 p. giaccone
17 篇 maode ma
17 篇 v.o.k. li
16 篇 jian-jia chen
16 篇 n.k. jha
16 篇 kwei-jay lin
16 篇 d. mosse
15 篇 j.a. stankovic
15 篇 i. ahmad
15 篇 j.w.s. liu
15 篇 r. srikant

语言

10,592 篇 英文
82 篇 其他
58 篇 中文

检索条件"主题词=Scheduling algorithm"

共 10732 条记录，以下是4431-4440 订阅

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

详细简洁

排序：

Instruction-Set Customization for Real-Time Embedded Systems

Instruction-Set Customization for Real-Time Embedded Systems

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Huynh Phung Huynh Tulika Mitra School of Computing National University of Singapore Singapore

ISBN: (纸本)9783981080124;3981080122

Application-specific customization of the instruction set helps embedded processors achieve significant performance and power efficiency. In this paper, we explore customization in the context of multi-tasking real-time embedded systems. We propose efficient algorithms to select the optimal set of custom instructions for a task set under two popular real-time scheduling policies. Our algorithms minimize the processor utilization through customization while satisfying the task deadlines and the constraint on silicon area. Experimental evaluation with various task sets shows that appropriate customization can achieve significant reduction in the processor utilization and the energy consumption

关键词： Real time systems Embedded system Processor scheduling Dynamic scheduling Voltage Energy consumption Computer aided instruction scheduling algorithm Silicon Timing

来源：评论

学校读者我要写书评

暂无评论

Group schedule serialized traffic in optical burst switching networks

Group schedule serialized traffic in optical burst switching...

引用

International Conference on Broadband Networks (BroadNets)

作者： Xiaojun Cao James Joseph Jikai Li Chunsheng Xin Department of Computer Science Georgia State University Atlanta GA USA College of Computing and Information Sciences Rochester Institute of Technology Rochester NY USA Department of Computer Science College of New Jersey Ewing NJ USA Department of Computer Science Norfolk State University Norfolk VA USA

ISBN: (纸本)9781424414321

In this paper, a new scheduling algorithm, Serialized Batch scheduling (SBS) for Optical Burst Switching (OBS) networks is proposed. SBS aggregates and serializes bursts along shared path into one composite burst which is switched as a single unit. There are two important processes in SBS namely, batching and serializing. While the batching process chooses proper set of bursts to form the composite burst, the serializing process determines how to organize the OBS bursts within the composite burst and generates a corresponding composite control packet. Several SBS batching and serializing schemes are introduced and analyzed. Our study shows that the guard band and bursts overlap can be reduced in the proposed SBS, and therefore, the packet loss rate and the number of switch reconfigurations can be significantly reduced.

关键词： Telecommunication traffic Optical burst switching Optical packet switching Optical buffering Optical network units Bandwidth scheduling algorithm Switches Optical fiber networks Optical sensors

来源：评论

学校读者我要写书评

暂无评论

Solving a Bi-Criteria Permutation Flow Shop Problem Using Immune algorithm

Solving a Bi-Criteria Permutation Flow Shop Problem Using Im...

引用

IEEE Symposium on Computational Intelligence in scheduling, CISCHED, SCIS

作者： Reza Tavakkoli-Moghaddam Ali-Reza Rahimi-Vahed Ali Hossein Mirzaei Department of Industrial Engineering University of Tehran Tehran Iran Department of Industrial Engineering Tarbiat Moalem University Tehran Iran

A flow shop problem as a typical manufacturing challenge has gained wide attention in academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling problem, in which the weighted mean completion time and the weighted mean tardiness are to be minimized simultaneously. Since a flow shop scheduling problem has been proved to be NP-hard in strong sense, an effective multi-objective immune algorithm (MOIA) is proposed for searching locally Pareto-optimal frontier for the given problem. To prove the efficiency of the proposed algorithm, a number of test problems are solved and the efficiency of the proposed algorithm, based on some comparison metrics, is compared with a distinguished multi-objective genetic algorithm, i.e. SPEA-II. The computational results show that the proposed MOIA performs better than the above genetic algorithm, especially for large-sized problems

关键词： Job shop scheduling scheduling algorithm Genetic algorithms Processor scheduling Computational intelligence Particle swarm optimization Heuristic algorithms Manufacturing Testing

来源：评论

学校读者我要写书评

暂无评论

Area Optimization of Multi-Cycle Operators in High-Level Synthesis

Area Optimization of Multi-Cycle Operators in High-Level Syn...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： M. C. Molina R. Ruiz-Sautua J. M. Mendias R. Hermida Departmento. Arquitectura de Computadores y Automática Universidad Complutense de Madrid Spain

ISBN: (纸本)9783981080124

Conventional high-level synthesis algorithms usually employ multi-cycle operators to reduce the cycle length in order to improve the circuit performance. These operators need several cycles to execute one operation, but the entire functional unit is not used in any cycle. Additionally, the execution of operations over wider multi-cycle operators is unfeasible if their results must be available in a smaller number of cycles than the functional unit delay. This obliges to add new functional resources to the datapath even if multi-cycle operators are idle when the execution of the operation begins. In this paper a new design technique to overcome the restricted reusability of multi-cycle operators is presented. It reduces the area of these functional units allowing their internal reuse when executing one operation. It also expands the possibilities of common hardware sharing as it allows the partial use of multicycle operators to calculate narrower operations faster than the functional unit delay. This technique is applied as an optimization phase at the end of the high-level synthesis process, and can optimize the circuits synthesized by any high-level synthesis tool

关键词： High level synthesis Circuit optimization Circuit synthesis Clocks High performance computing Hardware scheduling algorithm Calculus Delay effects Resource management

来源：评论

学校读者我要写书评

暂无评论

Determining the Minimum Energy Consumption using Dynamic Voltage and Frequency Scaling

Determining the Minimum Energy Consumption using Dynamic Vol...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Min Yeol Lim Vincent W. Freeh Department of Computer Science North Carolina State University Raleigh NC USA

While improving raw performance is of primary interest to most users of high-performance computers, energy consumption also is a critical concern. Some microprocessors allow voltage and frequency scaling, which enables a system to reduce CPU power and performance when the CPU is not on the critical path. When properly directed, such dynamic voltage and frequency scaling can produce significant energy savings with little performance penalty. Various DVFS scaling algorithms have been proposed. However, the benefit is application-dependent. We cannot see if they achieve the energy consumption as minimum as possible. So, it is important to establish the baseline of the DVFS scheduling for any application. This paper determines minimum energy consumption in voltage and frequency scaling systems for a given time delay. We assume we have a set of fixed points where scaling can occur. A brute-force solution is intractable even for a moderately sized set (although all programs presented in this paper can be solved with the brute-force). Our algorithm efficiently chooses the exact optimal schedule satisfying the given time constraint by estimation. Besides, our time and energy estimations from the optimal schedule have reasonable accuracy with 1.48% of differences at maximum.

关键词： Energy consumption Dynamic voltage scaling Frequency Optimal scheduling Central Processing Unit High performance computing Microprocessors Delay effects scheduling algorithm Time factors

来源：评论

学校读者我要写书评

暂无评论

A Distributed Deadlock Detection and Resolution algorithm for Process Networks

A Distributed Deadlock Detection and Resolution Algorithm fo...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Gregory E. Allen Paul E. Zucknick Brian L. Evans Applied Research Laboratories and Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

In the process network (PN) model, multiple concurrent processes communicate over unidirectional FIFO queues. PN is useful for modeling signal processing systems of streaming data, and naturally captures parallelism in these systems. PN provides formal execution properties to alleviate the difficulties of threaded and distributed programming, and naturally maps onto parallel and distributed targets. For a large class of PN, clever run-time scheduling can permit execution in bounded memory. In general, PN termination and boundedness cannot be statically determined, so correct bounded scheduling of PN requires run-time deadlock detection. We present the first algorithm that correctly performs dynamic deadlock detection and resolution for bounded scheduling of PN. The proposed algorithm is a modification of a distributed deadlock detection algorithm by Mitchell and Merritt.

关键词： System recovery Dynamic scheduling Signal processing algorithms Signal processing Parallel processing Writing Laboratories Distributed computing Runtime scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

An Innovative Restoration algorithm with Prioritized Preemption Enabled

An Innovative Restoration Algorithm with Prioritized Preempt...

引用

ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Jingyi Wang Zhiyu Zhou Jian Wu Beijing University of Posts and Telecommunications China Bell Laboratories Research China Lucent Technology Beijing China

This paper proposes an innovative prioritized restoration algorithm which enables carefully scheduled preemption (RAPPE). Firstly, it makes dedicate differentiation among network resources based on their roles in holding up services (working or backup) as well as the service levels they are carrying; secondly, it enables both higher level service preempting resources of lower and lower level service utilizing spare resources of higher; thirdly, it carefully schedules preempting rules. Simulation results show RAPPE satisfies various service requirements according to their priority levels and improves the network resource utilization sharply. Moreover, RAPPE also achieves wonderful performance in preemption perspective for it minimizes the preempted service level as well as the number of preempted services, both of which are important criteria in evaluating a preemption algorithm. Furthermore, to implement the RAPPE in existed networks, only a simple PathCost object needs to be installed on the existed routing module of edge nodes.

关键词： Protection Resource management Software algorithms scheduling algorithm Delay Costs Software engineering Artificial intelligence Distributed computing Routing

来源：评论

学校读者我要写书评

暂无评论

Influence Control for Dynamic Reconfiguration

Influence Control for Dynamic Reconfiguration

引用

Australian Conference on Software Engineering

作者： Zhikun Zhao Wei Li School of Computer Science Central Queensland University Australia

Dynamic reconfiguration is a useful technique for software update because it can achieve an architectural change without shutdown of a system. However, so far in the state-of arts, there has not been an approach that can evaluate and control both the functional influence and performance influence of reconfiguration in a unified framework. In this paper, we present an approach that addresses the above drawback. In our approach, we use a reconfiguration algorithm and a reconfiguration scheduler to control these two types of influence. The algorithm reduces the logical performance influence by allowing old and new components coexisting and uses a version management mechanism to avoid functional side effect in the coexisting period. The scheduler controls the physical performance influence through restricting the processor time spent on the reconfiguration procedure. We implement the algorithm and the scheduler in our reconfiguration data flow model.

关键词： scheduling algorithm Connectors Control systems Processor scheduling Dynamic scheduling Quality of service Streaming media Computer architecture Runtime Centralized control

来源：评论

学校读者我要写书评

暂无评论

A Fast Register Relocation Method for Circuit Size Reduction in Generalized-Synchronous Framework

A Fast Register Relocation Method for Circuit Size Reduction...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Yukihide Kohira Atsushi Takahashi Department of Communications and Integrated Systems Tokyo Institute of Technology Tokyo Japan

Under the assumption that the clock can be inputted to each register at an arbitrary timing, the minimum feasible clock period might be reduced by register relocation while maintaining the circuit behavior and topology. But if the minimum feasible clock period is reduced, then the number of registers tends to be increased. In this paper, we propose a register relocation method that reduces the number of registers while keeping the target clock period. The proposed method reduces the number of registers in the practical time in experiments.

关键词： Registers Clocks Timing Energy consumption Circuit synthesis Logic circuits Circuit topology Propagation delay scheduling algorithm Minimization

来源：评论

学校读者我要写书评

暂无评论

An Adaptive QoS Architecture for IEEE 802.16 Broadband Wireless Networks

An Adaptive QoS Architecture for IEEE 802.16 Broadband Wirel...

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Ikbal Chammakhi Msadaa Fethi Filali Farouk Kamoun Mobile Communications Department Eurecom Institute France CRISTAL research team La Manouba Tunisia

In this paper, we propose a new QoS architecture for PMP 802.16 systems operating in TDD mode over wirelessMAN-OFDM physical layer. It includes a call admission control policy and a hierarchical scheduling algorithm. The CAC policy we propose adopts a min-max fairness approach making efficient and fair use of available resources. The proposed scheduling algorithm flexibly adjusts uplink and downlink bandwidth to serve unbalanced traffic while considering adaptive modulation and coding (AMC) scheme. The efficiency of the proposed QoS architecture is revealed through simulation.

关键词： Wireless networks scheduling algorithm Downlink Bandwidth Mobile communication Channel allocation Proposals Media Access Protocol Programmable control Adaptive control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 440 441 442 443 444 445 446 447 448 449 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：