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

International Conference on Circuit, Power and Computing Technologies (ICCPCT)

作者： Sachin Prasanna Abhayjit Singh Gulati Anagha H C Information Technology National Institute of Technology Karnataka Surathkal Karnataka

ISBN: (数字)9798350372816

ISBN: (纸本)9798350372823

This paper introduces a novel CPU scheduling algorithm for uniprocessor systems that employs a probabilistic function to enhance fair resource allocation. Unlike traditional algorithms, our approach specifically tackles the challenge of equitable resource distribution by integrating a probabilistic methodology whilst also keeping the priority of each process in mind. We detail the implementation and evaluate its performance against established algorithms, assessing metrics such as average turnaround time, average waiting time and the gini index. All the related code, data used for testing and a working webpage to try out the algorithm first hand can be found at GitHub.

关键词： Measurement Computers Codes scheduling algorithms Probabilistic logic scheduling Resource management

来源：评论

学校读者我要写书评

暂无评论

An Empirical Design and Implementation of Job scheduling Enhancement for Kubernetes Clusters

An Empirical Design and Implementation of Job Scheduling Enh...

引用

International Conference on Information Networking

作者： Van-Binh Duong Duong Phung-Ha Jangwon Lee Younghan Kim School of Electronic Engineering Soongsil University Seoul Korea

ISBN: (数字)9798350330946

ISBN: (纸本)9798350330953

Batch job scheduling is a popular method in scheduling topics achieving considerable results. However, it is novel to bring those achievements to the cloud where problems of environments would limit algorithms. Although some projects have been introduced recently with benefits directly targeting machine learning jobs in cloud-native environments, there are gaps to be fulfilled. Consequently, this paper proposes an empirical design and implementation of deadline-aware enhancement of job scheduling for cloud-native environments. The proposal’s target is to automatically monitor, provision, and maintain machine learning jobs for batch job scheduling in cloud-native environments. The performance evaluation shows that the proposal has succeeded in reducing the average response time of machine learning jobs scheduled by different algorithms.

关键词： Performance evaluation Machine learning algorithms scheduling algorithms Clustering algorithms Machine learning scheduling Proposals

来源：评论

学校读者我要写书评

暂无评论

Resource Optimization in Cloud Environment Using Advanced Metaheuristic scheduling Algorithm

Resource Optimization in Cloud Environment Using Advanced Me...

引用

Sustainable Communication Networks and Application (ICSCNA), International Conference on

作者： Pasnur Deeplaxmi Cholleti Vikas Santhosh Kumar Medishetti Geetanjali College of Engineering and Technology Hyderabad T.S. India Keshav Memorial Institute of Technology Hyderabad T.S. India Nalla Narasimha Reddy Education Society's Group of Institutions Hyderabad T.S. India

ISBN: (数字)9798331530013

ISBN: (纸本)9798331530020

Task scheduling (TS) especially in cloud environments is quite a challenge because the resources within cloud are dynamic while the tasks present within a cloud have diverse characteristics. This paper aims at presenting a new scheduling technique based on one of the metaheuristic algorithms called Harris Hawks Optimization (HHO), which is derived from the social instinct and predatory hunting behavior of the Harris's hawks. The HHO algorithm is intended to deal with the challenges that appear in the pattern of tasks by adjusting the important factors like makespan, energy and resource utilization. We evaluate the performance of HHO through comprehensive simulations and compare it against traditional scheduling methods, highlighting its efficacy in balancing load and minimizing latency. The results demonstrate that the HHO-based scheduling approach achieves notable improvements in scheduling efficiency, with 15% improvement in energy consumption, a 16% reduction in makespan, and an 18% increase in throughput. The work that is presented in the paper offers a comprehensive approach to effective coordination of tasks in cloud computing systems to propose a satisfactory way to address this challenge in the context of current application-driven compute-intensive applications.

关键词： Cloud computing Energy consumption scheduling algorithms Heuristic algorithms Green communications Metaheuristics Throughput Dynamic scheduling Resource management Load modeling

来源：评论

学校读者我要写书评

暂无评论

Runtime Composition of Iterations for Fusing Loop-carried Sparse Dependence 23

Runtime Composition of Iterations for Fusing Loop-carried Sp...

引用

2023 International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2023

作者： Cheshmi, Kazem Strout, Michelle Mehri Dehnavi, Maryam Electrical and Computer Engineering McMaster University Hamilton Canada Computer Science University of Arizona Tucson United States Computer Science University of Toronto Toronto Canada

ISBN: (纸本)9798400701092

Dependence between iterations in sparse computations causes inefficient use of memory and computation resources. This paper proposes sparse fusion, a technique that generates efficient parallel code for the combination of two sparse matrix kernels, where at least one of the kernels has loop-carried dependencies. Existing implementations optimize individual sparse kernels separately. However, this approach leads to synchronization overheads and load imbalance due to the irregular dependence patterns of sparse kernels, as well as inefficient cache usage due to their irregular memory access patterns. Sparse fusion uses a novel inspection strategy and code transformation to generate parallel fused code optimized for data locality and load balance. Sparse fusion outperforms the best of unfused implementations using ParSy and MKL by an average of 4.2× and is faster than the best of fused implementations using existing scheduling algorithms, such as LBC, DAGP, and wavefront by an average of 4× for various kernel combinations. © 2023 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

CIS: Composable Instruction Set for Streaming Applications: Design, Modeling, and scheduling

arXiv

引用

arXiv 2024年

作者： Yang, Yu Hemani, Ahmed González, Jordi Altayó KTH Royal Institute of Technology Stockholm Stockholm Sweden

The efficiency improvement of hardware accelerators such as single-instruction-multiple-data (SIMD) and coarse-grained reconfigurable architecture (CGRA) empowers the rapid advancement of AI and machine learning applications. These streaming applications consist of numerous vector operations that can be naturally parallelized. Despite the outstanding achievements of today’s hardware accelerators, their potential is limited by their instruction set design. Traditional instruction sets, designed for microprocessors and accelerators, focus on computation and pay little attention to instruction composability and instruction-level cooperation. It leads to a rigid instruction set that is difficult to extend and significant control overhead in hardware. This paper presents an instruction set that is composable in both spatial and temporal sense and suitable for streaming applications. The proposed instruction set contains significantly fewer instruction types but can still efficiently implement complex multi-level loop structures, which is essential for accelerating streaming applications. It is also a resource-centric instruction set that can be conveniently extended by adding new hardware resources, thus creating a custom heterogeneous computation machine. Besides presenting the composable instruction set, we propose a simple yet efficient instruction scheduling algorithm. We analyzed the scalability of the scheduling algorithm and compared the efficiency of our compiled programs against RISC-V programs. The results indicate that our scheduling algorithm scales linearly, and our instruction set leads to near-optimal execution latency. The mapped applications on CIS are nearly 10 times faster than the RISC-V version. © 2024, CC BY-SA.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Low Earth Orbit Satellite scheduling Optimization Based on Deep Reinforcement Learning

Low Earth Orbit Satellite Scheduling Optimization Based on D...

引用

International Conference on Information and Communication Technology Convergence (ICTC)

作者： Junyoung Kim Soyi Jung Dept. Artificial Intelligence Convergence Network Ajou University Suwon South Korea Dept. Electrical and Computer Engineering Ajou University Suwon South Korea

ISBN: (数字)9798350364637

ISBN: (纸本)9798350364644

In next-generation 6G scenarios, non-terrestrial net-works employing low Earth orbit (LEO) satellites will be pivotal in achieving ultra-wide coverage, ultra-connectivity, and ultra-precision. Although LEO satellites provide comprehensive global coverage, their rapid mobility introduces frequent handovers, requiring sophisticated scheduling to maintain uninterrupted service. This paper proposes a deep reinforcement learning-based scheduling algorithm in order to improve service rate and continuity for terrestrial users in multi-LEO) environments.

关键词： Satellites scheduling algorithms Low earth orbit satellites Handover Deep reinforcement learning Timing Information and communication technology Optimization Next generation networking Convergence

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling Using Multi-scale Graph Attention Neural Network

Dynamic Scheduling Using Multi-scale Graph Attention Neural ...

引用

International Conference on Power and Energy Technology (ICPET)

作者： Hua-Kun Que Sheng Huang Xiao Jiang Rui-Biao Xie Qian-Qian Cai Guangdong Power Grid Corporation Metrology Center Guangzhou China

ISBN: (数字)9798350375855

ISBN: (纸本)9798350375862

Dynamic scheduling issues have garnered considerable attention in the realm of network topology-based research. Within power systems, efficient resource allocation and link scheduling, rooted in system networks, are paramount for optimizing power resource utilization and operational efficacy. This paper delves into the distributed link scheduling task within system networks, where a prevalent approach relies on Maximum Weighted Independent Set (MWIS) and greedy algorithms due to the versatility and broad applicability. Nonetheless, these greedy methodologies tend to disregard different ranges of topological information within networks. Different business and regional conflict network structures in power system vary, and different neighborhoods in the conflict network contribute differently to the node's unity function. To adapt to different network structures and comprehensively consider the roles of nodes within different ranges of neighborhoods, this paper proposes a link scheduling algorithm based on multi-scale graph attention feature embedding i.e. Multi-scale Graph Attention based MWIS solver. This solver integrates the combined effects of nodes within multiple neighborhood ranges in the conflict graph by defining different attention scales for graph feature embedding, thereby improving the unity function of the generated scheduling strategy. Experimental results validate the superiority of the proposed multi-scale graph attention feature embedding-based link scheduling algorithm over conventional approaches, affirming the efficacy of multi-scale graph attention features.

关键词： Greedy algorithms scheduling algorithms Heuristic algorithms Dynamic scheduling Graph neural networks Power systems Resource management Business

来源：评论

学校读者我要写书评

暂无评论

An Integrated Framework for Bus-Driver Allocation in Bangladesh 4th

An Integrated Framework for Bus-Driver Allocation in Bangl...

引用

International Conference on 4th Industrial Revolution and Beyond, IC4IR 2021

作者： Chakraborty, Mondira Saha, Sajeeb Jagannath University Dhaka Bangladesh

ISBN: (纸本)9789811980312

Intelligent transport system (ITS) aims to launch constructive vehicular connectivity and synchronization techniques which notably improve travel efficiency by reducing traffic gridlock, irregularities, mishaps, etc. There are numerous applications of ITS innovations in first world countries where emergent nations are yet depending on the fragmented disorganized analog public transportation system. The key challenge in underdeveloped countries is the maintenance of efficient timetables and scheduling of public transportation systems. In this paper, we have proposed a bus transit framework that consists of a timetable and a bus-driver scheduling algorithm to resolve this predicament. A coherent timetable considering passenger load in traffic rush hours is generated for scheduling the fixed number of trips and lines. To schedule the buses and drivers, three selection procedures—First Serve Check First (FSCF), Equal Allocation (EA), Random Allocation (RA) have been implemented and analyzed with varying numbers of trips and lines. The experimental results depict that, FSCF schedules with a minimum number of vehicles and drivers, though the algorithm runtime is higher compared to other approaches. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

CVTSA: Cooperative VNF and Time-Slot scheduling Algorithm for NFV Orchestration

CVTSA: Cooperative VNF and Time-Slot Scheduling Algorithm fo...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Chenxi Liao Jia Chen Deyun Gao Xu Huang Jingjing Liu Shang Liu Dongsheng Qian School of Electronic and Information Engineering Beijing Jiaotong University Beijing China Peng Cheng Laboratory Shenzhen China China Mobile Group Liaoning Company Limited Liaoning China

ISBN: (数字)9798350387414

ISBN: (纸本)9798350387421

A successful blend of network function virtualization (NFV) and software-defined networking (SDN) can offer flexible and varied network services, given the quick ascent of developing applications propelled by the next-generation 6G network vision. In NFV, the ordered execution of service functions that constitute emerging applications is modeled as service function chaining (SFC) and is no longer limited to traditional network functions. Nevertheless, concurrent demands for joint scheduling of network and computing resources with latency sensitivity in resource allocation frequently accompany these application demands. In this paper, we conduct SFC scheduling as an integer linear programming (ILP) problem to tackle this issue. Secondly, we provide a resource-aware SFC scheduling algorithm that combines VNF and timeslots. In order to increase the acceptance rate of latency-sensitive network services, it aims to optimize resource utilization while strictly adhering to application latency requirements by dynamically sensing the availability of resources under various time slots and, consequently, efficiently and collaboratively scheduling computing and network resources under spatiotemporal states. Experimental results demonstrate that the proposed algorithm not only maximizes resource utilization but also accommodates a larger number of latency-sensitive service requests.

关键词： Sensitivity scheduling algorithms Service function chaining Heuristic algorithms Computational modeling Routing Sensors

来源：评论

学校读者我要写书评

暂无评论

Physiological Conversations For Detection and Prediction of Emotion Recognition Using scheduling Algorithm

Physiological Conversations For Detection and Prediction of ...

引用

Applied Intelligence and Computing (AIC), IEEE World Conference on

作者： R. Sathiyapriya R. Vanitha Department of Computer Science and Engineering IFET College of Engineering Villupuram Tamilnadu

ISBN: (数字)9798350384598

ISBN: (纸本)9798350384604

By anticipating behavioural patterns and preventing the spread of harmful memes, machine learning enhances psychology. Cutting-edge algorithms identify meme humour and assess its influence on communities. Psychology’s ability to forecast future behaviours and societal difficulties is enhanced by this combination. New tools are produced via interdisciplinary collaboration in computer science, data science, and psychology. This combination strengthens psychology’s capacity for accurate prediction and practical application. The combination of machine learning and psychology is expected to advance understanding of human behaviour. This synergy promotes interventions that improve mental health and the general well-being of society in addition to helping to fathom the intricacies of the mind.

关键词： Human computer interaction Emotion recognition Machine learning algorithms scheduling algorithms Psychology Collaboration Machine learning Predictive models Prediction algorithms Data processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：