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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A fast scheduling algorithm for all-optical shared-buffer packet switches

A fast scheduling algorithm for all-optical shared-buffer pa...

引用

Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： Soung Y. Liew Siong F. Law Faculty of Information and Communication Technology Universiti Tunku Abdul Rahman Malaysia

All-optical shared-buffer packet switches have been studied intensively in literature and many scheduling algorithms have been proposed. However, these algorithms either suffer from not being able to make resource reservation, or require high time-complexity to compute scheduling assignment for packets. In this paper, we propose a fast scheduling algorithm for all-optical shared-buffer packet switches. In our algorithm, packet scheduling is first formulated as a tree-searching problem. By breaking down the search tree into multiple smaller subsets and assigning each subset to a secondary processor, solutions can be obtained in a much shorter duration since the secondary processors are working in parallel. For instance, a scheduling assignment can be calculated for a packet in 55 ns with 8 processors, and in 25 ns with 64 processors, assuming a processor clock rate of 200 MHz. We show that our algorithm can achieve a loss rate of ~10 -7 even at load 0.9 for a 32times32 switch.

关键词： scheduling algorithm Packet switching Processor scheduling Communication switching Optical buffering Clocks Optical switches Optical fiber communication Delay lines Optical packet switching

来源：评论

学校读者我要写书评

暂无评论

PB-FCFS-a task scheduling algorithm based on FCFS and backfilling strategy for grid computing

PB-FCFS-a task scheduling algorithm based on FCFS and backfi...

引用

Joint Conferences on Pervasive Computing (JCPC)

作者： Hong Jiang Tianwei Ni Hohai University Nanjing Jiangsu CN Department of Electronics and Information Engineering Hohai University HHU Maanshan Anhui China

ISBN: (纸本)9781424452279;9781424452286

In a task scheduling system for grid computing, most of algorithms such as reservation, backfilling, etc. are commonly used task scheduling algorithm. However, they have some insufficiencies in the system resource utilization rate and the response time due to these algorithms are insufficient in solving resource slot. In order to improve the system resource utilization rate and shorten the response time, this paper presents PB-FCFS algorithm which is a task scheduling algorithm based on FCFS and backfilling strategy for grid computing. The PB-FCFS algorithm combines backfilling and priority scheduling strategy, as well considers the resource recycling at the time of task accomplished. The simulation results show that the PB-FCFS algorithm shortens task run time and improves the system throughput rate and resource utilization rate to a certain extent.

关键词： scheduling algorithm Grid computing Processor scheduling Resource management Delay Educational institutions algorithm design and analysis Dynamic scheduling Recycling Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A novel static task scheduling algorithm in distributed computing environment

A novel static task scheduling algorithm in distributed comp...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Jian-Jun Han Qing-Hua Li School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)0769521320

Summary form only given. Distributed computing environment composed of interconnected machines with varied or same computational capabilities is well suited to meet the computational demands of diverse groups of tasks. The most popular model characterizing tasks' dependence is to utilize DAG (directed acyclic graph). We present a novel model called TTIG that is more realistic and universal than DAG and its corresponding algorithm called MATE for static mapping of parallel application. We extend TTIG model, and propose a new static scheduling algorithm called GBHA (group-based hybrid algorithm) and two versions (GBHA1 for homogeneous systems and GBHA2 for heterogeneous systems). In this work, our algorithms are compared with MATE and some well-known scheduling algorithms for multiprocessor systems based on DAG The simulation experiment results show that our algorithms outperform MATE significantly in both homogeneous and heterogeneous systems and can be comparable to efficient scheduling algorithms based on DAG in multiprocessor systems but with much lower complexity.

关键词： scheduling algorithm Distributed computing Processor scheduling Dynamic scheduling Multiprocessing systems Clustering algorithms Analytical models algorithm design and analysis Computer science Computational modeling

来源：评论

学校读者我要写书评

暂无评论

RDMS: A hardware task scheduling algorithm for Reconfigurable Computing

RDMS: A hardware task scheduling algorithm for Reconfigurabl...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Miaoqing Huang Harald Simmler Olivier Serres Tarek El-Ghazawi NSF Center for High-Performance Reconfigurable Computing (CHREC) Department of Electrical and Computer Engineering George Washington University USA

Reconfigurable computers (RC) can provide significant performance improvement for domain applications. However, wide acceptance of today's RCs among domain scientist is hindered by the complexity of design tools and the required hardware design experience. Recent developments in HW/SW co-design methodologies for these systems provide the ease of use, but they are not comparable in performance to manual co-design. This paper aims at improving the overall performance of hardware tasks assigned to FPGA devices by minimizing both the communication overhead and configuration overhead, which are introduced by using FPGA devices. The proposed reduced data movement scheduling (RDMS) algorithm takes data dependency among tasks, hardware task resource utilization, and inter-task communication into account during the scheduling process and adopts a dynamic programming approach to reduce the communication between muP and FPGA co-processor and the number of FPGA configurations to a minimum. Compared to two other approaches that consider data dependency and hardware resource utilization only, RDMS algorithm can reduce inter-configuration communication time by 11% and 44% respectively based on simulation using randomly generated data flow graphs. The implementation of RDMS on a real-life application, N-body simulation, verifies the efficiency of RDMS algorithm against other approaches.

关键词： Hardware scheduling algorithm Field programmable gate arrays Partitioning algorithms Coprocessors High performance computing Application software Resource management Dynamic scheduling Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A task duplication based scheduling algorithm for heterogeneous systems

A task duplication based scheduling algorithm for heterogene...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： S. Ranaweera D.P. Agrawal Department of Electrical Computer Engineering and Computer Science University of Cincinnati Cincinnati OH USA

Optimal scheduling of tasks of a directed acyclic graph (DAG) onto a set of processors is a strong NP-hard problem. In this paper we present a scheduling scheme called TDS to schedule tasks of a DAG onto a heterogeneous system. This models a network of workstations, with processors of varying computing power. The primary objective of this scheme is to minimize schedule length and scheduling time itself. The existing task duplication based scheduling scheme is primarily done for totally homogeneous systems. We compare the performance of this algorithm with an existing scheduling scheme for heterogeneous processors called BIL. In initial simulations TDS has been observed to generate scheduling lengths shorter than that of BIL, for communication-to-computation cost ratios (CCR) of 0.2 to 1. Moreover TDS is far more superior than BIL as far as scheduling time is concerned.

关键词： scheduling algorithm Clustering algorithms Computer networks Application software Partitioning algorithms Computer science NP-hard problem Power system modeling Computational modeling Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Packet scheduling algorithm considering both the delay constraint and user throughput in HSDPA

Packet scheduling algorithm considering both the delay const...

引用

International Conference on Communications, Circuits and Systems (ICCCAS)

作者： Hua Zeng Binyang Xu Wanbin Tang Youxi Tang Shaoqian Li National Key Laboratory of Communication University of Electronic Science and Technology Chengdu China

ISBN: (纸本)0780390156

This paper proposes a novel packet scheduling algorithm for delay constraint traffic on high speed down link packet access (HSDPA) and also a packet scheduler for this algorithm. In this packet scheduling algorithm, we consider both the delay constraint and the throughput for each traffic class while maximizing the system capacity. Considering the delay constraint and the throughput simultaneously, our method can guarantee different quality of service (QoS) for each traffic class. Finally, in order to demonstrate the performance of our proposed algorithm, we compare our algorithm with the proportional fairness (PF) method and round robin (RR) method by system simulations. Numerical results show that system performance can be significantly improved employing our algorithm compared to that with the PF or RR method.

关键词： scheduling algorithm Delay Throughput Multiaccess communication Downlink Round robin Modulation coding Quality of service Traffic control System performance

来源：评论

学校读者我要写书评

暂无评论

A dynamic and adaptive scheduling algorithm for distributed student registration system

A dynamic and adaptive scheduling algorithm for distributed ...

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Wen-hao Li Hai-yang Wang Department of Computer Science and Technology Shandong University Ji-nan P.R. China

Distributed workflow scheduling is a hotspot in recent workflow research, it aims to finish the execution in the shortest time and use the system resources sufficiently. In this paper we put forward a pre-calculated scheduling algorithm (PCSA) based on the characters of distributed workflow system. In this algorithm every workflow will be pre-calculated before they are deployed into the workflow engine, analyzing every possible simple path in the flow, each activity will get a sorted execution node ranking, so the workflow instances will always chose the execution node close to the optimal one. In this way the algorithm can make each workflow instance has the minimum execution cost and transport cost. Our experiment indicates that the algorithm has a preferable distributed execute efficiency. This algorithm can fits the need of the student registration system well.

关键词： Adaptive scheduling scheduling algorithm Dynamic scheduling Heuristic algorithms Engines Greedy algorithms Processor scheduling algorithm design and analysis Cost function Testing

来源：评论

学校读者我要写书评

暂无评论

An efficient scheduling algorithm for packet cellular networks

An efficient scheduling algorithm for packet cellular networ...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： H. Fattah C. Leung University of British Columbia Vancouver BC Canada

scheduling algorithms are crucial components for providing quality of service (QoS) guarantees in broadband wireless networks. However, bursty channel errors and location-dependent channel capacity and errors are unique factors in wireless networks that need to be taken into consideration when applying wireline scheduling algorithms to the wireless domain. In this paper, a new scheduling algorithm for packet cellular networks, Wireless Deficit Round Robin (WDRR), is proposed. WDRR is a round robin scheduler that has low implementation complexity and stems its efficiency from its low delay bound, tight fairness index, and almost perfect isolation property. In error-prone channels, the algorithm provides short-term fairness among sessions that perceive a clean channel, long-term fairness among all sessions, ability to meet specified throughput objectives for all sessions, and graceful service degradation among sessions that received excess service. Both analysis and simulation are used to verify the WDRR properties.

关键词： scheduling algorithm Land mobile radio cellular systems Round robin Quality of service Wireless networks Channel capacity Delay Throughput Degradation Analytical models

来源：评论

学校读者我要写书评

暂无评论

On Asymptotic Optimality of Dual scheduling algorithm In A Generalized Switch

On Asymptotic Optimality of Dual Scheduling Algorithm In A G...

引用

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

作者： Lijun Chen S.H. Low J.C. Doyle Engineering & Applied Science Division California Institute of Technology Pasadena CA USA

Generalized switch is a model of a queueing system where parallel servers are interdependent and have time-varying service capabilities. This paper considers the dual scheduling algorithm that uses rate control and queue-length based scheduling to allocate resources for a generalized switch. We consider a saturated system in which each user has in£nite amount of data to be served. We prove the asymptotic optimality of the dual scheduling algorithm for such a system, which says that the vector of average service rates of the scheduling algorithm maximizes some aggregate concave utility functions. As the fairness objectives can be achieved by appropriately choosing utility functions, the asymptotic optimality establishes the fairness properties of the dual scheduling algorithm. The dual scheduling algorithm motivates a new architecture for scheduling, in which an additional queue is introduced to interface the user data queue and the time-varying server and to modulate the scheduling process, so as to achieve different performance objectives. Further research would include scheduling with Quality of Service guarantees with the dual scheduler, and its application and implementation in various versions of the generalized switch model.

关键词： scheduling algorithm Switches Network servers Throughput Base stations Time varying systems Communication switching Wireless networks Interference constraints Packet switching

来源：评论

学校读者我要写书评

暂无评论

A dynamic resource scheduling algorithm for OFDM system

A dynamic resource scheduling algorithm for OFDM system

引用

Asia-Pacific Conference on Communications

作者： Liang Xiao Anchun Wang Shidong Zhou Yan Yao State Key Laboratory on Microwave & Digital Communications Tsinghua University Beijing China

ISBN: (纸本)0780381149

This article presents a practical scheduler algorithm-multiple carrier proportional fairness (MCPF), to dynamically allocate resource for the orthogonal frequency division multiplex (OFDM) system in both frequency and time domain. We analyze its performance on the Doppler fading multipath channel with cocentric system studio and find that the throughput of MCPF is more than 60% greater compared with the fixed scheduling algorithm when there are more than 2 users. This algorithm satisfies proportional fair rule and its throughput performance increases with the number of system user, reaching 100% in 8 users system.

关键词： scheduling algorithm OFDM Throughput Dynamic scheduling Resource management Frequency division multiplexing Radio spectrum management Performance analysis algorithm design and analysis Fading

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 27 28 29 30 31 32 33 34 35 36 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：