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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,360 篇 工学
- 1,160 篇 计算机科学与技术...
- 851 篇 电气工程
- 664 篇 信息与通信工程
- 293 篇 软件工程
- 276 篇 电子科学与技术（可...
- 221 篇 控制科学与工程
- 200 篇 仪器科学与技术
- 150 篇 机械工程
- 58 篇 交通运输工程
- 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,730 篇 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...
945 篇 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,590 篇 英文
82 篇 其他
58 篇 中文

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

共 10730 条记录，以下是4631-4640 订阅

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

详细简洁

排序：

scheduling task in-trees on distributed memory systems

Scheduling task in-trees on distributed memory systems

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： S. Baskiyar Department of Computer Science and Engineering Aubum University Auburn AL USA

ISBN: (纸本)0769509908

Tree task structures occur frequently in many applications where parallelization may be desirable. We present a formal treatment of non-preemptively scheduling task trees on distributed memory multiprocessors and show that the fundamental problems of scheduling (i) a task tree in absence of any inter-task communication on a fixed number of processors and (ii) a task tree with inter-task communication on an unbounded number of processors are NP-complete. For task trees that satisfy certain constraints, we present an optimal scheduling algorithm. The algorithm is shown optimal over a wider set of task trees than previous works.

关键词： Optimal scheduling Processor scheduling scheduling algorithm Tree graphs Tree data structures Multiprocessing systems Parallel machines Broadcasting Data communication Polynomials

来源：评论

学校读者我要写书评

暂无评论

scheduling in and out forests in the presence of communication delays

Scheduling in and out forests in the presence of communicati...

引用

International Symposium on Parallel Processing

作者： T.A. Varvarigou V.P. Roychowdhury T. Kailath AT and T Bell Laboratories Inc. Holmdel NJ USA School of Electrical Engineering Purdue University West Lafayette IN USA Department of Electrical Engineering University of Stanford Stanford CA USA

The authors consider the problem of scheduling tasks on multiprocessor architectures in the presence of communication delays. Given a set of dependent tasks, the scheduling problem is to allocate the tasks to processors such that the pre-specified precedence constraints among the tasks are obeyed and certain cost-measures (such as computation time) are minimized. Several cases of the scheduling problem have been proven to be NP-complete. Nevertheless, there are polynomial time algorithms for several interesting special cases of the general scheduling problem. Most of these results, however, do not take into consideration the delays due to message passing among processors. The authors study the increase in time complexity of the scheduling problem due to the introduction of communication delays. In particular, they address the open problem of scheduling out-forests (in-forests) in a multiprocessor system of m identical processors when communication delays are considered. They present first known polynomial time algorithms for the computation of the optimal schedule when the number of available processors is given and bounded and both computation and communication delays are assumed to take one unit of time.< >

关键词： Processor scheduling Optimal scheduling scheduling algorithm Polynomials Delay effects Message passing Computer architecture Multiprocessing systems Contracts

来源：评论

学校读者我要写书评

暂无评论

Optimal two-machine scheduling in a flexible flow system

Optimal two-machine scheduling in a flexible flow system

引用

International Conference on Computer Integrated Manufacturing

作者： A. Agnetis C. Arbib K.E. Stecke Dip. Informatica e Sistemistica Universitá di Roma La Sapienza Rome Italy Dip. Ingegneria Elettronica Universitá di Roma Tor Vergata Rome Italy Graduate School of Business Administration University of Michigan Ann Arbor MI USA

An approach to part-type selection and scheduling of parts in a two-machine flexible-flow line is presented. It consists of first selecting a small number of part types for simultaneous production (in suitable ratios in order to balance the workloads among the machines), and then scheduling the parts of each batch in order to minimize both completion time as well as the maximum level of in-process inventory required. The system consists of two machines, and all of the parts visit the two machines in the same order. Some advantages of the approach presented include management effectiveness and simplicity, in addition to other benefits inherent in a dynamic and flexible approach to part-type selection (such as a higher utilization of the machines, a smoother tool-changing activity, etc.).< >

关键词： Production Job shop scheduling scheduling algorithm Cutting tools Flexible manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

scheduling of partitioned regular algorithms on processor arrays with constrained resources

Scheduling of partitioned regular algorithms on processor ar...

引用

International Conference on Application Specific Systems (ASAP), Architectures and Processors

作者： J. Teich L. Thiele L. Zhang Institute TIK ETH Zürich Zurich Switzerland

A single integer linear programming model for optimally scheduling partitioned regular algorithms is presented. The herein presented methodology differs from existing methods in the following capabilities: (1) Not only constraints on the number of available processors and communication capabilities are taken into account, but also processor caches and constraints on the size of available memories are modeled and taken into account in the optimization model. (2) Different types of processors can be handled. (3) The size of the optimization model (number of integer variables) is independent of the size of the tiles to be executed. Hence, (4) the number of integer variables in the optimization model is greatly reduced such that problems of relevant size can be solved in practical execution time.

关键词： Processor scheduling Partitioning algorithms scheduling algorithm Constraint optimization Tiles High level synthesis Very large scale integration Hardware Runtime Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Heuristics for scheduling reconfigurable devices with consideration of reconfiguration overheads

Heuristics for scheduling reconfigurable devices with consid...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Josef Angermeier Jurgen Teich Department of Computer Science University of Erlangen Nuremberg Erlangen Germany

When using dynamically and partially reconfigurable FPGAs in embedded systems, the scheduler needs to fulfill area and time requirements for each task. While those demands are already well studied in literature, another characteristic peculiarity of reconfigurable systems has been rather neglected: the reconfiguration overhead. However, scheduling algorithms considering the exclusive access to the reconfiguration port can improve the latency of obtained schedules considerably. In this paper, we present new scheduling heuristics and a methodology to compare approaches which take into consideration the reconfiguration overheads with those which disregard them. Furthermore, our experimental results give insight into possible performance increases and present problem instances for which the reconfiguration latency is negligible.

关键词： Processor scheduling Dynamic scheduling Delay Hardware Field programmable gate arrays Embedded system Parallel machines scheduling algorithm Operating systems Computer science

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for SS/TDMA scheduling

Efficient algorithms for SS/TDMA scheduling

引用

IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record

作者： A. Ganz Y. Gao Electrical & Computer Engineering Department University of Massachusetts Amherst MA USA

The authors present efficient scheduling algorithms for the slot assignment problem in a satellite-switched time-division multiple-access (SS/TDMA) system. This problem is translated into a modified openshop scheduling problem, allowing the use of known optimal algorithms. Their complexity is expressed as a function of the following parameters: the number of nonzero entries in the demand matrix, the number of uplinks, and the number of downlinks. According to the values of these parameters, the algorithm with the lowest computational complexity can be adopted. While the computational complexity of previously published algorithms is greatly reduced, simulation results evidence that the assignment duration is close to previously presented solutions.< >

关键词： scheduling algorithm Time division multiple access Processor scheduling Computational complexity Downlink Matrix decomposition Switches Transponders Computational modeling Electromagnetic spectrum

来源：评论

学校读者我要写书评

暂无评论

On the Impact of Selfish Behaviors in Wireless Packet scheduling

On the Impact of Selfish Behaviors in Wireless Packet Schedu...

引用

IEEE International Conference on Communications (ICC)

作者： Z. Kong Y.-K. Kwok J. Wang Department of EEE University of Hong Kong Hong Kong China Department of EEE Colorado State University Fort Collins CO USA National Mobile Communications Research Laboratory South-East University Nanjing China

In many practical scenarios, wireless devices are autonomous and thus, may exhibit non-cooperative behaviors due to self-interests. For instance, a wireless user may report bogus channel information to gain resource allocation advantages. Such non-cooperative behaviors are practicable as the device's software could be modified by the user. In this paper, we first analyze the impact of these rationally selfish behaviors on the performance of packet scheduling algorithms in time-slotted wireless networks. Using a mixed strategy game theoretic model, we show that the traditional Maximum Rate packet scheduling algorithm can lead non-cooperative users to undesirable Nash equilibriums, in which the wireless channels are used inefficiently. By using repeated game to enforce cooperation, we further propose a novel game theoretic approach that can lead to an efficient equilibrium.

关键词： scheduling algorithm Game theory Resource management Wireless networks Nash equilibrium Radio spectrum management Downlink System performance Throughput Communications Society

来源：评论

学校读者我要写书评

暂无评论

scheduling in input-queued cell-based packet switches

Scheduling in input-queued cell-based packet switches

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： M.A. Marsan A. Bianco P. Giaccone E. Leonardi F. Neri Dipartimento di Elettronica Politecnico di Torino Italy

Input queuing switch architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for switches operating on fixed-size data units. We consider the case of packet switches, i.e., devices operating on variable-size data units at their interfaces, but internally operating on fixed-size data units, and we propose novel extensions of known scheduling algorithms. We show that, in the case of packet switches, input queuing architectures can provide advantages over output queuing architectures.

关键词： Packet switching Switches scheduling algorithm Fabrics Asynchronous transfer mode Internet Job shop scheduling ISDN Delay Contracts

来源：评论

学校读者我要写书评

暂无评论

A proportional fair scheduling for multicarrier transmission systems

A proportional fair scheduling for multicarrier transmission...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Hoon Kim Keunyoung Kim Youngnam Han Sangboh Yun Information and Communications University South Korea Samsung Advanced Institute of Technology South Korea

ISBN: (纸本)0780385217

In this paper, we proposed a proportional fair (PF) scheduling algorithm for systems with multiple carriers such as orthogonal frequency division multiple access systems. The scheduler assigns users to carriers to maximize the sum of logarithmic transmission rate, which is compatible with the definition by RE Kelly (Journal Operational Research Soc., vol.49, p.237-252, 1998). It is shown that the PF scheduling in the high data rate (HDR) system proposed by Qualcomm is a special case of our proposed scheme. A simple system is presented, which proves its superiority over other schemes for multicarrier transmission, e.g. extended round robin and the PF scheduling scheme for the HDR system.

关键词： Sections Throughput scheduling algorithm Frequency conversion Streaming media Telecommunication traffic Wireless networks Multicarrier code division multiple access Round robin Data communication

来源：评论

学校读者我要写书评

暂无评论

The loading time scheduling problem

The loading time scheduling problem

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： R. Bhatia S. Khuller J. Naor Computer science Department University of Maryland College Park MD USA Computer science Department Technion-Israel Institute of Technology Haifa Israel

In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a specified subset of the machines. Each machine has a loading time that is incurred only for the first task that is scheduled on the machine in a particular run. This basic scheduling problem arises in the context of machining on numerically controlled machines, query optimization in databases, and in other artificial intelligence applications. We give the first non-trivial approximation algorithm for this problem. We also prove non-trivial lower bounds on best possible approximation ratios for these problems. These improve on the non-approximability results that are implied by the non-approximability results for the shortest common supersequence problem. We use the same algorithmic technique to obtain approximation algorithms for a problem arising in the context of code generation for parallel machines, and for the weighted shortest common supersequence problem.

关键词： Computer science Machining Approximation algorithms Processor scheduling Educational institutions scheduling algorithm Milling machines Drilling Query processing Databases

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 460 461 462 463 464 465 466 467 468 469 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：