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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,403 篇 工学
- 3,895 篇 计算机科学与技术...
- 1,641 篇 信息与通信工程
- 1,589 篇 软件工程
- 1,518 篇 电气工程
- 588 篇 控制科学与工程
- 342 篇 电子科学与技术（可...
- 307 篇 机械工程
- 194 篇 动力工程及工程热...
- 187 篇 交通运输工程
- 115 篇 仪器科学与技术
- 80 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 48 篇 土木工程
- 46 篇 安全科学与工程
- 42 篇 建筑学
- 39 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,882 篇 管理学
- 1,763 篇 管理科学与工程(可...
- 1,432 篇 工商管理
- 222 篇 图书情报与档案管...
1,755 篇 理学
- 1,436 篇 数学
- 224 篇 系统科学
- 199 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
37 篇 农学
27 篇 教育学
25 篇 文学
5 篇 艺术学
2 篇 军事学

主题

8,575 篇 scheduling algor...
1,052 篇 scheduling
569 篇 schedules
526 篇 resource managem...
520 篇 real-time system...
474 篇 cloud computing
443 篇 throughput
425 篇 heuristic algori...
392 篇 quality of servi...
379 篇 delays
309 篇 dynamic scheduli...
307 篇 task analysis
305 篇 optimization
262 篇 computational mo...
229 篇 simulation
217 篇 energy consumpti...
208 篇 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 篇 school of electr...
9 篇 college of compu...
9 篇 department of el...
9 篇 college of compu...

作者

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,321 篇 英文
165 篇 其他
81 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8575 条记录，以下是4471-4480 订阅

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

详细简洁

排序：

Multi-thread Connection Based scheduling Algorithm for Network on Chip

Multi-thread Connection Based Scheduling Algorithm for Netwo...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Jia Tian Wei Hu Chunqiang Li Tianpei Li Wenjun Luo Wuhan University of Science and Technology Wuhan Hubei CN

More and more cores are integrated onto a single chip to improve the performance and reduce the power consumption of CPU without the increased frequency. The core are connected by lines and organized as a network, which is called network on chip (NOC) as the promising paradigm. NOC has improved the performance of the CPU without the increased power consumption. However, there is still a new problem that how to schedule the threads to the different cores to take full advantages of NOC. In this paper, we proposed a new multi-thread scheduling algorithm based on thread connection for NOC. The connection relationship of the threads will be analyzed and divided into different thread sets. And at the same time, the network topology of the NOC is also analyzed. The connection relationship of the cores is set in the NOC model and divided into different regions. The thread sets and core regions will be establish correspondence relationship according to the features of them. And the multi-thread scheduling algorithm will map thread sets to the corresponding core regions. In the same core set, the threads in the same set will be scheduled via different proper approaches. The experiments have showed that the proposed algorithm can improve the performance of the programs and enhance the utilization of NOC cores.

关键词： Instruction sets System-on-chip scheduling algorithms Multicore processing Algorithm design and analysis Heuristic algorithms Network topology

来源：评论

学校读者我要写书评

暂无评论

On the universality of age-based scheduling in wireless networks

On the universality of age-based scheduling in wireless netw...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Bin Li Atilla Eryilmaz R. Srikant Coordinated Science Lab University of Illinois at Urbana-Champaign Urbana IL USA Department of ECE The Ohio State University Columbus OH USA Department of ECE University of Illinois at Urbana-Champaign Urbana IL USA

It is well-known that maximum weight scheduling, with link weights which are either functions of queue lengths or the ages of the Head-of-Line (HoL) packets in each queue, maximizes the throughput region of wireless networks with persistent flows. In particular, with only persistent flows, it does not matter for throughput optimality whether one uses queue lengths or HoL ages as weights. In this paper, we show the following interesting result: when some flows in the network are dynamic (i.e., they arrive and depart from the network and are not persistent), then HoL-age-based scheduling algorithms are throughput-optimal while it has previously been shown that queue-length-based algorithms are not. This reveals that, age-based algorithms are universal in the sense that their throughput optimality does not depend on whether the arriving traffic is persistent or not. We also present a distributed implementation of the proposed age-based algorithm using CSMA techniques, where each flow only knows its own age and carrier sensing information. Finally, we support our analytical results through simulations. The proof of throughput optimality may be interesting in its own right: it uses a novel Lyapunov function which is the sum of the ages of all the packets in the network.

关键词： Heuristic algorithms Dynamic scheduling Throughput Wireless networks scheduling algorithms Multiaccess communication Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

A survey on packet scheduling over DVB-S2 through GSE encapsulation

A survey on packet scheduling over DVB-S2 through GSE encaps...

引用

International Conference on Wireless Networks and Mobile Communications (WINCOM)

作者： Youness Arjoune Ahmed Tamtaoui Hassan El Ghazi Lahoucine Ballihi INPT Rabat Instituts Morocco LRIT Unit Associe au CNRST (URAC 29) Faculty of Sciences Rabat Mohammed V-Agdal University Rabat Instituts Morocco

ISBN: (纸本)9781467382250

A key features of the second generation for video broadcasting (DVB-S2) is the adoption of Adaptive Coding and Modulation (ACM) technology and Generic Stream Encapsulation (GSE) standards. In order to increase the system performance up to the Shannon limit a suitable resource management (RRM) exploiting this key features is a needed. Packet scheduling mechanisms particularly play a fundamental role to guarantee a better RRM, because they are responsible for choosing, with a fine time how to distribute the satellite resources among different terrestrial stations, taking into account channel condition and the quality-of-service requirements. This goal should be accomplish by providing, at the same time, an optimal trade-off between spectral efficiency, given the limited resources on satellite systems, while granting the requirements for quality-of-service. In this context, this paper provides an overview on the key issues that arise with the use of ACM technology and GSE encapsulation in the design of a scheduler to allocate satellite resources. Moreover, a survey on the most recent scheduling techniques is reported, including a comparison between different approaches presented in literature.

关键词： Quality of service Satellites Digital video broadcasting scheduling algorithms Encapsulation Modulation Resource management

来源：评论

学校读者我要写书评

暂无评论

Adaptive packets scheduling method for energy harvesting relay with receiver energy consumption

Adaptive packets scheduling method for energy harvesting rel...

引用

International Conference on Information, Communications and Signal Processing

作者： Zhaojie Sun Lilin Dan Yue Xiao Peibo Wen Shaoqian Li Xiaojie Wen National Key Laboratory of Science and Technology Communications University of Electronic Science and Technology of China Chengdu China National Mobile Communications Research Laboratory Southeast University Space Star Technology CO. Ltd.

In this paper, we investigate the throughput maximizing problem for a classic three-node relay communication system with a receive-and-forward relay node, which is able to harvest energy from the nature using a rechargeable battery. Besides of the energy consumption for reforwarding the received data, the energy for receiving data at the relay node is also considered. The objective is to maximize the relaying throughput, i.e., receive-and-forward data amount with the energy causality constraints. To this end, we optimize the constituent power allocation for receiving and transmitting under a deterministic energy harvesting (EH) model that the energy arrival time and the energy harvested amount are known prior to relaying. Finally, an algorithm to find the optimal power policy within the constraint of transmission deadline is presented.

关键词： Relays Resource management Throughput Wireless communication scheduling algorithms Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Efficient scheduling for minimum latency aggregation in wireless sensor networks

Efficient scheduling for minimum latency aggregation in wire...

引用

IEEE Conference on Wireless Communications and Networking

作者： Jonathan Gagnon Lata Narayanan Department of Comp. Sci. and Soft. Eng Concordia University Montreal Quebec Canada

ISBN: (纸本)9781479984077

An important application for sensor networks is to collect data sensed from the environment and send it to a data collection point or a sink node using a convergecast tree. Considerable savings in energy can be obtained by aggregating data at intermediate nodes along the way to the sink. We study the problem of finding a minimum latency aggregation tree and transmission schedule in wireless sensor networks. This problem is referred to as Minimum Latency Aggregation scheduling (MLAS) in the literature and has been proven to be NP-Complete. We present a new algorithm for building an aggregation tree. Furthermore, we propose two new approaches for building a TDMA transmission schedule to perform aggregation on a given tree. We evaluate the performance of our algorithms through extensive simulations on randomly generated graphs and we compare them to the previous state of the art. Our results show that both our new scheduling algorithms when combined with our new tree-building algorithm obtain significantly lower latencies than that of the previous best algorithm.

关键词： Schedules scheduling algorithms Wires Algorithm design and analysis Buildings Wireless sensor networks Interference

来源：评论

学校读者我要写书评

暂无评论

Performance Modelling of Preemption-Based Packet scheduling for Data Plane in Software Defined Networks

Performance Modelling of Preemption-Based Packet Scheduling ...

引用

IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)

作者： Wang Miao Geyong Min Yulei Wu Haozhe Wang College of Engineering University of Exeter UK

Software Defined Networking (SDN) is an emerging key innovative technology towards next-generation Internet. Through decoupling the control plane from the data forwarding plane, SDN is able to significantly simplify network management and accelerate flexible deployment. Many research efforts have recently been devoted to improving the performance of SDN. The majority of them, however, have focused on exploring the capacity of the logically centralised controllers in the control plane, but pay less attention to quantitatively investigating the performance of the underlying data plane. In order to fill this gap, this paper presents a preemption-based packet-scheduling scheme to improve the global fairness and reduce the packet loss rate in SDN data plane. Furthermore, an analytical model is developed to quantitatively evaluate this scheduling scheme and pinpoint the performance bottleneck in the SDN architecture. Both theoretical analysis and simulation experiments are conducted to demonstrate that this preemption-based scheduling scheme can achieve the better system performance compared to the traditional data plane packet scheduling in terms of global fairness index and packet loss probability.

关键词： Switches Analytical models Uplink scheduling algorithms Process control Servers

来源：评论

学校读者我要写书评

暂无评论

A SURVEY: Duty cycle based routing and scheduling in wireless sensor networks

A SURVEY: Duty cycle based routing and scheduling in wireles...

引用

International Conference on Electronics and Communication Systems (ICECS)

作者： R. Nithya N. Mahendran M.E-Communication Systems M. Kumarasamy College of Engineering Karur India M Kumarasamy College of Engineering Karur Tamil Nadu IN

Wireless sensor networks consist of spatially distributed sensor nodes, which can sense the environment by collecting, processing and transmitting the data to sink node. A critical issue in wireless sensor networks since most sensors is equipped with non-rechargeable batteries. The lifetime of a sensor network can be extended by jointly applying different techniques of scheduling and routing schemes also brings great challenges to the design of efficient distributed routing protocols for multi-hop wireless sensor networks. In scheduling algorithms, the nodes are arranged to sleep when they are not in use. The main purpose of scheduling algorithms is to minimize resource starvation and to ensure fairness amongst the parties utilizing the resources. The routing can be applied to wireless sensor networks for reducing energy consumption caused by retransmissions and dynamically detouring critical sensor nodes with less energy. To achieve network lifetime maximization of wireless sensor network through joint routing schemes and scheduling algorithms. This paper surveys the latest progresses in scheduling and routing schemes.

关键词： Wireless sensor networks Routing Wireless communication Delays Routing protocols scheduling algorithms Monitoring

来源：评论

学校读者我要写书评

暂无评论

An Improved Upper-Bound Algorithm for Non-preemptive Task scheduling

An Improved Upper-Bound Algorithm for Non-preemptive Task Sc...

引用

International Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Stefan Andrei Albert M. K. Cheng Vlad Radulescu Department of Computer Science Lamar University Beaumont TX USA Computer Science Department University of Houston Houston TX USA Department of Computer Science A. I. Cuza University of Iaşi Iaşi Romania

One of the core problems in real-time systems, finding a feasible schedule for a certain task set, is subject to alternative solutions given the various system constraints. While preemptive scheduling has benefited from a large number of significant results, the non-preemptive case has still room for improvement. This paper extends our previous results regarding the minimum number of processors required for getting a feasible schedule and the possible ways of improving the well known traditional scheduling algorithms in the case of non-preemptive, single-instance, multiprocessor systems. The improvements refer to handling the situations when the already determined minimum number of processors proves insufficient, and also to extending an existing technique which allows the algorithm to overcome certain stalling situations.

关键词： Program processors Schedules scheduling Upper bound scheduling algorithms Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Schedulability and optimization analysis for non-preemptive static priority scheduling based on task utilization and blocking factors

Schedulability and optimization analysis for non-preemptive ...

引用

Euromicro Conference on Real-Time Systems

作者： Georg Brüggen Jian-Jia Chen Wen-Hung Huang Department of Informatics TU Dortmund University Germany

For real time task sets, allowing preemption is often considered to be important to ensure the schedulability, as it allows high-priority tasks to be allocated to the processor nearly immediately. However, preemptive scheduling also introduces some additional overhead and may not be allowed for some hardware components, which motivates the needs of non-preemptive or limited-preemptive scheduling. We present a safe sufficient schedulability test for non-preemptive (NP) fixed priority scheduling that can verify the schedulability for Deadline Monotonic (DM-NP) and Rate Monotonic (RM-NP) scheduling in linear time, if task orders according to priority and period are given. This test leads to a better upper bound on the speedup factor for DM-NP and RM-NP in comparison to Earliest Deadline First (EDF-NP) than previously known, closing the gab between lower and upper bound. We improve our test, resulting in interesting properties of the blocking time that allow to determine schedulability by only considering the schedulability of the preemptive case if some conditions are met. Furthermore, we present a utilization bound for RM-NP, based on the ratio γ > 0 of the upper bound of the maximum blocking time to the execution time, significantly improving previous results.

关键词： Optimal scheduling Upper bound scheduling algorithms Real-time systems Dynamic scheduling Time factors

来源：评论

学校读者我要写书评

暂无评论

Workflow scheduling on distributed systems

Workflow scheduling on distributed systems

引用

IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Maslina Abdul Aziz Jemal Abawajy Rafiqul Islam Tutut Herawan School of Information Technology Deakin University Australia School of Computing and Mathematics Charles Sturt University Australia Department of Information Systems University of Malaya Malaysia

Growing evidence shows that in obtaining high performance, a well-managed time-constrained workflow scheduling is needed. Efficient workflow scheduling is critical for achieving high performance especially in heterogeneous computing system. However, it is a great challenge to improve performance and to optimize several objectives simultaneously. We propose a workflow scheduling algorithm that minimizes the makespan of the workflow application modeled by a Directed Acyclic Graph (DAG). The new proposed scheduling algorithm is named Multi Dependency Joint (MDJ) Algorithm. The performance of MDJ is compared with existing algorithms such as, Highest Level First with Estimated Time (HLFET), Modified Critical Path (MCP) and Earliest Time First (ETF). As a result, the experiments show that our proposed MDJ algorithm outperforms HLEFT, MCP, and EFT with a 7% lower overall completion time.

关键词： Heuristic algorithms scheduling algorithms Genetic algorithms Program processors Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 444 445 446 447 448 449 450 451 452 453 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：