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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,416 篇 工学
- 3,905 篇 计算机科学与技术...
- 1,645 篇 信息与通信工程
- 1,603 篇 软件工程
- 1,519 篇 电气工程
- 588 篇 控制科学与工程
- 342 篇 电子科学与技术（可...
- 308 篇 机械工程
- 194 篇 动力工程及工程热...
- 189 篇 交通运输工程
- 116 篇 仪器科学与技术
- 81 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 48 篇 土木工程
- 46 篇 安全科学与工程
- 42 篇 建筑学
- 39 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,885 篇 管理学
- 1,765 篇 管理科学与工程(可...
- 1,434 篇 工商管理
- 223 篇 图书情报与档案管...
1,776 篇 理学
- 1,456 篇 数学
- 224 篇 系统科学
- 199 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
37 篇 农学
27 篇 教育学
25 篇 文学
5 篇 艺术学
2 篇 军事学

主题

8,598 篇 scheduling algor...
1,052 篇 scheduling
569 篇 schedules
528 篇 resource managem...
520 篇 real-time system...
475 篇 cloud computing
444 篇 throughput
427 篇 heuristic algori...
392 篇 quality of servi...
379 篇 delays
311 篇 dynamic scheduli...
307 篇 task analysis
306 篇 optimization
262 篇 computational mo...
229 篇 simulation
218 篇 energy consumpti...
209 篇 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 篇 tsinghua univers...
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,238 篇 英文
271 篇 其他
87 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8598 条记录，以下是4371-4380 订阅

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

详细简洁

排序：

Performance analysis of resource block preserver scheduling algorithm for the downlink in LTE networks

Performance analysis of resource block preserver scheduling ...

引用

IEEE Symposium on Computer Applications and Industrial Electronics, ISCAIE 2015

作者： Ali, Sinan Ghassan Abid Dani Baba, Mohd Mansor, Mohd Asri Abdullah, Labeeb Mohsin Centre for Computer Engineering Studies Faculty of Electrical Engineering Universiti Teknologi MARA Shah Alam Selangor Malaysia

ISBN: (纸本)9781479989690

Long Term Evolution (LTE) is a breakthrough in broadband technology which aims to support several high level quality and real time multimedia services for the mobile users. This paper proposes a resource block preserver (RBP) scheduling algorithm which optimizes the performance of the downlink transmission system in LTE network. The resource block preserver algorithm has two layers, upper and lower. The upper layer of the RBP exploits the LTE frame concept which contains multiple numbers of sub-frames. The lower layer of the RBP algorithm adopts the concept of proportional fair (PF) algorithm to schedule the non real time (NRT) flows. While for the real time (RT) flows, different scheduler algorithm's metrics are utilized. The simulation results show that the performance of the RBP scheduling algorithm has outperformed the non-RBP algorithm in terms of higher throughput and fairness when allocating their services. © 2015 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Resource allocation for Real-Time services using Earliest Due Date mechanism in LTE networks

Resource allocation for Real-Time services using Earliest Du...

引用

Japan-Egypt International Conference on Electronics, Communications and Computers (JEC-ECC)

作者： Mohamad I. Elhadad El-Sayed M. El-Rabaie Mohammed Abd-Elnaby Transmission Telecom Egypt Cairo Egypt Department of Electronics and Electrical Communications Menoufia University Menouf Egypt

In this paper we introduce and asses the performance of a new scheduling algorithm based on Earliest Due Date (EDD) mechanism. Our proposed scheduling algorithm enhances the performance of Real-Time (RT) flows such as video and Voice Over Internet Protocol (VOIP) in Long Term Evolution (LTE) cellular networks especially in downlink. The proposed scheduling scheme provides the lowest Packet Loss Ratio (PLR) for RT multimedia services, this can be achieved by taking the expiration time of the head of line packets of users' queues into account. Also, the proposed scheduling algorithm which we call Modified-Earliest Due Date (M-EDD), achieves higher bitrate for the RT applications. Especially for the video traffic, results have remarkably demonstrated that the M-EDD scheduling algorithm has the capacity to clearly outperform the conventional scheduling schemes.

关键词： scheduling algorithms Delays Internet telephony Quality of service Long Term Evolution Streaming media Throughput

来源：评论

学校读者我要写书评

暂无评论

A Convex Optimisation Approach to Traffic Signal Control

A Convex Optimisation Approach to Traffic Signal Control

引用

IEEE International Conference on Intelligent Transportation Systems

作者： Victor Valls Julien Monteil Melanie Bouroche Trinity College Dublin

ISBN: (纸本)9781509018901

We revisit the problem of traffic signal control in urban traffic networks. Recent work in the literature has studied the use of scheduling algorithms from communication networks to traffic signal control with the aim of maximising the network throughput. However, these algorithms are unable to capture some of the network characteristics such as protocol constraints or penalties on the control actions, e.g. the loss time when changing between phases. In this paper, we propose a convex optimisation approach to traffic signal control that decouples the stability of the system from the choice of traffic control policy. As a result, we are able to design a range of traffic signal control policies that maximise the network throughput, and that at the same time, capture the characteristics of urban traffic networks more accurately.

关键词： Optimisation Traffic control Max-weight Sub-gradient methods Traffic signals Ran Traffic Control Area traffic signal control Progressive traffic signal control Automatic traffic signal control Network throughput network characteristic traffic network control action scheduling algorithms networks(communications) traffic in cities

来源：评论

学校读者我要写书评

暂无评论

Improving Energy Efficiency by Phase-Grained Migration for Asymmetric Multicore

Improving Energy Efficiency by Phase-Grained Migration for A...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Youjun Xu Xianglan Chen Zhinan Cheng Jiachen Song Yuxiang Zhang Department of Computer Science and Technology University of Science and Technology of China (USTC) Hefei China

ISBN: (纸本)9781509032068

Asymmetric multicore architecture that consists of multiple cores with different power and performance features has the potential for improving energy efficiency. Migrating threads with different characteristics to appropriate cores can reap the full benefits of the asymmetry to improve energy efficiency. A key challenge in the use of asymmetric processors is to determine the reassignment of threads to asymmetric processor cores according to changing program phases within threads. In this paper we propose a scheme to improve the energy efficiency by phase-grained thread migration for asymmetric multicore. Our scheme mainly includes three new techniques. Firstly, we employ a linear estimation model with high accuracy to directly estimate performance per watt of the current thread phase on each core type online. These information of performance per watt decides the affinities of threads to cores. Secondly, according to the affinities of threads to cores and the overhead of migration, an Energy Efficiency Optimization Model (EEOM) is proposed to clarify the problem of thread-to-core assignment. Lastly, we present a scheduling algorithm based on the Kuhn-Munkres (KM) algorithm to find an optimal solution of the EEOM. We compare our proposed scheme with the state-of-the-art static assignment, and the result shows that our scheme can reach up to 9.5% improvement of performance per watt.

关键词： Multicore processing Estimation Instruction sets scheduling algorithms Scalability Radiation detectors

来源：评论

学校读者我要写书评

暂无评论

Network Codes-based Multi-Source Transmission Control Protocol for Content-centric Networks

Network Codes-based Multi-Source Transmission Control Protoc...

引用

International Workshop on Quality of Service

作者： Dongliang Xie Xin Wang Qingtao Wang State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China Department of Electrical and Computer Engineering State University of New York at Stony Brook USA

ISBN: (纸本)9781509026357

With the rapid shift from end-to-end communications to content-based data retrieval, there are increasing interests in exploiting Content-centric Networks (CCN) to deliver data. As the special characteristics of CCN, in-network caching and naming-based routing make traditional TCP-like transmission control protocol unsuitable. Although there are some existing efforts on improving the congestion control in CCN, the big issue of redundant transmissions caused by multiple sources has received little attention. To eliminate the redundancy and speed up the transmission, we propose a complete Network Codes-based Multi-Source Transmission Control Protocol (MSTCP), which provides an efficient and controllable multi-source content retrieval service over CCN. MSTCP takes advantage of random network coding to make full use of the coded data responded by different sources to speed up decoding and data receiving at the request side. Moreover, we design a scheduling algorithm based on a simple Expected Reception Deadline (ERD) to efficiently control the number of coded packets to send at each source. This not only effectively eliminates the redundant transmissions in CCN, but also helps to significantly speed up the information retrieval. Extensive simulations show that our mechanism greatly reduces the redundancy while speeding up the content retrievals by the network users.

关键词： Network coding Protocols Redundancy scheduling algorithms Decoding Peer-to-peer computing Routing

来源：评论

学校读者我要写书评

暂无评论

One-restart algorithm for scheduling and offloading in a hybrid cloud 23

One-restart algorithm for scheduling and offloading in a hyb...

引用

23rd IEEE International Symposium on Quality of Service, IWQoS 2015

作者： Champati, Jaya Prakash Liang, Ben Department of Electrical and Computer Engineering University of Toronto Canada

ISBN: (纸本)9781467371131

The hybrid cloud architecture utilizes both privately owned cloud servers and rented instances from public cloud providers, to offer flexible services that are particularly suited to enterprise computing. The task scheduler at a hybrid cloud decides both the selection of tasks to be offloaded to the public cloud and the scheduling of the remaining tasks on the processors at the private cloud. In this work, we consider the problem of minimizing a weighted sum of the makespan at the private cloud and the offloading cost to the public cloud. In contrast to prior works, we do not assume that the task processing times are known a priori. We show that the original problem can be solved by the same algorithms designed toward minimizing the maximum between the makespan and the weighted offloading cost, only with doubling of the competitive ratio. Furthermore, the latter problem can be equivalently transformed into a makespan minimization problem with unrelated processors. In the case where all tasks arrive at time zero, we propose a Greedy-One-Restart (GOR) algorithm based on online estimation of the unknown processing times, and one-time cancellation and rescheduling of tasks that turn out to require long processing times. We derive its competitive ratio and show that it is upper bounded on the order of the square root of the number of private processors, which is a substantial improvement over the best known algorithms in the literature. We present also a tight constant competitive ratio for the special two-processor case. In the case where tasks arrive dynamically with unknown arrival times, we extend GOR to Dynamic-GOR (DGOR) and find its competitive ratio. Further simulation results demonstrate that GOR and DGOR are favorable also in terms of average performance, in comparison with the well-known list scheduling algorithm and idealized offline algorithms. © 2015 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Runtime mapping and scheduling for energy efficiency in heterogeneous multi-core systems

Runtime mapping and scheduling for energy efficiency in hete...

引用

International Conference on ReConFigurable Computing and FPGAs, ReConFig 2015

作者： Silva, Bruno Delbem, Alexandre Bonato, Vanderlei Diniz, Pedro C. Instituto de Ciencias Matemáticas e de Computação Universidade de São Paulo São Carlos Brazil USC Information Sciences Institute 4676 Admiralty Way Marina del ReyCA90292 United States

ISBN: (纸本)9781467394062

Heterogeneous Multi-core Processors (HMPs) have the potential to outperform homogeneous multi-core processors in terms of raw performance and/or energy as both their Instruction-Set Architectures (ISA) and cache configurations (size and set associativity) can be tailored to the specific needs of a computation. In this paper we describe algorithm for the generation of custom HMP and a dynamic run-time core-mapping and scheduling policy that exploits the heterogeneity of such systems customized with respect to the number of cores and L1 cache memory sizes. Experimental results targeting custom HMPs implemented on a contemporary Field-Programmable Gate Array (FPGA) with LEON3 cores as their base for a set of 50 application codes reveal that the proposed core-mapping and scheduling algorithms achieves an average execution time improvement of 18.3% and a 12% energy reduction over a static core-mapping and list-scheduling algorithms. © 2015 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Min-parent: An effective approach to enhance resource utilization in cloud environment

Min-parent: An effective approach to enhance resource utiliz...

引用

(Spring) International Conference on Advances in Computing, Communication, & Automation (ICACCA)

作者： Raj Kumar Mala Kalra Sudeep Tanwar Sudhanshu Tyagi Neeraj Kumar Department of CSE NITTTR Chandigarh India Department of Information Technology Bharat Institute of Technology Meerut U.P. india Department of E&CE GBPUA&T Pantnagar Uttarakhand India Department of Computer Science & Engineering Thapar University Patiala Pb. India

With the rapid growth in online services and scarcity of professionals under same domain, there is a huge requirement for integaration of services with Cloud Computing (CC). It is a latest technological trend in present arena. It provide an efficient infrastructure, better services over the internet. In CC environment scheduling of services is one of the major issue which can have significant impact on resource utilization and system performance. Work-flow scheduling is a problem of finding the correct execution sequence for assigned work-flow tasks. It plays a vital role in the work-flow management. Proper scheduling of work-flow can have an efficient impact on performance of the system. This paper proposes a scheduling algorithm for work-flows. Key parameters include parent-child relationship, task allocation to available Virtual Machines(VMs) for execution. Proposed algorithm mainly focuses on increasing the resource utilization and reducing the make-span. In proposed algorithm, we create a table that contains ready tasks and their corresponding children in a work-flow, and occurrences of child have been counted. Further, on the basis of child occurrences, this parent-child relationship table is sorted and then used for ready tasks scheduling. The proposed algorithm has been executed and validated by using simulation based analysis through WorkflowSim tool kit. The results of the proposed scheduling algorithm significantly minimizes overall execution time of work-flows.

关键词： scheduling algorithms Resource management Algorithm design and analysis Dynamic scheduling Cloud computing Schedules

来源：评论

学校读者我要写书评

暂无评论

Optimized data-driven MAC schedulers for low-latency downlink in LTE networks

Optimized data-driven MAC schedulers for low-latency downlin...

引用

Annual Conference on Wireless On Demand Network Systems and Services (WONS)

作者： Fabio Pianese Peter J. Danielsen Wireless Research Program Bell Labs Alcatel-Lucent

We consider a novel way by which DL dynamic MAC scheduling can be augmented based on cross-layer inputs to provide desired performance enhancements. We describe ODDS, an automated design process for the data-driven refinement of downlink resource scheduling algorithms. ODDS extracts insights from the behavior of a simulated LTE cellular system under randomized traffic patterns and propagation conditions in a given network scenario. An offline iterated reinforcement learning campaign seeks to best fulfill a target set of goals, e.g. “fair throughput with low latency”, which can be encoded in the form of an arbitrary utility function specified by the designer. The knowledge base obtained from the learning campaign consists in a set of rules that a parametric scheduler leverages at run-time. We present our learning framework and evaluation results. ODDSgenerated schedulers are shown to achieve improved performance compared to well-known reference scheduling strategies.

关键词： Measurement Training Wireless communication scheduling algorithms Throughput OFDM Downlink

来源：评论

学校读者我要写书评

暂无评论

BLEST: Blocking estimation-based MPTCP scheduler for heterogeneous networks

BLEST: Blocking estimation-based MPTCP scheduler for heterog...

引用

IFIP Networking Conference

作者： Simone Ferlin Özgü Alay Olivier Mehani Roksana Boreli Simula Research Laboratory Norway National ICT Australia (NICTA) Sydney Australia

With the widespread availability of multi-homed devices, multipath transport protocols such as MPTCP are becoming increasingly relevant to support better use of multiple connectivity through capacity aggregation and seamless failover. However, capacity aggregation over heterogeneous paths, such as offered by cellular and Wi-Fi networks, is problematic. It causes packet reordering leading to head-of-line (HoL) blocking at the receiver, increased end-to-end delays and lower application goodput. MPTCP tackles this issue by penalising the use of longer paths, and increasing buffer sizes. This, however, results in suboptimal resource usage. In this paper, we first evaluate and compare the performance of default MPTCP and alternative state-of-the-art schedulers, all implemented in the Linux kernel, for a range of traffic patterns and network environments. This allows us to identify shortcomings of various approaches. We then propose a send-window BLocking ESTimation scheduler, BLEST, which aims to minimise HoL-blocking in heterogeneous networks, thereby increasing the potential for capacity aggregation by reducing the number of spurious retransmissions. The resulting scheduler allows an increase by 12% in application goodput with bulk traffic while reducing unnecessary retransmissions by 80% as compared to default MPTCP and other schedulers.

关键词： Wireless LAN Delays scheduling algorithms Streaming media Servers Transport protocols Linux

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 434 435 436 437 438 439 440 441 442 443 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：