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

IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)

作者： Yusuke Harada Kazuki Abe Myungryun Yoo Takanori Yokoyama Tokyo City University Tokyo Japan Presently with PFU Limited

ISBN: (纸本)9781509018949

Various embedded systems are used in a smart city and the required functionalities of real-time operating systems (RTOS) are different depending on applications. Most RTOSs adopt just fixed priority scheduling. Some applications, however, require dynamic scheduling algorithms. The paper presents a method to customize the scheduling algorithm and the resource access protocol of an OSEK OS using aspect-oriented programming (AOP). We define aspects to replace the fixed priority scheduling mechanism of the OSEK OS with an Earliest Deadline First (EDF) scheduling mechanism or a Rate Monotonic Critical Laxity (RMCL) scheduling mechanism. We also define aspects to customize the resource access protocol for EDF scheduling and RMCL scheduling. By using the aspects, we can customize the scheduling algorithm and the resource access protocol without modifying the original source code. This improves the maintainability of the RTOS family. The evaluation results show that the overhead of AOP is small enough.

关键词： scheduling algorithms Access protocols Operating systems Optimal scheduling Dynamic scheduling Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Analysis of real-time scheduling algorithms under overload conditions in a multi-core ECU

Analysis of real-time scheduling algorithms under overload c...

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： SeongHyeon Lim SeJeong Lim YoungSoo Do JaeWook Jeon Department of Electrical and Computer Engineering Sungkyunkwan University Suwon Korea

ISBN: (数字)9798350394085

ISBN: (纸本)9798350394092

As a vehicle’s software functionality increases, the number of ECUs required also increases. The addition of more ECUs to a vehicle is not a beneficial modification from a multitude of perspectives, including financial, operational, and environmental. One possible method for reducing the number of ECUs is to consolidate them using multi-core processors. In this paper, we apply representative real-time scheduling algorithms to a multi-core processor and analyze the stability of each algorithm when the ECU is overloaded. We also evaluate two methods for distributing tasks from a communication core to processing cores. One is based on odd and even priorities, and the other is a random, priority-independent distribution.

关键词： Industrial electronics Multicore processing scheduling algorithms Real-time systems Stability analysis Software Reliability

来源：评论

学校读者我要写书评

暂无评论

A performance comparison of LTE downlink scheduling algorithms in time and frequency domains

A performance comparison of LTE downlink scheduling algorith...

引用

IEEE International Conference on Communications (ICC)

作者： Mattia Carpin Andrea Zanella Jawad Rasool Kashif Mahmood Ole Grøndalen Olav N. Østerbø Dept. of Information Engineering University of Padova Italy Telenor Norway Telenor Research Norway

A number of scheduling algorithms for LTE downlink have been proposed and evaluated leveraging the flexibility of the resource allocation in both the time and the frequency domain. However, the existing literature falls short when it comes to schedulers that provide throughput guarantees. In this paper, we contribute to fill this gap by implementing a scheduling algorithm that provides long-term throughput guarantees to the different users, while opportunistically exploiting the instantaneous channel fluctuations to increase the cell capacity. We perform a thorough performance analysis comparing this algorithm with the other well known algorithms by means of extensive ns-3 simulations, both for saturated UDP and TCP traffic sources. The analysis makes it possible to appreciate the difference among the scheduling algorithms, and to assess the performance gain, both in terms of cell capacity and packet service time, obtained by allowing the schedulers to work in the frequency domain.

关键词： Throughput Fading Signal to noise ratio Interference scheduling algorithms Frequency-domain analysis OFDM

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of scheduling algorithms for Multiprocessor Systems

Comparative Study of Scheduling Algorithms for Multiprocesso...

引用

Intelligent and Innovative Technologies in Computing, Electrical and Electronics (IITCEE), International Conference

作者： M Sreenath P A Vijaya Department of ECE BNMIT under VTU Belagavi Bengaluru India Department of ECE BNMIT Bengaluru Karnataka India

Traditional real-time scheduling algorithms are developed employing a standard framework to satisfy the requirements for a rapid execution time, high performance, and low power consumption. However, real-time control is gaining significance for a variety of applications, including manufacturing, data processing systems, aviation, and others. The goal of the current effort is to find the optimal functional analysis of the system while considering performance efficiency and processor use into account as critical components for tasks to be successfully executed within the allocated time. In this study, real-time scheduling methodologies and multiprocessor system scheduling algorithms are compared in order to determine the characteristics that are most useful for classification. The work load should be distributed equitably among the system's various processors in order to prevent faulty operations in an embedded system. Real-time scheduling algorithms are often built utilizing a standard framework in order to meet the demands for lowest execution time, minimal power consumption, and maximum performance. Users can implement new algorithms on various simulation tools.

关键词： Power demand Job shop scheduling Embedded systems scheduling algorithms Data processing Real-time systems Functional analysis

来源：评论

学校读者我要写书评

暂无评论

Heuristic and meta-heuristic workflow scheduling algorithms in multi-cloud environments — A survey

Heuristic and meta-heuristic workflow scheduling algorithms ...

引用

International Conference on Advanced Computing and Communication Systems (ICACCS)

作者： C. Nandhakumar K. Ranjithprabhu Dept. of CSE PPG Institute of Technology Coimbatore India

Cloud computing recent emanation has drastically diversified everyone's perception of software delivery, infrastructure architectures, application development and deployment models. It is a new touchstone preceding the enterprise application development that can effectively expedite and facilitate the execution of various workflows in business process management system. Workflow is an automation of a business entity that can manage the business processes efficiently satisfying the requirements of prevailing enterprises. Dynamic workflows in a cloud computing environment empower the utilization of various cloud services to facilitate workflow execution. scheduling multiple workflows in cloud environment is always a challenge. Workflow scheduling is a critical issue in the management of workflow execution. In this paper, we have compared and analyzed the performance of different heuristic workflow scheduling algorithms with various QoS parameters and scheduling factors.

关键词： Cloud computing scheduling Algorithm design and analysis Heuristic algorithms scheduling algorithms Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Dynamic particle swarm scheduling algorithms for heterogeneous actuators

Dynamic particle swarm scheduling algorithms for heterogeneo...

引用

Computer Technology and Information Science (ISCTIS), International Symposium on

作者： Lingyu Yang Ming Ni Xinsheng Yu Jinzhong Wan The 32nd Research Institute of China Electronics Technology Group Corporation Shanghai China Jimei University Xiamen China

ISBN: (数字)9798350354560

ISBN: (纸本)9798350354577

Heterogeneous computing solves the problem of attack and defense asymmetry in cyberspace by establishing a reliable system from the perspective of endogenous security, for the lack of heterogeneous executor quantization in the current scheduling algorithms for active defense systems, this paper proposes a heterogeneous executor set adaptation function based on the probability of loophole attack and the index of heterogeneity measure, and puts forward a dynamic particle swarm scheduling algorithm based on the genetic idea, which utilizes the weights and the compression factor to control the convergence rate, with stable global search ability and optimization ability. The results show that the algorithm has better performance in terms of effectiveness and reliability than previous schemes while ensuring the security advantage.

关键词： Weight measurement scheduling algorithms Heuristic algorithms Dynamic scheduling Particle measurements Security Reliability Indexes Particle swarm optimization Optimization

来源：评论

学校读者我要写书评

暂无评论

A review of research on MapReduce scheduling algorithms in Hadoop

A review of research on MapReduce scheduling algorithms in H...

引用

International Conference on Computing, Communication & Automation (ICCCA)

作者： Namrata Singh Sanjay Agrawal Dept. of Computer Engineering & Applications National Institute of Technical Teachers' Training and Research Bhopal India

ISBN: (纸本)9781479988914

Big data has created an era of tera where bulk volume of data is being collected at escalating rates. Due to increase in storage capacities, processing power and availability of data, the size of global data is growing in zeta-bytes. Hadoop is one of the technologies in the big data landscape for analyzing the data through Hadoop Distributed File System and Map-Reduce. Job scheduling is an important activity for efficient management of cluster resources. Hadoop schedulers are pluggable components which assign resources to jobs. In a variety of schedulers, prominent are the default FIFO, Fair and Capacity schedulers. In this paper, a comprehensive survey of the various job scheduling algorithms has been performed. Also their comparative parametric analysis has been carried out by emphasizing the common key points in these schedulers.

关键词： scheduling scheduling algorithms Algorithm design and analysis Computational modeling Cooling Time factors

来源：评论

学校读者我要写书评

暂无评论

Various job scheduling algorithms in cloud computing: A survey

Various job scheduling algorithms in cloud computing: A surv...

引用

International Conference on Information Communication and Embedded Systems (ICICES)

作者： Yash P. Dave Avani S. Shelat Dhara S. Patel Rutvij H. Jhaveri Department of Computer Science and Engineering Shri Sa'd Vidya Mandal Institute of Technology Bharuch India Department of Computer Science and Information Technology Shri Sa'd Vidya Mandal Institute of Technology Bharuch India

ISBN: (纸本)9781479936984

Cloud Computing provides a Computing environment where different resources, infrastructures, development platforms and software are delivered as a service to customers virtually on pay per time basis. Low cost, scalability, reliability, utility-based computing are important aspects of cloud computing. Job scheduling is an essential and most important part in any cloud environment. With increasing number of users, Job scheduling becomes a strenuous task. Ordering the jobs by scheduler while maintaining the balance between quality of services (QoS), efficiency and fairness of jobs is quite challenging. scheduling algorithms are implemented considering parameters such as throughput, resource utilization, latency, cost, priority, computational time, physical distances, performance, bandwidth, resource availability. Though there are different scheduling algorithms available in cloud computing, a very less comparative study has been done on performance of various scheduling algorithms with respect to above mentioned parameters. This paper aims at a comparative study of various types of job scheduling algorithms that provide efficient cloud services.

关键词： Cloud computing scheduling algorithms scheduling Algorithm design and analysis Classification algorithms Resource management

来源：评论

学校读者我要写书评

暂无评论

Efficient vaccine scheduler based on CPU scheduling algorithms

Efficient vaccine scheduler based on CPU scheduling algorith...

引用

Artificial Intelligence and Machine Vision (AIMV), International Conference on

作者： Vasu Gondaliya Shreya Patel Jay Hemnani Samir Patel School of Technology Pandit Deendayal Energy University Gandhinagar India

ISBN: (纸本)9781665442121

This paper presents an efficient algorithm for scheduling vaccination process which is based on the CPU scheduling algorithms of an operating system. Based on a custom-designed scoring system of the given schedule, an analysis of why the first-come, first-served basis of scheduling vaccines is inefficient. The ranking system is based on the concept that health care personnel should be given higher priority, followed by front-line workers, major healthcare patients, elderly people, and finally the general public. This is the category in the dataset, the higher the importance of the person who needs to be vaccinated, the better the score. Different CPU scheduling methods are analyzed based on Arrival Time, Turn Around Time, Waiting Time, and Response Time. We obtain the resultant schedule after providing the dataset, the number of vaccines per day, and the selected algorithm for scheduling, and we get a customized schedule based on the data by entering the Aadhar number. The FCFS and Priority algorithms were compared to visualize the differences in efficiency for both algorithms, as well as an analysis of how many vaccines to choose per day and the related length of schedule in days.

关键词： Schedules scheduling algorithms Operating systems Machine vision scheduling Vaccines Registers

来源：评论

学校读者我要写书评

暂无评论

LTE CELLULAR NETWORKS PACKET scheduling algorithms IN DOWNLINK AND UPLINK TRANSMISSION: A SURVEY

arXiv

引用

arXiv 2022年

作者： Sirhan, Najem N. Martinez-Ramon, Manel Electrical and Computer Engineering Department University of New Mexico AlbuquerqueNM United States

This survey paper provides a detailed explanation of Long Term Evolution (LTE) cellular network's packet scheduling algorithms in both downlink and uplink directions. It starts by explaining the difference between Orthogonal Frequency Division Multiple Access (OFDMA) that is used in downlink transmission, and Single Carrier -Frequency Division Multiple Access (SC-FDMA) is used in uplink. Then, it explains the difference between the LTE scheduling process in the donwlink and uplink through explaining the interaction between users and the scheduler. Then, it explains the most commonly used downlink and uplink scheduling algorithms through analyzing their formulas, characteristics, most suitable conditions for them to work in, and the main differences among them. This explanation covers the Max Carrier-to-Interference (C/I), Round Robin (RR), Proportional Fair (PF), Earliest Deadline First (EDF), Modified EDF-PF, Modified-Largest Weighted Delay First (M-LWDF), Exponential Proportional Fairness (EXP-PF), Token Queues Mechanism, Packet Loss Ratio (PLR), Quality Guaranteed (QG), Opportunistic Packet Loss Fair (OPLF), Low Complexity (LC), LC-Delay, PF-Delay, Maximum Throughput (MT), First Maximum Expansion (FME), and Adaptive Resource Allocation Based Packet scheduling (ARABPS). Lastly, it provides some concluding remarks. © 2022, CC BY.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：