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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Adaptive disk scheduling for overload management

Adaptive disk scheduling for overload management

引用

International Conference on the Quantitative Evaluation of Systems (QEST)

作者： A. Riska E. Riedel S. Iren Seagate Research Center Pittsburgh PA USA

Most computer systems today are lightly loaded in normal operation. The real performance problems occur during burst times when the system becomes overloaded. We evaluate how the choice of scheduling algorithms can assist a system in maintaining stable performance while operating under transient overloads. We propose a new disk scheduling algorithm that efficiently handles overload by dynamically adjusting its parameters. The algorithm adapts its operation to the current load conditions and achieves good overall performance, while maintaining minimal variability in the request response time. We evaluate the robustness of the algorithm against different disks and synthetic and realistic traces measured in benchmarked systems.

关键词： Adaptive scheduling scheduling algorithm Delay Application software Resource management algorithm design and analysis Adaptive algorithm Performance analysis Processor scheduling Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems

Dynamic scheduling of imprecise-computation tasks in maximiz...

引用

Asia and South Pacific Design Automation Conference

作者： Heng Yu Bharadwaj Veeravalli Yajun Ha Department of Electrical and Computer Engineering National University of Singapore Singapore Computer Networks and Distributed Systems (CNDS) Laboratory National University of Singapore Singapore

ISBN: (纸本)9781424419210

In designing energy-aware CPU scheduling algorithms for real-time embedded systems, dynamic slack reclamation techniques significantly improve system quality-of-service (QoS) and energy efficiency. However, the limited schemes in this domain either demand high complexity or can only achieve limited QoS. In this paper, we present a novel low complexity runtime scheduling algorithm for the imprecise computation (IC) modeled tasks. The target is to maximize system QoS under energy constraints. Our proposed algorithm, named gradient curve shifting (GCS), is able to decide the best allocation of slack cycles arising at runtime, with very low complexity. We study both linear and concave QoS functions associated with IC modelde tasks, on non-DVS and DVS processors. Furthermore, we apply the intra-task DVS technique to tasks and achieve as large as 18% more of the system QoS compared to the conventional "optimal" solution which is inter-task DVS based.

关键词： Dynamic scheduling Embedded system Integrated circuit modeling Voltage control scheduling algorithm Runtime algorithm design and analysis Real time systems Quality of service Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Cell scheduling for ATM switch with two priority classes

Cell scheduling for ATM switch with two priority classes

引用

IEEE Workshop on ATM

作者： D.C.W. Pao S.P. Lam Department of Electronic Engineering City University of Hong Kong Kowloon Hong Kong China

The flexibility of ATM allows it to support various types of applications with diversified quality of service (QoS) requirements. We broadly classified these services into the delay sensitive (DS) class and the loss sensitive (LS) class. The scheduling problem for two priority classes is much more complex than the single priority class counterpart. The scheduling algorithm is required to satisfy two conflicting requirements (i) maintain the cell delay of DS traffic within an acceptable range by giving it a higher transmission priority; and (ii) minimize the cell loss probability of LS traffic. A good scheduling algorithm for a single priority class may not perform well when applied to two priority classes scheduling. We present a reservation based scheduling approach that can handle the QoS requirements of both the DS class and LS class effectively.

关键词： Switches Asynchronous transfer mode Quality of service Application software Delay effects scheduling algorithm Traffic control Propagation losses Videoconference Video compression

来源：评论

学校读者我要写书评

暂无评论

Energy-aware scheduling with deadline and reliability constraints in wireless networks

Energy-aware scheduling with deadline and reliability constr...

引用

International Conference on Broadband Networks (BroadNets)

作者： G. Sudha Anil Kumar G. Manimaran Z. Wang Real Time Computing and Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

ISBN: (纸本)9781424414321

In this paper, we address the problem of scheduling a set of periodic real-time messages in a wireless network with the objective of minimizing the total energy consumption while meeting deadline and reliability constraints. We formally prove that this problem is NP-hard and solve it in two stages. First, we consider a simple model that assumes that the wireless channel is completely reliable and the network is fully provisioned. Using the technique of employing multiple hop-by-hop transmissions instead of a single direct hop transmission as the basis, we prove that the strategy of choosing the hop distances such that they are equidistant is optimal in terms of energy consumption under the deadline constraint. Based on the intuition provided by the optimal strategy, we present heuristic scheduling algorithms for a more realistic wireless channel model and network condition. Our simulation results show that the proposed scheduling algorithms provide significant energy savings over the baseline algorithms

关键词： Wireless networks Energy consumption scheduling algorithm Wireless application protocol Throughput Access protocols Streaming media Resource management Processor scheduling Computer network reliability

来源：评论

学校读者我要写书评

暂无评论

Efficient and fair scheduling of uplink and downlink in IEEE 802.16 OFDMA networks

Efficient and fair scheduling of uplink and downlink in IEEE...

引用

IEEE Conference on Wireless Communications and Networking

作者： V. Singh V. Sharma Department of Electrical Communication Engineering Indian Institute of Science Bangalore India

We develop new scheduling algorithms for the IEEE 802.16d OFDMA/TDD based broadband wireless access system, in which radio resources of both time and frequency slots are dynamically shared by all users. Our objective ... 详细信息

关键词： Downlink Intelligent networks Quality of service Resource management scheduling algorithm Coaxial cables Throughput OFDM Portable media players Copper

来源：评论

学校读者我要写书评

暂无评论

scheduling message processing for reducing rollback propagation

Scheduling message processing for reducing rollback propagat...

引用

International Symposium on Fault-Tolerant Computing (FTCS)

作者： Y.-M. Wang W.K. Fuchs Coordinated Science Laboratory University of Illinois Urbana-Champaign USA

The authors show that the probability of rollback propagation in a message-passing system can often be greatly reduced by reordering the processing of messages. Also, rollback propagation was measured for several parallel programs. A scheduling algorithm for message processing and its implementation for reducing rollback propagation are described. The algorithm incorporates a user-transparent prioritized scheme based on the run-time communication and checkpointing history. Communication trace-driven simulation for several parallel programs written in the Chare Kernel language demonstrated that the probability of rollback propagation can be reduced at the cost of slight additional performance degradation.< >

关键词： Checkpointing Synchronization scheduling algorithm Costs Degradation Processor scheduling NASA Runtime History Kernel

来源：评论

学校读者我要写书评

暂无评论

scheduling directed task graphs on multiprocessors using simulated annealing

Scheduling directed task graphs on multiprocessors using sim...

引用

International Conference on Distributed Computing Systems

作者： A.K. Nanda D. DeGroot D.L. Stenger Computer Science Department Texas A and M University College Station TX USA Texas Instruments Inc. Plano TX USA

Two algorithms based on simulated annealing for minimizing the schedule length of a directed task graph on a multiprocessor system are presented. The first algorithm uses the schedule length itself as the cost function to be minimized. The second algorithm uses an indirect cost function that minimizes the total communication overhead and the total loss of parallelism simultaneously. Implementation results indicate that the first algorithm is superior to the second one in terms of the schedule length it gives, but the second algorithm is superior to the first in terms of algorithm run time.< >

关键词： Simulated annealing scheduling algorithm Processor scheduling Optimal scheduling Clustering algorithms Computational modeling Instruments Optimization methods Heuristic algorithms Polynomials

来源：评论

学校读者我要写书评

暂无评论

Simplified Antenna Selection and User scheduling for Orthogonal Space-Division Multiplexing

Simplified Antenna Selection and User Scheduling for Orthogo...

引用

IEEE Conference on Wireless Communications and Networking

作者： Shreeram Sigdel Witold A. Krzymien University of Alberta/TRLaboratories Edmonton AB Canada

In this paper, we study simplified algorithms for user scheduling in conjunction with receive antenna selection (RAS) for two downlink multiuser orthogonal space-division multiplexing techniques: block diagonalization (BD) and successive optimization (SO). Proposed algorithms select user and antenna subsets that maximize total power gain of the equivalent channel through mutual null-space projections of the active user channels. With this approach, algorithms add the best user at a time from the set of users not selected yet to the set of selected users until the desired number of users have been selected. To reduce the complexity further, users whose channel correlation to the signal subspace of the previously selected users is under some specified threshold are grouped at each step of the algorithm such that next user is selected from that group. This avoids the search through all K - i remaining users at the ith step of the algorithm. Two RAS algorithms are proposed, which further enhance the power gain of the equivalent channel by selecting a subset that contributes most towards the sum rate. For SO, user selection accounts for the interference of the previously selected users and maximizes the ratio of the total power of the equivalent channel to the approximate interference power on the desired signal subspace. Proposed algorithms perform close to the previously proposed algorithms with much less complexity.

关键词： OFDM Receiving antennas Downlink scheduling algorithm Transmitting antennas Base stations Interference cancellation Null space Power control Quality of service

来源：评论

学校读者我要写书评

暂无评论

Simple Proportional Fairness scheduling for OFDMA Frame-Based Wireless Systems

Simple Proportional Fairness Scheduling for OFDMA Frame-Base...

引用

IEEE Conference on Wireless Communications and Networking

作者： Nararat Ruangchaijatupon Yusheng Ji Department of Informatics Graduate University of Advanced Studies (SOKENDAI) Chiyoda Tokyo Japan National Institute of Informatics Graduate University of Advanced Studies (SOKENDAI) Chiyoda Tokyo Japan

We propose a packet scheduling scheme called OFDMA frame-based proportional fairness (OFPF) for a frame- based OFDMA wireless system. OFPF aims to maximize system throughput as well as maintain fairness between users. We define the scheduling resources as slots of fixed duration per OFDMA subchannel. Furthermore, we assume a realistic traffic pattern in which the user queues are not always backlogged. We suggest a simple method to update the average data rate in the PF ratio. In addition, we introduce an uncomplicated approach to schedule user data using matrix-based calculation. The simulation shows that our scheme improves performance in terms of throughput, delay, and fairness.

关键词： Proposals Throughput Delay Informatics scheduling algorithm Traffic control Wireless networks Frequency domain analysis Processor scheduling Downlink

来源：评论

学校读者我要写书评

暂无评论

scheduling tasks with variable deadlines

Scheduling tasks with variable deadlines

引用

Real-Time Technology and Applications Symposium

作者： Chi-Sheng Shih Lui Sha J. Liu Department of Computer Science University of Illinois Urbana IL USA Microsoft Corporation Redmond WA USA

ISBN: (纸本)0769511341

Traditional real time scheduling algorithms typically assume that deadlines of tasks do not change with time. Task deadlines in many real time command, control and communication applications change over time. Deadlines of some tasks in these applications depend on the states of the objects monitored and controlled by the applications. Because the states of the objects change with time, the deadlines may also change with time. The paper discusses the problem of scheduling tasks with variable deadlines and presents preliminary results and on-going work.

关键词： Missiles Real time systems scheduling algorithm Vehicles Monitoring Control systems Accidents Jamming Application software Communication system control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 454 455 456 457 458 459 460 461 462 463 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：