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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是4961-4970 订阅

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

详细简洁

排序：

Experimental comparison of some scheduling disciplines fed by self-similar traffic

Experimental comparison of some scheduling disciplines fed b...

引用

IEEE International Conference on Communications (ICC)

作者： A. Gorrasi R. Restaino DIIIE University of Salerno Fisciano Salerno Italy

Self-similar traffic models have permitted a more realistic description of the network devices behavior. However, the derivation of analytical results turns out to be a very demanding task, also in the single-server case. For the work-conserving switching architectures the characterization of the quality of service (QoS) parameters is even more complicated due to the correlation among the queues, induced by the scheduling policies. In this paper we present a detailed study, based on simulations of some paradigmatic scheduling disciplines, performed with an aim to furnish some useful tools for the design of high-speed network devices.

关键词： Traffic control Telecommunication traffic Queueing analysis scheduling algorithm Quality of service Delay Bandwidth Upper bound Global Positioning System Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

A Multimedia Priority Dynamic scheduling Scheme for Audio-Video Transmission with User-Level QoS Guarantee by IEEE 802.11e HCCA

A Multimedia Priority Dynamic Scheduling Scheme for Audio-Vi...

引用

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

作者： Zul Azri Bin Muhamad Noh Takahiro Suzuki Shuji Tasaka Graduate School of Engineering Nagoya Institute of Technology Japan Faculty of Social and Information Sciences Nihon Fukushi University Japan

This paper studies packet scheduling schemes for audio-video transmission in a wireless LAN with HCF controlled channel access (HCCA) of the IEEE 802.11e MAC protocol. We first propose two kinds of scheduling schemes which are referred to as the static scheduling (SS) and multimedia priority dynamic scheduling (MPDS). In the SS scheme, the hybrid coordinator (HC) allocates the duration of transmission opportunity (TXOP) for each station statically. The TXOP duration in the SS scheme can be shorter or longer than that in the reference scheduler of the IEEE 802.11e standard. On the other hand, in the MPDS scheme, the HC first allocates the duration of TXOP to each station according to the SS scheme; it then gives additional TXOP duration to stations which had audio or video packets in their source buffers at the end of the previous TXOP. We then compare the SS scheme, the MPDS scheme, and the reference scheduler in terms of application-level QoS and user- level QoS (perceptual QoS). Numerical results show that the SS and MPDS schemes can accommodate a larger number of multimedia stations in a cell than that of the reference scheduler under the condition that user-level QoS is kept high.

关键词： Dynamic scheduling Quality of service scheduling algorithm Wireless LAN Admission control Streaming media Media Access Protocol Wireless application protocol Access protocols Land mobile radio

来源：评论

学校读者我要写书评

暂无评论

Meld scheduling: relaxing scheduling constraints across region boundaries 29

Meld scheduling: relaxing scheduling constraints across regi...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： S.G. Abraham V. Kathail B.L. Deitrich Hewlett Packard Laboratories Palo Alto CA USA Center for Reliable and High Performance Computing University of Illinois Urbana IL USA

ISBN: (纸本)9780818676413

Meld scheduling melds the schedules of neighboring scheduling regions to respect latencies of operations issued in one region but completing after control transfers to the other. In contrast, conventional schedulers ignore latency constraints from other regions leading to potentially avoidable stalls in an interlocked (superscalar) machine or incorrect schedules for non-interlocked (VLIW) machines. Alternatively, schedulers that conservatively require all operations to complete before the branch rakes effect produce inefficient schedules. In this paper, we present general data structures for maintaining latency constraint information at region boundaries. We present a meld scheduling algorithm that generates latency constraints at the boundaries of scheduled regions and utilizes this information during the scheduling of other regions. We present a range of design options and describe the reasons behind our particular choices. We cover certain pitfalls and discuss how to develop an algorithm that addresses these issues. We evaluate the performance of meld scheduling on a range of noninterlocked machine models on a set of SPEC 92 and Unix benchmarks. We also investigate the sensitivity of the performance improvements due to changes in issue width and instruction latencies.

关键词： Processor scheduling Delay scheduling algorithm Frequency estimation Laboratories Milling machines VLIW Data structures Constraint optimization Optimizing compilers

来源：评论

学校读者我要写书评

暂无评论

A Study on Automated scheduling Methodology for Machining Job Shop

A Study on Automated Scheduling Methodology for Machining Jo...

引用

12th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2007), vol.2

作者： Yoshihiro Yao Kentaro Sashio Toshiya Kaihara Susumu Fujii Graduate School of Science and Technology Kobe University Kobe Japan Graduate School of Engineering Kobe University Kobe Japan Faculty of Science and Technolog Sophia University Chiyoda Tokyo Japan

In this study, scheduling method using a combination of auction-type real-time scheduling and simulation is proposed in order to automate the scheduling for machining job shop. The control mechanism which is essential for executing real-time scheduling and simulation simultaneously has been developed and implemented The auction algorithm for the real-time scheduling which improves the delay of delivery date and amount of setup time at the same time is investigated Also the method of simulation during the real-time scheduling which can predict the changing situation of the shop and automatically take countermeasures by adjusting the scheduling precondition is discussed. It is clarified that the proposed system has the ability to automate machining job shop scheduling.

关键词： Job shop scheduling Machining Processor scheduling Computational modeling Automatic control Delay effects scheduling algorithm Machinery production industries Manufacturing automation Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Packet scheduling for MIMO cellular systems

Packet scheduling for MIMO cellular systems

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Oh-Soon Shin Kwang Bok Lee School of Electrical Engineering and Computer Science Seoul National University South Korea

ISBN: (纸本)0780377575

Packet scheduling is investigated for the downlink of a multiple-input multiple-output (MIMO) cellular system. The conventional round robin scheduling (RRS) scheme does not utilize the benefits of multiuser environments, although it provides fair channel access chance to users. We propose an antenna-assisted round robin scheduling (AA-RRS) scheme to improve the conventional RRS scheme. The AA-RRS scheme provides fair channel access chance to users as the RRS scheme, whereas it increases the system capacity through the effective use of multiple antennas in achieving a diversity effect from multiple users. Computer simulations are conducted to compare the RRS and AA-RRS schemes in terms of the expected and outage capacities. It is shown that the AA-RRS scheme provides significant capacity gain over the RRS scheme, especially in terms of the outage capacity. We also discuss the effects of power control, signal-to-noise ratio (SNR), and spatial correlation on the system capacities.

关键词： scheduling algorithm MIMO Round robin Processor scheduling Downlink Computer simulation Power control Signal to noise ratio Computer science Communication systems

来源：评论

学校读者我要写书评

暂无评论

A Comparison between Tnime-slot scheduling Approaches for All-Photonic Networks

A Comparison between Tnime-slot Scheduling Approaches for Al...

引用

International Conference on Information, Communications and Signal Processing

作者： Xiao Liu N. Saberi M.J. Coates L.G. Mason Department of Electrical Engineering McGill University Montreal QC Canada

The internal switches in all-photonic networks do not perform data conversion into the electronic domain. Although this removal of O-E-O conversion eliminates a potential capacity bottleneck, it also introduces scheduling challenges; photonic switches cannot perform queuing operations, so traffic arrivals at these switches must be carefully scheduled. The (overlaid) star topology is an excellent match for an all-photonic network because it simplifies the scheduling problem. In such a network architecture, optical time division multiplexing (OTDM) approaches for scheduling the state of the central switch in the star are attractive. In this paper, we describe two OTDM algorithms that we have recently developed, one that performs scheduling on a slot-by-slot basis and another that schedules frames of multiple slots. We report and analyze the results of OPNET simulations that compare the performance of these scheduling algorithms

关键词： Optical switches scheduling algorithm Data conversion Telecommunication traffic Traffic control Network topology Circuit topology Optical fiber networks Time division multiplexing Performance analysis

来源：评论

学校读者我要写书评

暂无评论

scheduling for data center interactive services

Scheduling for data center interactive services

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Yuxiong He Sameh Elnikety Microsoft Research UK

ISBN: (纸本)9781457718175

To service requests with high quality, web search servers keep average server utilization low. As servers become busy, queuing delays increase, and requests miss their deadlines, resulting in degraded quality of service with poor user experience and potential revenue loss. In this paper, we propose a group of scheduling algorithms that can produce partial answers during overload. One of their key features is assigning processing time to each request based on system load with the objective of maximizing overall quality of responses. We propose three scheduling algorithms - offline, online clairvoyant and online nonclairvoyant. For applications with concave quality profile, we prove that the offline algorithm is optimal. We show the effectiveness of the online algorithms by conducting a simulation study modeling a web search engine. Simulation results show a significant improvement compared to traditional scheduling models with respect to average response quality.

关键词： Schedules Servers Optimal scheduling scheduling algorithm Web search Optimized production technology Indexes

来源：评论

学校读者我要写书评

暂无评论

Parallel processing of near fine grain tasks using static scheduling on OSCAR (optimally scheduled advanced multiprocessor)

Parallel processing of near fine grain tasks using static sc...

引用

Supercomputing Conference

作者： H. Kasahara H. Honda S. Narita Dept. of Electr. Eng. Waseda Univ. Tokyo Japan Department of Electrical Engineering Waseda University Tokyo Japan

The authors propose a compilation scheme for parallel processing near fine-grain tasks, each of which consists of several instructions or a statement, on a multiprocessor system called OSCAR. The scheme allows one to minimize synchronization and data transfer overheads and to optimally use registers of each processor by employing a static scheduling algorithm considering data transfer. This scheme can effectively be combined with macro-dataflow computation and with making the loop concurrent. A compiler using the proposed scheme has been implemented on OSCAR, which has been designed to take full advantage of the static scheduling. A performance evaluation of the scheme on OSCAR is also described.< >

关键词： Parallel processing Processor scheduling Dynamic scheduling scheduling algorithm Concurrent computing Runtime Multiprocessing systems Registers Data analysis Parallel machines

来源：评论

学校读者我要写书评

暂无评论

Asynchronous credit-based scheduling scheme for a multi-stage network

Asynchronous credit-based scheduling scheme for a multi-stag...

引用

International Conference on Communications, Circuits and Systems (ICCCAS)

作者： Wen Lei Du Xu School of Communication and Information Engineering University of Electronic Science and Technology Chengdu Sichuan China

ISBN: (纸本)0780390156

The multi-stage network based on the Clos network is widely used to build a scalable architecture for high-performance switches and routers. Many scheduling algorithms have been proposed to improve the performance of this architecture. Most high-speed switches and routers with a multi-stage architecture using a twice-matching scheduling algorithm, and "push" the packets to the egress by two-hop scheduling algorithms. These algorithms, however, can not schedule precisely and optimize the packet delay. In this paper, we present an efficient scheme called "asynchronous credit-based scheduling scheme" for scheduling both fixed-size or variable length packets on high-speed packet switches with a multi-stage architecture. The asynchronous credit-based scheduling scheme is a "pull" scheme which can achieve 100% throughput under uniform traffic with comparable delay performance and also support different QoS disciplines. It improves the effective utilization of each output port and significantly reduces the packet delay.

关键词： Switches scheduling algorithm Delay Throughput Packet switching Dispatching Communication switching Telecommunication traffic Memory architecture Bandwidth

来源：评论

学校读者我要写书评

暂无评论

On End-to-End scheduling in Wireless Cellular Networks

On End-to-End Scheduling in Wireless Cellular Networks

引用

IEEE International Symposium on Spread Spectrum Techniques and Applications

作者： Walid Saad Zaher Dawy Sanaa Sharafeddine Department of Electrical and Computer Engineering American University of Beirut Beirut Lebanon Division of Computer Science and Mathematics Lebanese American University Beirut Lebanon

Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm for services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.

关键词： Downlink Delay Joints Quality of service scheduling algorithm Resource management Gain

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：