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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Centralized scheduling and Channel Assignment in Multi-Channel Single-Transceiver WiMax Mesh Network

Centralized Scheduling and Channel Assignment in Multi-Chann...

引用

IEEE Conference on Wireless Communications and Networking

作者： Peng Du Weijia Jia Liusheng Huang Wenyan Lu Department of Computer Science City University of Hong Kong Hong Kong China Department of Computer Science University of Science and Technology Hefei Anhui China School of Information Science and Engineering Center South University Changsha Hunan China

The IEEE 802.16a standard defines WiMax mesh network, using the base station (BS) as a coordinator for the centralized scheduling. This paper proposes a centralized scheduling algorithm for WiMax mesh networks. In our scheme, each node has one transceiver and can be tuned between multiple channels, intending to eliminate the secondary interference for reducing the length of scheduling. We first study the problem when sufficient channels are supported, then extend our solution to the case with insufficient number of channels. Both the scheduling algorithm and the channel assignment strategies are included. The simulation results show that the multi-channel single-transceiver MAC can reduce the length of scheduling substantially as compared with the single channel system, and double channel may provide a performance similar to the multiple channels.

关键词： WiMAX Mesh networks scheduling algorithm Communications Society Processor scheduling Computer science Physical layer Telecommunication traffic Time division multiple access Data communication

来源：评论

学校读者我要写书评

暂无评论

A fair and effective scheduling strategy for workstation clusters

A fair and effective scheduling strategy for workstation clu...

引用

IEEE International Conference on Cluster Computing

作者： C. Anglano Dipartimento di Scienze e Tecnologie Avanzate Universitá del Piemonte Orientale A. Avogadro Alessandria Italy

In recent years workstation clusters have been increasingly used as general purpose computing servers for the execution of parallel and sequential applications submitted by many competing users. To make clusters a real alternative to more traditional general purpose computing platforms, scheduling techniques able to efficiently and fairly schedule collections of parallel and sequential applications must be devised. In this paper we propose a scheduling technique able to achieve the above goals by combining stride scheduling with a ticket redistribution policy that results in the spontaneous coscheduling of parallel applications. A simulation analysis carried out for a variety of workloads and operational conditions shows that our strategy outperforms previous strategies both in terms of efficiency and fairness.

关键词： Workstations Processor scheduling Concurrent computing Resource management Time sharing computer systems Computational modeling Analytical models Quality of service Clustering algorithms scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic window-constrained scheduling for multimedia applications

Dynamic window-constrained scheduling for multimedia applica...

引用

IEEE International Conference on Multimedia Computing and Systems (ICMCS)

作者： R. West K. Schwan College of Computing Georgia Institute of Technology Atlanta GA USA

This paper describes an algorithm, called dynamic window-constrained scheduling (DWCS), designed to meet the service constraints on packets from multiple, network-bound media streams with different performance objectives. Using only two attributes, a deadline and a loss-tolerance per packet stream, DWCS: can limit the number of late packets over finite numbers of consecutive packets in loss-tolerant or delay constrained, heterogeneous traffic streams; does not require a priori knowledge of the worst-case loading from multiple streams to establish the necessary bandwidth allocations to meet per-stream delay and loss constraints; and can exhibit both fairness and unfairness properties when necessary. In fact, DWCS can perform fair-bandwidth allocation, static priority (SP) and earliest-deadline first (EDF) scheduling. The paper shows the effectiveness of DWCS using a streaming video application, running over ATM.

关键词： Dynamic scheduling scheduling algorithm Streaming media Delay Bandwidth Propagation losses Processor scheduling Heuristic algorithms Quality of service Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Synthesis of Optimal Interfaces for Hierarchical scheduling with Resources

Synthesis of Optimal Interfaces for Hierarchical Scheduling ...

引用

Real-Time Systems Symposium (RTSS)

作者： Insik Shin Moris Behnam Thomas Nolte Mikael Nolin Department of Computer Science KAIST Daejeon South Korea Mälardalen Real-Time Research Centre (MRTC) Mälardalen University Vasteras Sweden

This paper presents algorithms that (1) facilitate system-independent synthesis of timing-interfaces for subsystems and (2) system-level selection of interfaces to minimize CPU load. The results presented are developed for hierarchical fixed-priority scheduling of subsystems that may share logical recourses (i.e. semaphores). We show that the use of shared resources results in a tradeoff problem, where resource locking times can be traded for CPU allocation, complicating the problem of finding the optimal interface configuration subject to schedulability. This paper presents a methodology where such a tradeoff can be effectively explored. It first synthesizes a bounded set of interface-candidates for each subsystem, independently of the final system, such that the set contains the interface that minimizes system load for any given system. Then, integrating subsystems into a system, it finds the optimal selection of interfaces. Our algorithms have linear complexity to the number of tasks involved. Thus, our approach is also suitable for adaptable and reconfigurable systems.

关键词： Resource management Real time systems Processor scheduling Computer science scheduling algorithm Vehicles Software systems Application software Fellows Access protocols

来源：评论

学校读者我要写书评

暂无评论

A hierarchical scheduling system using new weight assigned function in VLSI development lines

A hierarchical scheduling system using new weight assigned f...

引用

IEEE International Symposium on Semiconductor Manufacturing

作者： H. Ishizuka S. Matsumoto K. Nakata S. Tanimura Y. Hirofuji Semiconductor Research Center Matsushita Elecrric Indusrrial Company Limited Moriguchi Osaka Japan

Many kinds of scheduling systems have been devised in order to realize an efficient operation of production lines by means of, for example, shortening turn around time (TAT). The VLSI development line requires the following special key items: (1) an efficient lot processing schedule as the number of process steps in given period are maximized; (2) the quick making of a schedule counteracting the alternation of recipes and changes of the period demanded for the experimentation. We developed a new hierarchical scheduling system (DYSCHE II: DYnamic scheduling system II) using a Weight Assigned Function (WAF) to overcome the problem of conventional scheduling systems.

关键词： Very large scale integration Springs scheduling algorithm Iterative algorithms Dynamic scheduling Laboratories Production systems Physics

来源：评论

学校读者我要写书评

暂无评论

Using a flexible real-time scheduling strategy in a distributed embedded application

Using a flexible real-time scheduling strategy in a distribu...

引用

International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： L.B. Becker M. Gergeleit S. Schemmer E. Nett Faculty of Informatics PUCRSComputer Science Institute UFRGS Brazil IVS-EUK Otto-von-Guericke University of Magdeburg Germany

The increasing complexity of current real-time applications demands systems to make good use of the available computational resources. Guaranteeing timing behavior using traditional real-time scheduling policies is turning to be unfeasible, as these policies are based in pessimistic worst-case assumptions that pre-allocate resources even though they will be rarely used. The time-aware fault-tolerant (TAFT) scheduler presents a flexible scheduling strategy that allows the construction of schedules maximizing the CPU utilization. This work presents the use of the TAFT scheduler with computational intensive distributed embedded applications, in order to keep a high ratio of successful tasks completion and so guaranteeing its computational progress. More specifically, the paper sketches a "TAFT-based" fusion algorithm for laser-scanner data and derives the requirements that the execution of this algorithm has on the CPU-scheduling.

关键词： Processor scheduling Laser fusion Mobile robots Robot sensing systems Real time systems Application software Distributed computing Embedded computing scheduling algorithm Timing

来源：评论

学校读者我要写书评

暂无评论

Transmission scheduling for fieldbus: a strategy to schedule data and messages on the bus with end-to-end constraints

Transmission scheduling for fieldbus: a strategy to schedule...

引用

IEEE International Joint Symposia on Intelligence and Systems

作者： L.R.H.R. Franco Escola Federal de Engenharia de Itajubá-EFBI Brazil Escola Politécnica da Universidade de São Paulo Brazil

The transmission scheduling for fieldbus has been addressed until now to minimize the number of data. It does not take into account the temporal dependency of data. Usually, the approaches of transmission scheduling for fieldbus let to the application processes to decide whether to use old values or not. The objective of this paper is to show how to adapt Gerber's methodology to generate a scheduling table of a set of periodic and aperiodic data from application processes to be transmitted through a fieldbus, guaranteeing their end-to-end constraints; and how this can be done in according to IEC 1158. This strategy obviates the transmission of old and useless data to application, thus optimizing the fieldbus scheduling.

关键词： Field buses Job shop scheduling Communication system control IEC standards scheduling algorithm Processor scheduling Data communication Centralized control Instruction sets Instruments

来源：评论

学校读者我要写书评

暂无评论

Run-time scheduling for random multi-tasking in reconfigurable coprocessors

Run-time scheduling for random multi-tasking in reconfigurab...

引用

International Conference on Field Programmable Logic and Applications

作者： P. Benoit J. Becker G. Sassatelli L. Torres M. Robert G. Cambon ITIV University of Karlsruhe Germany LIRMM University of Montpellier 2 France

The authors addressed the multi-tasking issue for reconfigurable coprocessors in random application contexts. A scheduling algorithm was proposed to handle simultaneously a set of random tasks and able to maximize the resource usage even when the task-load is low. For this, processes are considered as relocatable: a simple transformation scheme is applied by a configuration controller to the initial configuration in order to relocate or duplicate the task when necessary. In this paper, the proposed method is implemented on a coarse grain reconfigurable architecture with 8 and 32 processing elements. A large amount of random scenario have been simulated and the statistical results presented here clearly show real advantages of the proposed method, but also some limitations drawing the line of future works.

关键词： Runtime Coprocessors Reconfigurable architectures Shape Field programmable gate arrays Heuristic algorithms scheduling algorithm Energy consumption Hardware Multitasking

来源：评论

学校读者我要写书评

暂无评论

scheduling input-buffered multicast ATM switch

Scheduling input-buffered multicast ATM switch

引用

IEEE Workshop on ATM

作者： D.C.W. Pao Department of Electronic Engineering City University of Hong Kong Kowloon Hong Kong China

Output contention resolution is a fundamental issue of ATM switch design. Output contention is much more severe in multicasting compared to the unicast counterpart. Previous studies have found that the cell loss probability of multicasting is slightly lower than unicasting. That is mainly because the effective cell arrival rate is reduced when the output load is kept unchanged. The performance of an ATM switch is dictated by the queueing discipline and the contention resolution strategy. In this paper, we present a distributed, reservation based scheduling algorithm in which a virtual queue is maintained for each virtual path/circuit. The scheduling is done on a frame by frame basis. While the input ports are transmitting cells according to the schedule of the current frame, the next frame schedule is computed. The proposed method substantially outperforms the other methods in the moderate to high load region.

关键词： Asynchronous transfer mode Switches Unicast scheduling algorithm Processor scheduling Telecommunication traffic Throughput Design engineering Delay Capacity planning

来源：评论

学校读者我要写书评

暂无评论

Joint Channel Assignment and Space-Division Multiple Access scheduling in Wireless Mesh Networks

Joint Channel Assignment and Space-Division Multiple Access ...

引用

IEEE Conference on Wireless Communications and Networking

作者： Dawei Gong Miao Zhao Yuanyuan Yang Department of Electrical and Computer Engineering Stony Brook University Stony Brook NY USA

ISBN: (纸本)9781424463961;9781424463985

In recent years, wireless mesh networks (WMNs) have been widely deployed to provide wireless access to the Internet. However, due to inter-link interference, the aggregated capacity of WMNs is limited, even with multiple channels. As a result, many links in WMNs are suppressed since interfering links cannot be active (i.e., transmitting packets) simultaneously. In this paper, we propose a joint design of channel assignment and space-division multiple access (SDMA) technique with the objective of maximizing the number of active links in WMNs. We assign different channels to transmission links based on their interference relationship to alleviate the interference. We also apply the SDMA technique to link scheduling, which enables two interfering links that share the same destination to communicate simultaneously on the same channel. By utilizing SDMA, more concurrent transmission links can be accommodated such that the network capacity can be greatly improved. We formulate this joint design into an optimization problem, prove its NP-hardness and then provide two heuristic algorithms to give practically good solutions to the problem. Our simulation results demonstrate that performance of the two heuristic algorithm is close to the optimal solution, and when 90% SDMA pairs are compatible, the proposed algorithms can increase the percentage of active links in a WMN by up to 40% as compared to non-SDMA schedules.

关键词： Wireless mesh networks Multiaccess communication IP networks Heuristic algorithms Network topology scheduling algorithm Wireless networks Interference constraints Mesh networks Receiving antennas

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 476 477 478 479 480 481 482 483 484 485 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：