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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

10,726 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,646 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,302 篇 resource managem...
1,301 篇 real time system...
1,291 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
968 篇 job shop schedul...
945 篇 dynamic scheduli...
782 篇 costs
735 篇 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,585 篇 英文
83 篇 其他
58 篇 中文

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

共 10726 条记录，以下是4891-4900 订阅

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

详细简洁

排序：

Asymptotic analysis of fair scheduling in the OFDM systems

Asymptotic analysis of fair scheduling in the OFDM systems

引用

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

作者： Wang Anchun Shexiaoming Zhou Shidong Xu Xibin Yao Yan State Key Lab on Microwave and Digital Commun. Tsinghua University Beijing China

ISBN: (纸本)0780378229

Orthogonal frequency division multiplexing (OFDM) is one of the promising techniques in the next generation high-speed data rate wireless networks for its ability to combat the intersymbol interference(ISI), and fair scheduling algorithms are used to utilize the independence of the fading statistics of different user to improve the spectral efficiency. In this paper, we try to analysed the performance of fair scheduling algorithms in the OFDM systems and choose the appropriate subband size to tradeoff between the throughput and the channel feedback. We show that asymptotic scheduling gain of fair scheduling algorithms in the OFDM system increases as the number of user increases and decreases with the average received SNR. We also present the distribution of the averaged received signal-to-noise-ratio (SNR) in a subband, give a formula to evaluate the scheduling gain approximately, and point out that the maximal eigenvalue is a good indicator to choose the appropriate subband size. It is shown that the appropriate subband number is 16 for channel A or 32 for channel B.

关键词： OFDM scheduling algorithm Next generation networking Wireless networks Intersymbol interference Fading Statistics Performance analysis algorithm design and analysis Throughput

来源：评论

学校读者我要写书评

暂无评论

Instruction selection, resource allocation, and scheduling in the AVIV retargetable code generator

Instruction selection, resource allocation, and scheduling i...

引用

Design Automation Conference

作者： S. Hanono S. Devadas Department of EECS MIT USA

The AVIV retargetable code generator produces optimized machine code for target processors with different instruction set architectures. AVIV optimizes for minimum code size. Retargetable code generation requires the development of heuristic algorithms for instruction selection, resource allocation, and scheduling. AVIV addresses these code generation subproblems concurrently, whereas most current code generation systems address them sequentially. It accomplishes this by converting the input application to a graphical (Split-Node DAG) representation that specifies all possible ways of implementing the application on the target processor. The information embedded in this representation is then used to set up a heuristic branch-and-bound step that performs functional unit assignment, operation grouping, register bank allocation, and scheduling concurrently. While detailed register allocation is carried out as a second step, estimates of register requirements are generated during the first step to ensure high quality of the final assembly code. We show that near-optimal code can be generated for basic blocks for different architectures within reasonable amounts of CPU time. Our framework thus allows us to accurately evaluate the performance of different architectures on application code.

关键词： Resource management Hardware Process design Job shop scheduling Processor scheduling Registers Permission Heuristic algorithms scheduling algorithm Embedded system

来源：评论

学校读者我要写书评

暂无评论

Communication sensitive rotation scheduling

Communication sensitive rotation scheduling

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： S. Tongsima N.L. Passos E.H.-M. Sha Department of Computer Science & Engineering University of Notre Dame Notre Dame IN USA

Loop pipelining (retiming) is a valuable tool used to explore parallelism across iterations. Few results are available about loop pipelining with data communication considerations. This paper first designs a modified list scheduling algorithm to be used as a subroutine in a novel technique called "communication sensitive rotation scheduling". Such a technique explores loop pipelining properties while handling the underlying imposed communication environment. An initial schedule is transformed to a more compact one under resource constraints.< >

关键词： Processor scheduling scheduling algorithm Flow graphs Pipeline processing Costs Parallel processing Data communication algorithm design and analysis Communication system control Computer science

来源：评论

学校读者我要写书评

暂无评论

Online scheduling of a multi-robot system by using genetic algorithms

Online scheduling of a multi-robot system by using genetic a...

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： H. Murao S. Kitamura Department of Computer and Systems Engineering Faculty of Engineering Kobe University Kobe Japan

This paper proposes an online method to schedule the movement of robots in a multi-robot system. The authors introduce a multi-agent based search method to cope with small modifications of the system during the execution of a schedule which is preliminarily obtained by a genetic algorithm (GA). They apply the method to a welding plant, in which a number of seams are processed simultaneously by several robots, but there is no one-to-one relation between the seems and the robots. A GA is used to assign the welded seams to the robots and to schedule the welding order of the seams of each robot in a way which minimizes the overall welding time. The task of the proposed multi-agent based search method is to cope with troubles of the robots and sudden changes of the seams for which a online modification of the schedule is necessary. As a result of computer simulations, the proposed method shows fairly good results for perturbations in the system during the task.

关键词： Multirobot systems Genetic algorithms Robots Welding Processor scheduling Search methods Computer simulation Systems engineering and theory scheduling algorithm Production systems

来源：评论

学校读者我要写书评

暂无评论

A fault-tolerant scheduling scheme for hybrid tasks in distributed real-time systems

A fault-tolerant scheduling scheme for hybrid tasks in distr...

引用

IEEE Workshop on Software Technologies for Future Embedded Systems

作者： Y.S. Hong H.W. Goo Dongguk University Seoul South Korea

This paper studies a fault-tolerant real-time scheduling algorithm for hybrid task sets, which contain periodic tasks and aperiodic tasks. A previously proposed fault-tolerant periodic scheduling was extended to hybrid scheduling based on time redundancy and space redundancy. Periodic tasks are assigned to processors using fast and simple heuristic scheme and joint scheduling is used for periodic and aperiodic tasks. A simulation study shows the effectiveness of the proposed approach.

关键词： Fault tolerant systems Real time systems Redundancy Processor scheduling Job shop scheduling Fault tolerance scheduling algorithm Transaction databases Network servers Fault detection

来源：评论

学校读者我要写书评

暂无评论

Efficient Power-Aware Packet scheduling for Multiantenna Packet Radio Systems

Efficient Power-Aware Packet Scheduling for Multiantenna Pac...

引用

International Conference on Networks and Communications (NETCOM)

作者： Stanislav Nonchev Mikko Valkama Department of Communications Engineering Tampere University of Technology Tampere Finland

In this paper, we propose fairness-oriented packet scheduling (PS) schemes with power-efficient control mechanism for future packet radio systems. In general, multi-antenna transmit-receive schemes provide additional flexibility to packet scheduler functionality. Stemming from the earlier enhanced proportional fair scheduler studies for single-input multiple-output (SIMO) and multiple-input multiple-output (MIMO) systems, we extend the development of efficient packet scheduling algorithms by adding transmit power considerations in the overall priority metrics calculations and scheduling decisions. Furthermore, we evaluate the proposed scheduling schemes by simulating practical orthogonal frequency division multiple access (OFDMA) based packet radio system in terms of throughput, coverage and fairness distribution among users. As a concrete example, under reduced overall transmit power constraint and unequal power distribution for different sub-bands, we demonstrate that by using the proposed power-aware multi-user scheduling schemes, significant coverage and fairness improvements in the order of 70% and 20% can be obtained, at the expense of average throughput loss of only 15%.

关键词： scheduling algorithm Packet radio networks MIMO Throughput Radio control Control systems Frequency conversion Concrete Power distribution Propagation losses

来源：评论

学校读者我要写书评

暂无评论

scheduling Real-Time Computations on Hypercubes with Load Balancing

Scheduling Real-Time Computations on Hypercubes with Load Ba...

引用

Distributed Memory Computing Conference

作者： Kwei-Jay Lin Jen-Yao Chung J.W.-S. Liu Department of Computer Science University of Illinois Urbana-Champaign Urbana IL USA IBM Thomas J. Watson Research Center Yorktown Heights NY USA

来源：评论

学校读者我要写书评

暂无评论

Optimal two level partitioning and loop scheduling for hiding memory latency for DSP applications

Optimal two level partitioning and loop scheduling for hidin...

引用

Design Automation Conference

作者： Z. Wang M. Kirkpatrick E.H.-M. Sha Department of Comp Sci & Engineering University of Notre Dame Notre Dame IN USA

来源：评论

学校读者我要写书评

暂无评论

Deadline based channel scheduling

Deadline based channel scheduling

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： Y.E. Liu J.W. Wong Department of Computer Science University of Waterloo Waterloo ONT Canada

The use of deadline based channel scheduling in support of real time delivery of application data units (ADU's) is investigated. Of interest is priority scheduling where a packet with a smaller ratio of delivery deadline over number of hops to destination is given a higher priority. It has been shown that a variant of this scheduling algorithm, based on head-of-the-line priority, is efficient and effective in supporting real time delivery of ADU's. In this variant, packets with a ratio smaller than or equal to a given threshold are sent to the higher priority queue. We first present a technique to select this threshold dynamically. The effectiveness of our technique is evaluated by simulation. We then study the performance of deadline based channel scheduling for large networks, with multiple autonomous systems. For this case, accurate information on number of hops to destination may not be available. A technique to estimate this distance metric is presented. The effectiveness of our algorithm with this estimated distance metric is evaluated. In addition, we study the performance of a multi-service scenario where only a fraction of the routers deploy deadline based channel scheduling.

关键词： Quality of service Processor scheduling scheduling algorithm Resource management Clocks Computer science Application software Internet Games Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

On realistic and efficient scheduling of DSP algorithms onto multiprocessor architectures

On realistic and efficient scheduling of DSP algorithms onto...

引用

Asilomar Conference on Signals, Systems & Computers

作者： P. Koch K.K. Bagchi K. Hermansen Institute of Electronic Systems University of Aalborg Aalborg Denmark

Available strategies for static scheduling of DSP algorithms onto multiprocessor (general purpose and DSP-based) systems are discussed. It is found that simplistic interprocessor communication (IPC) modeling and the absence of precedence analysis are major reasons for unrealistic and not always efficient solutions. The authors propose a mapping scheme based on clustering and various realistic scheduling strategies in order to minimize the runtime of the DSP algorithm. The scheme, called NODUST (for NOde DUplication STrategy), incorporates modeling of the target architecture in terms of nonsimplistic IPC times, which makes the solutions more realistic. The NODUST algorithm provides superior speedup and better processor utilizations in all possible cases compared to the results of T. C. Hu (1961). The compile time for the Hu strategy, on the other hand, is lower than that of NODUST. The speedups do not vary significantly when one moves from the M68000 to the ADSP 2101 environment.< >

关键词： Digital signal processing scheduling algorithm Processor scheduling Optimal scheduling Costs Computer architecture Grain size Parallel processing Time factors algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 486 487 488 489 490 491 492 493 494 495 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：