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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,788 篇 会议
1,804 篇 期刊文献
5 篇 学位论文
1 册 图书

馆藏范围

8,598 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,416 篇 工学
- 3,905 篇 计算机科学与技术...
- 1,645 篇 信息与通信工程
- 1,603 篇 软件工程
- 1,519 篇 电气工程
- 588 篇 控制科学与工程
- 342 篇 电子科学与技术（可...
- 308 篇 机械工程
- 194 篇 动力工程及工程热...
- 189 篇 交通运输工程
- 116 篇 仪器科学与技术
- 81 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 48 篇 土木工程
- 46 篇 安全科学与工程
- 42 篇 建筑学
- 39 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,885 篇 管理学
- 1,765 篇 管理科学与工程(可...
- 1,434 篇 工商管理
- 223 篇 图书情报与档案管...
1,776 篇 理学
- 1,456 篇 数学
- 224 篇 系统科学
- 199 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
37 篇 农学
27 篇 教育学
25 篇 文学
5 篇 艺术学
2 篇 军事学

主题

8,598 篇 scheduling algor...
1,052 篇 scheduling
569 篇 schedules
528 篇 resource managem...
520 篇 real-time system...
475 篇 cloud computing
444 篇 throughput
427 篇 heuristic algori...
392 篇 quality of servi...
379 篇 delays
311 篇 dynamic scheduli...
307 篇 task analysis
306 篇 optimization
262 篇 computational mo...
229 篇 simulation
218 篇 energy consumpti...
209 篇 bandwidth
205 篇 job shop schedul...
200 篇 servers
194 篇 algorithm design...

机构

26 篇 beijing universi...
24 篇 state key labora...
21 篇 university of ch...
18 篇 national mobile ...
15 篇 institute of com...
13 篇 hong kong polyte...
13 篇 purple mountain ...
12 篇 northeastern uni...
12 篇 college of compu...
11 篇 shanghai jiao to...
10 篇 college of compu...
10 篇 sun yat sen univ...
10 篇 georgia state un...
10 篇 school of softwa...
10 篇 university of el...
10 篇 scuola super san...
9 篇 tsinghua univers...
9 篇 school of electr...
9 篇 college of compu...
9 篇 department of el...

作者

21 篇 ghaderi javad
16 篇 baruah sanjoy
15 篇 guan nan
13 篇 yi wang
13 篇 gao hong
11 篇 anderson james h...
11 篇 xie zhiqiang
11 篇 buyya rajkumar
11 篇 wang yi
10 篇 wei hu
10 篇 wang wei
10 篇 zhang jie
10 篇 jing liu
9 篇 zhang lei
9 篇 deng qingxu
9 篇 ying lei
9 篇 guo song
9 篇 hsu yu-pin
9 篇 li bo
9 篇 shakkottai sanja...

语言

8,238 篇 英文
271 篇 其他
87 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

检索条件"主题词=scheduling algorithms"

共 8598 条记录，以下是4421-4430 订阅

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

详细简洁

排序：

Analysis of Channel Estimation in Mobile Communication Systems with Users Moving at Various Speeds 24

Analysis of Channel Estimation in Mobile Communication Syste...

引用

24th Wireless and Optical Communication Conference (WOCC)

作者： Feng, Cheng Chen, Yingyang Cui, Hongyu Ma, Meng Jiao, Bingli Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China

ISBN: (纸本)9781479988549

In order to provide a reliable reception and decrease the packet retransmission, the wireless communication system should guaranty the accuracy of channel estimation. This implies that the channel estimation mean-square error (MSE) of the mobile terminals with various speeds should remain lower than a threshold. This usually causes higher pilot overhead in terms of more bandwidth and transmit power. In this paper, a commonly used time multiplexing pilot pattern is reconsidered from a different point of view in contrast with the previous studies. In a frame, the intervals between each data time slot and the nearest pilot time slot are different, and thus the tracking abilities of each data time slot are also different. Therefore, a system is able to support a number of levels of users' moving speed, even though using a fixed pilot pattern. In order to analyze the tracking ability of each time slot, the MSE for two interpolation methods, i.e., linear minimum MSE and linear interpolation, is derived. Based on the derived analytical results, a novel criterion for pilot spacing design is presented, and a novel scheduling algorithm based on user moving speeds is also proposed. Simulation results show that the proposed pilot design and scheduling algorithm can achieve significant performance improvement.

关键词： Channel estimation Time varying channel scheduling algorithms Pilot

来源：评论

学校读者我要写书评

暂无评论

Sparsity-Promoting Sensor Management for Estimation: An Energy Balance Point of View 18

Sparsity-Promoting Sensor Management for Estimation: An Ener...

引用

18th International Conference on Information Fusion (Fusion)

作者： Liu, Sijia Chen, Feishe Vempaty, Aditya Fardad, Makan Shen, Lixin Varshney, Pramod K. Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA Syracuse Univ Dept Math Syracuse NY 13244 USA

ISBN: (纸本)9780982443866

In the context of parameter estimation, we study the problem of sensor management under a sparsity-promoting framework, where a sensor being off at a certain time instant is represented by the corresponding column of the estimator coefficient matrix being identically zero. In order to achieve a balance between activating the most informative sensors and uniformly allocating sensor energy, we propose a novel sparsity-promoting approach by adding an l(2)-norm penalty function that discourages successive selections of the same group of sensors. We employ the alternating direction method of multipliers (ADMM) to solve the resulting l(2)-norm optimization problem, which can then be split into a sequence of analytically solvable subproblems. We finally provide numerical results and comparison with other sensor scheduling algorithms in the literature to demonstrate the effectiveness of our approach.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Resource Provision for Batch and Interactive Workloads in Data Centers 21

Resource Provision for Batch and Interactive Workloads in Da...

引用

21st IEEE International Conference on Parallel and Distributed Systems ICPADS

作者： Chang, Ting-Wei Lin, Ching-Chi Liu, Pangfeng Wu, Jan-Jan Shih, Chia-Chun Huang, Chao-Wen Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei Taiwan Natl Taiwan Univ Grad Inst Networking & Multimedia Taipei Taiwan Chunghwa Telecom Labs Taoyuan Taiwan Acad Sinica Inst Informat Sci Taipei Taiwan

ISBN: (纸本)9780769557854

In this paper we describe a scheduling framework that allocates resources to both batch jobs and interactive jobs simultaneously in a private cloud with a static amount of resources. In the system, every job has an individual service level agreement (SLA), and violating the SLA incurs penalty. We propose a model to formally quantify the SLA violation penalty of both batch and interactive jobs. The analysis on the interactive jobs focuses on queuing analysis and response time. The analysis on batch jobs focuses on the non-preemptive job scheduling for multiple processing units. Based on this model we also propose algorithms to estimate the penalty for both batch jobs and interactive jobs, and algorithms that reduce the total SLA violation penalty. Our experiment results suggest that our system effectively reduces the total penalty by allocating the right amount of resources to heterogeneous jobs in a private cloud system.

关键词： scheduling algorithms Client-sever systems Parallel processing Multiprocessing systems Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Real-time Streaming with Millisecond Granularity 40

Real-time Streaming with Millisecond Granularity

引用

IEEE LCN Local Computer Networks Conference on 40th Annual IEEE Conference on Local Computer Networks (LCN 2015)

作者： Ofner, Simon Frank, Matthias Fraunhofer FKIE Friedrich Ebert Allee 144 D-53113 Bonn Germany Univ Bonn Inst Comp Sci 4 Laser & Light Lab D-53113 Bonn Germany

We investigate the conditions for streaming real-time laser data with commercial off-the-shelf hard-and software. We design scheduling algorithms to work around the identified limitations. We run end-to-end tests of o... 详细信息

ISBN: (纸本)9781467367707

关键词： Local area networks UDP Multimedia & real-time streaming scheduling algorithms End-to-end analysis

来源：评论

学校读者我要写书评

暂无评论

Boundary lines between Permutation Flowshop Problems and Single Machine Problems

Boundary lines between Permutation Flowshop Problems and Sin...

引用

International Conference on Industrial Engineering and Systems Management

作者： Fernandez-Viagas, Victor Framinan, Jose M. Univ Seville Sch Engn Ind Management Ave Descubrimientos S-N Seville 41092 Spain

ISBN: (纸本)9782960053265

The permutation flowshop scheduling and the single machine scheduling problems are two classical problems in the scheduling literature. Since the former is known to be NP-hard for more than two machines, hundreds of algorithms have been implemented in the last decades to solve it. Furthermore, several computational studies have found that the permutation flowshop to minimise makespan is easily solvable for structured (i.e. processing times are job-and/or machine-correlated) instances and when the initial availability of all machines for processing jobs cannot be assumed. Our working hypothesis to explain this behaviour is that, under certain conditions of machine availability or structured processing times, only one stage in the flowshop layout determines the optimal sequence, approximately transforming the flowshop scheduling problem into a single machine scheduling problem. Since the single machine scheduling problem with makespan objective is a trivial problem where all feasible sequences are optimal, such transformation may explain why it is so easy to find good solutions for such flowshop scheduling problems. Therefore, the goal of this paper is to study under which assumptions a permutation flowshop scheduling problem can be reduced to a single machine scheduling problem. More specifically, we focus onto the two most common objectives in the literature (i. e. makespan and total flowtime). Our work is a combination of theoretical and computational analysis, therefore several properties are derived, together with an extensive computational evaluation.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Timing Characterization of OpenMP4 Tasking Model

Timing Characterization of OpenMP4 Tasking Model

引用

International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES)

作者： Serrano, Maria A. Melani, Alessandra Vargas, Roberto Marongiu, Andrea Bertogna, Marko Quinones, Eduardo Tech Univ Catalonia Barcelona Spain Barcelona Supercomp Barcelona Spain Scuola Super Sant Anna Pisa Italy Swiss Fed Inst Technol Zurich Switzerland Univ Modena & Reggio Emilia Modena Italy

ISBN: (纸本)9781467383202

OpenMP is increasingly being supported by the newest high-end embedded many-core processors. Despite the lack of any notion of real-time execution, the latest specification of OpenMP (v4.0) introduces a tasking model that resembles the way real-time embedded applications are modeled and designed, i.e., as a set of periodic task graphs. This makes OpenMP4 a convenient candidate to be adopted in future real-time systems. However, OpenMP4 incorporates as well features to guarantee backward compatibility with previous versions that limit its practical usability in real-time systems. The most notable example is the distinction between tied and untied tasks. Tied tasks force all parts of a task to be executed on the same thread that started the execution, whereas a suspended untied task is allowed to resume execution on a different thread. Moreover, tied tasks are forbidden to be scheduled in threads in which other non-descendant tied tasks are suspended. As a result, the execution model of tied tasks, which is the default model in OpenMP to simplify the coexistence with legacy constructs, clearly restricts the performance and has serious implications on the response time analysis of OpenMP4 applications, making difficult to adopt it in real-time environments. In this paper, we revisit OpenMP design choices, introducing timing predictability as a new and key metric of interest. Our first results confirm that even if tied tasks can be timing analyzed, the quality of the analysis is much worse than with untied tasks. We thus reason about the benefits of using untied tasks, deriving a response time analysis for this model, and so allowing OpenMP4 untied model to be applied to real-time systems.

关键词： embedded systems message passing open systems OpenMP4 tasking model backward compatibility high-end embedded many-core processors real-time systems response time analysis timing characterization Analytical models Force Programming Real-time systems scheduling algorithms Synchronization real-time systems backward compatibility time series analysis scheduling algorithms Religious Missions message passing ANALYSIS MODELS open systems Embedded systems Programming Force Legal Executions THREADS

来源：评论

学校读者我要写书评

暂无评论

Overhead-aware schedulability evaluation of semi-partitioned real-time schedulers 21

Overhead-aware schedulability evaluation of semi-partitioned...

引用

21st IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Souto, Pedro Sousa, Paulo Baltarejo Davis, Robert I. Bletsas, Konstantinos Tovar, Eduardo CISTER INESC TEC Res Ctr Oporto Portugal ISEP Polytech Inst Porto Oporto Portugal Univ Porto FEUP Fac Engn P-4100 Oporto Portugal Univ York York YO10 5DD N Yorkshire England

ISBN: (纸本)9781467378550

Schedulability analyses, while valuable in theoretical research, cannot be used in practice to reason about the timing behaviour of a real-time system without including the overheads induced by the implementation of the scheduling algorithm. In this paper, we provide an overhead-aware schedulability analysis based on demand bound functions for two hard real-time semi-partitioned scheduling algorithms, EDFWM- and C=D. This analysis is based on a novel implementation that uses a global clock to reduce the overheads incurred due to the release jitter of migrating subtasks. The analysis is used to guide the respective off-line task assignment and splitting procedures. Finally, results of an evaluation are provided highlighting how the different algorithms perform with and without a consideration of overheads.

关键词： global clock real-time systems scheduling algorithms time characteristic hard real-time Jitter OFF LINE

来源：评论

学校读者我要写书评

暂无评论

Development of an unmanned helicopter automatic barrels transportation system

Development of an unmanned helicopter automatic barrels tran...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Wu, Chong Qi, Juntong Song, Dalei Qi, Xin Lin, Tianyu Han, Jianda Univ Chinese Acad Sci Beijing Peoples R China Chinese Acad Sci Shenyang Inst Automat State Key Lab Robot Shenyang 110016 Liaoning Provin Peoples R China

ISBN: (纸本)9781479969234

In the 2nd International Unmanned Aerial Vehicle (UAV) Innovation Grand Prix (UAVGP) sponsored by Aviation Industry Corporation of China (AVIC), an autonomous barrel transportation mission was proposed for Rotary-wing UAV (RUAV) which aims at validating the feasibility of marine vertical replenishment by RUAVs. The RUAV was supposed to track the movable platform, pick up barrels on the supplier platform, stack barrels on the replenishment platform, take off and land autonomously without any human interference. The final score was determined based on the mission completion time and the stacking accuracy. The main challenges involved in this mission include attitude stabilizing with varying payload, accurate movable platform tracking and task-scheduling. An unmanned helicopter (UH) automatic barrels transportation system was established by our team, and the navigation system, control system and task scheduling system will be detailed in this paper, along with the flight tests before and in the competition. The system's performance has been verified in the competition and won the first prize finally.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Platform and Co-runner Affinities for Many-Task Applications in Distributed Computing Platforms 15

Platform and Co-runner Affinities for Many-Task Applications...

引用

2015 15th IEEE ACM International Symposium on Cluster Cloud and Grid Computing (CCGrid 2015)

作者： Kim, Seontae Hwang, Eunji Yoo, Tae-kyung Kim, Jik-Soo Hwang, Soonwook Choi, Young-ri UNIST Sch Elect & Comp Engn Ulsan South Korea KISTI Natl Inst Supercomp & Networking Daejeon South Korea

ISBN: (纸本)9781479980062

Recent emerging applications from a wide range of scientific domains often require a very large number of loosely coupled tasks to be efficiently processed. To support such applications effectively, all the available resources from different types of computing platforms such as supercomputers, grids, and clouds need to be utilized. However, exploiting heterogeneous resources from the platforms for multiple loosely coupled many-task applications is challenging, since the performance of an application can vary significantly depending on which platform is used to run it, and which applications co-run in the same node with it. In this paper, we analyze the platform and co-runner affinities of many-task applications in distributed computing platforms. We perform a comprehensive experimental study using four different platforms, and five many-task applications. We then present a two-level scheduling algorithm, which distributes the resources of different platforms to each application based on the platform affinity in the first level, and maps tasks of the applications to computing nodes based on the co-runner affinity for each platform in the second level. Finally, we evaluate the performance of our scheduling algorithm, using a trace-based simulator. Our simulation results demonstrate that our scheduling algorithm can improve the performance up to 30.0%, compared to a baseline scheduling algorithm.

关键词： Platform affinity Co-runner affinity Many-task applications Performance analysis Distributed computing platforms scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Mimer and Schedeval: Tools for Comparing Static Schedulers for Streaming Applications on Manycore Architectures 44

Mimer and Schedeval: Tools for Comparing Static Schedulers f...

引用

44th Annual International Conference on Parallel Processing Workshops (ICPPW)

作者： Melot, Nicolas Janzen, Johan Kessler, Christoph Linkoping Univ Linkoping Sweden Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781467375894

scheduling algorithms published in the scientific literature are often difficult to evaluate or compare due to differences between the experimental evaluations in any two papers on the topic. Very few researchers share the details about the scheduling problem instances they use in their evaluation section, the code that allows them to transform the numbers they collect into the results and graphs they show, nor the raw data produced in their experiments. Also, many scheduling algorithms published are not tested against a real processor architecture to evaluate their efficiency in a realistic setting. In this paper, we describe Mimer, a modular evaluation tool-chain for static schedulers that enables the sharing of evaluation and analysis tools employed to elaborate scheduling papers. We propose Schedeval that integrates into Mimer to evaluate static schedules of streaming applications under throughput constraints on actual target execution platforms. We evaluate the performance of Schedeval at running streaming applications on the Intel Single-Chip Cloud computer (SCC), and we demonstrate the usefulness of our tool-chain to compare existing scheduling algorithms. We conclude that Mimer and Schedeval are useful tools to study static scheduling and to observe the behavior of streaming applications when running on manycore architectures.

关键词： Benchmark testing Energy consumption Processor scheduling Schedules Switches Throughput Time-frequency analysis benchmark crown scheduling energy frequency many-core scaling scc scheduling streaming voltage Benchmark testing scheduling of multiprocessor Streaming Time frequency analysis Throughput scheduling algorithms Switches energy consumption BENCHMARKS Stress corrosion cracking Scale formation VOLTAGE Scaling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 439 440 441 442 443 444 445 446 447 448 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：