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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A Suboptimal QoS Aware Multiuser scheduling for 3GPP LTE Network

A Suboptimal QoS Aware Multiuser Scheduling for 3GPP LTE Net...

引用

International Conference on Advances in Computing and Communication Engineering (ICACCE)

作者： Kunal Soni Anshul Tyagi Dept. of Electronics and Communication Engg. IIT Roorkee Roorkee Uttarakhand India

Emerging cellular communication technology such as Long Term Evolution (LTE) requires high data rate as well as quality of service (QoS). One of key features of LTE system is scheduling the wireless resources through Radio resource management. LTE is an all-Packet system with promising QoS. In this context, the scheduler is a vital and crucial entity of the LTE which is responsible for efficient allocation of the radio resources among mobile users who having different QoS demands. In this paper, we propose a novel sub optimal MAC PHY level scheduler to deliver different class of QoS demands of active users. The scheduling algorithm performs sub optimal tradeoff between QoS requirements and data rate throughput of users with sub optimal allocation of power and bandwidth resources. Evaluation of algorithm on the basis of latency, overall cell throughput and complexity is performed and compared. Simulation results depict an improvement in throughput and complexity using the proposed algorithm, as compared to the previously used algorithms.

关键词： Quality of service Throughput Long Term Evolution scheduling algorithms Resource management Downlink MIMO

来源：评论

学校读者我要写书评

暂无评论

Improving the efficiency of MapReduce scheduling algorithm in Hadoop

Improving the efficiency of MapReduce scheduling algorithm i...

引用

International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)

作者： R. Thangaselvi S. Ananthbabu S. Jagadeesh R. Aruna Department of Computer Science VV College of Engineering Tirunelveli India Department of Computer Science Jayamatha Engineering College Kanyakumari India

ISBN: (纸本)9781467392228

In a distributed computing environment, to support the processing of large data sets a free Java-based programming framework Hadoop plays a vital role. In Hadoop, MapReduce technique is used for processing and generating large datasets is used with a parallel distributed algorithm on a cluster. The benefit of using MapReduce is to automatically handle failures and hides the complexity of fault tolerance from the user. The scheduling algorithm of FIFO(FIRST IN FIRST OUT) is used in Hadoop as default in which the jobs are executed in the order of their arrival. This method suits well for homogeneous cloud and results in poor performance on the heterogeneous cloud. Later the LATE (Longest Approximate Time to End) algorithm has been developed which reduces the FIFO's response time by a factor of 2. It gives better performance in heterogeneous environments. The three principles of LATE algorithms are i) prioritizing tasks to speculate ii) selecting fast nodes to run on iii) capping speculative tasks to prevent thrashing. It takes action on appropriate slow tasks and it could not compute the remaining time for tasks correctly and can't find the real slow tasks. Finally, an SAMR (Self-Adaptive MapReduce) scheduling algorithm is being introduced which can find the slow tasks dynamically by using the historical information recorded on each node to tune parameters. SAMR reduces the execution time by 25% when compared to FIFO and 14% when compared to LATE.

关键词： Clustering algorithms Algorithm design and analysis scheduling algorithms Computer science Cloud computing Approximation algorithms Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Performance improvement in cloud computing through dynamic task scheduling algorithm

Performance improvement in cloud computing through dynamic t...

引用

International Conference on Next Generation Computing Technologies (NGCT)

作者： Shital Patil Rekha A. Kulkarni Suhas H. Patil N. Balaji School of Electrical Engineering KTH-Royal Institute of Technology Stockholm Sweden

Cloud computing can be defined as dynamic hosting of services like servers, network, infrastructure, data storage and applications on internet. Resource management is the core function required by this type of system. Poor resource management affects both to cloud service provider and users in terms of cost and consequences in wastage of resources. scheduling of tasks plays important role to overcome these losses. Traditional scheduling algorithms suffer from problems like starvation, uneven distribution of loads on nodes etc. and results in increased turnaround time or waiting time of a task. Also these scheduling strategies cannot be applied for every use case as they might be diverse in nature for cloud computing. So in this paper we are introducing efficient and dynamic task scheduling algorithm to increase system functionality and for increased resource utilization. In this paper we have worked on our newly designed dynamic scheduling algorithm and First Come First Serve algorithm. The comparison of results shows that there is increased system performance with our new approach.

关键词： Cloud computing Servers Heuristic algorithms Algorithm design and analysis scheduling algorithms Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Traffic scheduling Algorithm for Wireless Mesh Networks Based Defense Networks Incorporating Centralized scheduling Architecture

Traffic Scheduling Algorithm for Wireless Mesh Networks Base...

引用

Sensor Signal Processing for Defence (SSPD)

作者： Sidharth Shukla Vimal Bhatia Signals and Software group Discipline of Electrical Engineering Indian Institute of Technology Indore India

Wireless mesh networks (WMN) are the networks of the future which are flexible, easy to deploy and can support high data rate triple play (voice, video and data) services. WMNs are ideal for future defense networks. WMN can operate on multi protocols ranging from WiFi, WiMax and LTE. To enable the support of high data rate services WMN should incorporate optimum traffic scheduling algorithms which will improve the performance of the WMN in highly loaded traffic scenarios for a combat communication network. In this paper, we propose an efficient traffic scheduling algorithms to improve the overall blocking probability of the WMN employed for defense networks and the same is substantiated by the simulation results.

关键词： scheduling algorithms Routing Wireless mesh networks Quality of service Wireless networks Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Unifying fixed- and dynamic-priority scheduling based on priority promotion and an improved ready queue management technique

Unifying fixed- and dynamic-priority scheduling based on pri...

引用

IEEE Symposium on Real-Time and Embedded Technology and Applications

作者： Risat Mahmud Pathan Chalmers University of Technology Sweden

This paper proposes a new preemptive scheduling algorithm, called Fixed-Priority with Priority Promotion (FPP), for scheduling sporadic tasks on uni- and multiprocessor platform. In FPP scheduling, tasks are executed similar to traditional fixed-priority (FP) scheduling but the priority of some tasks may be promoted at fixed time interval (called, promotion point) relative to the release time of each job. A policy called Increase Priority at Deadline Difference (IPDD) to compute the promotion points and promoted priorities for each task is proposed. It is shown that when all tasks' priorities are governed under IPDD policy, then FPP scheduling essentially prioritizes jobs according to Earliest-Deadline-First (EDF) priority. It is known that inserting and removing jobs to and from the ready queue of traditional EDF scheduler is more complex and has higher overhead than that of FP scheduler. To avoid such problem in FPP scheduling, a simple data structure and efficient operations to insert and remove jobs to and from the ready queue are proposed. Finally, an effective scheme to reduce overhead due to priority promotion is proposed: if a task set is not schedulable using traditional FP scheduling, then promotion points are assigned only to those tasks that need them to meet the deadlines; otherwise, tasks are assigned fixed priorities without any priority promotion and executed same as traditional FP scheduling. Empirical investigation shows the effectiveness of the proposed scheme in reducing overhead on uniprocessor and in accepting larger number of task sets in comparison to that of using state-of-the-art global schedulability tests for multiprocessors.

关键词： Arrays Dynamic scheduling Schedules scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid iSLIP scheduling algorithm for Network on Chip

Hybrid iSLIP scheduling algorithm for Network on Chip

引用

World Symposium on Web Applications and Networking (WSWAN)

作者： Ihsen Ben Mbarek Mohamed Mazouzi Salem Hasnaoui Khaled Jelassi Networking and Distributed Computing: Sys'Com University of Tunis El Manar Tunis Tunisia

Network on Chip is a set of hardware component that communicates together. The communication system must achieve maximum throughput while maintaining the system correctness, stability and eliminating starvation. The ideal solution among existing NoC architecture is the Switch Fabric. As it is known, the scheduler is the Switch Fabric brain. Moreover, the scheduling algorithm choice must be suitable to the application requirement. By nature, NoC architecture is composed of two types of core that are master cores and slave ones, called also processor and coprocessor. Trying to give the suitable solution for such hardware architecture, we propose our own scheduling algorithm called Hybrid iSLIP which is a kind of prioritized iSLIP. This paper presents a modeling, design and an evaluation of a hardware scheduler for High-Speed Virtual output Queuing using the Hybrid iSLIP algorithm. A comparison is done between the iSLIP algorithm and the Hybrid one by determining the complexity and the convergence order for both them.

关键词： scheduling algorithms Hardware Complexity theory Convergence Schedules Throughput IP networks

来源：评论

学校读者我要写书评

暂无评论

DAG scheduling for Heterogeneous Systems Using Biogeography-Based Optimization

DAG Scheduling for Heterogeneous Systems Using Biogeography-...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Kefeng Deng Kaijun Ren Shaowei Liu Junqiang Song School of Computer National University of Defense Technology Changsha China

Efficient scheduling algorithm is critical for DAG-based applications to obtain high-performance in heterogeneous computing systems. In comparison with heuristic-based algorithms, meta-heuristic based scheduling algorithms can produce better results by searching in a guided manner. Biogeography-based optimization (BBO) is a recently proposed optimization technique which has shown less parameters, faster convergency, and superior performance than existing meta-heuristics. In this article, we introduce this novel optimization technique into the field of DAG scheduling. To reduce scheduling overhead, the proposed algorithm only encodes task mapping while using a heuristic strategy to determine task ordering. Moreover, it uses heuristic-based algorithms as baseline algorithms to obtain better results. We evaluate the BBO-based scheduling algorithm using three real world DAG-based applications under various parameter settings. The results show that the BBO-based scheduling algorithm outperforms the state-of-the-art meta-heuristic based algorithms.

关键词： Periodic structures scheduling scheduling algorithms Computational modeling Optimization Biogeography

来源：评论

学校读者我要写书评

暂无评论

Utility-based scheduling algorithm for wireless multi-media sensor networks

Utility-based scheduling algorithm for wireless multi-media ...

引用

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

作者： Han Hao Ke Wang Hong Ji Xi Li Heli Zhang Beijing University of Posts and Telecom P.R. China

Wireless Sensor Networks (WSNs) have been widely deployed in monitoring and surveillance areas. With the improvement of sensor nodes' processing capability, multi-media transmission in WSNs has become a new trend. Since multi-media has strict Quality of Service (QoS) requirements, which calls for efficient scheduling algorithm that could guarantee the end-to-end delay and reduce the energy consumption. Therefore, in this paper we propose a utility-based scheduling algorithm that could enhance the energy efficiency and meet the QoS requirements of multimedia. Our proposed scheduling algorithm includes two steps: firstly, a semi-Markov model is deployed to predict the arrival rate of multi-media; secondly, a utility function is designed which based on the consideration of energy consumption and the QoS constraints. Simulations show that, compared to conventional algorithms, our proposed scheduling algorithm performs better in terms of packet loss rate due to buffer overflow and end-to-end delay.

关键词： Wireless sensor networks scheduling algorithms Delays Quality of service Energy consumption Packet loss

来源：评论

学校读者我要写书评

暂无评论

Class Based Overall Priority scheduling for M2M Communications over LTE Networks

Class Based Overall Priority Scheduling for M2M Communicatio...

引用

IEEE Vehicular Technology Conference

作者： Beichen Chen Zhong Fan Fengming Cao George Oikonomou Theo Tryfonas Toshiba Res. Eur. Ltd. Bristol UK

ISBN: (纸本)9781479980895

The rapidly increasing demand of M2M (Machine to Machine) communications poses great challenges to the capacity of cellular networks. This paper proposes a new M2M scheduling algorithm, namely, Class Based Overall Priority (CBOP) scheduling, which is designed particularly to improve uplink scheduling for a massive number of MTCDs (Machine Type Communication Devices) in LTE networks. We compare the proposed algorithm with several existing scheduling algorithms via simulations and discuss its advantages and limitations.

关键词： Delays Bandwidth scheduling algorithms Dynamic scheduling Machine-to-machine communications Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Mutual Trust Based scheduling for (Semi)autonomous Multi-Agent Systems

Mutual Trust Based Scheduling for (Semi)autonomous Multi-Age...

引用

American Control Conference

作者： Xiaotian Wang Zhenwu Shi Fumin Zhang Yue Wang Department of Mechanical Engineering Clemson University Fluor Daniel Building Clemson SC 29634 School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA 30332

ISBN: (纸本)9781479917730

Mutual trust is a key factor in human-human collaboration. Inspired by this social interaction, we propose to analyze human-agent mutual trust in the collaboration of human and (semi)autonomous multi-agent systems. Humanagent mutual trust should be bidirectional and determines the human's acceptance and use of autonomous agents as well as agents' willingness to take human's command. It is especially important when a human collaborates with multiple agents concurrently. In this paper, we propose time-series humanagent mutual trust models based on well known results from human factors engineering. To avoid both "over-trust" and "under-trust", we set up dynamic timing models for the multiagent scheduling problem and develop necessary and sufficient conditions to test the schedulability of the human multi-agent collaborative task. We demonstrate the effectiveness of the proposed scheduling algorithm using Matlab simulations. It shows that the proposed algorithm guarantees the effective real-time scheduling of the human multi-agent collaboration system while ensuring a proper level of mutual trust.

关键词： Collaboration Dynamic scheduling Heuristic algorithms Timing scheduling algorithms Mathematical model

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 448 449 450 451 452 453 454 455 456 457 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：