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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,033 篇 会议
685 篇 期刊文献
9 篇 学位论文
5 册 图书

馆藏范围

10,732 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,362 篇 工学
- 1,162 篇 计算机科学与技术...
- 851 篇 电气工程
- 664 篇 信息与通信工程
- 293 篇 软件工程
- 276 篇 电子科学与技术（可...
- 221 篇 控制科学与工程
- 200 篇 仪器科学与技术
- 150 篇 机械工程
- 58 篇 交通运输工程
- 24 篇 材料科学与工程（可...
- 23 篇 网络空间安全
- 21 篇 石油与天然气工程
- 17 篇 光学工程
- 16 篇 动力工程及工程热...
- 15 篇 航空宇航科学与技...
- 7 篇 土木工程
- 6 篇 测绘科学与技术
- 4 篇 化学工程与技术
252 篇 管理学
- 247 篇 管理科学与工程(可...
- 6 篇 工商管理
- 6 篇 图书情报与档案管...
173 篇 理学
- 67 篇 系统科学
- 58 篇 物理学
- 30 篇 数学
- 16 篇 化学
- 9 篇 生物学
48 篇 文学
- 48 篇 新闻传播学
16 篇 医学
- 12 篇 临床医学
9 篇 经济学
- 7 篇 应用经济学
9 篇 军事学
- 9 篇 军队指挥学
5 篇 教育学
1 篇 法学

主题

10,732 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,645 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,303 篇 resource managem...
1,302 篇 real time system...
1,292 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
969 篇 job shop schedul...
946 篇 dynamic scheduli...
782 篇 costs
736 篇 telecommunicatio...
691 篇 switches
677 篇 optimal scheduli...
588 篇 application soft...
582 篇 heuristic algori...
520 篇 hardware

机构

40 篇 department of el...
32 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
29 篇 department of co...
26 篇 department of co...
24 篇 department of co...
24 篇 school of electr...
23 篇 department of co...
22 篇 department of co...
22 篇 department of co...
22 篇 mitre corporatio...
22 篇 beijing universi...
21 篇 institute of com...
19 篇 department of el...
19 篇 bell laboratorie...
18 篇 department of el...

作者

30 篇 m. hamdi
26 篇 tei-wei kuo
25 篇 e. leonardi
21 篇 e.h.-m. sha
19 篇 sanjoy baruah
19 篇 f. neri
19 篇 klaus i. pederse...
18 篇 k.g. shin
18 篇 james h. anderso...
17 篇 p. giaccone
17 篇 maode ma
17 篇 v.o.k. li
16 篇 jian-jia chen
16 篇 n.k. jha
16 篇 kwei-jay lin
16 篇 d. mosse
15 篇 j.a. stankovic
15 篇 i. ahmad
15 篇 j.w.s. liu
15 篇 r. srikant

语言

10,592 篇 英文
82 篇 其他
58 篇 中文

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

共 10732 条记录，以下是4691-4700 订阅

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

详细简洁

排序：

Effects of Non-Ideal Channel Feedback on Dual-Stream MIMO-OFDMA System Performance

Effects of Non-Ideal Channel Feedback on Dual-Stream MIMO-OF...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Istvan Z. Kovacs Klaus I. Pedersen Troels E. Kolding Akhilesh Pokhariyal Markku Kuusela Nokia Siemens Networks Aalborg Denmark Aalborg University Copenhagen Aalborg Denmark Nokia Research Center Helsinki Finland

In this paper we analyze the downlink OFDMA system-level performances of a 2times2 dual-stream MIMO multiuser transmission scheme under the assumptions of partial and noisy channel quality indicator (CQI) feedback available from the terminals. The effects on the CQI feedback of the terminal measurement and estimation errors, quantization errors, uplink reporting format and delays are included. Two reduced CQI reporting schemes are evaluated in macro and microcell scenarios when operating in combination with a MIMO outer loop link adaptation (OLLA) and a MIMO aware frequency domain packet scheduling (FDPS) algorithm. We show that, by using OLLA and with a proper choice of the CQI reporting scheme for dual-stream MIMO, the required CQI feedback overhead can be reduced by 90% while limiting the cell throughput losses to less than 10%.

关键词： Feedback System performance MIMO scheduling algorithm Performance analysis Downlink Estimation error Quantization Delay effects Delay estimation

来源：评论

学校读者我要写书评

暂无评论

RouteGA: A Grid Load Balancing algorithm with Genetic Support

RouteGA: A Grid Load Balancing Algorithm with Genetic Suppor...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Rodrigo F. de Mello Jose A. Andrade Filho Luciano J. Senger Laurence T. Yang Instituto de Ciências Matemáticas e de Computação Departmento de Ciencias de Computação Universidade de Sáo Paulo Sao Paulo Brazil Departamento de Informática Universidade Estadual de Ponta Grossa Ponta Grossa Parana Brazil Saint Francis Xavier University Antigonish NS Canada

Motivated by the first process allocation limitations of the original Route load balancing algorithm, this paper presents RouteGA (Route with Genetic algorithm support) which considers historical information about parallel application executions in order to optimize the first scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify process occupation at the launch moment. Such occupation is used to parameterize a genetic algorithm responsible for optimizing the process allocation on heterogeneous computing environments such as Grids. Results confirm RouteGA over- performs the original Route, which had previously overper-formed others from literature.

关键词： Load management Application software Concurrent computing Genetic algorithms Grid computing scheduling algorithm Data mining Machine learning algorithms Distributed computing Computer networks

来源：评论

学校读者我要写书评

暂无评论

Bandwidth Balancing in Multi-Channel IEEE 802.16 Wireless Mesh Networks

Bandwidth Balancing in Multi-Channel IEEE 802.16 Wireless Me...

引用

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

作者： C. Cicconetti I. F. Akyildiz L. Lenzini Dipartimento di Ingegneria dellInformazione University of Pisa Pisa Italy School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA

In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput. In this paper, a Fair End-to-end Bandwidth Allocation (FEBA) algorithm is introduced to solve this problem. FEBA is implemented at the Medium Access Control (MAC) layer of single-radio, multiple channels IEEE 802.16 mesh nodes, operated in a distributed coordinated scheduling mode. FEBA negotiates bandwidth among neighbors to assign a fair share to each end-to-end traffic flow. This is carried out in two steps. First, bandwidth is requested and granted in a round-robin fashion where heavily loaded links are provided with a proportionally higher amount of service than the lightly loaded links at each round. Second, at each output link, packets from different traffic flows are buffered in separate queues which are served by the Deficit Round Robin (DRR) scheduling algorithm. If multiple channels are available, all of them are shared evenly in order to increase the network capacity due to frequency reuse. The performance of FEBA is evaluated by extensive simulations and is shown to provide fairness by balancing the bandwidth among traffic flows.

关键词： Bandwidth Wireless mesh networks Traffic control Throughput Telecommunication traffic Communication system traffic control Channel allocation Media Access Protocol Round robin scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Aggregate Rate-Controlled Service Discipline Enabling Packet Switched Networks with Deterministic Delay Bound

Aggregate Rate-Controlled Service Discipline Enabling Packet...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Maksim Azarov Standard MicroSystems Inc. NY USA

来源：评论

学校读者我要写书评

暂无评论

A simulation-based algorithm for supply chain optimization 07

A simulation-based algorithm for supply chain optimization

引用

Simulation Winter Conference

作者： Takayuki Yoshizumi Hiroyuki Okano Tokyo Research Laboratory IBM Research Yamato Kanagawa Japan

ISBN: (纸本)9781424413065

In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as optimization problems, and algorithms have been proposed for each problem. It is difficult, however, to design an algorithm for optimizing a supply chain simultaneously because the problem is much more complex than the individual problems. We present a simulation-based optimization algorithm that optimizes a supply chain, exploiting both simulation and optimization techniques. This system leverages two existing algorithms, and will optimize a supply chain by executing simulations while changing the boundary conditions between the two algorithms. Experimental results show that a better solution to a supply chain can be found through a series of optimization simulations. A logistics consultant was satisfied with the solution. This system will be used in actual logistics consulting services.

关键词： Supply chains Costs Transportation Logistics algorithm design and analysis Design optimization Boundary conditions Laboratories scheduling algorithm Supply chain management

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of an Ultra-Fast Pipeline Scheduler for Next-Generation Networks

Performance Evaluation of an Ultra-Fast Pipeline Scheduler f...

引用

ACS/IEEE International Conference on Computer Systems and Applications

作者： M. T. Anan G. M. Chaudhry J. Qaddour School of Computing and Engineering University of Missouri Kansas City USA School of Information Technology Illinois State University USA

The Internet protocol (IP) plays a dominant role in current networking technologies and the wavelength division multiplexing (WDM) technology provides tremendous bandwidth. The IP-over-WDM is becoming the right choice for next-generation Internet networks where optical burst switches (OBS) is a promising technique to bridge the gap between IP and WDM. However, traditional OBS scheduling algorithms either have low computational complexity with high burst dropping probability or high computational complexity with low burst dropping probability. A critical design issue in OBS is how to reduce burst dropping probability as a result of resource contention using a high performance scheduling algorithm. In this paper, we present an ultra-fast scheduler which integrates the merits of both low computational complexity and low burst dropping probability. The key idea is to maintain all scheduled data bursts and void intervals in a binary representation. Then, fast hardware logic operations are performed to schedule incoming data bursts without the need to traverse and search all scheduled bursts in all channels. The new approach provides an effective optical burst switching for variable-length bursts with low computational complexity compared to existing scheduling algorithms.

关键词： Pipelines Next generation networking Computational complexity Processor scheduling Wavelength division multiplexing scheduling algorithm IP networks Protocols Bandwidth Optical fiber networks

来源：评论

学校读者我要写书评

暂无评论

Simultaneous Power Fluctuation and Average Power Minimization during Nano-CMOS Behavioral Synthesis

Simultaneous Power Fluctuation and Average Power Minimizatio...

引用

International Conference on VLSI Design

作者： Saraju P. Mohanty Elias Kougianos Computer Science and Engineering University of North Texas Denton TX USA Electrical Engineering Technology University of North Texas Denton TX USA

ISBN: (纸本)9780769527628;0769527620

The authors present minimization methodologies and an algorithm for simultaneous scheduling, binding, and allocation for the reduction of total power and power fluctuation during behavioral synthesis. We consider resources of dual gate oxide thicknesses, dual threshold voltage, and dual power supply. Statistical variations in these parameters are explicitly taken into account by using Monte Carlo simulations to characterize a datapath component library which is then used during behavioral synthesis. The formulated multi-objective cost function is optimized for various resource and time constraints. We present results on several standard benchmarks where we observed significant reduction in total power (as high as 75% without time penalty) and elimination of total power fluctuation (as high as 76% without time penalty). To the best of the authors' knowledge, this is the first-ever behavioral synthesis work addressing fluctuation in total power consumption accounting for gate and subthreshold leakage and dynamic power

关键词： Fluctuations Minimization methods scheduling algorithm Threshold voltage Power supplies Libraries Cost function Constraint optimization Time factors Energy consumption

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient Framework for Large-Scale Parallel Storage Systems

An Energy-Efficient Framework for Large-Scale Parallel Stora...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Ziliang Zong Matt Briggs Nick O'Connor Xiao Qin Department of Computer Science New Mexico Institute of Mining and Technology Socorro NM USA

Huge energy consumption has become a critical bottleneck for further applying large-scale cluster systems to build new data centers. Among various components of a data center, storage subsystems are one of the biggest consumers of energy. In this paper, we propose a novel buffer-disk based framework for large-scale and energy-efficient parallel storage systems. To validate the efficiency of the proposed framework, a buffer-disk scheduling algorithm is designed and implemented. Our algorithm can provide more opportunities for underlying disk power management schemes to save energy by keeping a large number of idle data disks in sleeping mode as long as possible. The trace-driven simulation results based on a revised disksim simulator show that this new framework can significantly improves the energy efficiency of large-scale parallel storage systems.

关键词： Energy efficiency Large-scale systems Energy storage Buffer storage Energy consumption scheduling algorithm High performance computing algorithm design and analysis Humans Computer science

来源：评论

学校读者我要写书评

暂无评论

Run-time Task Overlapping on Multiprocessor Platforms

Run-time Task Overlapping on Multiprocessor Platforms

引用

Embedded Systems for Real-Time Multimedia (ESTIMedia)

作者： Zhe Ma Daniele P. Scarpazza Francky Catthoor IMEC Leuven Belgium

Today's embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into sub-tasks which are in turn assigned and scheduled on multiple different processors to achieve the optimal performance/energy combination. Previous work introduced systematical approaches to make performance-energy trade-offs explorations for each individual task and used the exploration results at run-time to fulfill system-level constraints. However, they did not exploit the fact that the concurrent tasks can be executed in an overlapped fashion. In this paper, we propose a simple yet powerful online technique that performs task overlapping by run-time subtask re-scheduling. By doing so, a multiprocessor system with concurrent tasks can achieve better performance without extra energy consumption. We have applied our algorithm to a set of randomly-generated task graphs, obtaining encouraging improvements over non-overlapped task, and also having less overall energy consumption than a previous DVS method for real-time tasks. Then, we have demonstrated the algorithm on real-life video- and image-processing applications implemented on a dual-processor TITMS320C6202 board: We have achieved a reduction of 22-29% in the application execution time, while the impact of run-time scheduling overhead proved to be negligible (1.55%).

关键词： Runtime Optimal scheduling Job shop scheduling Energy consumption Voltage control scheduling algorithm Multimedia systems Mobile handsets Base stations Radio frequency

来源：评论

学校读者我要写书评

暂无评论

A Unified Strategy for Dynamic Mapping in Grid Computing Environments

A Unified Strategy for Dynamic Mapping in Grid Computing Env...

引用

IEEE International Conference on Mechatronics and Automation

作者： Ying Liu Jun Wei KanMin Yu WanYin Zhou JingBo Xia Telecommunication Engineering Institute Air Force Engineering University Xi'an Shanxi China

A unified strategy for dynamic mapping in grid computing environments is brought forward. Immediate mode and batch mode are symbiotic and can switch adaptively in our strategy. It uses MCT for the immediate mode mapping and an improved sufferage algorithm, called utility-sufferage for the batch mode scheduling which the utility functions are defined to assure diverse QoS demands of tasks. The experimental results indicate that the improved scheme can achieve higher performances than the benchmark algorithms subject to varying task flow in grid computing environments.

关键词： Grid computing Switches Symbiosis Dynamic scheduling Mechatronics Automation Telecommunication switching scheduling algorithm Processor scheduling Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 466 467 468 469 470 471 472 473 474 475 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：