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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

10,732 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,645 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,303 篇 resource managem...
1,302 篇 real time system...
1,292 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
969 篇 job shop schedul...
946 篇 dynamic scheduli...
782 篇 costs
736 篇 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,592 篇 英文
82 篇 其他
58 篇 中文

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

共 10732 条记录，以下是4661-4670 订阅

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

详细简洁

排序：

Single Machine Fuzzy Delays scheduling Problem with Fuzzy Precedences

Single Machine Fuzzy Delays Scheduling Problem with Fuzzy Pr...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Xie Yuan Linlin Ou School of Electric Shanghai Dianji University Shanghai China Department of Automation Zhejiang University of Technology Hangzhou China

A single machine scheduling problem involving fuzzy time delays and fuzzy precedence constraints is analyzed. Schedules are evaluated not only by degree of satisfaction with fuzzy time delays but also degrees of satisfaction with fuzzy precedence constraints. For the bicriteria scheduling problem, an efficient algorithm is proposed for calculating nondominated schedules.

关键词： Single machine scheduling Delay effects Fuzzy systems Upper bound scheduling algorithm Polynomials Job shop scheduling Automation Processor scheduling Uncertainty

来源：评论

学校读者我要写书评

暂无评论

A practical approach to preemptable and nonpreemptable task scheduling with resource constraints based on earliest deadlines

A practical approach to preemptable and nonpreemptable task ...

引用

Euromicro Workshop on Real Time

作者： W.A. Halang Department of Computing Science University of Groningam Groningen Netherlands

All intrinsic properties of the earliest-deadline task scheduling discipline are compiled and discussed to show that this is the most advantageous scheme available, characterized by efficiency and allowing for predictable system behavior. It is pointed out how the method naturally extends to the scheduling of tasks having nonpreemptable regions due to resource access constraints. A sufficient condition is derived which allows one, at any arbitrary point in time and under observation of resource constraints, to check the feasible executability of the tasks competing for processor allocation. This condition takes the lengths of the tasks' critical regions into account and resembles the necessary and sufficient conditions holding for the executability in the case of always preemptable tasks. It reduces to the latter if there are no critical regions, but applies to entirely nonpreemptable tasks as well. The favorable consequences of deadline scheduling for virtual storage management are discussed.< >

关键词： Processor scheduling scheduling algorithm Sufficient conditions Process control Augmented virtuality Resource management Real time systems Data processing High level languages Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Quantum-Adaptive scheduling for Multi-Core Network Processors

Quantum-Adaptive Scheduling for Multi-Core Network Processor...

引用

International Conference on Distributed Computing Systems

作者： Yue Zhang Bin Liu Lei Shi Jingnan Yao Laxmi Bhuyan China USA

Efficiency and effectiveness are always the emphases of a scheduler, for both link and processor scheduling. Well-known scheduling algorithms such as surplus round robin (SRR) and elastic round robin (ERR) suffer from two fold shortcomings: 1) additional pre-processing queuing delay and post-processing resequencing delay are incurred due to the lack of short-term load-balancing; 2) bursty scheduling is caused due to blind preservation of scheduling history under non-backlogged traffic. In this paper, we propose a quantum-adaptive scheduling (QAS) algorithm, which: 1) synchronizes all the quanta in a fine-grained manner and, 2) adjusts the quanta intelligently based on processor utilization. We theoretically prove that the queuing fairness bound (QFB) for QAS is one third tighter than SRR and ERR. This result approaches the optimal value as obtained in shortest queue first (SQF) algorithm, while still maintaining O(1) complexity. Trace-driven simulations show that QAS reduces average packet delay by 18%~24% while cutting down the resequencing buffer size by more than 40% compared to SRR and ERR.

关键词： scheduling Processor scheduling scheduling algorithm Complexity theory Round robin Program processors Delay

来源：评论

学校读者我要写书评

暂无评论

On-line sporadic task scheduling in hard real-time systems

On-line sporadic task scheduling in hard real-time systems

引用

Euromicro Conference on Real-Time Systems

作者： S.L. Vieira M.F. Magalhaes Department Estatística e Informática Universidade Federal de Goias Goiania Brazil Faculdade de Engenharia Elétrica Universidade Estadual de Campinas (UNICAMP) Sao Paulo Brazil

We propose a set of scheduling procedures for dealing with the sporadic task scheduling in a dynamic periodic system. For this we mean a system in which periodic tasks change their parameters dynamically (at run-time), in an unpredictable way. So, the off-line periodic task set will be different from the current periodic task set. It means that the task schedulability tests in such systems have to be made on-line. On the other hand, on-line evaluations in hard real-time systems must be done in a fast way, once the overhead incurred in these evaluations may jeopardize the tasks timing requirements. As it is common that exact tests, providing necessary and sufficient conditions for validating the schedule, are intractable algorithms (EXPTIME), they can not support on-line decisions. Then, our goal is to provide a sufficient condition for on-line scheduling tests which is fast (PTIME) and can be reasonably useful compared to the exact condition. We present a series of simulation runs that confirm the usefulness of our approach.< >

关键词： Real time systems Processor scheduling System testing Timing Dynamic scheduling Sufficient conditions Runtime scheduling algorithm Sampling methods algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Adaptive and distributed scheduling in heterogeneous MIMO-based ad hoc networks

Adaptive and distributed scheduling in heterogeneous MIMO-ba...

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Shan Chu Xin Wang Department of Electrical and Computer Engineering Stony Brook University Stony Brook NY USA

Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising wireless technologies that can significantly improve transmission capacity and reliability. Many emerging mobile wireless applications require peer-to-peer transmissions over an ad hoc network, where the nodes often have different number of antennas, and the channel condition and network topology vary over time. It is important and challenging to develop efficient schemes to distributively coordinate transmission resource sharing among a heterogeneous group of nodes over an infrastructure-free mobile ad hoc network. In this work, we propose a holistic distributed scheduling algorithm that can adaptively select different transmission strategies based on the node types and channel conditions to effectively relieve the bottleneck effect caused by nodes with smaller antenna arrays, and avoid transmission failure due to violation of channel constraint. The algorithm also takes advantage of channel information to opportunistically schedule cooperative spatial multiplexed transmissions between nodes and provide special transmission support for higher priority nodes with weak channels, so that the data rate of the network can be maximized while user transmission quality requirement is supported. The performance of our algorithm is studied through extensive simulations and the results demonstrate that our algorithm is very effective in handling node heterogeneity and channel constraint, and can significantly increase the throughput while reducing the transmission delay.

关键词： Adaptive scheduling Ad hoc networks Peer to peer computing Transmitting antennas scheduling algorithm Adaptive arrays MIMO Mobile antennas Network topology Resource management

来源：评论

学校读者我要写书评

暂无评论

Selfish Multi-User Task scheduling

Selfish Multi-User Task Scheduling

引用

International Symposium on Parallel and Distributed Computing

作者： Thomas E. Carroll Daniel Grosu Department of Computer Science Wayne State University Detroit MI USA

ISBN: (纸本)9780769526381;0769526381

In this paper we formulate and study a new scheduling problem called selfish multi-user task scheduling. This problem assumes that there are several users, each of them having multiple tasks that need processing on a set of parallel identical machines. Each user is selfish and her goal is to minimize the makespan of her own tasks. We model this problem as a non-cooperative, extensive-form game. We use the subgame perfect equilibrium solution concept to analyze the game which provides insight into the problem's properties. We compute the price of anarchy to quantify the costs due to lack of coordination among the users

关键词： Processor scheduling Surface-mount technology Game theory Costs scheduling algorithm Routing Single machine scheduling Computer science Decision making Steady-state

来源：评论

学校读者我要写书评

暂无评论

Evaluation of heuristic algorithms for scheduling, routing and power allocation in traffic sensitive spatial TDMA Wireless Ad Hoc Networks

Evaluation of heuristic algorithms for scheduling, routing a...

引用

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Oscar Somarriba Department of Communication Systems Royal Institute of Technology Kista Sweden

Major design issues in Wireless Ad Hoc Networks is the design of the routing algorithms and the Medium Access Control (MAC) protocols. Spatial TDMA (STDMA) is a ldquoconflict-freerdquo MAC protocol for these networks, thus enabling high spectral utilization. In link-oriented STDMA, the schedule specifies when particular radio links will be activated. Moreover, the use of power control and heuristic routing algorithms have the potential of improving STDMA network performance. Besides Power and Traffic Adaptive STDMA, in this paper we also, as a comparison, include optimal STDMA. To obtain the optimal STDMA scheduling combined with routing and power allocation, a convex optimization problem is solved using the method reported in [1]. Our results show that one of the heuristic routing algorithms can provide near optimal solutions regarding end-to-end network throughput.

关键词： Heuristic algorithms scheduling algorithm Routing Telecommunication traffic Time division multiple access Mobile ad hoc networks Media Access Protocol Communication system traffic control algorithm design and analysis Access protocols

来源：评论

学校读者我要写书评

暂无评论

A dynamic grouping scheduling for heterogeneous Internet-centric metacomputing system

A dynamic grouping scheduling for heterogeneous Internet-cen...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Chuanwen Chiang Chungnan Lee Mingjyh Chang Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung Taiwan

ISBN: (纸本)0769511538

In this paper we propose a dynamic scheduling heuristic for allocating task graphs onto Internet-centric metacomputing systems. This proposed algorithm, which is called the Dynamic Grouping scheduling (DGS), differs from conventional algorithms in three respects. First, DGS employs a dynamic task grouping strategy to determine task computational cast. Second, this algorithm estimates the competence of processors for unscheduled tasks at each scheduling step. Third, the proposed scheme takes the fluctuations of power weight for processors into consideration. Experimental results show that the proposed DGS performs better than the competing scheduling schemes under the effects of varying power weights of processors.

关键词： Dynamic scheduling Internet Metacomputing scheduling algorithm Processor scheduling Heuristic algorithms Fluctuations Graph theory Computer science Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Deadlock-free scheduling strategy for automated production cell

Deadlock-free scheduling strategy for automated production c...

引用

IEEE/ASME (AIM) International Conference on Advanced Intelligent Mechatronics

作者： Xu Gang Zhiming Wu Shanghai Jiaotong University Shanghai China

ISBN: (纸本)0780377591

Deadlock must be avoided in a manufacturing system. In this paper, an efficient algorithm for finding an optimal deadlock-free schedule in a Manufacturing System with very limited buffer is presented. This algorithm is based on the effective Genetic algorithm (GA) search method, and a formal Petri net structure is introduced to detect the token player assuring deadlock-free. In order to make the scheduling strategy generated by GA meet the required constraint of deadlock-free, Petri net is involved to make the implementation of the job scheduling in an FMS deadlock-free. The effectiveness and efficiency of the proposed approach is illustrated by using an example.

关键词： System recovery Production Job shop scheduling Flexible manufacturing systems scheduling algorithm Manufacturing systems Manufacturing processes Resource management Control systems Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A radio aware random iterative scheduling technique for high speed downlink packet access

A radio aware random iterative scheduling technique for high...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： S. Abedi S. Vadgama Fujitsu Laboratories Limited Middlesex UK

The overall performance of the high speed downlink packet access (HSDPA) proposal in 3GPP in terms of delay and throughput for various possible radio resource allocation and scheduling algorithms is evaluated using a system level simulator. By exploiting the weaknesses of the conventional wireless scheduling techniques under extreme scenarios, a novel random iterative hybrid scheduling (RIIHS) and radio aware wireless resource allocation technique for HSDPA is introduced. The algorithm has the unique ability of reaching the maximum possible levels of the throughput and fairness and minimum possible level of the delay at the same time.

关键词： Downlink Multiaccess communication Throughput scheduling algorithm Quality of service Delay Resource management Modulation coding Automatic repeat request System performance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 463 464 465 466 467 468 469 470 471 472 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：