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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Real-time scheduling in distributed systems

Real-time scheduling in distributed systems

引用

International Conference on Parallel Computing in Electrical Engineering (PARLEC)

作者： N.D. Thai Institute of Informatics Slovak Academy of Sciences Bratislava Slovakia

Real-time computer systems are expected to greatly benefit from multiprocessor technology and employing multiprocessor systems for real-time applications has shown to be difficult. A major obstacle is that scheduling algorithms for real-time multiprocessor systems are significantly more complex than for uniprocessor systems. In multiprocessor systems, the scheduling algorithm must not only specify the order of tasks, but also determine the specific processor to be used. Any practical scheduling algorithm for assigning real-time tasks to a multiprocessor system presents trade-off between its computational complexity and its performance. Finding a minimal schedule for a given set of real-time tasks in a multiprocessor system has shown to be NP-hard. In this paper, we show several scheduling algorithms used in such multiprocessor systems and their performance with experimental results.

关键词： Real time systems scheduling algorithm Multiprocessing systems Processor scheduling Optimal scheduling Computational complexity Informatics Application software Heuristic algorithms Protocols

来源：评论

学校读者我要写书评

暂无评论

Incorporating speculative execution into scheduling of control-flow intensive behavioral descriptions

Incorporating speculative execution into scheduling of contr...

引用

Design Automation Conference

作者： G. Lakshminarayana A. Raghunathan N.K. Jha C&C Research Laboratories NEC USA Inc. Princeton NJ USA Department of Electrical Engineering Princeton University Princeton NJ USA

Speculative execution refers to the execution of parts of a computation before the execution of the conditional operations that decide whether it needs to be executed. It has been shown to be a promising technique for eliminating performance bottlenecks imposed by control flow in hardware and software implementations alike. In this paper, we present techniques to incorporate speculative execution in a fine-grained manner into scheduling of control-how intensive behavioral descriptions. We demonstrate that failing to take into account information such as resource constraints and branch probabilities can lead to significantly sub-optimal performance. We also demonstrate that it may be necessary to speculate simultaneously along multiple paths, subject to resource constraints, in order to minimize the delay overheads incurred when prediction errors occur. Experimental results on several benchmarks show that our speculative scheduling algorithm can result in significant (up to seven-fold) improvements in performance (measured in terms of the average number of clock cycles) as compared to scheduling without speculative execution. Also, the best and worst case execution times for the speculatively performed schedules are the same as or better than the corresponding values for the schedules obtained without speculative execution.

关键词： High level synthesis Permission Clocks Laboratories Processor scheduling Data flow computing Hardware Software performance Delay scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A new scheduling based heuristic for three layer gridless channel routing

A new scheduling based heuristic for three layer gridless ch...

引用

International Phoenix Conference on Computers and Communications (IPCCC)

作者： N.A. Sherwani N.D. Holmes R. Gidwani Department of Computer Sciences Western Michigan University Kalamazoo MI USA

The authors develop a novel heuristic algorithm, SCHEDULER, for three-layer gridless channel routing. This algorithm is based on a mapping of two-processor resource constraint scheduling to three-layer gridless channel routing using the HVH model. This mapping permits the application of well-developed scheduling heuristics to the channel routing problem. SCHEDULER has been implemented and tested extensively. Experimental results show that the quality of the solutions generated is comparable to that of routings produced by existing three-layer channel routers assuming that doglegs are not allowed. Also, the scheduling-based heuristics are very fast and can route benchmark examples in less than two minutes on a SUN 3/60 workstation.< >

关键词： Routing Processor scheduling scheduling algorithm Very large scale integration Computer science Heuristic algorithms Testing algorithm design and analysis Minimization Scholarships

来源：评论

学校读者我要写书评

暂无评论

Traffic Aided Fair scheduling Using Compensation Scheme in Wireless CDMA Networks

Traffic Aided Fair Scheduling Using Compensation Scheme in W...

引用

International Conference on ITS Telecommunications (ITST)

作者： Dan Liao Lemin Li School of Communication and Information Engineering University of Electronic Science and Technology Chengdu China

In this paper, we study the fundamental problem of allocating the available resources with efficiency and fairness in a wireless CDMA network. In particular, we first introduce an ideal fair scheduling (IFS) scheme. The allocation of resources in IFS is strictly fair. Then we introduce the proportional compensation based fair scheduling (PCFS) algorithm. PCFS distinguishes the services in different application levels. In PCFS, a channel-adaptive resource allocation policy is introduced to improve the system throughput and a compensation model is introduced to achieve fair services. Based on the assignment of PCFS, we propose the traffic aided PCFS (T-PCFS) algorithm that incorporates traffic information into compensation model to achieve better fairness. Extensive simulation results show that our scheme can operate well in wireless CDMA networks

关键词： Telecommunication traffic Multiaccess communication Traffic control Resource management scheduling algorithm Quality of service Bandwidth Throughput Delay Channel capacity

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling of signature analysis for VLSI testing

Optimal scheduling of signature analysis for VLSI testing

引用

IEEE International Test Conference

作者： Y.-H. Lee C.M. Krishna IBM Thomas J. Watson Research Center Yorktown Heights NY USA Electrical and Computer Engineering University of Massachusetts Amherst MA USA

A simple algorithm is presented which minimizes the mean testing time for VLSI circuits. By breaking up the testing process into subintervals, and analyzing the signature are the end of each subinterval, it is possible to abort future tests if the circuit is found to be faulty, thus saving test time. Subdivision of the test process also reduces the probability of aliasing, thus increasing the effective coverage of the signature analysis process. If the process is sufficiently subdivided, it may be possible to use the test results not only to determine if the circuit is faulty or not, but to diagnose the fault.< >

关键词： Optimal scheduling Very large scale integration Circuit testing Circuit faults scheduling algorithm System testing Processor scheduling algorithm design and analysis Interleaved codes Exponential distribution

来源：评论

学校读者我要写书评

暂无评论

Dynamic frame scheduling with load balancing for IEEE 802.16j

Dynamic frame scheduling with load balancing for IEEE 802.16...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Hoon Baek Ju Wook Jang Department of Electronic Engineering Sogang University South Korea

In this paper, we consider a multi-hop relay networks in IEEE 802.16j system with the full frequency-reuse capability, in which a frame structure can be asymmetrically divided into two different intervals, one for access zone to base station (BS)/relay station (RS)-mobile stations (MSs) communication and the other for relay zone to BS-RS communication, while the same radio resource is fully reused by every RS in the cell. This paper proposes a frame scheduling algorithm that improves the overall system throughput by reducing waste of radio resource through balancing of resource allocation in each relay station (RS). The proposed algorithm is divided into two stages: first, a boundary between access zone and relay zone is scheduled by BS and determined dynamically; second, traffics that will be retransmitted by automatic repeat request (ARQ) and generated by difference between current and scheduled MCS (modulation and coding scheme) level are scheduled by RS. The simulation results show that proposed algorithm improves the overall system throughput approximately by 35% over a conventional frame scheduling algorithm without any load balancing capability.

关键词： Dynamic scheduling Load management Frame relay scheduling algorithm Throughput Automatic repeat request Spread spectrum communication Frequency conversion Base stations Resource management

来源：评论

学校读者我要写书评

暂无评论

Compiler assisted runtime task scheduling on a reconfigurable computer

Compiler assisted runtime task scheduling on a reconfigurabl...

引用

International Conference on Field Programmable Logic and Applications

作者： Mojtaba Sabeghi Vlad-Mihai Sima Koen Bertels Computer Engineering Laboratory Delft University of Technnology Delft Netherlands

Multitasking reconfigurable computers with one or more reconfigurable processors are being used increasingly during the past few years. One of the major challenges in such systems is the scheduling and allocation of the tasks on the reconfigurable fabric. In this paper we present a two level scheduling mechanism for tightly coupled reconfigurable architecture machines. To overcome the complexity of identifying kernels at runtime, we use the compiler support. The compiler provides the runtime system with a configuration call graph which will be used as a viable source of information for the scheduling algorithm. We combine the configuration call graphs from all running applications and extract the distance to the next call and frequency of calls in future for each kernel from this graph. We base our scheduling decisions on these two parameters. Evaluation results show that the proposed method is very promising and it has the potential to be considered for future research.

关键词： Runtime Processor scheduling Kernel Multitasking Fabrics Reconfigurable architectures Information resources scheduling algorithm Data mining Frequency

来源：评论

学校读者我要写书评

暂无评论

A tabu search with a new neighborhood search technique applied to flow shop scheduling problems

A tabu search with a new neighborhood search technique appli...

引用

IEEE Conference on Decision and Control

作者： Yajie Tian N. Sannomiya Yuedong Xu Graduate School of Informatics Kyoto University Sakyo Kyoto Japan Kyoto Institute of Technology Sakyo Kyoto Japan

ISBN: (纸本)0780366387

In this paper, a tabu search algorithm with a new neighborhood technique is proposed for solving flow shop scheduling problems. An idea obtained from a simulation study on the adaptive behavior of a fish school is used to determine the neighborhood search technique. The cooperation and the diversity of job data are defined for describing the data structure by using the given information. According to the definitions, job data are classified into four types, and two of them are treated in this paper. A large number of computational experiments are carried out to study the assignments of both local effort and global effort under a limited search time. The result shows that the allocation of the local and the global effort depends on the job data characteristics, such as cooperation and diversity. The validity of the tabu search algorithm is examined by comparing it with the genetic algorithm. It is found that the proposed tabu search algorithm has better convergence and much shorter computational time than the genetic algorithm.

关键词： Job shop scheduling Educational institutions Marine animals Biological system modeling Electronic mail Genetic algorithms Informatics scheduling algorithm Data structures Convergence

来源：评论

学校读者我要写书评

暂无评论

An application of a planning and scheduling multi-model approach in chemical industry

An application of a planning and scheduling multi-model appr...

引用

International Conference on Industrial Electronics, Control and Instrumentation

作者： A. Artiba E.H. Aghezzaf O. Kaufmann P. Levecq Industrial Management Unit Chausséche FUCAM Mons Belgium FUCAM ChauIndustrial Management Unit Chausséchesséche FUCAM Mons Belgium

In this paper, a multi-model system for planning and scheduling is presented. The multi-model system is defined as a system integrating expert systems techniques, discrete event simulation, optimization algorithms and heuristics to support decision making for complex production planning and scheduling problems. An application to chemical industry is then described and some experiment results are presented.

关键词： Job shop scheduling Chemical industry Artificial intelligence Expert systems Production planning Manufacturing systems Discrete event simulation scheduling algorithm Processor scheduling Production management

来源：评论

学校读者我要写书评

暂无评论

scheduling Real-Time of the Synchronous Hybrid Tasks under Energy Constraint

Scheduling Real-Time of the Synchronous Hybrid Tasks under E...

引用

International Conference on Sensor Technologies and Applications, SensorComm

作者： Akli Abbas Hamid Hentous Tayeb Kenaza Computer Science Department M. P. School Algiers Algeria Artificial Intelligence Laboratory M. P. School Algiers Algeria

In this paper, we are interested by the integration of precedence and resources sharing constraints in the real time scheduling of periodic and aperiodic tasks. We also treat the problem of dynamic voltage scaling of the processor in the same context. Many dynamic voltage scaling algorithms have been proposed in the literature. However, these algorithms do not consider the constraints of precedence and shared resources on the scheduling of periodic and aperiodic tasks. In this case, we propose two algorithms with the constraints cited above. Experimental results show that the proposed algorithms reduce the energy consumption under earliest deadline first scheduling policy and the stack resource policy.

关键词： Processor scheduling scheduling algorithm Real time systems Energy consumption Collaboration Dynamic voltage scaling Embedded system Voltage control Access protocols Resource management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：