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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

8,575 篇 scheduling algor...
1,052 篇 scheduling
569 篇 schedules
526 篇 resource managem...
520 篇 real-time system...
474 篇 cloud computing
443 篇 throughput
425 篇 heuristic algori...
392 篇 quality of servi...
379 篇 delays
309 篇 dynamic scheduli...
307 篇 task analysis
305 篇 optimization
262 篇 computational mo...
229 篇 simulation
217 篇 energy consumpti...
208 篇 bandwidth
205 篇 job shop schedul...
200 篇 servers
194 篇 algorithm design...

机构

26 篇 beijing universi...
24 篇 state key labora...
21 篇 university of ch...
18 篇 national mobile ...
15 篇 institute of com...
13 篇 hong kong polyte...
13 篇 purple mountain ...
12 篇 northeastern uni...
12 篇 college of compu...
11 篇 shanghai jiao to...
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...
9 篇 school of electr...
9 篇 college of compu...
9 篇 department of el...
9 篇 college of compu...

作者

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

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

共 8575 条记录，以下是4501-4510 订阅

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

详细简洁

排序：

An adaptive hybrid scheduling algorithm for LTE-Advanced

An adaptive hybrid scheduling algorithm for LTE-Advanced

引用

International Conference on Telecommunications (ICT)

作者： Basel Barakat Kamran Arshad Department of Electrical Electronic and Computer Engineering University of Greenwich United Kingdom

The 3 rd Generation Partnership Project (3GPP) introduced Long Term Evolution (LTE) in release 8, and afterwards it was updated significantly in later releases (referred to as LTE-Advanced). LTE and LTE-Advanced (LTE-A) aim to achieve higher spectral efficiency, higher data rates, robustness and flexibility. Intelligent channel-aware radio resource scheduling is one of the key features of LTE-A. A number of schedulers proposed in the literature rely on the feedback sent from the Users Equipment (UE) without considering the presence of feedback delay. In this paper, we analyse the effect of the uplink delay on the cell performance of existing schedulers, in terms of throughput and the users' fairness. We then propose an adaptive hybrid scheduler to overcome the effect of the uplink delay on the scheduler performance. The simulation results show that our proposed scheduling algorithm outperforms the existing schedulers in the presence of uplink feedback delay.

关键词： Throughput Delays Uplink Long Term Evolution scheduling algorithms Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Data-Intensive HPC Tasks scheduling with SDN to Enable HPC-as-a-Service

Data-Intensive HPC Tasks Scheduling with SDN to Enable HPC-a...

引用

IEEE International Conference on Cloud Computing, CLOUD

作者： Saba Jamalian Hassan Rajaei Department of Computer Science Bowling Green State University Bowling Green OH USA

Advances in Cloud Computing attracted scientists to deploy their HPC applications to the cloud to benefit from the flexibility of the platform such as scalability and on-demand services. Nevertheless, HPC programs can face serious challenges in the cloud that could undermine the gained benefits. This paper first compares the performance of several HPC benchmarks on a commodity cluster and Amazon public cloud to illustrate the confronted challenges. To mitigate the problem, we have introduced a novel approach called ASETS, "A SDN Empowered Task scheduling System", to schedule data-intensive High Performance Computing (HPC) tasks in a Cloud environment. In this paper, we focus on the implementation and performance analysis of ASETS and its first algorithm called SETSA, (SDN Empowered Task scheduling Algorithm). ASETS uses the "bandwidth awareness" capability of SDN to better utilize the bandwidths when assigning tasks to virtual machines. This approach aims to improve the performance of HPC programs and provides an efficient HPC-as-a-Service (HPCaaS) platform. The paper briefly describes the architecture and the algorithm, and then focuses on the details of the implementation and performance analysis of ASETS and SETSA. Preliminary results indicate that ASETS delivers substantial performance improvement for HPCaaS as the degree of multi-tenancy increases. This result is significant since it indicates both the users and the cloud service providers can benefit from ASETS.

关键词： Cloud computing Bandwidth scheduling algorithms Virtualization Benchmark testing Virtual machining

来源：评论

学校读者我要写书评

暂无评论

A novel scheduling algorithm based class-service using game theory for LTE network

A novel scheduling algorithm based class-service using game ...

引用

IEEE International Conference on Telecommunications and Malaysia Communications (ICT-MICC)

作者： Ayman Hajjawi Mahamod Ismail Nor Fadzilah Abdullah Nordin Ramli Department of Electronic Electrical and System Engineering The National University of Malaysia (UKM) Selangor Malaysia Wireless Innovation MIMOS Berhad Technology Park Malaysia Kuala Lumpur Malaysia

Long Term Evolution (LTE) network is a promising wireless technology which provides mobile users with high data rate and low latency. LTE has been developed by the 3rd Generation Partnership Project (3GPP) to improve the end to end system delay and support higher Quality of Services (QoS). However, 3GPP has not defined a firm provision to handle the scheduling process, so that scheduling becomes an open issue for researchers. Instead, they defined nine classes with their corresponding Quality of Services (QoS) requirements. In this paper, a novel scheduling algorithm is proposed based on class service using cooperative game theory technique. The available resources are fairly distributed among classes as proportion which results in higher fairness level among classes. In the second level, the users with tightest delay requirements are prioritized. The proposed algorithm is compared with Proportional Fairness (PF) and Exponential (EXP) rule algorithms in terms of throughput, delay and fairness index. The proposed model outperforms PF and EXP schemes in all comparative parameters.

关键词： Delays Long Term Evolution Quality of service Throughput scheduling algorithms Game theory 3GPP

来源：评论

学校读者我要写书评

暂无评论

On User scheduling for Maximum Throughput in K-user MISO Broadcast Channels

On User Scheduling for Maximum Throughput in K-user MISO Bro...

引用

IEEE International Conference on Communications

作者： Martina Cardone Daniela Tuninetti Raymond Knopp Eurecom Biot University of Illinois at Chicago

ISBN: (纸本)9781467364300

This paper studies the sum-capacity of the Multiple Input Single Output (MISO) Gaussian broadcast channel where K single-antenna users are served by a base station with N antennas, with N < K. The generalized Degrees-of-Freedom (gDoF) for this system is derived as the solution of a Maximum Weighted Bipartite Matching (MWBM) problem, where, roughly speaking, each of the N transmit antennas is assigned to a different user. The MWBM problem inspires a user selection algorithm where a subset of N out of K users is served. The proposed algorithm runs in polynomial-time (rather than involving an exhaustive search among all possible subsets of size N out of K users) and extends the classical DoF analysis to more realistic wireless channel configurations where users can experience very different channel gains from the base station. Extensive numerical simulations, run in practically relevant Rayleigh fading environments for different numbers of users and of antennas, show that the throughput achieved by serving the set of N users selected by the MWBM-based algorithm is at most N log(K) bits away from an outer bound to the sum-capacity, where in principle all the K users are served. Comparisons with another widely used user scheduling algorithm are also provided.

关键词： Base stations Signal to noise ratio Throughput Fading Transmitting antennas scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards efficient radio resource scheduling in LTE-based satellite mobile communication system

Towards efficient radio resource scheduling in LTE-based sat...

引用

IEEE Conference on Computer Communications Workshops, INFOCOM Wksps

作者： Changjiang Fei Baokang Zhao Chunqing Wu Wanrong Yu Biao Han Jinshu Su School of Computer National University of Defense Technology Changsha China

LTE-based satellite mobile communication system combines LTE standards and satellite communication technologies and have particular advantages in providing mobile communication services. However, the long transmission delay in satellite communication poses a severe challenge to radio resource scheduling of the system. Focusing on the long transmission delay of satellite-ground link, we propose BSP, a Buffer Status Prediction based scheduling approach. BSP includes a Buffer Status Prediction and Reporting mechanism (BSPR) and a Buffer Status based Proportional Fairness scheduling algorithm (BSPF). eNB can get more accurate buffer status information from UEs, used for making scheduling decision, through BSPR mechanism; BSPF scheduling algorithm bases on PF scheduling algorithm and considers the quality of service class and data flow of services by adding buffer statuses of UEs as parameters of scheduling decision. Simulation results show that BSP scheduling approach can improve resource utilization of the system effectively and satisfy throughput requirements of different services preferably.

关键词： Streaming media scheduling algorithms scheduling Resource management Mobile communication Satellites Satellite broadcasting

来源：评论

学校读者我要写书评

暂无评论

Low-complexity multi-resource packet scheduling for network function virtualization

Low-complexity multi-resource packet scheduling for network ...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Xin Li Chen Qian Department of Computer Science University of Kentucky

Network functions are widely deployed in modern networks, providing various network services ranging from intrusion detection to HTTP caching. Various virtual network function instances can be consolidated into one physical middlebox. Depending on the type of services, packet processing for different flows consumes different hardware resources in the middlebox. Previous solutions of multi-resource packet scheduling suffer from high computational complexity and memory cost for packet buffering and scheduling, especially when the number of flows is large. In this paper, we design a novel low-complexity and space-efficient packet scheduling algorithm called Myopia, which supports multi-resource environments such as network function virtualization. Myopia is developed based upon the fact that most Internet traffic is contributed by a small fraction of elephant flows. Myopia schedules elephant flows with precise control and treats mice flows using FIFO, to achieve simplicity of packet buffering and scheduling. We will demonstrate, via theoretical analysis, prototype implementation, and simulations, that Myopia achieves multi-resource fairness at low cost with short packet delay.

关键词： Mice Middleboxes scheduling algorithms Arrays Schedules Resource management

来源：评论

学校读者我要写书评

暂无评论

Optimized Two Head Disk scheduling Algorithm (OTHDSA)

Optimized Two Head Disk Scheduling Algorithm (OTHDSA)

引用

International Conference on Advanced Computing & Communication Technologies (ACCT)

作者： Karishma Singh Nidhi Divya Rastogi Dayashankar Singh Deptt. of CSE MMMUT Gorakhpur India CSE MMMUT Gorakhpur India

In this paper, we proposed a new disk scheduling algorithm for improving the performance of modern storage devices in terms of throughput. Since the invention of disk with movable heads, many researchers tried to improve the I/O performance by using intelligent algorithms for disk scheduling. Memory capacity and speed of the processor are increasing several times than the speed of disk. This disparity shows that this cannot supply data to processor as fast as it requires. As soon as data is received by the processor from disk, data is processed immediately and then processor waits for next data from disk. Hence disk I/O performance becomes a bottleneck. Some advanced methods and scheduling algorithms are required for increasing disk I/O performance and using the disk efficiently. We can improve the performance of disk by reducing total number of head movements needed to serve requests. In this paper, we proposed and implemented an optimized two head disk scheduling algorithm (OTHDSA) which reduces total number of head movements. Experimental analysis has been carried out and it is observed that this proposed algorithm requires less number of head movements than many existing disk scheduling algorithms and hence it maximizes the throughput.

关键词： Tracking scheduling algorithms Electronic mail Throughput Bandwidth Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Self-Organized Energy Efficient scheduling in LTE-A

Self-Organized Energy Efficient Scheduling in LTE-A

引用

IEEE Vehicular Technology Conference

作者： Valdemar Monteiro Shahid Mumtaz Jonathan Rodriguez Ikram Ashraf Instituto de Telecomunicações Aveiro Portugal University of Oulu Finland Oulu Finland

Traditional packet scheduling is mainly designed for increasing spectral efficiency (SE) but not for the energy efficiency (EE). Self-organized network (SON) has prospective for self-configuring, self-optimizing self-healing and minimizes the energy consumption in the network. We consider self-optimizing and self-healing property of SON and investigate a novel energy efficient scheduling algorithm for LTEA. We first compare the state the of art scheduling in view of energy efficiency, then explain the tradeoff between EE and SE. System level simulation (SLS) analysis shows that the investigated SON approach achieves notable energy gain over traditional scheduling algorithm.

关键词： Energy efficiency Algorithm design and analysis scheduling algorithms Resource management scheduling Throughput Quality of service

来源：评论

学校读者我要写书评

暂无评论

Contention-Aware scheduling for Asymmetric Multicore Processors

Contention-Aware Scheduling for Asymmetric Multicore Process...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Xiaokang Fan Yulei Sui Jingling Xue Programming Languages and Compilers Group UNSW Australia

Asymmetric multicore processors (AMPs) have been proposed as an energy-efficient alternative to symmetric mul-ticore processors (SMPs). However, AMPs derive their performance from core specialization, which requires co-running applications to be scheduled to run on their most appropriate core types. Despite extensive research on AMP scheduling, developing an effective scheduling algorithm remains challenging. Contention for shared resources is a key performance-limiting factor, which often renders existing contention-free scheduling algorithms ineffective. We introduce a contention-aware scheduling algorithm for ARM's ***, a commercial AMP platform. Our algorithm comprises an offline stage and an online stage. The offline stage builds a performance interference model for an application by training it with a set of co-running applications. Guided by this model, the online stage schedules a workload by assigning its applications to their most appropriate core types in order to minimize the performance degradation caused by contention for shared resources. Our model can accurately predict the performance degradation of an application when co-running with other applications with an average prediction error of 9.60%. Compared with the default scheduler provided for ARM's *** and the speedup-factor-driven scheduler, our contention-aware scheduler can improve overall system performance by up to 28.32% and 28.51%, respectively.

关键词： Multicore processing Interference Program processors scheduling algorithms scheduling Degradation

来源：评论

学校读者我要写书评

暂无评论

A priority based job scheduling algorithm using IBA and EASY algorithm for cloud metaschedular

A priority based job scheduling algorithm using IBA and EASY...

引用

International Conference on Advances in Computer Engineering and Applications (ICACEA)

作者： Kalka Dubey Mohit Kumar Mayank Arya Chandra ABV-Indian Institute of Information Technology and Management Gwalior India Indian Institute of Technology Roorkee India MJP Rohilkhand University Bareilly India

Job scheduling (JS) is one of the most important issues in a Cloud system. The objective of job schedulers in cloud computing is to meet users' requirements and optimize the utilization of cloud resources. To achieve better QoS with high resource utilization in a cloud environment, an improved backfill algorithm (IBA) using balanced spiral (BS) method can be used. Results show that IBA minimizes resource idleness up to a great extent. However, IBA does not provide support for handling job priority and QoS. We need an algorithm to maximize the resource utilization while considering priority.

关键词： Cloud computing Resource management scheduling scheduling algorithms Computer architecture Computational modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 447 448 449 450 451 452 453 454 455 456 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：