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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,731 篇 会议
1,797 篇 期刊文献
5 篇 学位论文
1 册 图书

馆藏范围

8,534 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,400 篇 工学
- 3,901 篇 计算机科学与技术...
- 1,640 篇 信息与通信工程
- 1,609 篇 软件工程
- 1,512 篇 电气工程
- 587 篇 控制科学与工程
- 343 篇 电子科学与技术（可...
- 310 篇 机械工程
- 194 篇 动力工程及工程热...
- 188 篇 交通运输工程
- 116 篇 仪器科学与技术
- 80 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 48 篇 土木工程
- 47 篇 安全科学与工程
- 42 篇 建筑学
- 41 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,877 篇 管理学
- 1,759 篇 管理科学与工程(可...
- 1,431 篇 工商管理
- 220 篇 图书情报与档案管...
1,749 篇 理学
- 1,428 篇 数学
- 225 篇 系统科学
- 198 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
99 篇 经济学
- 97 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
35 篇 农学
26 篇 教育学
25 篇 文学
5 篇 艺术学
3 篇 军事学

主题

8,534 篇 scheduling algor...
1,042 篇 scheduling
564 篇 schedules
517 篇 resource managem...
510 篇 real-time system...
472 篇 cloud computing
439 篇 throughput
412 篇 heuristic algori...
392 篇 quality of servi...
376 篇 delays
307 篇 task analysis
297 篇 dynamic scheduli...
290 篇 optimization
259 篇 computational mo...
227 篇 simulation
216 篇 energy consumpti...
205 篇 job shop schedul...
204 篇 bandwidth
196 篇 servers
194 篇 algorithm design...

机构

26 篇 beijing universi...
24 篇 state key labora...
21 篇 university of ch...
18 篇 national mobile ...
14 篇 institute of com...
13 篇 purple mountain ...
12 篇 hong kong polyte...
12 篇 northeastern uni...
12 篇 college of compu...
10 篇 college of compu...
10 篇 sun yat sen univ...
10 篇 school of softwa...
10 篇 university of el...
10 篇 scuola super san...
9 篇 shanghai jiao to...
9 篇 georgia state un...
9 篇 school of electr...
9 篇 state key labora...
9 篇 college of compu...
9 篇 department of el...

作者

21 篇 ghaderi javad
16 篇 baruah sanjoy
15 篇 guan nan
13 篇 yi wang
12 篇 gao hong
11 篇 anderson james h...
11 篇 xie zhiqiang
11 篇 buyya rajkumar
10 篇 wei hu
10 篇 wang wei
10 篇 wang yi
10 篇 jing liu
9 篇 zhang lei
9 篇 deng qingxu
9 篇 ying lei
9 篇 hsu yu-pin
9 篇 li bo
9 篇 shakkottai sanja...
9 篇 zhang jie
9 篇 pop florin

语言

8,282 篇 英文
162 篇 其他
82 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 德文
1 篇 法文
1 篇 俄文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8534 条记录，以下是4841-4850 订阅

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

详细简洁

排序：

Energy-Efficient scheduling for Multicore Systems with Bounded Resources

Energy-Efficient Scheduling for Multicore Systems with Bound...

引用

IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social Computing (CPSCom) Green Computing and Communications (GreenCom)

作者： Ziliang Zong Jonathan Bush Rong Ge Xin Li Zizhong Chen Department of Computer Science Texas State University USA Amazon Inc. USA Department of Mathematics Statistics and Computer Science Marquette University USA School of Computer Science and Technology Shandong University China Department of Computer Science UC-Riverside USA

High energy cost has become a salient constraint of the next generation of multicore based supercomputers. One approach that has the potential to conserve energy is to reduce the number of resources allocated for a given parallel application. However, this approach raises the concern that utilizing bounded resources may adversely affect performance. In this paper, we demonstrate that utilizing bounded resources to execute parallel tasks with dependency on multicore systems can actually conserve energy without degrading performance. We achieve this goal by proposing BREES, an energy-efficient scheduling algorithm for multicore systems with bounded resources. The proposed BREES algorithm takes advantage of the Dynamic Voltage Scaling (DVS) algorithm and the task duplication strategy. In addition, a dynamic waiting window (DWW) is implemented in BREES to handle the system hardware heterogeneity. We evaluate the effectiveness of BREES by conducting a series of experiments using both real world and synthetically generated parallel applications on fifteen different multicore processors and four well-known high speed networks.

关键词： Multicore processing Program processors Energy efficiency Energy consumption Educational institutions Algorithm design and analysis scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A High Efficient Disk scheduling Framework with QoS Mechanism in Xen-Based Cloud Platforms

A High Efficient Disk Scheduling Framework with QoS Mechanis...

引用

IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID)

作者： Tseng-Yi Chen Hsin-Wen Wei Ying-Jie Chen Nia-Yuan Chang Tsan-Sheng Hsu Wei-Kuan Shih Department of Computer Science National Tsing Hua University Hsinchu Taiwan Department of Electrical Engineering Tamkang University Taipei Taiwan Academia Sinica Institute of Information Science Taipei Taiwan

Improving the disk I/O performance is always a critical research issue in cloud computing platforms, especially for cloud computing platforms with distributed data-intensive workloads. To resolve the problem of poor disk I/O, in this paper, we propose a novel scheduling framework in the Xen-based hypervisor. In our framework, we employ a locality-aware scheduler with a deadline constraint and provide a basic QoS controller to guarantee the throughput of the cloud platform. The experimental results show that our solution increases the IOPS of Xen-based cloud platform by 9%-13% compared to the solution of early-deadline-first (EDF), deadline scheduling algorithm or Flubber. Moreover, according to the schedulability test, our solution can improve the miss deadline ratio significantly, compared to the EDF scheduling algorithm and Flubber.

关键词： Quality of service Virtual machine monitors Virtual machining scheduling algorithms Educational institutions Servers Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Multiprocessor Real-Time scheduling with Hierarchical Processor Affinities

Multiprocessor Real-Time Scheduling with Hierarchical Proces...

引用

Euromicro Conference on Real-Time Systems

作者： Vincenzo Bonifaci Björn Brandenburg Gianlorenzo D'Angelo Alberto Marchetti-Spaccamela IASI—CNR Italy MPI-SWS Germany Gran Sasso Sci. Inst. L'Aquila Italy Sapienza Università di Roma Rome Italy

ISBN: (纸本)9781509028122

Many multiprocessor real-time operating systems offer the possibility to restrict the migrations of any task to a specified subset of processors by setting affinity masks. A notion of “strong arbitrary processor affinity scheduling” (strong APA scheduling) has been proposed; this notion avoids schedulability losses due to overly simple implementations of processor affinities. Due to potential overheads, strong APA has not been implemented so far in a real-time operating system. We show that, in the special but highly relevant case of hierarchical processor affinities (HPA), strong APA scheduling can be implemented with a vastly improved runtime complexity. In particular, we present a strong HPA scheduler with a runtime complexity of O(m) per task arrival and O(log n+m 2 ) per task departure, where mis the number of processors and n is the number of tasks, thus improving on the previous bounds of O(m 2 ) and O(mn). The improved runtime algorithms allowed us to implement support for strong hierarchical processor affinities in LITMUSRT. We benchmarked this implementation on a 24-core platform and observed nonnegligible, but still viable runtime overheads. Additionally, in the case of a bilevel affinity hierarchy and when job priorities are based on deadlines, we argue that the performance of our strong HPA scheduler, HPA-EDF, can be related to system optimality in the following way: any collection of jobs that is schedulable (under any policy) on m unit-speed processors subject to hierarchical affinity constraints is correctly scheduled by HPA-EDF on m processors of speed 2.415.

关键词： Real-time systems Runtime Complexity theory scheduling algorithms Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Genetic Algorithm for Flexible Job Shop scheduling Problem

A Hybrid Genetic Algorithm for Flexible Job Shop Scheduling ...

引用

World Conference on Mechanical Engineering and Intelligent Manufacturing (WCMEIM)

作者： Xianglong Wang Changyi Liu College of Mechanical and Electrical Engineering Nanjing University of Aeronautics and Astronautics Nanjing China

ISBN: (纸本)9781665473705

Partially flexible job shop scheduling problem (P-FJSP) is a NP Hard problem more complex than fully flexi-ble job shop scheduling problem (T -FJSP). In this paper, the mathematical model of flexible job shop scheduling is established with the goal of minimizing the maximum completion time (makespan). It combines the local search ability of simu-lated annealing algorithm and the global search ability of ge-netic algorithm. In the process of chromosome decoding, greedy decoding method is used to get a better scheduling solution as far as possible. The hybrid scheduling algorithm is implemented based on Visual Studio and C # language. Finally, 8×8 classic scheduling instance are used for simulation scheduling experiments to verify that the hybrid genetic algorithm proposed in this paper is effective in solving large-scale FJSP.

关键词： Visualization Job shop scheduling scheduling algorithms NP-hard problem Simulation Simulated annealing Mathematical models

来源：评论

学校读者我要写书评

暂无评论

A round-trip-time based concurrent transmission scheduling for MPTCP

A round-trip-time based concurrent transmission scheduling f...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Rui Chen Wen-Nai Wang Jing-Ling Zhu Bing Wang School of Communications and Information Engineering Nanjing University of Posts and Telecommunications Nanjing China

Multipath Transmission Control Protocol (MPTCP) promises to aggregate concurrent and multiple communications interfaces to improve data transmission rate. There is, however, an open issue of flow management under highly asymmetric condition where the throughput may degrade. This paper proposes an algorithm for flow scheduling in the sender to minimize the degree of out-of-order packets arriving in the receiver. The Round Trip Times (RTTs) of each path of a MPTCP connection are taken into traffic allocation over subflows. Simulations are conducted by extending the MPTCP open source modules for the NS2 tool set. It is found that the proposed algorithm is superior to a traditional Round-Robin (RR) technique in both buffer size and effective throughput.

关键词： Receivers Throughput Out of order Merging scheduling algorithms scheduling Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Intelligent Grid scheduling Algorithm based on Artificial Neural Network

Intelligent Grid Scheduling Algorithm based on Artificial Ne...

引用

Mobile Networks and Wireless Communications (ICMNWC), IEEE International Conference on

作者： Baoqiang Yue Jing Peng Fujun Qi Haiyan Chen Guilong Lv State Grid Linyi Power Supply Company Linyi Shandong China

ISBN: (纸本)9781665491129

With the increasingly serious energy and environmental problems, renewable energy has been favored all over the world. In order to ensure the safe and stable operation of the power grid when wind power and photovoltaic are connected to the grid, the power system often takes some technical means and measures to absorb the output from wind power and photovoltaic. This paper mainly studies the smart grid scheduling algorithm based on artificial neural network. In this paper, a BP neural network model based on load prediction is constructed. By integrating the learning network rate, elastic method is adopted to modify and optimize the BP neural network model. The load data obtained from the modified model is used for power grid dispatching. The experimental results show that the BP neural network is far superior to the traditional dispatching model in load prediction and power grid dispatching.

关键词： Photovoltaic systems scheduling algorithms Artificial neural networks Wind power generation Predictive models Power system stability Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

QL-TSCH-plus: A Q-learning Distributed scheduling Algorithm for TSCH Networks

QL-TSCH-plus: A Q-learning Distributed Scheduling Algorithm ...

引用

IEEE World Forum on Internet of Things (WF-IoT)

作者： Mehdi Kherbache Moufida Maimour Eric Rondeau CRAN Laboratory CNRS UMR 7039 Campus Sciences BP 70239 Université de Lorraine Nancy France

ISBN: (数字)9798350311617

ISBN: (纸本)9798350311624

Addressing the requirements of Industrial Internet of Things (IIoT) in Industry 4.0, the Time Slotted Channel Hopping (TSCH) protocol of the IEEE 802.15.4e amendment has been proposed. However, the lack of a defined scheduling procedure in the standard remains an open research area. Existing reinforcement learning-based scheduling proposals demonstrate great potential for this technique due to the ongoing observations within the network environment. Beneficial for real-world scenarios where network conditions are volatile and unpredictable. This work presents QL- TSCH-plus, an enhancement of the existing QL- TSCH scheduler that reduces energy consumption by adapting the Action Peeking mechanism to a distributed scheme. Instead of continuously listening to neighboring nodes communication, QL- TSCH-plus allows nodes to broadcast the learned transmission slots for updating the Action Peeking Tables and allocating reception slots, reducing energy use by up to 47% compared to QL-TSCH. This novel approach also maintains reliability and timeliness, demonstrating significant potential for efficient scheduling in TSCH networks, making it suitable for the IIoT.

关键词： Energy consumption Job shop scheduling Q-learning scheduling algorithms Routing Fourth Industrial Revolution Resource management

来源：评论

学校读者我要写书评

暂无评论

Certification-cognizant scheduling of tasks with pessimistic frequency specification

Certification-cognizant scheduling of tasks with pessimistic...

引用

International Symposium on Industrial Embedded Systems

作者： Sanjoy Baruah University of North Carolina USA

In modern embedded platforms, safety-critical functionalities that must be certified correct to very high levels of assurance may co-exist with less critical software that are not subject to certification requirements. Upon such platforms one seeks to satisfy two, sometimes contradictory, goals: (i) being able to certify the safety-critical functionalities under very conservative assumptions, and (ii) ensuring high utilization of platform resources even when actual run-time behavior does not live up to such pessimistic expectations. This paper describes efforts at designing scheduling algorithms that balance these two requirements, when scheduling recurrent tasks that are triggered by external events of unknown exact frequency.

关键词： Job shop scheduling Automotive engineering scheduling algorithms Industries Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic Targeting of Satellite Observations Incorporating Slewing Costs and Complex Observation Utility

Dynamic Targeting of Satellite Observations Incorporating Sl...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Kangaslahti, Akseli Candela, Alberto Swope, Jason Yue, Qing Chien, Steve Univ Michigan Ann Arbor MI 48109 USA CALTECH Jet Prop Lab Pasadena CA 91011 USA

ISBN: (纸本)9798350384581;9798350384574

Maximizing the utility of limited Earth observing satellite resources is a difficult ongoing problem. Dynamic Targeting is an approach to this challenge that intelligently plans and executes primary sensor observations based on information from a lookahead sensor. However, current implementations have failed to account for realistic satellite operational constraints and have used static utility for repeat observations of the same target. To address these limitations, we implement a more general Dynamic Targeting framework that comprises a physics-based slew model, a dynamic model of observation utility, and an algorithm for gathering high-utility observations. To demonstrate this framework, we also supply complex dynamic utility models that are applicable to many missions and new algorithms for intelligently scheduling observations with slewing restrictions and changing utility, including a greedy algorithm and a depth-first search algorithm. To evaluate these algorithms, we test their performance across simulated runs through two datasets and compare to the performance of an algorithm representative of most scheduling algorithms aboard Earth science missions today as well as an intractable upper bound. We show that our algorithms have great potential to improve science return from Earth science missions.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A new genetic-based algorithm for reliable distributed resources

A new genetic-based algorithm for reliable distributed resou...

引用

2011 IEEE 3rd International Conference on Communication Software and Networks, ICCSN 2011

作者： Nejadkheirallah, Mohsen Sookhtsaraei, Reza Darvish, Kobra Shahnazi, Mehdi Allameh Mohaddes Noori Institute of Higher Education Noor Iran Payam Noor University Tehran Iran University of Tehran Tehran Iran

ISBN: (纸本)9781612844855

In this paper, a new scheduling algorithm has been introduced based on dynamic genetic algorithm, which is more efficient in comparison with the previous similar algorithms and has more reliability. SQEFG is a new proposed algorithm, with new parameters and metrics defined, delays and response time to jobs have been decreased and the user satisfaction level has been increased. Analysis of proposed algorithm and several simulations' results show better makeSpan in the overall processing time and more efficiency improvement in distributed systems. Hence the quality of service increases at different levels of distributed processors and the acknowledgments delay time of the processes decrease significantly. Considering the majority of parameters in the Grid environment, a new scheduling algorithm for independent jobs based on genetic algorithm has been presented which has increased the performance in the grid environments. For fault tolerance control in grid environments with high failure rates, inspection point method that has an enhanced performance comparing other techniques and methods such as repeat request, and repeat and migration is being used which considering low risk and risky environments parameters and metrics, reduces the round trip scheduling time of the processing resources comparing previous algorithms, hence increasing the quality of the service in different grid environments and decreases the average processing time of work. By using this new proposed algorithm, we would be able to solve some of the challenges in processing resources management and finally improve the response time for the service output which provided by the processing resources and with this new hybrid and dynamic technique overall processing time is being reduced. © 2011 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 481 482 483 484 485 486 487 488 489 490 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：