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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

10,764 篇 scheduling algor...
4,069 篇 processor schedu...
2,048 篇 delay
1,652 篇 throughput
1,569 篇 algorithm design...
1,380 篇 computer science
1,311 篇 resource managem...
1,305 篇 real time system...
1,298 篇 quality of servi...
1,176 篇 bandwidth
1,091 篇 traffic control
970 篇 job shop schedul...
949 篇 dynamic scheduli...
787 篇 costs
742 篇 telecommunicatio...
698 篇 switches
681 篇 optimal scheduli...
588 篇 application soft...
587 篇 heuristic algori...
526 篇 hardware

机构

40 篇 department of el...
32 篇 department of co...
30 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
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,619 篇 英文
87 篇 其他
58 篇 中文

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

共 10764 条记录，以下是4991-5000 订阅

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

详细简洁

排序：

Low-Overhead Run-Time scheduling for Fine-Grained Acceleration of Signal Processing Systems

Low-Overhead Run-Time Scheduling for Fine-Grained Accelerati...

引用

IEEE Workshop on Signal Processing Systems (SIPS)

作者： Jani Boutellier Shuvra S. Bhattacharyya Olli Silven Machine Vision Group University of Oulu Oulu Finland Department of Electrical and Computer Engineering University of Maryland College Park MD USA

In this paper, we present four scheduling algorithms that provide flexible utilization of fine-grain DSP accelerators with low run-time overhead. Methods that have originally been used in operations research are implemented in a way that minimizes the amount of run-time computations. These low overhead scheduling methods can be used for synchronization in multi-processor systems, especially when dedicated co-processors implement tasks with low turnaround times. We demonstrate our methods by an application to MPEG-4 video decoding. In this demonstration, MPEG-4 macroblock decoding is modeled as a permutation flowshop problem and our proposed algorithms are applied to schedule co-processors that implement MPEG-4 block decoding operations. Experimental results demonstrate the effectiveness of our scheduling approach.

关键词： Runtime Acceleration Signal processing MPEG 4 Standard Decoding Processor scheduling Signal processing algorithms scheduling algorithm Coprocessors Digital signal processing

来源：评论

学校读者我要写书评

暂无评论

Disk I/O mixed scheduling strategy for VoD servers

Disk I/O mixed scheduling strategy for VoD servers

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Hai Jin Jie Xu Bibo Tu Shengli Li Internet and Cluster Computing Center Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)0780377613

Disk I/O scheduling is one of the key issues in designing Video-on-Demand (VoD) servers. For mixed media data requests, disk I/O scheduling algorithms have to satisfy three performance goals: 1) video streams must be continuously played back, so we must guarantee the real-time retrieval of video streams from storage disks; 2) VoD servers save not only video data, but discrete data (non real-time data), so we have to best-effort reduce response time of retrieving non real-time data from storage disks; 3) pursuing the maximum number of concurrent video streams, so we must optimize disk seeking time to improve disk throughout. This paper puts forward a new Disk I/O Mixed scheduling (DIOMS) strategy for VoD servers, which reaches above three goals. Experimental results show DIOMS has good performance.

关键词： scheduling algorithm Streaming media Processor scheduling Delay Bandwidth Mars Web server Information retrieval Round robin Internet

来源：评论

学校读者我要写书评

暂无评论

Throughput performance of quantized proportional fair scheduling with adaptive modulation and coding

Throughput performance of quantized proportional fair schedu...

引用

Wireless Telecommunications Symposium, WTS

作者： Fumio Ishizaki Gang Uk Hwang Department of Systems Design and Engineering Nanzan University Seto Japan Department of Mathematical Sciences and Telecommunication Engineering Program Korea Advanced Institute of Science and Technology Daejeon South Korea

Assuming a logarithmic rate model for SISO (Single-Input Single-Output) systems, the information theoretic capacity under scheduling algorithms exploiting multiuser diversity in wireless networks has been studied so far. However, in many cases, the throughput achieved in real wireless networks is very different from (and is much less than) the information theoretic capacity obtained under the assumption of the logarithmic rate model, and the rate functions in real wireless networks are very different from the logarithmic rate model. Hence, to examine the usefulness of the scheduling algorithms exploiting multiuser diversity in real wireless networks, we should study the throughput performance under more realistic rate function model rather than the information theoretic capacity under the logarithmic rate model. In this paper, we consider a wireless network where QPF (Quantized Proportional Fair) scheduling and AMC (adaptive modulation and coding) scheme are employed. Assuming a realistic rate function of AMC, we then analyze the throughput performance under the QPF scheduling with the AMC scheme. We also provide numerical results to investigate the usefulness of the QPF scheduling with the AMC scheme.

关键词： Throughput Adaptive scheduling Modulation coding Wireless networks scheduling algorithm Quantization Design engineering Performance analysis Downlink Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient scheduling on multi-context FPGAs

Energy-efficient scheduling on multi-context FPGAs

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Nei-Chiung Perng Jian-Jia Chen Chuan-Yue Yang Tei-Wei Kuo Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan ROC

This work is motivated by the needs of energy-efficient designs for multi-context FPGAs. Dynamic-voltage-scaling-based algorithms are proposed to schedule loading and executing of tasks in a multi-context FPGA. When a task partition over contexts is given, two optimal scheduling algorithms are proposed in minimizing the energy consumption and the maximum time span of task executions. When no task partition is given, two approximation algorithms with approximation ratios 2.371 and 1.540 are presented in the energy-consumption minimization and the maximum-time-span minimization, respectively

关键词： Energy efficiency Field programmable gate arrays Optimal scheduling Partitioning algorithms scheduling algorithm Minimization methods Heuristic algorithms Dynamic scheduling Energy consumption Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Challenges in Packet scheduling in 4G Wireless Networks

Challenges in Packet Scheduling in 4G Wireless Networks

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Harri Paloheimo Jukka Manner Johanna Nieminen Antti Yla-Jaaski Nokia Research Center China Helsinki University of Technology Finland

Network information theory states that novel methods, such as, cooperative communication and relaying can increase the overall network transport capacity. These methods are not utilized in current networking technologies. The 3G RAN will not scale up to meet the requirements set for telecommunication in the next decade. We need a novel fourth generation (4G) RAN design. This paper analyses challenges in wireless packet scheduling algorithms for 4G systems and proposes energy efficient scheduling and queue management solutions for the 4G wireless environment. Focus in our work is kept on a relay networking scenarios, which comprise of operator managed RAN including relays together with user controlled mobile routers

关键词： scheduling algorithm Wireless networks Relays Radio access networks Information theory algorithm design and analysis Energy efficiency Queueing analysis Energy management Environmental management

来源：评论

学校读者我要写书评

暂无评论

Mapping complex timing constraints to simple real-time scheduling parameters

Mapping complex timing constraints to simple real-time sched...

引用

International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Damir Isovic Radu Dobrin Mälardalen Real Time Research Centre Mälardalen University Vasteras Sweden

In this paper, we propose a novel approach for flexible representation of complex timing constraints for scheduling real-time tasks under different scheduling paradigms. It allows different instantiations of the task attributes, depending on which underlying scheduling policy is used. scheduling parameters are flexibly derived from original timing constrains, rather than using the same set of task attributes for all schedulers. For each real-time task in the system, temporal feasibility windows are identified, such that if the task executes and completes within its feasibility window, the original timing constraints will be met. Then, scheduler dependent parameters are derived to guarantee the tasks' execution and completion within their feasibility windows.

关键词： Timing Real time systems Job shop scheduling scheduling algorithm Optimization

来源：评论

学校读者我要写书评

暂无评论

Feedback scheduling for resource-constrained real-time control systems

Feedback scheduling for resource-constrained real-time contr...

引用

International Conference on Computer and Information Technology (CIT)

作者： Pingfang Zhou Jianying Xie Department of Automation Shanghai Jiaotong University Shanghai China

ISBN: (纸本)076952432X

Subject to limited computational resource, feedback scheduling aims to improve, or to optimize, the global control performance of real-time control systems. For the system that consists of simple control tasks, a feedback scheduling scheme is presented to shorten tasks' deadlines online as much as possible, so as to reduce jitter and to improve the performance. For the system that consists of complex control tasks, another feedback scheduling scheme is presented to adjust the reserved processor time for each task dynamically, and thus to optimize the performance, if these tasks can be implemented as anytime algorithm. The general feedback scheduling architecture is introduced. The control strategy in both schemes is model predictive control. The designs of feedback controllers are discussed. And the stability conditions are also analyzed.

关键词： Feedback Real time systems Control systems Processor scheduling Jitter Dynamic scheduling scheduling algorithm Predictive models Predictive control Adaptive control

来源：评论

学校读者我要写书评

暂无评论

scheduling video recording to minimize distance-jitter for surveillance systems

Scheduling video recording to minimize distance-jitter for s...

引用

IEEE International Symposium on Consumer Electronics (ISCE)

作者： Kuan Jen Lin Wei Jen Chen Wan Te Hsiao Department of Electronic Engineering Fu Jen Catholic University Taipei Taiwan

Due to the limit of storage capacity and processor speed, only a subset of frames from each channel can be recorded in a multi-channel video surveillance system. Each channel may have different recording frame rate. It is required that the recorded frames from the same channel should have equal temporal distance between any two consecutive frames. In this paper, we define cost functions to evaluate the schedule quality. The scheduling problem which minimizes distance jitter and meets real time requirement will be formulated as a zero-one integer linear programming problem. Then an efficient list scheduling algorithm modified from the EDF algorithm will be proposed. Experimental result will show that our algorithm can get better results than the EDF algorithm.

关键词： Video recording Surveillance Jitter Optimal scheduling Cameras Cost function scheduling algorithm Integer linear programming Displays Video compression

来源：评论

学校读者我要写书评

暂无评论

scheduling Temporal Partitions in a Multiprocessing Paradigm for Reconfigurable Architectures

Scheduling Temporal Partitions in a Multiprocessing Paradigm...

引用

NASA/ESA Conference on Adaptive Hardware and Systems (AHS)

作者： Andreas Popp Yannick Le Moullec Peter Koch Center for Software Defined Radio & Technology Platforms Section Department of Electronic Systems University of Aalborg Aalborg Denmark

In this paper we describe a mapping methodology for heterogeneous reconfigurable architectures consisting of one or more SW processors and one or more reconfigurable units, FPGAs. The mapping methodology consists of a separated track for a) the generation of the configurations for the FPGA by level-based and clustering-based temporal partitioning, and b) the scheduling of those configurations as well as the software tasks, based on two multiprocessor scheduling algorithms: a simple list-based scheduler and the more complex extended dynamic level scheduling algorithm. The mapping methodology is benchmarked by means of randomly created task graphs on an architecture of one SW processor and one FPGA. The results are compared to a 0-1 integer linear programming solution in terms of exploration time as well as the finish-time of all tasks of the application. The results show that, in 90% of the investigated cases, the combination of level-based temporal partitioning and extended dynamic level scheduling gives the best performance in terms of finish-time of the full task-set.

关键词： Reconfigurable architectures Processor scheduling Field programmable gate arrays Dynamic scheduling scheduling algorithm Clustering algorithms Partitioning algorithms Software algorithms Computer architecture Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Fast scheduling for optical packet switches with minimum configurations

Fast scheduling for optical packet switches with minimum con...

引用

IEEE Workshop on High Performance Switching and Routing

作者： Zhen Zhou Xin Li M. Hamdi Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

scheduling optical packet switches with minimum configurations has been proven to be NP-complete. Moreover, an optimal scheduling algorithm produce as many as /spl theta/(log N) empty slots in each switching per time slot for an N /spl times/ N optical switch. The best known algorithm approximates the optimal solution in O (N/sup 3.5/) time. In this paper, we propose an algorithm called DNC with minimal time complexity /spl theta/(N/sup 2/) based on divide-and-conquer paradigm. The number of empty slots created by our algorithm is upper bounded by /spl theta/(N). However, simulation results indicate that it is approximately O(log N) on average. Therefore, our algorithm is more practical and beats the previous ones when optical switches have large reconfiguration overhead.

关键词： Optical packet switching Optical switches Optimal scheduling scheduling algorithm Fabrics Optical waveguides Delay effects Traffic control Processor scheduling Computer science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：