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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

8,577 篇 scheduling algor...
1,050 篇 scheduling
568 篇 schedules
525 篇 resource managem...
520 篇 real-time system...
474 篇 cloud computing
442 篇 throughput
425 篇 heuristic algori...
392 篇 quality of servi...
378 篇 delays
309 篇 dynamic scheduli...
307 篇 task analysis
303 篇 optimization
262 篇 computational mo...
229 篇 simulation
217 篇 energy consumpti...
208 篇 bandwidth
205 篇 job shop schedul...
199 篇 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...
10 篇 school of automa...
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,321 篇 英文
167 篇 其他
81 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8577 条记录，以下是741-750 订阅

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

详细简洁

排序：

Improved Initialization for Tunicate Swarm Optimization in Cloud Task scheduling

Improved Initialization for Tunicate Swarm Optimization in C...

引用

2024 IEEE Region 10 Symposium, TENSYMP 2024

作者： Sharma, Isha Gupta, Ruchika Singh, Pardeep Chandigarh University Punjab India Galgotias University Greater Noida India

ISBN: (纸本)9798350364866

Efficient task scheduling in cloud computing is critical for optimizing resource utilization and reducing execution cost. However, the task scheduling problem is known to be NP-hard, motivating the use of metaheuristic algorithms. This paper proposes an improved initialization approach for the Tuni-cate Swarm Optimization (TSO) algorithm, leveraging strategic heuristics. Specifically, Shortest Job First Priority (SJFP) and Earliest Completion Time (ECT) heuristics are employed to initialize TSO. Both of the proposed SJFP-TSO and ECT-TSO algorithms are evaluated on the performance metrices including minimizing makespan, total execution time, load balancing, and energy consumption. Comparative analysis shows the superiority of the proposed algorithms over conventional TSO method. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluation and Comparaison of scheduling algorithms in Wimax Networks

Evaluation and Comparaison of Scheduling Algorithms in Wimax...

引用

International Conference on Multimedia Computing and Systems (ICMCS)

作者： Mnif, Kais Khdhir, Radia Kamoun, Lotfi Univ Sfax LETI Lab Sfax Tunisia Ecole Natl Elect & Telecommun ENETCOM Sfax Tunisia Univ Sfax LETI Lab ENIS Sfax Tunisia

ISBN: (纸本)9781479938247

In this paper, we propose a new scheduling algorithm for IEEE802.16 Broadband wireless Metropolitan Area Networks in TDD mode. Based on some known algorithms such as Modified Deficit Round Robin (MDRR), Proportional Fairness (PF) and Adaptive Proportional Fairness (APE), we have studied the scheduling problem and proposed scheduling algorithm, called (Enhanced-APF) for focuses on an efficient mechanism to serve high priority traffic in order to perform and achieve high resource utilization in the Wimax Base Station. We give a detailed simulation study for the proposed scheduling algorithm and its performance has been compared. Based on OPNET modeler Simulation, results show that the proposed algorithm can increase the network throughput, maintain relative fairness, and lower delay of dealing with different requirements from users under congestion conditions.

关键词： component: Wimax scheduling algorithms QoS

来源：评论

学校读者我要写书评

暂无评论

Hybrid algorithm on timeline matrix for task scheduling in clouds

Hybrid algorithm on timeline matrix for task scheduling in c...

引用

2024 China Automation Congress, CAC 2024

作者： Zhang, Anni Xia, Yuanqing Department of Mathematics Beijing Institute of Technology Beijing China School of Automation Beijing Institute of Technology Beijing China

ISBN: (纸本)9798350368604

In recent years, cloud computing is an emerging industry that serves many people who do not own sufficient compute resources in a flexible and efficient approach. However, it is difficult to optimize the cost of computing while meeting the QoS requirements of users, especially for those time-constrained workflows. In this article, we present a hybrid particle swarm optimization (PSO) scheduling algorithm, called HPSOTM, which aims to optimize the scheduling strategy of workflows while meeting deadline constraints in a cloud environment. In HPSOTM, a more suitable and refined optimization and solution-repair strategy is constructed for the timeline matrix of the virtual machine pool to improve the efficiency. At the same time, it also enriches the diversity of solutions in particle swarms and improves the convergence speed of feasible solutions. It mainly contains two major highlight features: 1) design a new slot-aware rule to reduce VM idle time, which could reduce execution costs;2) apply the concept of partial critical path to complete deadline distribution, which could fit to time constraints precisely. Extensive experiments are conducted and the results show that the proposed algorithm outperforms other existing algorithms that minimize the execution cost of scheduling workflows with deadline constraints. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic Priority Coflow scheduling in Optical Circuit Switched Networks 24th

Dynamic Priority Coflow Scheduling in Optical Circuit Switch...

引用

24th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2023

作者： Ren, Hongkun Shen, Hong Wang, Xin School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Faculty of Applied Sciences Macao Polytechnic University China

ISBN: (纸本)9789819982103

OCS (Optical Circuit Switch) is increasingly popular for accelerating data transmission of coflows due to its higher bandwidth and lower power consumption compared with EPS (Electronic Packet Switch), where a coflow is a collection of related parallel flows between two computation stages in data-intensive applications. However, the extra port constraints and reconfiguration delay of OCS obstruct the efficiency of OCS operations. This paper studies the problem of coflow scheduling in the OCS of datacenter networks to minimize the total Coflow Completion Time (CCT). We propose a Dynamic Priority Coflow scheduling Algorithm that schedules coflows preemptively by considering coflow transmission time and OCS reconfiguration delay jointly to dynamically update each coflow's priority, which can significantly reduce the waiting time of small coflows and reduce head-of-line blocking. Extensive simulations based on Facebook data traces show that our approach outperforms the state-of-the-art scheme OMCO [19] significantly, and transmits multiple coflows 1.30× faster than OMCO. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Throughput Optimization in Cache-aided Networks: An Opportunistic Probing and scheduling Approach

Throughput Optimization in Cache-aided Networks: An Opportun...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Zhang, Zhou Atapattu, Saman Wang, Yizhu Di Renzo, Marco Tianjin China Rmit University School of Engineering MelbourneVIC Australia Université Paris-Saclay 3 Rue Joliot Curie Gif-sur-Yvette91190 France

ISBN: (纸本)9798350351255

This paper addresses the challenges of throughput optimization in wireless cache-aided cooperative networks. We propose an opportunistic cooperative probing and scheduling strategy for efficient content delivery. The strategy involves the base station probing the relaying channels and cache states of multiple cooperative nodes, thereby enabling opportunistic user scheduling for content delivery. Leveraging the theory of Sequentially Planned Decision (SPD) optimization, we dynamically formulate decisions on cooperative probing and stopping time. Our proposed Reward Expected Thresholds (RET)-based strategy optimizes opportunistic probing and scheduling. This approach significantly enhances system throughput by exploiting gains from local caching, cooperative transmission and time diversity. Simulations confirm the effectiveness and practicality of the proposed Media Access Control (MAC) strategy. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Multi-Task scheduling in Smart Warehouse Systems Based on Dual-Task Chains 21

Research on Multi-Task Scheduling in Smart Warehouse Systems...

引用

21st International Conference on Networking, Sensing and Control, ICNSC 2024

作者： Zhang, Chenwei Wu, Weimin Institute of Cyber-Systems and Control Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou310027 China

ISBN: (纸本)9798350365221

With the advancement of warehousing technology, the allocation of multiple tasks in multi-AGV systems has become an important factor in order to decrease task completion time in the warehouse. This paper develops a multi-task scheduling algorithm that employs a dual-task chain approach to maximize task execution benefits. For the multi-task allocation problem, this paper proposes a dual-task chain-based task allocation algorithm (DTTA), which uses the dual-task chain strategy as a mechanism for selecting multiple tasks, taking into consideration derived tasks to enhance solution quality. Simulation experiments show that the proposed algorithm and model perform better than other methods. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

VehA & PedA Mobility based scheduling in Future Communication Networks 97

VehA & PedA Mobility based Scheduling in Future Communicatio...

引用

97th IEEE Vehicular Technology Conference (VTC-Spring)

作者： Ashfaq, Khuram Safdar, Ghazanfar Ali Ur-Rehman, Masood Univ Bedfordshire Sch Comp Sci & Technol Luton Beds England Univ Glasgow James Watt Sch Engn Glasgow Lanark Scotland

ISBN: (纸本)9798350311143

The primary means of communication is quickly evolving to be wireless communications. However, when compared to wired links, their properties render traffic susceptible to time and location-dependent signal attenuation, noise, fading, and interference, resulting in time variable channel capacity and link error rate. scheduling algorithms are critical in wireless connections for ensuring quality of service (QoS) metrics such as throughput, latency, jitter, fairness, and packet loss rate. The scheduler is critical in current and future cellular communications because it assigns resource blocks (RB) to different users for transmission. The scheduling algorithm decides based on the link state, number of sessions, reserved rates, and the status of the session queues. The information required by a scheduler implemented in the base station can be easily gathered from the downlink stream. It evaluates the performance of four well-known scheduling methods, including round robin (RR), best channel quality indicator (BCQI), proportional fair (PF), and fractional frequency reuse (FFR), for dynamic use Pedestrian (PedA) and Vehicular (VehA). The performance of these four algorithms is measured in terms of throughput, fairness index, spectral efficiency, and overall effectiveness. System-level simulations were carried out utilizing a MATLAB-based LTE-A Vienna simulator.

关键词： Radio Resource Allocation scheduling algorithms Cellular Networks Quality of Service

来源：评论

学校读者我要写书评

暂无评论

A Robust scheduling Algorithm for Overload-Tolerant Real-Time Systems 26

A Robust Scheduling Algorithm for Overload-Tolerant Real-Tim...

引用

26th IEEE International Symposium on Real-Time Distributed Computing (ISORC)

作者： Avan, Amin Azim, Akramul Mahmoud, Qusay H. Ontario Tech Univ Dept Elect Comp & Software Engn Oshawa ON L1G 0C5 Canada

ISBN: (纸本)9798350339024

A real-time system is overloaded when all the tasks in a workload cannot meet their deadlines, and hence a robust algorithm is essential to maximize the number of tasks that meet their deadlines with the minimum number of miss rates and context switching. Although the Rate Monotonic (RM), Earliest Deadline First (EDF), and Least Laxity First (LLF) algorithms optimally perform and schedule tasks on a non-overloaded system, they have deficient performance when the system is overloaded. Therefore, we propose a new scheduling algorithm for uniprocessor and partitioned multiprocessor systems to address the overload situation. Since the proposed scheduling algorithm operates like EDF non-overloaded conditions, the proposed algorithm is optimal for non-overloaded systems. In addition, the proposed algorithm is robust against overloading situations as it executes the maximum possible tasks in the overload situation instead of missing deadlines of many tasks or burdening context switching to the system. The proposed algorithm allocates a processor to tasks based on the possibility of executing the task. The experimental results demonstrate that the proposed scheduling algorithm maximizes the number of tasks that meet their deadlines in overload conditions without a domino effect and context switching. In addition, the proposed algorithm achieves the lowest miss rate without context switching and the highest efficiency and processor utilization in the overloaded system compared with RM, EDF, and LLF.

关键词： scheduling algorithms Dynamic scheduling Overload Tolerance

来源：评论

学校读者我要写书评

暂无评论

Ordered scheduling in Control-Flow Distributed Transactional Memory 19th

Ordered Scheduling in Control-Flow Distributed Transactional...

引用

19th International Conference on Distributed Computing and Intelligent Technology (ICDCIT)

作者： Poudel, Pavan Rai, Shishir Guragain, Swapnil Sharma, Gokarna ATGWORK Norcross GA USA Kent State Univ Kent OH 44242 USA

ISBN: (纸本)9783031248474;9783031248481

Consider the control-flow model of transaction execution in a distributed system modeled as a communication graph where shared objects positioned at nodes of the graph are immobile but the transactions accessing the objects send requests to the nodes where objects are located to read/write those objects. The control-flow model offers benefits to applications in which the movement of shared objects is costly due to their sizes and security purposes. In this paper, we study the ordered scheduling problem of committing dependent transactions according to their predefined priorities in this model. The considered problem naturally arises in areas, such as loop parallelization and state-machine-based computing, where producing executions equivalent to a priority order is needed to satisfy certain properties. Specifically, we study ordered scheduling considering two performance metrics fundamental to any distributed system: (i) execution time - total time to commit all the transactions and (ii) communication cost - the total distance traversed in accessing required shared objects. We design scheduling algorithms that are individually or simultaneously efficient for both the metrics and rigorously evaluate them through several benchmarks on random and grid graphs, validating their efficiency. To our best knowledge, this is the first study of ordered scheduling in the control-flow model of transaction execution.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Hardware Architecture to Deploy Complex Multiprocessor scheduling algorithms 20

A Hardware Architecture to Deploy Complex Multiprocessor Sch...

引用

20th IEEE International Conference on Embedded and Real- Time Computing Systems and Applications (RTCSA 2014).

作者： Mancuso, Renato Srivastava, Prakalp Chen, Deming Caccamo, Marco Univ Illinois Urbana IL 61801 USA

ISBN: (纸本)9781479939541

An increasing demand for high-performance systems has been observed in the domain of both general purpose and real-time systems, pushing the industry towards a pervasive transition to multi-core platforms. Unfortunately, well-known and efficient scheduling results for single-core systems do not scale well to the multi-core domain. This justifies the adoption of more computationally intensive algorithms, but the complexity and computational overhead of these algorithms impact their applicability to real OSes. We propose an architecture to migrate the burden of multicore scheduling to a dedicated hardware component. We show that it is possible to mitigate the overhead of complex algorithms, while achieving power efficiency and optimizing processors utilization. We develop the idea of "active monitoring" to continuously track the evolution of scheduling parameters as tasks execute on processors. This allows reducing the gap between implementable scheduling techniques and the ideal fluid scheduling model, under the constraints of realistic hardware.

关键词： Computer architecture Hardware Monitoring Program processors scheduling scheduling algorithms Program processors scheduling algorithms Computer Architecture Computer hardware hardware architecture scheduling of multiprocessor PROCESSOR System performance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 71 72 73 74 75 76 77 78 79 80 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：