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

dynamic scheduling algorithm for Data Relay Services in Next-Generation TDRS Systems

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2018年第11期15卷 665-669页

作者： Deng, Changlin Guo, Wei Hu, Weisheng Shanghai Jiao Tong Univ State Key Lab Adv Opt Commun Syst & Networks Sch Elect Informat & Elect Engn Shanghai 200240 Peoples R China

来源：评论

学校读者我要写书评

暂无评论

A dynamic scheduling algorithm for energy harvesting embedded systems

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2016年第1期2016卷 1页

作者： Tan, Yonghong Yin, Xiangdong Hunan Univ Sci & Engn Expt Training Ctr Yongzhou Hunan Peoples R China Hunan Univ Sci & Engn Sch Elect & Informat Engn Yongzhou Hunan Peoples R China

Energy harvesting embedded systems are embedded systems that integrate with energy harvesting modules. In this kind of systems, service tasks and energy harvesting tasks must be scheduled efficiently to keep the whole system working properly as long as possible. In this paper, we model an energy harvesting embedded system with an energy model, a task model, and a resource model and propose a dynamic task scheduling algorithm. The proposed algorithm is based on dynamic voltage and frequency scaling technique and dynamically concentrates all disperse free time together to harvest energy. We validate the efficiency and effectiveness of the proposed algorithm under both energy-constraint and non-energy-constraint situations with the Yartiss simulation tool.

关键词： Energy harvesting embedded systems dynamic scheduling algorithm Energy model

来源：评论

学校读者我要写书评

暂无评论

Profit-driven Wireless Charging dynamic scheduling for WRSN in Green IoT 23

Profit-driven Wireless Charging Dynamic Scheduling for WRSN ...

引用

23rd IEEE International Conference on Communication Technology, ICCT 2023

作者： Liu, Silai Liu, Xilong Ansari, Nirwan School of Ise Yunnan University Kunming China New Jersey Institute of Technology Advanced Networking Laboratory NewarkNJ07102 United States

ISBN: (纸本)9798350325959

With the rapid development of fifth generation (5G) communication technology, Wireless Rechargeable Sensor Networks (WRSNs) have gained attention. Wireless Power Transfer (WPT) enables WRSNs to play important roles in Internet of Things (IoT) applications like smart cities, smart farms and intelligent factories. In these scenarios, in order to save on-grid energy and protect environment, a Green Base Station (GBS) is leveraged to first harvest green energy and then wirelessly power the surrounding sensors in WRSNs by WPT. Most related works focus on maximizing the Green Energy Utilization (GEU) in WPT but overlook reducing nodes' waiting time for energy replenishment, which affects Quality of Service (QoS) and the wireless charging service provider's profit in terms of losing customers. Hence, in this paper, we first propose a novel pricing model that reflects waiting time to maximize the provider's profit. The charging profit maximization problem is formulated as an optimization problem, which is NP-hard, and solved by a heuristic algorithm called dynamic scheduling (DS) that considers both waiting time and GEU. Finally, we validate the performance of the proposed algorithm through extensive simulations. © 2023 IEEE.

关键词： dynamic scheduling algorithm Green energy utilization Green loT QoS

来源：评论

学校读者我要写书评

暂无评论

Static Task scheduling for Parallel Execution of Large-Scale Multidisciplinary Design Optimization Models

Static Task Scheduling for Parallel Execution of Large-Scale...

引用

AIAA SciTech Forum

作者： Sperry, Mark Z. Kondap, Kavish Hwang, John T. Univ Calif San Diego Dept Mech & Aerosp Engn 9500 Gilman Dr La Jolla CA 92093 USA Francis Parker Sch 6501 Linda Vista Rd San Diego CA 92111 USA

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

Multidisciplinary design optimization (MDO) models are built by assembling sub-models that represent varying disciplines and design conditions. Consequently, such models are often computationally expensive, requiring their evaluation in a parallel computing environment to decrease solution time. MDO modeling frameworks, which are software tools to allow construction of MDO models, generally require manual user input to specify where to parallelize their code. However, this process can be tedious if the model is large or complex. In this paper, we propose a method heavily inspired by scheduling theory that aims to fully automate parallelization of MDO models. We use static task scheduling to partition mathematical operations in the model to different processors prior to model execution. Additionally, our approach supports adjoint-based derivative computation to enable the use of gradient-based optimization algorithms. Our results show a significant performance improvement when applying our method to several MDO applications. We believe our approach enables MDO modelers to solve computationally expensive problems in a more efficient manner.

关键词： Multidisciplinary Design and Optimization Parallel Computing Environment Optimization algorithm Software Tool Uncertainty Quantification Computing Vortex Lattice Method Blade Element Momentum Theory Asynchronous Communications dynamic scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

The Researches on Path Planning algorithm for Distribution Vehicles Based on Automata 19

The Researches on Path Planning Algorithm for Distribution V...

引用

5th International Conference on Industrial and Business Engineering (ICIBE)

作者： Wang Danyuan Beijing Jiaotong Univ Sch Econ & Management Beijing Peoples R China

ISBN: (纸本)9781450376532

With the rapid development of logistics, customers can enjoy more convenient service. But meanwhile, the market has also put higher requirements forward the timeliness of cargo distribution. Traffic demand has increasing continuously, which has led people to tend to buy more motor vehicles. And the increasing vehicle ownership has brought great pressure on urban transportation, causing traffic congestion to become increasingly serious. However, traffic congestion sometimes has influence on the timeliness of cargo distribution. This article is based on the theory of automata and applies the real-time communication positioning technology of vehicle networking to simulate the running status of the distribution vehicles in the road network. Based on this, it designs a dynamic scheduling algorithm for the distribution vehicles' driving path, and it can optimize distribution vehicles' driving path in real time, and improve the efficiency of distribution.

关键词： Automata dynamic scheduling algorithm Distribution vehicles

来源：评论

学校读者我要写书评

暂无评论

MRM: mobile resource management scheme on mobile cloud computing

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2018年第4期9卷 1245-1257页

作者： Yi, Gangman Heo, Yoon-A Byun, Hwirim Jeong, Young-Sik Dongguk Univ Dept Multimedia Engn Seoul 04620 South Korea

Mobile Resource Management without Cloud Server (MRM) is the computing resource integrated management of mobile devices in order to establish mobile cloud computing infrastructure without a cloud server and to provide computing services in this research. The MRM forms a logical resource pool to integrate physical resources from scattered mobile devices and provides computing services. In other words, the MRM offers static and dynamic performance-based computing services, designed to provide computing services that guarantee availability and expandability through a mobile device resource pool without a cloud server. To this end, the MRM defines static and dynamic metadata to manage mobile devices. Detailed schemes consisting of the MRM configuration, the MRM management, and the MRM operation are established to design and implement the MRM. To integrate the MRM resources and validate the effectiveness of the computing services, the configuration time for resource integration, and the task time, in accordance with simultaneous requests for computing services, is measured, and the availability results for the MRM are demonstrated.

关键词： Mobile cloud computing Mobile resource management Collaborative architecture dynamic scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

ACO Based dynamic scheduling algorithm for Real-Time Multiprocessor Systems

引用

INTERNATIONAL JOURNAL OF GRID AND HIGH PERFORMANCE COMPUTING 2011年第3期3卷 20-30页

作者： Shah, Apurva Kotecha, Ketan GH Patel Coll Engg Tech Anand Gujarat India Nirma Univ Ahmadabad Gujarat India

The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm for homogeneous multiprocessor real-time systems is proposed. The results obtained during simulation are measured in terms of Success Ratio (SR) and Effective CPU Utilization (ECU) and compared with the results of Earliest Deadline First (EDF) algorithm in the same environment. It has been observed that the proposed algorithm is very efficient in underloaded conditions and it performs very well during overloaded conditions also. Moreover, the proposed algorithm can schedule some typical instances successfully which are not possible to schedule using EDF algorithm.

关键词： Ant Colony Optimization (ACO) dynamic scheduling algorithm Multiprocessor Systems Real-Time Systems scheduling

来源：评论

学校读者我要写书评

暂无评论

Joint scheduling and Power Control for Delay Guarantees in Heterogeneous Cognitive Radios

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2016年第9期15卷 6298-6309页

作者： Ewaisha, Ahmed E. Tepedelelioglu, Cihan Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA

An uplink multisecondary user (SU) cognitive radio system having average delay constraints as well as an interference constraint to the primary user (PU) is considered. If the interference channels between the SUs and the PU are statistically heterogeneous due to the different physical locations of the different SUs, the SUs will experience different delay performances. This is because SUs located closer to the PU transmit with lower power levels. Two dynamic scheduling-and-power-allocation policies that can provide the required average delay guarantees to all SUs irrespective of their locations are proposed. The first policy solves the problem when the interference constraint is an instantaneous one, while the second is for problems with long-term average interference constraints. We show that although the average interference problem is an extension to the instantaneous interference one, the solution is totally different. The two policies, derived using the Lyapunov optimization technique, are shown to be asymptotically delay optimal while satisfying the delay and interference constraints. Our findings are supported by extensive system simulations and shown to outperform the existing policies as well as shown to be robust to channel estimation errors.

关键词： dynamic scheduling algorithm Lyapunov technique statistical delay constraints uplink multisecondary user system average interference constraints wireless communication

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithms of DNC Systems Based on CAN and Program Expending Rate

A Scheduling Algorithms of DNC Systems Based on CAN and Prog...

引用

International Conference on Engineering Design and Optimization (ICEDO 2010)

作者： Cai, Huilin Li, Zonggang Ren, Enen Lanzhou Jiaotong Univ Sch Mechatron Engn Lanzhou 730070 Peoples R China Lanzhou Jiaotong Univ Sch Elect & Informat Engn Lanzhou 730070 Peoples R China

ISBN: (纸本)9780878492220

In order to avoid communication conflicts in DNC systems, the scheduling tactics adopting a modified guaranteed EDF algorithm to DNC systems' numerical control (NC) programs transmission was proposed. A condition was given to guarantee all NC machines in DNC systems work continuously. A mathematic model based on the actual expending rate of NC program was established to decide the priority of NC program transformation of all NC machines. A constraint condition for two machines with neighbored priority was proposed to avoid the conflict in the scheduling times. A dynamic scheduling scheme was presented for DNC systems. The validity of the presented method is verified by the practical tests.

关键词： Program expending rate CAN bus DNC dynamic scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A dynamic scheduling algorithm with minimum context switches for spacecraft avionics systems

A dynamic scheduling algorithm with minimum context switches...

引用

IEEE Aerospace Conference

作者： Zolfaghari, B Iran Univ Sci & Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)0780381556

Most of the process-scheduling algorithms, which can be exploited by spacecraft avionics systems, fall into one of the two main categories: static algorithms and dynamic algorithms. 12 Static algorithms assign priorities to processes before runtime. These algorithms bound the CPU utilization and require considerable information about the runtime parameters of processes in advance. These disadvantages encourage the spacecraft avionics system designers to exploit dynamic algorithms instead. But these algorithms have their own disadvantages. For example, these algorithms require so many context switches to schedule the processes. This causes a notable overhead in the runtime. One of the well-known dynamic algorithms is the MLF (Minimum Laxity First) algorithm. The MLF algorithm suffers from a serious problem (in addition to the need for so many context switches). This paper proposes a novel dynamic algorithm called Optimized MLF which is an attempt to solve the problems of the MLF algorithm in order to make it more applicable to spacecraft avionics systems. The performance of the proposed scheduling algorithm is evaluated through the use of mathematical modeling as well as simulation results. Both the mathematical model and simulation results show that the optimized MLF algorithm requires less context switches than the traditional MLF and makes the MLF algorithm more applicable to spacecraft avionics systems.

关键词： avionics space vehicle electronics dynamic scheduling optimisation mathematical analysis dynamic scheduling algorithm minimum context switches spacecraft avionics systems process scheduling algorithms CPU utilization minimum laxity first algorithm mathematical modeling avionics dynamic scheduling space vehicle electronics mathematical modeling mathematical analysis scheduling algorithms dynamic algorithms Spacecraft Switches algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：