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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,751 篇 会议
1,800 篇 期刊文献
5 篇 学位论文
1 册 图书

馆藏范围

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

日期分布

学科分类号

5,400 篇 工学
- 3,895 篇 计算机科学与技术...
- 1,638 篇 信息与通信工程
- 1,596 篇 软件工程
- 1,511 篇 电气工程
- 588 篇 控制科学与工程
- 343 篇 电子科学与技术（可...
- 310 篇 机械工程
- 194 篇 动力工程及工程热...
- 188 篇 交通运输工程
- 116 篇 仪器科学与技术
- 81 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 49 篇 土木工程
- 47 篇 安全科学与工程
- 43 篇 建筑学
- 40 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,880 篇 管理学
- 1,761 篇 管理科学与工程(可...
- 1,433 篇 工商管理
- 222 篇 图书情报与档案管...
1,760 篇 理学
- 1,441 篇 数学
- 225 篇 系统科学
- 200 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
37 篇 农学
26 篇 教育学
25 篇 文学
5 篇 艺术学
3 篇 军事学

主题

8,557 篇 scheduling algor...
1,044 篇 scheduling
564 篇 schedules
520 篇 resource managem...
511 篇 real-time system...
472 篇 cloud computing
439 篇 throughput
417 篇 heuristic algori...
392 篇 quality of servi...
377 篇 delays
307 篇 task analysis
302 篇 dynamic scheduli...
293 篇 optimization
261 篇 computational mo...
228 篇 simulation
217 篇 energy consumpti...
205 篇 job shop schedul...
204 篇 bandwidth
198 篇 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 篇 shanghai jiao to...
10 篇 sun yat sen univ...
10 篇 school of softwa...
10 篇 university of el...
10 篇 scuola super san...
10 篇 school of automa...
9 篇 georgia state un...
9 篇 school of electr...
9 篇 state key labora...
9 篇 college of compu...

作者

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,295 篇 英文
173 篇 其他
81 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8557 条记录，以下是521-530 订阅

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

详细简洁

排序：

Analysis of Thread Block scheduling algorithms for General Purpose GPU Systems

Analysis of Thread Block Scheduling Algorithms for General P...

引用

Computer Science and Data Engineering (CSDE), IEEE Asia-Pacific Conference on

作者： Soyeon Park Kyungwoon Cho Hyokyung Bahn Ewha University Seoul Republic of Korea Embedded Software Research Center Ewha University Seoul Republic of Korea

ISBN: (纸本)9781665495530

Modern GPGPUs (General-Purpose Graphics Processing Units) have the ability of executing thousands of threads simultaneously. However, the resource utilization of GPGPU in real systems is limited as the load balancing between SMs (Stream Multiprocessors) is difficult during the scheduling of thread blocks, which are the basic units for resource allocation in GPGPU. In order to schedule thread blocks in GPGPU, the current hardware scheduler allocates thread blocks to SMs by the Round-Robin order. Although this is simple and easy to implement, we show that Round-Robin is not efficient when thread blocks of heterogeneous workloads are mixed. In such environments, efficient resource sharing in GPGPU is challenging as workloads have different resource usage patterns, but scheduling should be performed instantly. In this paper, we present a new thread block scheduling algorithm that has the ability of analyzing the load of SMs and the characteristics of pending thread blocks. Specifically, we formulate thread block scheduling as a bin-packing problem, and aim to minimize the internal fragmentation of SMs by arranging size-aware filling of thread blocks to overall SMs in advance. To do so, we make use of multiple queues for incoming thread blocks according to their sizes and perform scheduling by considering the load balancing of SMs. Our experimental results under a wide range of workload conditions show that the proposed algorithm improves the performance of GPGPU by 24.8% on average compared to the Round-Robin scheduler.

关键词： Schedules scheduling algorithms Instruction sets Graphics processing units Load management Data engineering Filling

来源：评论

学校读者我要写书评

暂无评论

Research and Implementation of AHP scheduling algorithms for Load Balancing

Research and Implementation of AHP Scheduling Algorithms for...

引用

2011 13th IEEE Joint International Computer Science and Information Technology Conference(JICSIT 2011)

作者： Jian-dong Zhang 1 ,Jin Yang 1 ,Xuan Ma 2 , 1 Department of Computer Science,Laboratory of Intelligent Information Processing and Application 1 LeShan Normal Univ. 1 614004 LeShan,SiChuan,ChinaCai-ming Liu 1 ,Bin Li 1 2 Library of Leshan Normal University 2 LeShan Normal Univ. 2 614004 LeShan,SiChuan,China

For great change of service time for request,big difference of hardware and software server and different network performance,this paper proposes a dynamic-feedback algorithm based on AHP in the course of studying the algorithm of load balancing in the cluster-based system. Combined with Weighted scheduling algorithm of the kernel, based on the parameters influencing the performance of cluster system from dynamic feedback,we can adjust the servers'weight,solve the load imbalance problem among the servers effectively and certainly improve the throughput of the whole system.

关键词： The Analytic Hierarchy Proccess Server cluster Load balancing scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient scheduling algorithms for Data Center Resources in Cloud Computing

Energy-efficient Scheduling Algorithms for Data Center Resou...

引用

International Workshop on Intelligent Communication and Social Networks

作者： Tamal Adhikary Amit Kumar Das Md. Abdur Razzaque A. M. Jehad Sarkar Green Networking Research Group Department of Computer Science & Engineering University of Dhaka Dept. of Digital Information Engineering College of Engineering Hankuk University of Foreign Studies

ISBN: (纸本)9781479909735

A significant amount of energy is consumed to render high-level computation tasks in large scale cloud computing applications. The state-of-the-art energy saving techniques based on centralized job placement approaches reduce the reliability of operation due to a single point of failure. Moreover, the existing works do not consider energy consumption cost for communication devices and network appliances which contribute a lot. In this paper, we have proposed a mechanism for cluster formation based on network vicinity among the data servers. We have developed two distributed and localized intra-cluster and inter-cluster VM scheduling algorithms based on energy calculation, resource requirement and availability. Our proposed scheduling algorithms manage VMs to reduce the energy consumption of both the servers and networking devices. Simulation results show that our proposed distributed VM scheduling algorithms can conserve significant amount of energy compared to state-of-the-art works.

关键词： scheduling algorithms energy capacity Cloud Computing Single point failure energy consumption Servers communication equipment data center Voltmeter virtual machines Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Developing a fairness metric for packet scheduling algorithms in a single-hop wireless network 01

Developing a fairness metric for packet scheduling algorithm...

引用

Annual CCSC Northeastern Conference on The Journal of Computing in Small Colleges

作者： Wesley Murry Dickinson College Dickinson College/HUB 1539 PO BOX 4888 Carlisle PA

No abstract available.

关键词： scheduling algorithms Wireless networks wireless multi-hop networks Packet Metric Metronidazole

来源：评论

学校读者我要写书评

暂无评论

Analyzing Heuristic Job scheduling algorithms by Varying Cloudlet Load in a Cloud Infrastructure

Analyzing Heuristic Job Scheduling Algorithms by Varying Clo...

引用

International Conference on System Modeling & Advancement in Research Trends (SMART)

作者： Vivek Jain Shivani Chouhan K. K. Goyal Bhagwant Univ. Ajmer Rajasthan India R.B.S. Management Technical Campus Agra U.P. India

ISBN: (纸本)9781665439718

The cloud based innovative applications are increasing regularly and hence the data and job load also increasing proportionally. Cloud based service providers are also increasing their infrastructure and service facility to serve in a much better way to its clients. The job processing load will also increase the waiting time and hence affect the service response time at user’s end. So, it is always a matter of great importance that which job scheduling algorithm should be applied to serve the client in an efficient manner. This is the main motivation for framing this research paper. In this paper, we are taking the main five heuristic job scheduling algorithms like FCFS (First Come First Server), SJF (Shortest Job First), MaxMin, MinMin, and Saffrage for analyzing on the pre-decided cloud infrastructure. Among these heuristic algorithm, MaxMin algorithm outperforms than others in all the test cases i.e. with the cloudlet load of 100, 200, 300, …, 1000 cloudlets. Hence we can say that the MaxMin is the best scheduling algorithm among these five heuristic job scheduling algorithms.

关键词： scheduling algorithms Heuristic algorithms Market research scheduling Servers Time factors Task analysis

来源：评论

学校读者我要写书评

暂无评论

An analysis of the load scheduling algorithms in the cloud computing environment: A survey

An analysis of the load scheduling algorithms in the cloud c...

引用

International Conference on Industrial and Information Systems, ICIIS

作者： Divya Chaudhary Bijendra Kumar Department of Computer Engineering Netaji Subhas Institute of Technology Dwarka New Delhi India

Cloud Computing is a recent developmental paradigm in the field of computing offering huge power to next generation computers. The dynamic provisioning acts as a base for cloud computing facilitating and supporting the network services. It focuses on making the vision of utility computing a reality with pay-as-you-go. It offers immense potential to bloom the world with applications and products focussing on greater resource utilization and scalability. This paper presents the basic cloud computing fundamentals and the concepts of load balancing i.e., scheduling of load in the cloud. It elaborates the existing load scheduling algorithms with their merits/demerits and suitability in the cloud and heterogeneous computing environment and proposes a new perspective for better results as per desired parameters.

关键词： Cloud computing Resource management scheduling scheduling algorithms Quality of service Scalability

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Security-Aware List scheduling algorithms in IaaS Cloud

Performance Evaluation of Security-Aware List Scheduling Alg...

引用

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

作者： Hamza Djigal Jun Feng Jiamin Lu School of Computer and Information Hohai University Nanjing China

ISBN: (数字)9781728160955

ISBN: (纸本)9781728196497

Efficient workflow scheduling algorithms are crucial for attaining high performance in large-scale heterogeneous distributed infrastructures, such as cloud computing. List scheduling algorithms are one of the most efficient heuristic methods for assigning task graphs to fully connected heterogeneous systems. However, most existing list-based scheduling algorithms do not consider the applications' security requirements and the security services offered by cloud providers. In this paper, we extend four list scheduling algorithms for security-aware workflow scheduling in the IaaS cloud. The idea of the extension is to consider the security overheads in both tasks prioritizing phase and virtual machine selection phase of the four original algorithms. Based on real-world applications, we evaluate the performance of the proposed algorithms in terms of scheduling length, speedup and efficiency.

关键词： Task analysis Cloud computing Security scheduling scheduling algorithms Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient centralized link scheduling algorithms in wireless mesh networks

Efficient centralized link scheduling algorithms in wireless...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Mohamed Nabli Fatma Abdelkefi Wessam Ajib Mohamed Siala Universite du Quebec a Montreal Montreal QC CA Universite de Carthage Tunis TN

ISBN: (纸本)9781479909582

Wireless mesh networks (WMNs) have been developed to answer the needs of many wireless applications. A major limiting parameter of the performance of WMNs is the interference between the several communications that occur simultaneously in the same network. To address this limitation, an adequate scheduling algorithm has to be implemented. Hence, this paper focuses on the scheduling problem under the physical interference model. This problem is known to be NP-Hard problem. In this paper we develop and propose two efficient scheduling algorithms. We evaluate their performances by simulation in terms of spatial reuse and we compare their performance with known previously-proposed algorithms. We show that our proposed algorithms provide high performances with low complexity.

关键词： Interference Schedules scheduling algorithms Complexity theory Signal to noise ratio Receivers Transmitters

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of various scheduling algorithms using FPGA platforms

Performance analysis of various scheduling algorithms using ...

引用

International Conference on VLSI Systems, Architecture, Technology and Applications (VLSI-SATA)

作者： Liyaqat Nazir Roohie Naaz Mir Computer Science Engineering National Institute of Technology Srinagar J&K India

This paper discusses the synthesis and implementation of various scheduling algorithms for Network-on-Chip communication. Traditionally these scheduling algorithms were implemented on ASIC platforms generally for shared bus based interconnection systems. In this paper we carry a comparative analysis by synthesizing and implementing various scheduling algorithms for configuring the crossbar in input queued switches. The implementation is carried out using various arbitration networks responsible for scheduling 8-bit input requests. The implementation targets Spartan6 FPGA family. The analysis concludes that the scheduling algorithm based on CLA based encoding network shows lower power delay product and lower area delay product and a reasonably lower resource utilization when implemented for speed optimization goal.

关键词： Field programmable gate arrays Switches Clocks Algorithm design and analysis scheduling algorithms Encoding Logic gates

来源：评论

学校读者我要写书评

暂无评论

An Antithetic Coupling Approach to Multi-Chain based CSMA scheduling algorithms

An Antithetic Coupling Approach to Multi-Chain based CSMA Sc...

引用

Annual IEEE International Conference on Computer Communications

作者： Jaewook Kwak Do Young Eun Department of Electrical and Computer Engineering North Carolina State University Raleigh NC 27695-7911

ISBN: (纸本)9781467399548

In recent years, a suite of Glauber dynamics-based CSMA algorithms have attracted great attention due to their simple, distributed implementations with guaranteed throughput-optimality. However, these algorithms often suffer from poor delay performance and the starvation problem. Among several attempts to improve the delay performance, a remarkable improvement has recently been made in a class of CSMA algorithms that utilize multiple instances of the algorithm (or Markov chains). In this paper, we develop a new approach via an antithetic coupling (AC) method, which can further improve the delay performance of those that virtually emulate multiple chains. The key enabler of utilizing AC method lies in our skilful choice of manipulating the driving sequences of random variables that govern the evolution of schedule instances, in such a way that those multiple instances of chains become negatively correlated as oppose to having them run independently. This contributes faster change of the link state, rendering it more like a periodic process and thus leading to better queueing performance. We rigorously establish an ordering relationship for the effective bandwidth of each net-input process to the queue, between our proposed algorithm (AC-CSMA) and other state-of-the-art existing algorithms in the literature, under a mild set of assumptions. The proposed algorithm involves very simple modification onto existing CSMA-based algorithms, and can be implemented in a fully distributed manner without any additional message overhead. Our extensive simulation results also confirm that AC-CSMA always delivers better queueing performance over a variety of network scenarios.

关键词： carrier sense multiple access scheduling algorithms Queue algorithms effective bandwidth

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 49 50 51 52 53 54 55 56 57 58 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：