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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,416 篇 工学
- 3,905 篇 计算机科学与技术...
- 1,646 篇 信息与通信工程
- 1,603 篇 软件工程
- 1,519 篇 电气工程
- 587 篇 控制科学与工程
- 342 篇 电子科学与技术（可...
- 307 篇 机械工程
- 195 篇 动力工程及工程热...
- 189 篇 交通运输工程
- 116 篇 仪器科学与技术
- 82 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 49 篇 土木工程
- 46 篇 安全科学与工程
- 43 篇 建筑学
- 39 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,886 篇 管理学
- 1,767 篇 管理科学与工程(可...
- 1,436 篇 工商管理
- 222 篇 图书情报与档案管...
1,781 篇 理学
- 1,461 篇 数学
- 224 篇 系统科学
- 199 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
102 篇 经济学
- 100 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
36 篇 农学
27 篇 教育学
25 篇 文学
5 篇 艺术学
2 篇 军事学

主题

8,603 篇 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 篇 state key labora...
26 篇 beijing universi...
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 篇 wang wei
11 篇 anderson james h...
11 篇 xie zhiqiang
11 篇 buyya rajkumar
11 篇 wang yi
10 篇 wei hu
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,236 篇 英文
277 篇 其他
87 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8603 条记录，以下是1411-1420 订阅

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

详细简洁

排序：

Enhanced Task scheduling in Cloud Computing: A Comparative Analysis and Hybrid Algorithm Implementation Using CloudSim

Enhanced Task Scheduling in Cloud Computing: A Comparative A...

引用

International Conference on Computing and Networking Technology (ICCNT)

作者： Padigela Srinithya Reddy Kariveda Trisha Nichenametla Hima Sree Sreebha Bhaskaran Nalini Sampath Dept. of Computer Science and Engineering Amrita School of Computing Bengaluru Amrita Vishwa Vidyapeetham India

ISBN: (数字)9798350370249

ISBN: (纸本)9798350370270

Task scheduling is crucial in cloud environments to optimize resource allocation and performance. This research presents a comprehensive comparative analysis of task scheduling algorithms, that includes First-Come-First Serve (FCFS), Shortest Job First (SJF), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO). FCFS schedules tasks based on their arrival order, SJF prioritizes tasks based on the shortest execution time, and GA and PSO use metaheuristic approaches that use evolutionary methods for optimization. The hybrid algorithm is proposed combining SJF and GA to improve scheduling efficiency. The main objective is to improve the performance of task-scheduling algorithms in cloud environments. The performance of the individual algorithms and of the proposed hybrid algorithm are analyzed under static and dynamic workload scenarios. Metrics such as makespan and response time are evaluated using simulations.

关键词： Measurement Cloud computing Machine learning algorithms scheduling algorithms Heuristic algorithms Quality of service Dynamic scheduling Time factors Resource management Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Monty: A Framework for Latency-aware Multi-flow ATSSS scheduling

Monty: A Framework for Latency-aware Multi-flow ATSSS Schedu...

引用

Conference on Local Computer Networks (LCN)

作者： Alexander Rabitsch Per Hurtig Stefan Alfredsson Anna Brunstrom Department of Computer Science Karlstad University Sweden Institute of Software Technologies and Engineering University of Malaga Spain

ISBN: (数字)9798350388008

ISBN: (纸本)9798350388015

The Access Traffic Steering, Switching, and Splitting (ATSSS) technology, currently under standardization by the 3rd Generation Partnership Project (3GPP), is designed to enhance wireless access through the bundling of both 3GPP and non-3GPP access. One implementation option involves tunneling data through the Multipath QUIC (MP-QUIC) protocol. The decision of which access network each packet is transmitted on can greatly impact the performance of a network flow, and may also impact the performance of other flows. While Active Queue Management (AQM) in the network could normally manage such interactions, such techniques are limited in a shared multipath-tunnel context, since all traffic in the tunnel share a single connection. This paper introduces a multi-flow, multipath tunneling framework using MP-QUIC. It employs four distinct scheduling policies for packet scheduling decisions. We investigate how such scheduling policies interact with each other, and how they may be combined in order to achieve trade-offs in terms of latency, interactivity, and throughput. Through an extensive investigation in both emulated and real-world environments, we show that Quality of Service (QoS) can be significantly improved by smart combinations of scheduling policies.

关键词： Wireless communication Protocols scheduling algorithms Quality of service Switches Standardization Tunneling

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Various Task scheduling Algorithm Using Cloudsim

A Comparison of Various Task Scheduling Algorithm Using Clou...

引用

Electrical Power Engineering, Communication and Computing Technology(ODICON), Odisha International Conference on

作者： Padmaja Patel K. Murali Gopal Nimai Charn Patel Binod Kumar Sahu Department of CSE GIET University Gunupur Department of CDS SOA Deemed to be University Bhubaneswer Department of Electrical and Electronics Engineering NIT Sikkim Sikkim India Department of Electrical Engineering Sikhsa ‘O’ Anusandhan University Bhubaneswar India

ISBN: (数字)9798350354379

ISBN: (纸本)9798350354386

The term “cloud computing” refers to a large-scale, cost-effective distributed clustered computing paradigm in which users can access virtualize, platforms, manage scalable storage,computing power, and services as needed, via the internet. Through the use of hardware, systems software, and the internet, it offers applications as a service for data centres, that offer resources as a service. The job scheduling issue is a significant and challenging task in cloud computing. The primary goal of cloud computing service providers is to figure out how to utilise resources in the cloud effectively and earn profit as much as possible. High energy consumption results in significant operational costs, which lower cloud providers' profit margins, as well as high CO 2 emissions, which are unfriendly to the environment. Therefore, to reduce the negative effects of cloud computing on the environment, energy-efficient solutions are required. Because of this, the simulation tools are essential for both evaluating the functioning of the cloud and advancing cloud computing for the advancement of greener IT. The performance of the min-min, max-min, and suffrage scheduling algorithms are examined in this article, and CloudSim is used to provide a green approach for sustainable IT development.

关键词： Cloud computing Power engineering Energy consumption scheduling algorithms Green products Minimax techniques Air pollution Hardware Energy efficiency System software

来源：评论

学校读者我要写书评

暂无评论

NoQ: An Innovative Approach to Virtualize and Automate Queues 3

NoQ: An Innovative Approach to Virtualize and Automate Queue...

引用

3rd IEEE International Conference on Intelligent Technologies, CONIT 2023

作者： Shafiulla, Mohammed Math, Naveen S Akash, B. Aditi Naidu, B.T. Shreya, B.M. Ballari Institute of Technology and Management Department of Computer Science and Engineering Karnataka Ballari India

ISBN: (纸本)9798350338607

It has been observed that waiting has been a constant trouble in our increasingly fast-paced world where the traditional waiting in lines/queues is not a viable option as it is statistically shown that 25% of people would only wait for a max of 2 mins, 59% would wait no longer than 4 mins and 73% would abandon their purchase or work if its more than 5 mins. So, to tackle this common issue, the proposed system incorporates an innovative solution by virtualizing the entire queuing system and creating a scheduling process with the help of advanced scheduling algorithms such as FCFS scheduling and Priority scheduling. This is a web application that will be developed using Full stack (Laravel, PHP, CSS, HTML, phpMyAdmin). With the help of this an ecosystem will be created where the work process can be monitored, altered, and improved that makes it efficient for both the parties, i.e., the workers and the people waiting in a queue, and allowing for further improvement by collecting workers statistics which can be used by the admin to further optimize the workflow. This system enables 'Virtual Queue Creation' by adapting functionalities such as 'Virtual Room Creation' used by famous organizations such as Google and Microsoft. The work statistics get stored in the backend with the help of SQL-based technology i.e., phpMyAdmin and a user-friendly UI will be developed for ease of use for all the end users of this proposed virtual system. The web application as mentioned above uses scheduling algorithms for the automation of queue management and will also have the functionality for manual management making it more flexible for the end users. This web application will incorporate several APIs for data collection and storage for statistics handling. The APIs and frameworks that will be used are Laravel, Excel JS API, and user-created APIs. This new system will be able to reduce the waiting times to a great extent and will be able to facilitate the needs that are necessary for th

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Data Visualization and Practice Platform Based on Data Mining Technology

Data Visualization and Practice Platform Based on Data Minin...

引用

作者： Kong, Jie China University of Labor Relations Beijing China

Modern society is an information society. With the continuous popularization of informatization, people have realized the importance of information literacy. As the talent reserve force of our country, college students have good information literacy has become the requirement of the times. Cloud computing (C C G) provides technical support for information literacy teaching due to its high cost performance, good scalability, and on-demand services. Based on this, the purpose of this article is to design and research a university information literacy teaching platform based on C C G technology. This article first summarizes the current situation of information literacy research, and then extends the current problems and shortcomings of information literacy teaching in my country’s universities. On the basis of it, design and analyze the information literacy teaching platform of colleges and universities (C A U), and analyze the strategy of information literacy teaching. This paper systematically expounds the design of the scheduling algorithm of the teaching platform based on C C G, and uses the field research method, questionnaire survey method and other research forms to carry out experimental research on the theme of this article. Research shows that the university information literacy teaching platform based on C C G technology studied in this paper has higher feasibility. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Location-based User scheduling through Graph Coloring for Cell-Free MIMO NTN Systems

Location-based User Scheduling through Graph Coloring for Ce...

引用

European Conference on Networks and Communications (EuCNC)

作者： Daniel Gaetano Riviello Bruno De Filippo Bilal Ahmad Alessandro Guidotti Alessandro Vanelli-Coralli Dept. of Electrical Electronic and Information Engineering (DEI) Univ. of Bologna Bologna Italy National Inter-University Consortium for Telecommunications (CNIT) Bologna Italy

ISBN: (数字)9798350344998

ISBN: (纸本)9798350345001

Non-Terrestrial Networks (NTN) have recently grown in popularity, with Low Earth Orbit (LEO) mega-constellations delivering broadband services to households world-wide. Under the cell-free MIMO paradigm in full frequency reuse systems, meeting the increasing traffic demand requires complex scheduling and digital beamforming algorithms to minimize the excessive co-channel interference. In this paper, we present a user scheduling algorithm for LEO-based B5G NTNs with reduced computational complexity that does not require knowledge of downlink (DL) Channel State Information (CSI). In our proposed method, we perform user grouping by first solving the Minimum Clique Cover (MCC) problem on an inter-user distance adjacency matrix, avoiding the need for DL pilots for CSI estimation. We approach MCC as a graph coloring task on the complementary graph, using the DSatur algorithm to minimize the computational complexity of the scheduler. Users within the same group are served via space-division multiplexing by means of feed space digital beamforming, inferring the users’ channel vectors from their position. System-level analysis show that the proposed algorithm, named Distance-based MCC DSatur (D-MCC-DSatur), achieves a per-cluster sum-rate capacity gain of up to 1.8% with respect to the distance-based Multiple Antenna Downlink User scheduling (D-MADOC) algorithm.

关键词： Space vehicles scheduling algorithms Array signal processing Low earth orbit satellites Downlink scheduling Vectors

来源：评论

学校读者我要写书评

暂无评论

Scalable HPC Job scheduling and Resource Management in SST

Scalable HPC Job Scheduling and Resource Management in SST

引用

Simulation Winter Conference

作者： Abubeker Abdurahman Abrar Hossain Kevin A. Brown Kazutomo Yoshii Kishwar Ahmed Dept of Electrical Engineering and Computer Science The University of Toledo Toledo OH USA Mathematics and Computer Science Division Argonne National Laboratory Lemont IL USA

ISBN: (数字)9798331534202

ISBN: (纸本)9798331534219

Efficient job scheduling and resource management contributes towards system throughput and efficiency maximization in high-performance computing (HPC) systems. In this paper, we introduce a scalable job scheduling and resource management component within the structural simulation toolkit (SST), a cycle-accurate and parallel discrete-event simulator. Our proposed simulator includes state-of-the-art job scheduling algorithms and resource management techniques. Additionally, it introduces a workflow management components that supports the simulation of task dependencies and resource allocations, crucial for workflows typical in scientific computing and data-intensive applications. We present validation and scalability results of our job scheduling simulator. Simulation shows that our simulator achieves good accuracy in various metrics (e.g., job wait times, number of nodes usage) and also achieves good parallel performance.

关键词： Measurement Accuracy Scientific computing scheduling algorithms High performance computing Scalability Dynamic scheduling Throughput Resource management

来源：评论

学校读者我要写书评

暂无评论

Non-orthogonal MAC scheduling in Joint Communications and Sensing Networks

Non-orthogonal MAC Scheduling in Joint Communications and Se...

引用

IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN

作者： Husheng Li School of Aeronautics and Astronautics and the Elmore Family School of Electrical and Computer Engineering Purdue University

ISBN: (数字)9798350317640

ISBN: (纸本)9798350317657

Joint communications and sensing (JCS) are expected to be a promising technology in 6 G, which integrates both functions in the same waveform. In networked JCS systems, interference among different JCS users needs to be addressed. In contrast to the interference management in traditional communication networks, JCS networks face the challenge of insufficient bandwidth for orthogonal transmissions, due to the large bandwidth required by the task of sensing. One simple approach is to leverage time division multiplexing (TDM) such that the transmissions are made orthogonal, while the employment of code division multiplexing (CDM) can effectively reduce the interference when sensing waveforms are used as spread codes. An alternative challenge is how to schedule the different tasks of communications and sensing, for which a novel framework of virtual queues of sensing is proposed. Numerical simulations are carried out to demonstrate the validity of the proposed schemes.

关键词： Schedules scheduling algorithms Employment Interference Bandwidth Time division multiplexing Numerical simulation

来源：评论

学校读者我要写书评

暂无评论

Multi-user scheduling based on Puncturing in TSN-enabled 5G System

Multi-user Scheduling based on Puncturing in TSN-enabled 5G ...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Yi Zhang Kang Li Xinchen Lyu Peng Hao Feng Shu Pengcheng Zhu National Mobile Communications Research Laboratory Southeast University Nanjing China National Engineering Research Center for Mobile Network Technologies Beijing University of Posts and Telecommunications Beijing China ZTE Corporation Shenzhen China School of Information and Communication Engineering Hainan University Haikou China

ISBN: (数字)9798350378412

ISBN: (纸本)9798350378429

G has emerged as the most promising solution for Industry 4.0 due to its high data rate, low latency, and high reliability. For different applications, their quality-of-service(QoS) requirements vary from time-sensitive to high throughput, so it is challenging to meet their demands on a common physical infrastructure simultaneously. The puncturing technique has the potential to achieve the scheduling of different traffic types by allocating resources in various time scales. However, as puncturing may impair the data rate of the punctured targets, the fairness among traffic will be affected. In this paper, by incorporating the factor of compensation over short time scales into the puncturing strategy, we maximize the minimum expected average rate (MEAR) over longer time scales under throughput, latency, and reliability constraints. Since the optimization problem belongs to integer programming with nonlinear constraints, we propose a heuristic scheduling algorithm to obtain a good quality solution with low complexity. The numerical results validate the effectiveness of the heuristic algorithm, and the simulation results demonstrate that the considered puncturing strategy enhances the MEAR of high data rate streams compared to other baseline schemes.

关键词： Schedules Job shop scheduling 5G mobile communication scheduling algorithms Simulation Quality of service Ultra reliable low latency communication

来源：评论

学校读者我要写书评

暂无评论

Age-minimal CPU scheduling

Age-minimal CPU Scheduling

引用

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

作者： Mengqiu Zhou Meng Zhang Howard H. Yang Roy D. Yates ZJU-UIUC Institute Zhejiang University Department of Electrical and Computer Engineering WINLAB Rutgers University

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

The proliferation of real-time status updating applications and ubiquitous mobile devices have motivated the analysis and optimization of data freshness in the context of age of information. At the same time, increasing requirements on computer performance have inspired research on CPU scheduling, with a focus on reducing energy consumption. However, since prior CPU scheduling strategies have ignored data freshness, we formulate the first CPU scheduling problem that aims to minimize the long-term average age of information, subject to an average power constraint. In particular, we optimize CPU scheduling strategies that specify when the CPU sleeps and adapt the CPU speed (clock frequency) during the execution of update-processing tasks. We formulate the age-minimal CPU scheduling problem as a constrained semi-Markov decision process (SMDP) problem with uncountable space. We develop a value-iteration-based algorithm and further prove its convergence in infinite space to obtain the optimal policy. Compared with existing benchmarks in terms of long-term average AoI, numerical results show that our proposed scheme can reduce the AoI by up to 53%, and obtains greater benefits when faced with a tighter power constraint. In addition, for a given AoI target, the age-minimal CPU scheduling policy can save more than 50% on energy consumption.

关键词： Energy consumption scheduling algorithms Data integrity Transforms Information age Real-time systems Servers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 138 139 140 141 142 143 144 145 146 147 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：