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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,405 篇 工学
- 3,896 篇 计算机科学与技术...
- 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,577 篇 scheduling algor...
1,050 篇 scheduling
568 篇 schedules
525 篇 resource managem...
520 篇 real-time system...
474 篇 cloud computing
442 篇 throughput
425 篇 heuristic algori...
392 篇 quality of servi...
378 篇 delays
309 篇 dynamic scheduli...
307 篇 task analysis
303 篇 optimization
262 篇 computational mo...
229 篇 simulation
217 篇 energy consumpti...
208 篇 bandwidth
205 篇 job shop schedul...
199 篇 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...
10 篇 school of automa...
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,321 篇 英文
167 篇 其他
81 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8577 条记录，以下是4591-4600 订阅

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

详细简洁

排序：

Hierarchical taylor-made scheduling for data traffic with prioritization over LTE networks

Hierarchical taylor-made scheduling for data traffic with pr...

引用

International Workshop on Telecommunications (IWT)

作者： Jahyr Gonçalves Neto Fabbryccio A. C. M. Cardoso Paulo A. Valente Ferreira Max H. M. Costa University Centec of Votuporanga Campinas SP Brazil Department of Communications Department of Systems and Energy Campinas SP Brazil School of Electrical and Computer Engineering Research and Development Center for Telecommunications - CPqD Campinas SP Brazil Campinas SP Brazil

Long Term Evolution (LTE) is the standard developed by the 3rd Generation Partnership Project (3GPP) to address the ITU's 4G requirements. For the first time, we have technology convergence in a generation of cellular communication systems. LTE promises data transmission of about 100 Mbps and its advanced version (LTE-A) goes even further with more than 1 Gbps in the downlink channel. Such very high data rates will only be achievable with appropriate network resource optimizations. Accordingly, this paper presents a flexible and adaptive scheme of multi-user scheduling considering data traffic prioritization in the LTE downlink channel. The proposed scheduling algorithm uses Proportional Fairness and Analytic Hierarchy Process (AHP) that allows to aggregate performance criteria and to improve resource allocation for users based on the general traffic.

关键词： Resource management Long Term Evolution Throughput Analytic hierarchy process Downlink Optimization scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A lightweight sensor scheduling algorithm for clustered wireless sensor networks

A lightweight sensor scheduling algorithm for clustered wire...

引用

Mediterranean Conference on Control and Automation (MED)

作者： Francesco Liberati Guido Oddi Andrea Lanna Antonio Pietrabissa Department of Computer “Sapienza” University of Rome Rome Italy

ISBN: (纸本)9781479999378

This paper deals with the design of a lightweight sensor scheduling algorithm in clustered wireless sensor networks (WSNs) for environmental observation. The aim is that of achieving energy savings and a fair distribution of the sensing task among WSN nodes, while ensuring that critical network tasks, such as data fusion, are not impaired. The proposed scheduling policy takes into account feedback on nodes' health status and the quality of the information provided by the nodes to be scheduled. As a result, dynamically variable schedules are produced, adapted to the current status of the WSN. Simulation results are presented to highlight the relevant features of the algorithm.

关键词： scheduling algorithms Wireless sensor networks Schedules Energy consumption Monitoring Sensors Batteries

来源：评论

学校读者我要写书评

暂无评论

Collision scheduling for Cellular Networks with Spatial Connectivity Constraints

Collision Scheduling for Cellular Networks with Spatial Conn...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Wenbo He Chen Feng Bobak Nazer ECE Department Boston University Boston MA

Conventional scheduling algorithms assign users to orthogonal sub-channels in order to avoid collisions. However, recent physical-layer advances, such as the compute-and-forward technique, have demonstrated that it is possible to recover a linear combination of packets when a collision occurs. Recently, we proposed a collision scheduling algorithm that exploits this phenomenon to attain higher throughputs. Here, we argue that the complexity of this algorithm can be significantly reduced in the important special case where each cell only overlaps with a constant number of neighboring cells.

关键词： Base stations Complexity theory Bipartite graph scheduling algorithms Receivers Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Minimum delay scheduling for raw-data convergecast in wireless field networks

Minimum delay scheduling for raw-data convergecast in wirele...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Hossein Akhlaghpasand Vahid Shah-Mansouri School of Electrical and Computer Engineering University of Tehran Tehran Iran

Wireless field networks (WFNs) are type of ad hoc network which are employed for industrial automation applications. Delay plays an important role due to the time sensitive nature of such applications. In this paper, we build scheduling algorithms based on WFN standards such as WirelessHART and ISA 100.11a. The goal is to minimize the delay. Two heuristic scheduling algorithms are presented. The first algorithm is proposed based on finding maximum independent set (MIS). Advantage of this algorithm is its low complexity and ease of implementation, while not essentially optimizing the delay. The second algorithm minimizes the total delay of WFNs. Also, it controls the delay of each field node. Another objective which is surveyed in formulation of problem is to minimize the number of channels used in scheduling.

关键词： Delays Job shop scheduling Approximation algorithms Time-frequency analysis scheduling algorithms Standards

来源：评论

学校读者我要写书评

暂无评论

Fill the Void: Improved scheduling for Optical Switching

Fill the Void: Improved Scheduling for Optical Switching

引用

International Teletraffic Congress, ITC 21

作者： Kurt Van Hautegem Wouter Rogiest Herwig Bruneel Universiteit Gent Gent BE Ghent University Ghent Belgium

With ever-increasing demand for bandwidth, optical packet/burst switching is proposed to utilize more of the available capacity of optical networks in the future. In these packet-based switching techniques, packet contention on a single wavelength is resolved effectively by means of Fiber Delay Lines. The involved scheduling algorithms are typically designed to minimize packet loss and/or packet delay. By filling so-called voids, void-filling algorithms are known to outperform their non-void-filling counterparts. This however comes at a large computational cost as the void-filling algorithms have to keep track of beginnings and endings of all voids. This is opposed to the non-void-filling algorithms which only have to keep track of a single system state variable. We therefore propose a new type of algorithm that selectively creates voids that are larger than strictly needed, only when these will likely be filled. Results obtained by Monte Carlo simulation show that selective void creation can jointly reduce packet loss by 50% and packet delay by 18%, without imposing a high computational cost.

关键词： Delays Schedules Indexes Optical switches scheduling algorithms Ports (Computers) scheduling

来源：评论

学校读者我要写书评

暂无评论

OCPS:Offset Compensation based Packet scheduling Mechanism for Multipath TCP

OCPS:Offset Compensation based Packet Scheduling Mechanism f...

引用

IEEE International Conference on Communications

作者： Dan Ni Kaiping Xue Peilin Hong Hong Zhang Hao Lu The Department of EEIS University of Science and Technology of China

ISBN: (纸本)9781467364300

As terminals are equipped with multiple interfaces and allowed to access heterogeneous networks, transferring data simultaneously through all the available paths becomes possible and also brings many benefits. Multipath TCP (MPTCP) distributes an application stream over different TCP connections. Since different paths have disparate latencies, out-of-order packets problem occurs at receiver. Large number of these packets exhaust the limited receive buffer and make the receive window stall, which greatly degrade the throughput. Thus, a scheduling mechanism plays an important role to keep in-order delivery. Previous intelligent scheduling mechanisms schedule data independently each time and doesn't utilize the feedback carried in acknowledgements, which lose flexibility. Our Offset Compensation based Packet scheduling (OCPS) mechanism gets feedback information from SACK options and gains the knowledge of whether last scheduling round still causes out-of-order problem. Then it modifies the scheduling next round accordingly by using an offset. The simulation results illustrate our mechanism enhance throughput and reduce cache occupancy at receiver.

关键词： Receivers scheduling Out of order scheduling algorithms Throughput Estimation Quality of service

来源：评论

学校读者我要写书评

暂无评论

Multicore scheduling of parallel real-time tasks with multiple parallelization options

Multicore scheduling of parallel real-time tasks with multip...

引用

IEEE Symposium on Real-Time and Embedded Technology and Applications

作者： Jihye Kwon Kang-Wook Kim Sangyoun Paik Jihwa Lee Chang-Gun Lee Department of Computer Science and Engineering Seoul National University Seoul Korea

ISBN: (纸本)9781479986040

Past researches on multicore scheduling assume that a computational unit has already been parallelized into a prefixed number of threads. However, with recent technologies such as OpenCL, a computational unit can be parallelized in many different ways with runtime selectable numbers of threads. This paper proposes an optimal algorithm for parallelizing and scheduling a set of parallel tasks with multiple parallelization options on multiple CPU cores. The proposed algorithm is validated through both simulation and actual implementation. To the best of our knowledge, this is the first work addressing the problem of scheduling real-time tasks with multiple parallelization options on multiple CPU cores.

关键词： Multicore processing Computational modeling Message systems Instruction sets Real-time systems scheduling scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantifying the impact of routing and scheduling on throughput for wireless networks

Quantifying the impact of routing and scheduling on throughp...

引用

MILCOM, Military Communications Conference

作者： Jun Sun Thomas Shake Greg Kuperman Joshua Van Hook Aradhana Narula-Tam MIT Lincoln Laboratory

Current evaluations of DoD tactical networking systems have left the impression of sub-optimal performance without being able to provide either a clear vision of the limits on the performance that could realistically be attained or which layers of the network algorithm are responsible for the suboptimal results. Recent advances in computing the capacity of a large MANET allow us to obtain a practical benchmark for MANET capacity performance evaluation [1]. In this paper, we quantify the impact of commonly used algorithms at the routing and the scheduling layers on the overall network throughput and compare their individual effects on overall network throughput performance. We consider the routing and the scheduling layers separately since practical MANET implementations are likely to use a layered architecture even though the joint routing and scheduling algorithm is known to be optimal. Our data shows that a good scheduling algorithm can provide potentially four times the throughput improvement of a good routing algorithm when inter-user interference conforms to an 802.11 type model.

关键词： Routing Throughput Interference Mobile ad hoc networks scheduling algorithms IEEE 802.11 Standard Protocols

来源：评论

学校读者我要写书评

暂无评论

Adaptive Time-Based Least Memory Intensive scheduling

Adaptive Time-Based Least Memory Intensive Scheduling

引用

IEEE International Symposium on Embedded Multicore Socs (MCSoC)

作者： Amr Saleh Elhelw Ali El-Moursy Hossam Ali Hassan Fahmy Information System Sector Egyptian Financial Supervisory Authority Cairo Egypt Electr. & Comput. Eng. Dept. Univ. of Sharjah Sharjah Sharjah United Arab Emirates Electron. & Commun. Dept. Cairo Univ. Cairo Cairo Egypt

DRAM memory is a major resource shared in multi-core system, hence memory requests from different applications interfere with each other. Therefore, different applications running together on the same chip can experience extremely different memory system performance: one application can experience a severe slowdown or starvation while another is unfairly prioritized by the memory scheduler. Existing memory access scheduling techniques try to optimize the overall multi-core system performance and fairness. This paper proposes an effective memory access scheduler, called Adaptive Time-Based Least Memory Intensive scheduling (Adaptive TB-LMI). The goal of the proposed scheduler is to increase the overall system performance and fairness. Adaptive TB-LMI showed an average increase in performance and fairness by 2.5% and 10.2% respectively compared to Time-Based Least Memory Intensive scheduling (TB-LMI) (previous work providing the best system throughput and fairness). Adaptive TB-LMI showed a maximum increase in performance and fairness by 9.65% and 22.16% respectively compared to TB-LMI.

关键词： Benchmark testing scheduling scheduling algorithms Hardware Instruction sets Memory management Registers

来源：评论

学校读者我要写书评

暂无评论

A Proportional Fairness scheduling for Wireless Sensor Networks

A Proportional Fairness Scheduling for Wireless Sensor Netwo...

引用

International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

作者： Jianhui Huang Jingping Bi Institute of Computing Technology Chinese Academy of Science Beijing Chjna

A packet scheduling algorithm used for wireless sensor network meeting the proportional fairness principle is proposed. Based on the weighted round robin (WRR) strategy, the proposed scheduling algorithm allocates different service quota to different traffics according to their average packet arrival rates to guarantee the proportion fairness on the average packet delivery delay and the average packet loss ratio. Since the scheduling algorithm does not perform the high-load operations such as adding time stamps, sorting and so on, it can be implemented easily and is suitable for resource-limited WSN. The proposed algorithm is tested in a wireless sensor network. The performance shows that the scheduling algorithm can guarantee the average packet delivery delay proportional fairness when the average packet delivery delay is used as the performance metric and the average packet loss ratio proportional fairness is realized when all the queues are overflowing and the average packet loss ratio is used as the performance metric.

关键词： Quality of service Wireless sensor networks Packet loss Delays scheduling algorithms Mathematical model

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 456 457 458 459 460 461 462 463 464 465 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：