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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Dynamic scheduling of nested loops with uniform dependencies in heterogeneous networks of workstations

Dynamic scheduling of nested loops with uniform dependencies...

引用

International Symposium on Parallel Architectures, algorithms and Networks (ISPAN)

作者： I. Riakiotakis P. Tsanakas Department of Electrical and Computer Engineering National and Technical University of Athens Athens Greece

Static algorithms have been proposed to parallelize loops with uniform dependencies for networks of workstations. However, the heterogeneous and dynamic nature of these networks demands a dynamic solution to the scheduling and load balancing problem. At the same time many dynamic scheduling algorithms have been proposed, but all of them are dealing with programs with parallel loops, i.e. loops without dependencies. In this paper we extend the applicability of dynamic algorithms by presenting a dynamic scheduling algorithm that uses simple data structures in order to handle programs with data dependencies. Experimental results validate the proposed algorithm in both homogeneous and heterogeneous networks.

关键词： Dynamic scheduling Intelligent networks Processor scheduling Heuristic algorithms scheduling algorithm Workstations Concurrent computing Load management Computer networks Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Contention Awareness In Task scheduling Using Tabu Search

Contention Awareness In Task Scheduling Using Tabu Search

引用

IEEE International Advance Computing Conference, IACC

作者： R Shanmugapriya S. Padmavathi S. Mercy Shalinie Department of Computer Science & Engineering Thiagarajar College of Engineering Madurai Tamilnadu India

A task scheduling problem is to arrange the tasks of an application on computing resources so as to achieve minimum schedule length. Many effective scheduling algorithms have been proposed, but most of them assumes that network is fully connected and contention free. In order to make this problem more practical, the link contention constraints are considered. In this paper we proposed an effective and efficient scheduling algorithm called Migration scheduling algorithm (MSA) based on Tabu search extended from list scheduling algorithm. The edges among the tasks are also scheduled by treating communication links between the processors as resources. To present the effectiveness of the proposed algorithm, we compared it with the Dynamic level scheduling algorithm (DLS) and List scheduling without contention. The proposed algorithm has admissible time complexity and suitable for regular as well as irregular task graph structures. Experimental results show that algorithm with tabu search produce optimal schedules in reasonable time.

关键词： Processor scheduling Optimal scheduling scheduling algorithm Computer science Educational institutions Environmentally friendly manufacturing techniques Delay Dynamic scheduling Time measurement Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Channel and queue aware scheduling for real- time service in multiuser MIMO OFDM system

Channel and queue aware scheduling for real- time service in...

引用

Asia-Pacific Conference on Communications

作者： Guangyi Liu Jianhua Zhang Jianchi Zhu Weidong Wang Research Institute of China Mobile Beijing University of Posts and Telecommunications China

ISBN: (纸本)9781424413737

For real time service, not only the data rate, but also the packet delay should be guaranteed. In this paper, by exploiting the queue status information and channel status information, a novel framework of joint spatial-frequency scheduling for real time service in MIMO-OFDMA system is proposed, and some joint spatial-frequency scheduling algorithm is proposed based on modified largest weighted delay first (M-LWDF), quality guaranteed (QG) and packet loss ratio (PLR) priority function. Comparing the simulation results of MIMO 1times2 case, M-LWDF achieves best performance; QG and M-LWDF scheduler may support 20 video user with 500 kbps data rate in 10 MHz bandwidth, and the spectrum efficiency may approach 0.9 bps/Hz. while for MIMO 2times4 results, QG scheduler may achieve best performance comprehensively, and more than 50 video user can be supported in 10 MHz, and the spectrum efficiency may approach 2.5 bps/Hz.

关键词： MIMO OFDM Delay effects Throughput Real time systems scheduling algorithm Bandwidth Downlink Fading Diversity methods

来源：评论

学校读者我要写书评

暂无评论

On symbolic scheduling and parallel complexity of loops

On symbolic scheduling and parallel complexity of loops

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Tao Yang O.H. Ibarra Department of Computer Science University of California Santa Barbara CA USA

We first consider the symbolic scheduling and performance prediction of a partitioned single loop on message passing architectures with non zero communication and a sufficient number of processors. The loop body contains a set of coarse grain tasks whose computational weights change during the course of the iterations. Using the macro dataflow task: model and software pipelining techniques, we develop an algorithm for computing a heuristic schedule, and provide analytic and experimental results on the correctness and asymptotic performance of this schedule. Using this result, we can show the impact of partitioning on the performance of parallelization. While this result is effective for a class of loops, there are many other methods proposed for loop parallelization. An interesting fundamental question is whether every instance of a nested loop can be efficiently executed, We present some positive and negative results on this issue.

关键词： Processor scheduling Message passing Computer architecture Software performance Pipeline processing Partitioning algorithms Software algorithms scheduling algorithm Performance analysis algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Test scheduling of BISTed memory cores for SoC

Test scheduling of BISTed memory cores for SoC

引用

Asian Test Symposium (ATS)

作者： Chih-Wea Wang Jing-Reng Huang Yen-Fu Lin Kuo-Liang Cheng Chih-Tsun Huang Chen-Wen Wu Youn-Long Lin Laboratory for Reliable Computing Department of Electrical Engineering National Tsing Hua University Hsinchu Taiwan Global UniChip Corporation Hsinchu Taiwan

ISBN: (纸本)0769518257

The test scheduling of memory cores can significantly affect the test time and power of system chips. We propose a test scheduling algorithm for BISTed memory cores to minimize the overall testing time under the test power constraint. The proposed algorithm combines several approaches for a near-optimal result, based on the properties of BISTed memory cores. By proper partitioning, an analytic exhaustive search finds optimal results for large memory cores, while a heuristic ordering with simulated annealing further handles a large amount of smaller memory cores. On the average, the results are within 1% difference of the optimal solution for the cases of 200 memory cores.

关键词： Circuit testing Job shop scheduling Built-in self-test scheduling algorithm Power system reliability System testing Automatic testing Sequential analysis Minimization Logic testing

来源：评论

学校读者我要写书评

暂无评论

QoS supported dynamic traffic scheduling in WDM/TDM networks with arbitrary tuning latencies

QoS supported dynamic traffic scheduling in WDM/TDM networks...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： Nen-Fu Huang Te-Lung Liu Ching-Fang Hsu Department of Computer Science National Tsing Hua University Taiwan

This paper proposes a dynamic traffic scheduling algorithm in single-hop WDM/TDM networks with arbitrary tuning latencies to support guaranteed QoS. To furnish different levels of QoS, two classes of traffic are considered: constant bit rate (CBR) and available bit rate (ABR). An effective bandwidth normalization scheme for ABR traffic is also derived. By applying distinct normalization schemes to CBR and ABR traffic individually, the bandwidth can be allocated more accurately and meanwhile the QoS is also guaranteed. Two slot allocation policies are also suggested to allocate the time slots to connections. The performance of proposed algorithm is evaluated and compared by simulations under different system parameters, such as wavelength number, traffic load, and tuning latency.

关键词： Telecommunication traffic Dynamic scheduling Wavelength division multiplexing WDM networks Time division multiplexing Delay Bit rate Bandwidth scheduling algorithm Traffic control

来源：评论

学校读者我要写书评

暂无评论

scheduling active camera resources for multiple moving targets

Scheduling active camera resources for multiple moving targe...

引用

Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： Christopher D. W. Ward Michael D. Naish Sensing and Mechatronic Systems Laboratory Department of Mechanical & Materials Engineering University of Western Ontario London ONT Canada Western University London ON CA

Five scheduling policies that have been developed and implemented to manage the active resources of a centralized active vision system are presented in this paper. These scheduling policies are tasked with making target-to-camera assignments in an attempt to maximize the number of targets that can be imaged with the system's active cameras. A comparative simulation-based evaluation has been performed to investigate the performance of the system under different target and system operating parameters for all five scheduling policies. Parameters considered include: target entry conditions, congestion levels, target-to-camera speeds, target trajectories, and number of active cameras. An overall trend in the relative performance of the scheduling algorithms was observed. The Least System Reconfiguration and Future Least System Reconfiguration scheduling policies performed the best for the majority of conditions investigated, while the Load Sharing and First Come First Serve policies performed the poorest. The performance of the Earliest Deadline First policy was highly dependent on target predictability.

关键词： Cameras Processor scheduling Surveillance Machine vision Performance evaluation scheduling algorithm Computer applications Throughput Resource management Mechatronics

来源：评论

学校读者我要写书评

暂无评论

Enlarged-maximum-scannable-groups for real-time disk scheduling in a multimedia system

Enlarged-maximum-scannable-groups for real-time disk schedul...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Hsung-Pin Chang Ray-I Chang Wei-Kuan Shih Ruei-Chuan Chang Department of Comp&Inform Science National Chiao Tung University Hsinchu Taiwan Institute of Inform Science Academia Sinica Taipei Taiwan Department of Comp Science National Tsing Hua University Hsinchu Taiwan

ISBN: (纸本)0769507921

In a multimedia system, disk I/O subsystem is the most important component due to its relatively limited throughput and large delay. Previously, by applying SCAN to reschedule tasks having the same deadline, SCAN-EDF tries to improve disk throughput while real time constraints can be satisfied. In DM-SCAN, groups of tasks that can be successfully rescheduled by SCAN under specified real time requirements are identified. They are called MSGs (maximum-scannable-groups). An enlarged-MSG (E-MSG) is proposed to further expand the MSG concept and thus to obtain more improvement in disk throughput. By removing some excess constraints on MSG, E-MSG merges several MSGs as a new scannable group. Experimental results show that the E-MSG scheme is better than both SCAN-EDF and MSG in the disk throughput obtained.

关键词： Real time systems Multimedia systems Throughput scheduling algorithm Timing Delay Time factors Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

Sleep scheduling towards geographic routing in duty-cycled sensor networks

Sleep scheduling towards geographic routing in duty-cycled s...

引用

International Conference on Distributed Computing in Sensor Systems (DCOSS)

作者： Chunsheng Zhu Laurence T. Yang Lei Shut Joel J. P. C. Rodrigues Takahiro Harat Department of Computer Science St. Francis Xavier University Canada Department of Multimedia Engineering Osaka University Japan Instituto de Telecomunicações University of Beira Interior Portugal Osaka Daigaku Suita Osaka JP

This paper focuses on improving the geographic routing performance of the two-phase geographic greedy forwarding (TPGF) in duty-cycled wireless sensor networks (WSNs) and proposes a geographic routing oriented sleep scheduling (GSS) algorithm. The algorithm analysis and simulation results show that GSS can shorten the length of the first explored transmission path of TPGF, compared with the connected-k neighborhood (CKN) algorithm.

关键词： Wireless sensor networks Routing algorithm design and analysis Copper Electronic mail Ad hoc networks scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Workload Allocation to Improve scheduling Real-Time Tasks

An Efficient Workload Allocation to Improve Scheduling Real-...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： A. Hamdy A. Hussein R. Ammar Department of Computer systems Electronic Research Institute Giza Egypt Department of Computer Science and Engineering University of Connecticut Storrs CT USA

Cluster computing systems are currently used to execute high performance applications that exhibit real time characteristics. A high-speed communication networks are used to interconnect the nodes of a cluster. Also, special software is used to allocate and manage the execution of the parallel tasks of the applications on cluster's processors to satisfy real-time requirements and achieve high throughput. In this paper, we present a new algorithm to allocate tasks’ workloads in a way that improves the utilization of each cluster's processor. Consequently, a cluster's processor can accept more tasks and results in higher throughput. The idea of the algorithm depends on assigning a variable processing power to the task under consideration to satisfy its deadline instead of rejecting it if a constant processing power cannot be guaranteed. Simulation results reveal that the acceptance rate of submitted tasks to a cluster's processor using the new approach is superior to previous approaches.

关键词： Optimal scheduling Application software Processor scheduling Real time systems Clustering algorithms scheduling algorithm Communication networks Throughput High performance computing Operating systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：