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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,405 篇 工学
- 3,895 篇 计算机科学与技术...
- 1,640 篇 信息与通信工程
- 1,591 篇 软件工程
- 1,516 篇 电气工程
- 588 篇 控制科学与工程
- 342 篇 电子科学与技术（可...
- 308 篇 机械工程
- 194 篇 动力工程及工程热...
- 187 篇 交通运输工程
- 115 篇 仪器科学与技术
- 81 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 49 篇 土木工程
- 46 篇 安全科学与工程
- 43 篇 建筑学
- 39 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,883 篇 管理学
- 1,764 篇 管理科学与工程(可...
- 1,433 篇 工商管理
- 222 篇 图书情报与档案管...
1,759 篇 理学
- 1,440 篇 数学
- 224 篇 系统科学
- 199 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
37 篇 农学
27 篇 教育学
25 篇 文学
5 篇 艺术学
2 篇 军事学

主题

8,561 篇 scheduling algor...
1,047 篇 scheduling
567 篇 schedules
520 篇 resource managem...
511 篇 real-time system...
473 篇 cloud computing
439 篇 throughput
420 篇 heuristic algori...
392 篇 quality of servi...
377 篇 delays
307 篇 task analysis
304 篇 dynamic scheduli...
295 篇 optimization
261 篇 computational mo...
228 篇 simulation
217 篇 energy consumpti...
208 篇 bandwidth
205 篇 job shop schedul...
198 篇 servers
194 篇 algorithm design...

机构

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

作者

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

语言

8,305 篇 英文
167 篇 其他
81 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8561 条记录，以下是4611-4620 订阅

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

详细简洁

排序：

scheduling in hybrid cloud to maintain data privacy

Scheduling in hybrid cloud to maintain data privacy

引用

International Conference on Innovative Computing Technology (INTECH)

作者： Hamid Abrishami Amin Rezaeian Ghazaleh Khojasteh Tousi Mahmoud Naghibzadeh Dept of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran

The development of cloud computing technology has been continuously growing since its invention and has attracted the attention of many researchers in the academia and the industry, particularly during the recent years. The majority of organizations, whether large corporate businesses or typical small companies, are moving towards employing this cutting edge technology. Using private cloud provides low cost and privacy for workflow applications execution. However, an organization's requirements to high performance resources and high capacity storage devices lead them to utilize public clouds. Public cloud leases information technology services in the form of small units and in larger scale compared to private cloud, but this model is potentially exposed to the risk of data breach and is less secure in comparison to a pure private cloud environment. The combination of public and private clouds is known as hybrid cloud, where workflow tasks can be executed on resources residing on either public or private clouds. The objective of this paper is to present a scheduling algorithm for maintaining data privacy in workflow applications, such that the budget is minimized, while the makespan limitation imposed by the user is satisfied.

关键词： Cloud computing Schedules scheduling Mathematical model Heuristic algorithms scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Stochastic Task scheduling Algorithm Based on Importance-ratio of Makespan to Energy for Heterogeneous Parallel Systems

A Stochastic Task Scheduling Algorithm Based on Importance-r...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Yuqing Yang Xinqiao Lu Hai Jin Xiaofei Liao Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan China

In the past years, most task scheduling algorithms consider either to minimize the application's completion time or to minimize the application's energy consumption subject to a deadline constraint. Few of them can achieve these two performance goals at the same time. In this paper, we propose an energyaware importance-ratio-based stochastic task scheduling (EISTS) algorithm, which makes a good balance between the makespan and energy consumption and achieves high system weighted improvement based on the importance-ratio of makespan toenergy consumption for heterogeneous parallel systems. Compared with other existing algorithms, our algorithm can achieve shorter application's completion time when the importance-ratio of makespan to energy consumption is high. On the contrary, our algorithm consumes less energy. To prove its validity, we compare our proposed algorithms with two existing scheduling algorithms(SHEFT and ECS) in terms of system weighted improvement, makespan, and energy consumption respectively. The results of simulations show that the system weighted improvement of our algorithm and those two compared algorithms are 37%, 17%, and 18% respectively, which clearly demonstrates that ourEISTS algorithm outperforms them significantly. In addition, our algorithm is also very competitive in terms of both makespan and energy consumption.

关键词： Program processors Energy consumption Heuristic algorithms scheduling Approximation algorithms scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient Backpressure Routing and scheduling Algorithm for Wireless Sensor Networks

An Energy-Efficient Backpressure Routing and Scheduling Algo...

引用

IEEE Global Communications Conference

作者： Zhenzhen Jiao Baoxian Zhang Haiyi Zhang Cheng Li China Academy of Information and Communications Technology Research Center of Ubiquitous Sensor Networks University of Chinese Academy of Sciences Faculty of Engineering and Applied Science Memorial University

ISBN: (纸本)9781479959532

Much previous work had demonstrated the remarkable performance of backpressure based routing and scheduling algorithms in wireless sensor networks (WSNs). However, the absence of consideration on energy use efficiency in the design of existing backpressure based algorithms makes them difficult to be deployed in resource-limited WSNs. In this paper, we study how to improve the energy use efficiency of backpressure based algorithm. For this purpose, we propose an energy efficient backpressure routing and scheduling algorithm (EBP) for WSNs. In EBP, a new link weight calculation method is designed, based on which nodal energy status is considered when making decisions on backpressure based transmission scheduling. In EBP, packets are encouraged to be forwarded to nodes with more residual energy while the throughput-optimality of backpressure based algorithm is still preserved. Simulation results show that EBP can obtain significant performance improvements in terms of energy use efficiency, network throughput, and packet delivery ratio as compared with existing work.

关键词： Backpressure based scheduling Energy use efficiency Wireless sensor networks Wireless sensor networks BACK PRESSURE use efficiency scheduling algorithms performance boost Electron beam pumping EBP gene Energy efficiency Network routing Residual energy

来源：评论

学校读者我要写书评

暂无评论

Implementation of Hierarchical scheduling Algorithm on Real-Time Grid Environment

Implementation of Hierarchical Scheduling Algorithm on Real-...

引用

International Conference on Computing Communication Control and Automation (ICCUBEA)

作者： Abhishek P. Nachankar R.C. Dharmik Asst. Prof Department of Information Technology Yeshwantrao Chavan College of Engineering Nagpur India

ISBN: (纸本)9781479968930

Grid computing is considered as the upcoming phase of distributed computing. Grid focuses on maximizing the resource utilization of an organization by sharing them across application. In grid computing, job scheduling is an important task. Load balancing and resource allocation are vital issues that must be considered in a grid computing environment. Load balancing is the technique which distributes the workload across multiple computers to reduce the latency of process execution with proper resource utilization. To resolve these issues, we are proposing hierarchical scheduling algorithm for grid environment and implementing it on the real-time grid set up on LAN.

关键词： Servers Load management scheduling algorithms Grid computing Resource management scheduling Computers

来源：评论

学校读者我要写书评

暂无评论

HPCA: A node selection and scheduling method for Hadoop MapReduce

HPCA: A node selection and scheduling method for Hadoop MapR...

引用

International Conference on Computer and Communications Technologies (ICCCT)

作者： Archana G.K. V.Deeban Chakravarthy Department Of Computer Science and Engineering SRM University Chennai

Big data is the technology which is designed to handle both structured and unstructured data which has high intensity. Hadoop and MapReduce are two important aspects of big data. Task assignment in MapReduce is done through scheduling algorithms. scheduling algorithms assign the tasks to a selected data node. Selection of a healthy and available data node to perform the Map and reduce is done based on the availability and the location of the data on which the processing should be done. Creating an algorithm for the node selection is essential to discipline and optimize and improve the performance of the MapReduce. The proposed Health, Priority, Capacity and Availability based Node selection algorithm [HPCA based Node Selection Algorithm] creates a queue of the nodes that are available for accepting the new tasks through scheduling algorithms. This algorithm optimizes the node selection task and provides better performance. It also introduces a failover mechanism to handle the tasks that fail during the execution.

关键词： scheduling algorithms Big data Clustering algorithms Computer science Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Network and User Centric Performance Analysis of scheduling Strategies for Video Streaming over LTE

Network and User Centric Performance Analysis of Scheduling ...

引用

International Conference on Communication Workshop

作者： Nabeel Khan Moustafa M. Nasralla Maria G. Martini WMN Research Group Kingston University London UK

Diverse scheduling strategies have been designed for video streaming traffic ranging from Quality of Service (QoS) aware scheduling rules to more complex video quality based scheduling strategies. In this work, we analyze and compare some of the well known scheduling rules for video streaming traffic. Our main goal is to compare and analyze different classes of scheduling strategies (QoS and video quality aware rules) in terms of network centric performance metrics as well as user centric metrics. QoS evaluation involves the evaluation of network performance parameters, e.g., packet loss rate, average system throughput and end-to-end packet delay. On the other hand, video quality evaluation involves the computation of objective and subjective video quality metrics. According to simulation results, the proxy based video quality aware scheduling strategy performs best in terms of number of satisfied users and should be used in an Long-Term Evolution (LTE) downlink to offer high quality video streaming services.

关键词： scheduling algorithms Resource Allocation LTE Downlink QoS Content Aware Video Traffic

来源：评论

学校读者我要写书评

暂无评论

Energy aware scheduling and queue management for next generation Wi-Fi routers

Energy aware scheduling and queue management for next genera...

引用

IEEE Wireless Communications and Networking Conference Workshops (WCNCW)

作者： Husnu S. Narman Mohammed Atiquzzaman School of Computer Science University of Oklahoma Norman OK

An increasing number of internet connected devices access large multimedia files over the Internet. Therefore, the bandwidth demand is exponentially increasing. To satisfy users' demands, multi-band wireless routers, which simultaneously support several bands, are developed. However, current multiband routers do not attempt to maximize the utilization of frequency bands nor consider the energy consumption. There are a limited number of previous works on multi-band wireless routers and those works do not address the energy efficiency and utilization problems of multi-band routers. Therefore, we have proposed an energy aware scheduling algorithm to ensure maximize utilization of multi-band routers while decreasing energy consumption through band sharing. Results show that the proposed method uses system resources efficiently and decreases energy consumption of the multi-band systems up to 60%. Our proposed scheduling algorithm and related analysis will help network engineers build next generation wireless routers by considering performance metrics such as throughput and energy usage of multi-band Wi-Fi routers.

关键词： Energy consumption IEEE 802.11 Standards Throughput scheduling algorithms Conferences Next generation networking Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Predicting scheduling Failures in the Cloud: A Case Study with Google Clusters and Hadoop on Amazon EMR

Predicting Scheduling Failures in the Cloud: A Case Study wi...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Mbarka Soualhia Foutse Khomh Sofiène Tahar Concordia University Polytechnique Montréal Montréal Quebec Canada

Cloud Computing has emerged as a key technology to deliver and manage computing, platform, and software services over the Internet. Task scheduling algorithms play an important role in the efficiency of cloud computing services as they aim to reduce the turnaround time of tasks and improve resource utilization. Several task scheduling algorithms have been proposed in the literature for cloud computing systems, the majority relying on the computational complexity of tasks and the distribution of resources. However, several tasks scheduled following these algorithms still fail because of unforeseen changes in the cloud environments. In this paper, using tasks execution and resource utilization data extracted from the execution traces of real world applications at Google, we explore the possibility of predicting the scheduling outcome of a task using statistical models. If we can successfully predict tasks failures, we may be able to reduce the execution time of jobs by rescheduling failed tasks earlier (i.e., before their actual failing time). Our results show that statistical models can predict task failures with a precision up to 97.4%, and a recall up to 96.2%. We simulate the potential benefits of such predictions using the tool kit GloudSim and found that they can improve the number of finished tasks by up to 40%. We also perform a case study using the Hadoop framework of Amazon Elastic MapReduce (EMR) and the jobs of a gene expression correlations analysis study from breast cancer research. We find that when extending the scheduler of Hadoop with our predictive models, the percentage of failed jobs can be reduced by up to 45%, with an overhead of less than 5 minutes.

关键词： Cloud computing Google Predictive models scheduling Data mining scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of scheduling policies for VoIP traffic in LTE-Advanced network

Performance analysis of scheduling policies for VoIP traffic...

引用

International Conference on Computer, Communications, and Control Technology (I4CT)

作者： Aini Syuhada Md Zain Mohd Fareq Abd. Malek Mohamed Elshaikh Normaliza Omar Abadal-Salam T. Hussain School of Computer and Communication Engineering School of Electrical Systems Engineering University Malaysia Perlis Perlis Malaysia

Resource allocation mechanisms are important in assigning all available resources in the network. scheduling is one of the resource allocation mechanism which will determine the performance of the network. This paper provides the performance analysis on three different scheduling algorithms in the Long Term Evolution-Advanced downlink transmission system with realistic channel model for urban macro cell scenario. All scheduling algorithms are evaluated based on throughput, frame delay, packet delay variation and mean opinion score index of voice over internet protocol via simulation executed on OMNET++ based simulator. The maximum of carrier to interference ratio scheme provided the highest value of throughput and mean opinion score index among all schemes in the evaluated network. The scheme also provided the lowest value of frame delay and packet delay variation in the evaluated network scenario.

关键词： Delays Bandwidth Throughput scheduling algorithms Resource management Indexes Quality of service

来源：评论

学校读者我要写书评

暂无评论

Dynamic benefit-weighted scheduling scheme in multi service networks

Dynamic benefit-weighted scheduling scheme in multi service ...

引用

IEEE International Advance Computing Conference, IACC

作者： Namratha B Gowda Reema Sharma Navin Kumar Talabatulla Srinivas Dept. of ECE The Oxford College of Engineering Bangalore India

This paper proposes a new dynamic packet scheduling scheme which guarantees the delay and jitter properties of differentiated services (DiffServ) network for both real time and non-real time traffics. The proposed dynamic packet scheduling algorithm uses a new weighted computation scheme known as dynamic benefit weighted scheduling (DB-WS) which is loosely based on weighted round robin (WRR) or fair queuing policy. The novelty of this scheduler is that it predicts the weight required by expedited forwarding (EF) service for current time slot (t) based on two factors: (i) previous weight allocated to it at time slot (t-1), and (ii) average increase in weights of EF traffic in consecutive time slots. This prediction provides smoother and balanced bandwidth allocation to EF, assured forwarding (AF) and best effort (BE) packets by not allocating all the resources to EF and also ensuring minimal packet losses for EF service. Adopting such a dynamic resource allocation effectively achieves reduction in packet loss, end to end delay and delay jitter. The algorithm is tested with different data rates and found to outperform other existing methods in terms of packet loss and end to end delay.

关键词： Delays Quality of service Diffserv networks Packet loss Dynamic scheduling scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 458 459 460 461 462 463 464 465 466 467 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：