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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A new scheduling scheme for resilient packet ring networks with single transit buffer

A new scheduling scheme for resilient packet ring networks w...

引用

IEEE Globecom Workshops

作者： Jian Zhu A. Matrawy I. Lambadaris Department of Systems and Computer Engineering Carleton University Ottawa Ontario Canada

Resilient packet ring (RPR) technology known as IEEE 802.17 standard is an emerging network architecture and technology designed to meet the requirements of a packet-based metropolitan area network. The medium access control architecture of RPR network can have single transit buffer (STB), or dual transit buffer (DTB). STB has lower implementation complexity. But the weakness of single transit buffer architecture is that high priority traffic trying to access the ring will be delayed by any low priority traffic already transiting on the node. To improve the quality of service for high priority traffic transmission, we propose a new RPR scheduling scheme which uses deficit round-robin (DRR) algorithm to alternately select packets from the single transit buffer and the high priority transmit buffer. If there is no packet in these two buffers, low priority' transmit buffer is then served. Simulation results show certain improvement on overall delay and delay jitter performance of RPR networks with single transit buffer by using our scheme.

关键词： US Department of Transportation Communication system traffic control Metropolitan area networks Media Access Protocol Delay Quality of service Traffic control scheduling algorithm Round robin Jitter

来源：评论

学校读者我要写书评

暂无评论

scheduling using genetic algorithms

Scheduling using genetic algorithms

引用

International Conference on Distributed Computing Systems

作者： U. Fissgus Institut für Informatik Universität Halle-Wittenberg Saale Germany

Considers the scheduling of mixed task- and data-parallel modules comprising computation and communication operations. The program generation starts with a specification of the maximum degree of task- and data-parallelism of the method to be implemented. In several derivation steps, the degree of parallelism is adapted to a specific distributed memory machine. We present a scheduling derivation step based on the genetic algorithm paradigm. The scheduling takes not only decisions on the execution order (independent modules can be executed consecutively by all processors available or concurrently by independent groups of processors) but also on appropriate data distributions and task implementation versions. We demonstrate the efficiency of the algorithm by an example from numerical analysis.

关键词： Genetic algorithms Parallel processing scheduling algorithm Costs Processor scheduling Numerical analysis Runtime Scientific computing Signal processing Parallel machines

来源：评论

学校读者我要写书评

暂无评论

A NOVEL UPLINK scheduling MECHANISM FOR WiMAX NETWORKS

A NOVEL UPLINK SCHEDULING MECHANISM FOR WiMAX NETWORKS

引用

2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems

作者： Bingcai Chen Lingchao He Zhimao Lu Huazhuo Yao Baojun Li College of Information and Communication Engineering Harbin Engineering University

According to the research on the uplink scheduling mechanism for WiMAX system, this paper proposes a novel fair scheduling algorithm based on time delay and throughput. scheduling scheme can be changed to adapt to changes in throughput of service class, in this way fairness of the system can be improved. The emergency scheduler based on time delay in the mechanism can guarantee the QoS and fairness of those lower priority services. Compared with the other two layer scheduling algorithms, the algorithm proposed in this paper optimizes scheduling fairness on the fist layer, making fairness guaranteed at the initial stage.

关键词： WiMAX scheduling algorithm Time delay Fairness

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

scheduling for large-scale on-demand data broadcasting

Scheduling for large-scale on-demand data broadcasting

引用

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

作者： D. Aksoy M. Franklin Computer Science Department and UMIACS University of Maryland College Park MD USA

Advances in telecommunications have enabled the deployment of broadcast-based wide-area information services that provide on-demand data access to very large client populations. In order to effectively utilize a broadcast medium for such a service, it is necessary to have efficient, on-line scheduling algorithms that can balance individual and overall performance and can scale in terms of data set sizes, client populations, and broadcast bandwidth. In this study we introduce a parameterized algorithm that provides good performance across all of these criteria and can be tuned to emphasize either average or worst case waiting time. Unlike previous work on low overhead scheduling, the algorithm is not based on estimates of the access probabilities of items, but rather, it makes scheduling decisions based on the current queue state, allowing it to easily adapt to changes in the intensity and distribution of the workload. We examine the performance of the algorithm using a simulation model.

关键词： Large-scale systems Satellite broadcasting TV broadcasting scheduling algorithm Bandwidth Unicast Delay Databases Processor scheduling Computer science

来源：评论

学校读者我要写书评

暂无评论

Modeling and Evaluation of Homing-Pigeon Based Delay Tolerant Networks with Periodic scheduling

Modeling and Evaluation of Homing-Pigeon Based Delay Toleran...

引用

IEEE International Conference on Communications (ICC)

作者： H. Guo J. Li Y. Qian National Institute for Standards and Technology Gaithersburg MD USA Department of Systems and Computer Science Howard University College of Medicine Washington D.C. DC USA

In this paper, we analyze a new type of delay tolerant networks (DTN) where each node owns multiple dedicated messengers, called pigeons. The only form of inter- node communication is for a pigeon to periodically carry a batch of messages originated at the home node, deliver to the corresponding destination nodes and return home. We name this as homing-pigeon (HoP) based routing mechanism, which is an effective way to overcome end-to-end disconnection in DTN. In this work, we model the HoP mechanism analytically with a periodic pigeon scheduling algorithm. Our analysis focuses on understanding the pigeon departure frequency from the home node while keeping the message delivery ratio above a given threshold. Simulation results are given to validate our analysis.

关键词： Disruption tolerant networking Peer to peer computing Routing USA Councils scheduling algorithm Analytical models Mobile communication Communications Society Processor scheduling NIST

来源：评论

学校读者我要写书评

暂无评论

Quality-of-Service Provisioning using Hierarchical scheduling in Optical Burst Switched Network

Quality-of-Service Provisioning using Hierarchical Schedulin...

引用

International Conference on Networking and Services (ICNS)

作者： Suriani Mohd Sam Norsheila Fisal Sharifah Hafizah Syed Ariffin Technology & Science College University Technology of Malaysia Malaysia Faculty of Electrical Engineering University Technology of Malaysia Malaysia

ISBN: (纸本)9781424431526

The issues of providing QoS in WDM OBS network are attracting increasing attention in the networking community. One of the key issues is to design efficient algorithms for burst scheduling or more precisely their bandwidth reservation. An ideal scheduling algorithm should be able to process a control packet fast enough before the burst arrives, and yet be able to find a suitable void interval for the burst as long as there exists one. Otherwise, a burst may be unnecessarily discarded either because a reservation cannot be completed before the burst arrives or simply because the scheduling algorithm is not smart enough to make the reservation. In this paper, we propose an OBS network model using the per-hob-behaviors with its three methods of forwarding of the differentiated service to create the burst packets and to implement the burst hierarchical scheduling technique using weighted round-robin and priority queueing (WRR_PQ) in order for the network model to support QoS in terms of lower blocking probability, higher resource utilization and lower burst loss rates.

关键词： Quality of service Optical fiber networks Optical packet switching scheduling algorithm Traffic control Wavelength division multiplexing Telecommunication traffic Bandwidth Resource management Optical buffering

来源：评论

学校读者我要写书评

暂无评论

Distribution-graph based approach and extended tree growing technique in power-constrained block-test scheduling

Distribution-graph based approach and extended tree growing ...

引用

Asian Test Symposium (ATS)

作者： V. Murescan Xiaojun Wang M. Vladutiu

A distribution-graph based scheduling algorithm is proposed together with an extended tree growing technique to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. The extended tree growing technique is used in combination with the classical scheduling approach in order to improve the test concurrency having assigned power dissipation limits. Its goal is to achieve a balanced test power dissipation by employing a least mean square error function. The least mean square error function is a distribution-graph based global priority function. Test scheduling examples and experiments highlight in the end the efficiency of this approach towards a system-level test scheduling algorithm.

关键词： Circuit testing Power dissipation System testing Concurrent computing Very large scale integration scheduling algorithm Mean square error methods Design methodology Performance evaluation Clocks

来源：评论

学校读者我要写书评

暂无评论

Getting more flexible scheduling in the RTSJ

Getting more flexible scheduling in the RTSJ

引用

International Symposium on Object-Oriented Real-Time Distributed Computing

作者： A. Zerzelidis A.J. Wellings University of York UK

This paper illustrates how the real-time specification for Java (RTSJ) can be modified to allow applications to implement more flexible scheduling. The proposed approach is a two-level scheduling mechanism where the first level is the RTSJ priority scheduler and the second level is under application control. Minimum, backward-compatible changes to the RTSJ specification are discussed to motivate the required interface. The only assumptions made about the underlying real-time operating system are that it supports pre-emptive priority-based dispatching and that changes to priorities have immediate effect

关键词： Processor scheduling Dispatching Yarn Real time systems Java Operating systems Hardware Programming profession scheduling algorithm Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent-based Approach for Meeting scheduling System

Multi-Agent-based Approach for Meeting Scheduling System

引用

International Conference on Integration of Knowledge Intensive Multi-Agent Systems (KIMAS)

作者： Takao Kawamura Yusuke Hamada Kazunori Sugahara Kengo Kagemoto Shinichi Motomura Department of Information and Knowledge Engineering Faculty of Engineering Tottori University Tottori Japan Graduate School of Engineering Tottori University Tottori Japan

In this paper, a meeting scheduling system based on mobile agent technology is proposed. The users of the system do not need to input all of their schedules unlike the existing groupwares. When a user intends to call a meeting, he only inputs information about the meeting. On behalf of the inviter, mobile agents move around each invited user's computer to ask whether he can join the meeting and negotiate with him if necessary. Therefore, the inviter's work becomes less compared with using the existing groupwares. We have developed the system with our mobile agent framework on Java platform and confirmed its effectiveness through experiments

关键词： Collaborative software Collaborative work Mobile agents Knowledge engineering Network servers Java Electronic mail Processor scheduling Application software scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：