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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,410 篇 工学
- 3,902 篇 计算机科学与技术...
- 1,637 篇 信息与通信工程
- 1,592 篇 软件工程
- 1,508 篇 电气工程
- 592 篇 控制科学与工程
- 339 篇 电子科学与技术（可...
- 310 篇 机械工程
- 193 篇 动力工程及工程热...
- 186 篇 交通运输工程
- 120 篇 仪器科学与技术
- 80 篇 航空宇航科学与技...
- 68 篇 生物工程
- 62 篇 冶金工程
- 48 篇 土木工程
- 47 篇 安全科学与工程
- 43 篇 建筑学
- 40 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 37 篇 光学工程
1,882 篇 管理学
- 1,763 篇 管理科学与工程(可...
- 1,432 篇 工商管理
- 222 篇 图书情报与档案管...
1,773 篇 理学
- 1,452 篇 数学
- 225 篇 系统科学
- 202 篇 统计学（可授理学、...
- 149 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
65 篇 法学
- 62 篇 社会学
49 篇 医学
35 篇 农学
26 篇 教育学
24 篇 文学
5 篇 艺术学
3 篇 军事学

主题

8,556 篇 scheduling algor...
1,044 篇 scheduling
564 篇 schedules
519 篇 resource managem...
507 篇 real-time system...
482 篇 cloud computing
439 篇 throughput
414 篇 heuristic algori...
388 篇 quality of servi...
376 篇 delays
307 篇 task analysis
301 篇 dynamic scheduli...
289 篇 optimization
261 篇 computational mo...
227 篇 simulation
216 篇 energy consumpti...
206 篇 job shop schedul...
204 篇 bandwidth
197 篇 servers
193 篇 algorithm design...

机构

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

作者

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

语言

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

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

共 8556 条记录，以下是211-220 订阅

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

详细简洁

排序：

An empirical study of heuristic rules on the performance of agile earth observing satellite scheduling algorithms 15th

An empirical study of heuristic rules on the performance of ...

引用

15th International Conference on Space Operations, SpaceOps 2018

作者： Song, Bingyu Chen, Yuning Chen, Yingwu College of Information System and Management National University of Defense Technology Changsha410073 China

ISBN: (数字)9781624105623

ISBN: (纸本)9781624105623

Agile earth observing satellite (AEOS), the new generation of earth observing satellite, is mobile along three axes (roll, pitch and yaw). This mobility increases not only the efficiency of the whole system, but also the complexity of scheduling. Agile earth observing satellite scheduling (AEOSS) is a process of selecting a subset of observation requests among the candidate set, which must satisfy imperative constraints and at the same time maximize a given utility function. In this work, we carry out an empirical study of heuristic rules on the performance of AEOSS algorithms. We consider a generic construction algorithm which solves the problem by first determining a permutation of the observation requests, and then producing a schedule from the given ordered requests. Heuristic rules are used in the first phase for determining the request permutation. The central arrangement algorithm (CAA) is proposed to assign the observation time window for each scheduled request according to a given request permutation. Our experimental instances are global or regional point target sets with different density and size which can characterize the different scenarios. The purpose of this study is to identify a matching between the heuristic rules and various scenarios, which provides the guidance for the construction algorithm to select the most appropriate heuristic rules when a new scenario is encountered. © 2018, American Institute of Aeronautics and Astronautics Inc, AIAA. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Recommendations for NextGen airport surface traffic scheduling algorithms: A fast-time simulation-based perspective

Recommendations for NextGen airport surface traffic scheduli...

引用

2013 Aviation Technology, Integration, and Operations Conference

作者： Saraf, Aditya Griffin, Katy Stroiney, Steve Felipe, Val Windhorst, Robert Advanced Development - Saab Sensis Corporation Campbell CA 95008 United States NASA Ames Research Center Aerospace High Density Operations Branch Mail Stop 210-15 Moffett Field CA 94035 United States

ISBN: (数字)9781624102257

ISBN: (纸本)9781624102257

NASA researchers are developing surface optimization algorithms and a concept of operations for an airport surface traffic management tool called Spot And Runway Departure Advisor (SARDA). As part of this research, the SARDA scheduling algorithms have been adapted to work at several capacity-constrained airports. Adapting the SARDA scheduling algorithms to airports with dissimilar geometries and operational characteristics requires a careful study of the trade-offs between competing optimization objectives and conflicting constraints. This paper presents three trade-off studies, which were performed using a fast-time simulation of the Charlotte Douglas International airport (CLT). The first study explores a trade-off between minimizing system-wide delay and allocating delay equitably among flights. The equitable delay allocation objective was achieved through a simple scheduler formulation modification. The second study focuses on a tradeoff between minimizing system-wide delay and employing an aggressive gate holding strategy. The scheduler's gate holding strategy was managed by adding a new departure queue duration scheduling parameter to control how long departures are allowed to wait in the runway queue. The third study explores the effectiveness of controlling how aircraft merge together in the ramp area in order to achieve a departure sequence which maximizes throughput. This study was motivated by CLT's distinctive airport geometry, which forces departures to merge together in the ramp area to form departure sequences prior to reaching the runway. The paper describes and summarizes the results of these three studies.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A performance study of scheduling algorithms in point-to-multipoint WiMAX networks

A performance study of scheduling algorithms in point-to-mul...

引用

33rd IEEE Conference on Local Computer Networks, LCN 2008

作者： Dhrona, Pratik Ali, Najah Abu Hassanein, Hossam School of Computing Queen's University Kingston ON K7L 3N6 Canada College of IT UAEU AL-Ain 17555 United Arab Emirates

ISBN: (纸本)9781424424139

The IEEE 802.16 standard, which includes specification for the Medium Access Control (MAC) and Physical (PHY) layers, was designed to handle the requirements of different contemporary applications with diverse QoS requirements. IEEE 802.16 standard is equipped with signaling and bandwidth allocation algorithms that can accommodate many connections with a variety of QoS requirements at one Subscriber Station (SS). The connections may be varied in their bandwidth and latency requirements, so several researchers proposed an IEEE 802.16 schedulers with different objectives to provide for wireless resource allocations over a different range of traffic models. In this paper, we conduct a comprehensive performance study of scheduling algorithms in Point to Multipoint mode of WiMAX. We first make a classification of WiMAX scheduling algorithms, then simulate a representative number of algorithms in each class taking into account the characteristics of the IEEE 802.16 standard. We evaluate the algorithms with respect to their abilities to support multiple classes of service, providing Quality of Service (QoS) guarantees, fairness amongst service classes and bandwidth utilization. To the best of our knowledge, no such comprehensive performance study has been reported in the literature. Simulation results indicate that none of the current algorithms is capable of effectively supporting all WiMAX classes of service. We demonstrate that an efficient, fair and robust scheduler for WiMAX is still an open research area. We conclude our study by making recommendations that can be used by WiMax protocol designers. ©2008 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A survey of various scheduling algorithms in cloud environment

A survey of various scheduling algorithms in cloud environme...

引用

2016 IEEE International Conference on Emerging Technological Trends in Computing, Communications and Electrical Engineering, ICETT 2016

作者： Santhosh, B. Manjaiah, D.H. Padma Suresh, L. Department of Computer Science Mangalore University Mangalore India Baselios Mathews II College Kollam India

ISBN: (纸本)9781509037513

scheduling is one of the research issue in cloud computing. It affects the performance of the cloud. To provision cloud resources to the users or to run cloud applications efficiently underlying infrastructure of the data center has to be properly managed. Other wise it may create hotspots or bottlenecks in many cases. This paper presents different types of scheduling, surveys the existing job scheduling algorithms and finally summaries various scheduling algorithms in the table. © 2016 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Comparative Performance Analysis of Task scheduling algorithms in Federated Clouds 4

A Comparative Performance Analysis of Task Scheduling Algori...

引用

4th IEEE International Conference on Electrical, Computer, and Energy Technologies, ICECET 2024

作者： Daniel, Ilunga Nday Ezenwoke, Azubuike Adetiba, Emmanuel Covenant University Department of Computer and Information Sciences Ota Nigeria Covenant University Electrical and Information Engineering Ota Nigeria

ISBN: (纸本)9798350395914

Efficient task scheduling is crucial in the domain of cloud computing. Cloud computing is a service that allows users to access and share virtual resources as needed in order to fulfil their jobs. The primary objective of task scheduling is to execute tasks in a manner that maximizes performance by fully utilizing resources and minimising losses. Several scheduling algorithms currently exist with the goal of achieving various objectives, including minimising execution time, cost, makespan, enhancing resource utilisation, and load balancing. This study evaluates and compares the performance of six scheduling algorithms, including Particle Swarm Optimisation (PSO), Ant Colony Optimisation (ACO), Q-Learning, Round Robin (RR), First-Come, First-Served (FCFS), and Shortest Job First (SJF) algorithms. The algorithms' performance is assessed by comparing them using standard measures, such as makespan, execution time, and throughput, across various workload scenarios through graphical representation of the findings. The study employs Java and CloudSim for the purpose of implementing and evaluating. The Particle Swarm Optimisation (PSO) algorithm exhibits exceptional efficiency, particularly in minimising makespan, obtaining optimal throughput, and attaining the shortest execution time. The capacity to adjust to changing settings and efficiently utilise resources continually demonstrates its worth in many situations. The study emphasizes the pivotal significance of algorithm selection and data centre layout in optimising work scheduling, particularly in dynamic and distributed cloud computing systems. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and Performance Comparison of Latency Efficient scheduling algorithms for Smart Environment 4

Design and Performance Comparison of Latency Efficient Sched...

引用

4th International Conference on Communication, Computing and Industry 6.0, C216 2023

作者： Boomiga, S.S. Venkatesan, V. Prasanna Department of Artificial Intelligence and Data Science Sri Manakula Vinayagar Engineering College Puducherry India Department of Banking Technology Pondicherry University Puducherry India

ISBN: (纸本)9798350327328

Smart Environment aims to improve humans' quality of life. IoT is an emerging paradigm that makes the environment smart by using sensing technologies in IoT devices and cloud computing technology. Various surveys portray that IoT devices are growing rapidly which results in more data which leads to more delay in response time for the services provided in the smart environment since the Cloud server imposes more transmission latency. This transmission latency is reduced by the emergence of Edge computing in which the services can be provided by using Edge as a computing device. However, the Edge is a resource-constrained device, so the proposed work aims to identify the process that can be processed at the Edge based on context and priority based scheduling. Therefore, an algorithm is designed to execute the process that needs immediate attention by applying context and priority-based scheduling. In a comparative analysis of algorithms, the experimental results showcase that the proposed algorithms notably reduce latency in IoT processes. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Bandwidth and latency analysis of modified deficit round robin scheduling algorithms 06

Bandwidth and latency analysis of modified deficit round rob...

引用

VALUETOOLS: 1st International Conference on Performance Evaluation Methodologies and Tools

作者： Lenzini, Luciano Mingozzi, Enzo Stea, Giovanni Dipartimento di Ingegneria dell'Informazione University of Pisa Italy Via Diotisalvi 2 56122 Pisa Italy

ISBN: (纸本)1595935045

Deficit Round Robin (DRR) is a scheduling algorithm which provides fair queuing at O(1) complexity. However, due to its round robin structure, its latency properties are not adequate for latency-critical applications, such as voice. For this reason, router manufacturers implement variants of the DRR algorithm which guarantee lower latencies to one (or a subset of) queue(s). In this paper we evaluate the performance of two such variants, both of which are known as Modified Deficit Round Robin, currently implemented in commercial routers. The comparison is carried out analytically, by deriving the latency and bandwidth sharing properties of both algorithms, and by simulation. Copyright 2006 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient scheduling algorithms for real-time distributed systems

Efficient scheduling algorithms for real-time distributed sy...

引用

2010 1st International Conference on Parallel, Distributed and Grid Computing, PDGC - 2010

作者： Shah, Apurva Kotecha, Ketan G.H. Patel College of Engg. and Tech. Vallabh Vidyanagar India Nirma Institute of Technology Ahmedabad India

ISBN: (纸本)9781424476725

Dynamic scheduling has been always a challenging problem for real-time distributed systems. EDF (Earliest Deadline First) algorithm has been proved to be optimal scheduling algorithm for single processor real-time systems and it performs well for distributed systems also. In this paper, we have proposed scheduling algorithms for client/server distributed system with soft timing constraints. The algorithms are proposed with modifications in conventional EDF algorithm. The proposed algorithms are simulated;results are obtained and measured in terms of SR (Success Ratio) & ECU (Effective CPU Utilization). Finally the results are compared with EDF algorithm in the same environment. It has been observed that the proposed algorithms ares equally efficient during underloaded conditions and they perform much better during overloaded conditions. © 2010 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison of CPU scheduling algorithms: FCFS, SJF, SRTF, Round Robin, Priority Based, and Multilevel Queuing 10

Comparison of CPU Scheduling Algorithms: FCFS, SJF, SRTF, Ro...

引用

10th IEEE Region 10 Humanitarian Technology Conference, R10-HTC 2022

作者： Pemasinghe, Sajeewa Rajapaksha, Samantha Wayamba University of Sri Lanka Department of Food Science and Technology Makandura81070 Sri Lanka Sri Lanka Institute of Information Technology Department of Information Technology Malabe10115 Sri Lanka

ISBN: (数字)9781665401562

ISBN: (纸本)9781665401562

In this article, we are discussing various aspects of CPU scheduling. We first introduce the concept of CPU scheduling, different types of schedulers and the typical terminology used in relation to processes. scheduling criteria, the optimization of which is the ultimate goal of a CPU scheduling algorithm, are also discussed. We then discuss various types of research studies that have been carried out with respect to CPU scheduling algorithms. Different CPU scheduling algorithms are examined with examples to highlight their characteristics. Advantages and disadvantages of each of these algorithms are also explored. The scheduling algorithms discussed are, first come first served, shortest job first, shortest remaining time first, priority based, round robin, multilevel queue, and multilevel feedback queue. © 2022 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

The research of scheduling algorithms in real-time system

The research of scheduling algorithms in real-time system

引用

2010 International Conference on Computer and Communication Technologies in Agriculture Engineering, CCTAE 2010

作者： Jie, Li Ruifeng, Guo Zhixiang, Shao Graduate University of Chinese Academy of Sciences Shenyang Institute of Computing Technology Shenyang China Chinese Academy of Sciences Anyang Normal University Shenyang China Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang China

ISBN: (纸本)9781424469451

scheduling algorithm is a hot research topic of real-time system. The quality of real-time scheduling algorithm has a direct impact on real-time system's throughput capacity, response time, even on tasks' scheduling result in required deadline. This paper discusses the features and performance of real-time system. According to system environment, real-time system can be divided into uniprocessor scheduling, centralized multiprocessor scheduling and distributed scheduling. Classic real-time scheduling algorithms RMS, EDF and LLF are discussed in uniprocessor systems. The scheduling thought and strategies are investigated in multiprocessor systems. Distributed real-time scheduling algorithms such as GRMS and DSr are analyzed briefly. Finally, it points out the future direction of real-time scheduling research. © 2010 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：