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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Optimal dispatching and scheduling for both periodic and aperiodic jobs in cluster

Optimal dispatching and scheduling for both periodic and ape...

引用

International Conference on Parallel Processing Workshops (ICPPW)

作者： Hai Jin Ligang He Zongfen Han Internet and Cluster Computing Center Huazhong University of Science and Technology Wuhan China

Presents dispatching and scheduling algorithms for both periodic and aperiodic jobs on a cluster of computers. A cluster system consists of one front-end node, called dispatcher and multiple back-end nodes, called schedulers. By rigorous theoretical analysis, these algorithms are optimal in the sense that each aperiodic job can achieve the shortest response time in the cluster while maintaining the schedulability of periodic jobs. The aperiodic jobs, which have no deadline requirement, are partitioned into phases and assigned deadlines by the dispatcher With the deadlines the aperiodic jobs can be scheduled uniformly under EDF together with periodic jobs. Based on extensive simulation studies, we have that the algorithms proposed in the paper can achieve great performance improvement. We also work out the workload zone in which the response time of aperiodic jobs in the cluster with N schedulers is the same as the ideal bound of response time in the corresponding M/M/N model.

关键词： Dispatching Optimal scheduling Processor scheduling scheduling algorithm Clustering algorithms Delay Partitioning algorithms Topology Runtime Helium

来源：评论

学校读者我要写书评

暂无评论

Opportunistic scheduling of delay sensitive traffic in OFDMA-based wireless networks

Opportunistic scheduling of delay sensitive traffic in OFDMA...

引用

IEEE International Symposium on World of Wireless Mobile and Multimedia Networks (WoWMoM)

作者： A.K.F. Khattab K.M.F. Elsayed Cairo University Egypt Department of ECE Rice University Houston TX USA Department of ECE Cairo University Giza Egypt

OFDMA is an attractive multiple access technique for packet-based mobile broadband wireless access for beyond 3G and 4G systems. Radio resource allocation in OFDMA can exploit multiuser diversity to increase system capacity by implementing opportunistic scheduling techniques. This paper presents a new opportunistic scheduling scheme for OFDMA-based wireless multimedia networks. We focus the scheduling algorithm on the class of delay-sensitive packets that belong to interactive applications such as telephony and video streaming. We divide the scheduling decision into two sub-problems: the OFDMA subcarrier allocation and subsequently the subcarrier assignment. Both the sub-carrier allocation and assignment algorithms exploit multiuser diversity and are designed to provide fairness with respect to the realizable throughput per user, packet dropping ratios and packet delay distributions. We investigate various performance aspects of the proposed scheduling algorithm using actual MPEG-4 traffic traces under different system loading and requested deadline values. The results show the superiority of the proposed scheduling scheme and its excellent performance with respect to throughput, packet dropping, and delay distributions

关键词： Telecommunication traffic Wireless networks Delay Streaming media scheduling algorithm Throughput Wireless sensor networks Resource management Telephony algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

An enhanced parallel loop self-scheduling scheme for cluster environments

An enhanced parallel loop self-scheduling scheme for cluster...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Chao-Tung Yang Kuan-Wei Cheng Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

In this paper, a parallel loop self-scheduling scheme for heterogeneous PC cluster systems is proposed. Though the proposed scheme does allow users to choose parameters before the execution initialization phase, there are still weaknesses that motivate us to go further with new improvements in that scheme. For instance, a decision on a fixed and monotonous parameter can easily lead to invalid schedule by using previous input information. Thus, it is proposed in this paper a new scheme, where the scheduling parameter can be adjusted dynamically and fit into most widely available computer systems, in order to provide higher overall performance.

关键词： Processor scheduling Dynamic scheduling Load management Master-slave Concurrent computing Distributed computing Clustering algorithms Runtime Computer science scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A packet scheduling discipline for supporting real-time applications

A packet scheduling discipline for supporting real-time appl...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

作者： O. Altintas Y. Atsumi T. Yoshida Ultra-high Speed Network and Computer Technology Laboratories UNCL Minato Tokyo Japan

Packet scheduling is lone of the key mechanisms that will be employed in the network nodes (routers and switches) for supporting real-time applications in a high-speed networking environment. We propose a new frame-based packet scheduling algorithm which calculates and keeps an index for each flow in order to keep track of instantaneous bursts. With this approach, flows with small bandwidth shares which might be in need of momentary service can be detected. Our algorithm can be considered as a version of WRR with improved delay characteristics. After an introduction to packet scheduling issues, we describe the operation of our algorithm. We then give some simulation results showing the delay performance of the proposed algorithm under various traffic loads and show that the proposed algorithm has a better delay performance.

关键词： scheduling algorithm Round robin Global Positioning System Application software Computer networks Packet switching Network servers Traffic control Delay Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for scheduling Real-Time Multicast Flows in Wireless LANs

Approximation Algorithms for Scheduling Real-Time Multicast ...

引用

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

作者： Y. Bejerano D. Lee P. Sinha L. Zhang Bell Laboratories USA Samsung Technology Seoul South Korea CSE Ohio-State University USA

In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world. However, the shortage of non-interfering channels makes it a challenge for WLANs to efficiently support real-time multicast services. In this paper, we study the problem of efficient scheduling of real-time multicast flows . For mitigating interferences, we allow access-points (APs) to transmit simultaneously only if they are mutually non-interfering and our objective is minimizing the fraction of time used by the APs for servicing the multicast flows. We introduce two multicast strategies, the association strategy for which each user is restricted to receive flows only from its associated AP and the non-association strategy for which a user may also decode transmissions from other APs in its vicinity. Under both strategies, the scheduling problem of minimizing the multicast service time is NP-hard and we propose simple approximation algorithms with provable performance bounds. Our simulations clearly demonstrate that the proposed algorithms yield efficient multicast scheduling.

关键词： Approximation algorithms Multicast algorithms scheduling algorithm Wireless LAN Broadcasting Unicast Interference elimination Frequency conversion Large-scale systems Multimedia communication

来源：评论

学校读者我要写书评

暂无评论

Joint Opportunistic scheduling and Spectrum Sharing

Joint Opportunistic Scheduling and Spectrum Sharing

引用

IEEE Conference on Wireless Communications and Networking

作者： Mehrdad Shariat Atta Ul Quddus Rahim Tafazolli Mobile VCE Research Group Centre of Communication Systems Research University of Surrey Guildford Surrey UK

In this paper, a novel framework is proposed to integrate spectrum (resource) sharing into multihop scheduling in relay-assisted systems. This approach provides an effective solution to minimize the effect of extra resources that are required in multihop transmission. Particularly, this approach can be combined with different topologies of resource scheduling to provide better performance in terms of throughput and coverage compared to benchmark non-sharing algorithms.

关键词： Interference scheduling algorithm Frame relay Topology Throughput Quality of service Communications Society Spread spectrum communication Degradation Base stations

来源：评论

学校读者我要写书评

暂无评论

Genetic allgorithm for dynamic task scheduling

Genetic allgorithm for dynamic task scheduling

引用

International Phoenix Conference on Computers and Communications (IPCCC)

作者： M.D. Kidwell D.J. Cook Department of Computer Science Engineering Central Washington University Ellensburg WA USA Department of Computer Science Engineering University of Texas Arlington Arlington TX USA

来源：评论

学校读者我要写书评

暂无评论

Analysis of Hierarchical EDF Pre-emptive scheduling

Analysis of Hierarchical EDF Pre-emptive Scheduling

引用

Real-Time Systems Symposium (RTSS)

作者： Fengxiang Zhang Alan Burns Real-Time Systems Research Group Department of Computer Science University of York UK

This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global scheduler of the system could be fixed priority (FP) or earliest deadline first (EDF). Each application task could be periodic or sporadic, bound or unbound, with arbitrary relative deadline which could be less than, equal to or greater than its period. A number of different server types are considered. This paper presents an exact and efficient schedulability test for the application tasks based on the capacity demand criterion when the global scheduler could be FP or EDF, in some cases, it is necessary and sufficient. Schedulability tests which are necessary and sufficient for several types of dynamic servers are presented when the global scheduler is EDF.

关键词： Processor scheduling Real time systems scheduling algorithm Testing Dynamic scheduling Delay Microprocessors algorithm design and analysis Computer science Application software

来源：评论

学校读者我要写书评

暂无评论

Test scheduling and scan-chain division under power constraint

Test scheduling and scan-chain division under power constrai...

引用

Asian Test Symposium (ATS)

作者： E. Larsson Z. Peng Department of Computer and Information Science Linköping University Sweden

ISBN: (纸本)0769513786

An integrated technique for test scheduling and scan-chain division under power constraints is proposed in this paper. We demonstrate that optimal test time can be achieved for systems tested by an arbitrary number of tests per core using scan-chain division and we define an algorithm for it. The design of wrappers to allow different lengths of scan-chains per core is also outlined. We investigate the practical limitations of such wrapper design and make a worst case analysis that motivates our integrated test scheduling and scan-chain division algorithm. The efficiency and usefulness of our approach have been demonstrated with an industrial design.

关键词： System testing Job shop scheduling algorithm design and analysis Processor scheduling scheduling algorithm Automatic testing Built-in self-test Information science System-on-a-chip Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Multi-aggregate-query scheduling over Data Streams

Multi-aggregate-query Scheduling over Data Streams

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Tao Chen Nong Xiao Fang Liu School of Computer National University of Defense Technology Changsha China

With the wide applications of data streams in many fields, such as sensor network monitoring and internet traffic control, query processing over data streams has become increasingly important. In these applications, multiple aggregate queries are registered in the system, and have different sliding window sizes and different frequency upper bounds. How to share the results of these queries is a challenge. Prior work studies how to detect common tasks of these queries and share the results by computing the common tasks only once. Hybrid scheduling first addressed this problem and used the earliest-deadline-first (EDF) method. However, this work did not present a method for computing the scheduling. We formulate the scheduling problem among multiple aggregate queries with different sliding window sizes and different frequency upper bounds over data streams and propose a combination rule to classify these queries. Then, we present an efficient scheduling algorithm to decide whether a query should be executed more often than necessary, as long as the interval between two consecutive executions is less than the frequency upper bound. We also combine our scheduling algorithm with EDF to handle under loaded and overloaded situations. An experimental study shows that our scheduling algorithms are more efficient than no scheduling and EDF in terms of the number of scanned tuples, the throughput and the latency.

关键词： scheduling algorithm Upper bound scheduling Semantics Aggregates Schedules

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：