A new modern resource management method based on economic model is proposed. Giving mathematic description about economic model; analysis different resource scheduling methods based on deadline and budget constrained ...A new modern resource management method based on economic model is proposed. Giving mathematic description about economic model; analysis different resource scheduling methods based on deadline and budget constrained which present by Buyya, point out shortcoming of Buyya's schedule method. Considerate integrate factor of time and budget, by import a weight coefficient named a , puts forward a new resource schedule method named STPP based on economic models of Buyya. Contrast to old schedule strategy of Buyya through analysis and experiments, STPP policy is more flexible, and is easy to import other new QoS parameters.展开更多
Frequent extreme disasters have led to frequent large-scale power outages in recent years.To quickly restore power,it is necessary to understand the damage information of the distribution network accurately.However,th...Frequent extreme disasters have led to frequent large-scale power outages in recent years.To quickly restore power,it is necessary to understand the damage information of the distribution network accurately.However,the public network communication system is easily damaged after disasters,causing the operation center to lose control of the distribution network.In this paper,we considered using satellites to transmit the distribution network data and focus on the resource scheduling problem of the satellite emergency communication system for the distribution network.Specifically,this paper first formulates the satellite beam-pointing problem and the accesschannel joint resource allocation problem.Then,this paper proposes the Priority-based Beam-pointing and Access-Channel joint optimization algorithm(PBAC),which uses convex optimization theory to solve the satellite beam pointing problem,and adopts the block coordinate descent method,Lagrangian dual method,and a greedy algorithm to solve the access-channel joint resource allocation problem,thereby obtaining the optimal resource scheduling scheme for the satellite network.Finally,this paper conducts comparative experiments with existing methods to verify the effec-tiveness of the proposed methods.The results show that the total weighted transmitted data of the proposed algorithm is increased by about 19.29∼26.29%compared with other algorithms.展开更多
In this paper,we propose a joint power and frequency allocation algorithm considering interference protection in the integrated satellite and terrestrial network(ISTN).We efficiently utilize spectrum resources by allo...In this paper,we propose a joint power and frequency allocation algorithm considering interference protection in the integrated satellite and terrestrial network(ISTN).We efficiently utilize spectrum resources by allowing user equipment(UE)of terrestrial networks to share frequencies with satellite networks.In order to protect the satellite terminal(ST),the base station(BS)needs to control the transmit power and frequency resources of the UE.The optimization problem involves maximizing the achievable throughput while satisfying the interference protection constraints of the ST and the quality of service(QoS)of the UE.However,this problem is highly nonconvex,and we decompose it into power allocation and frequency resource scheduling subproblems.In the power allocation subproblem,we propose a power allocation algorithm based on interference probability(PAIP)to address channel uncertainty.We obtain the suboptimal power allocation solution through iterative optimization.In the frequency resource scheduling subproblem,we develop a heuristic algorithm to handle the non-convexity of the problem.The simulation results show that the combination of power allocation and frequency resource scheduling algorithms can improve spectrum utilization.展开更多
For the mobile edge computing network consisting of multiple base stations and resourceconstrained user devices,network cost in terms of energy and delay will incur during task offloading from the user to the edge ser...For the mobile edge computing network consisting of multiple base stations and resourceconstrained user devices,network cost in terms of energy and delay will incur during task offloading from the user to the edge server.With the limitations imposed on transmission capacity,computing resource,and connection capacity,the per-slot online learning algorithm is first proposed to minimize the time-averaged network cost.In particular,by leveraging the theories of stochastic gradient descent and minimum cost maximum flow,the user association is jointly optimized with resource scheduling in each time slot.The theoretical analysis proves that the proposed approach can achieve asymptotic optimality without any prior knowledge of the network environment.Moreover,to alleviate the high network overhead incurred during user handover and task migration,a two-timescale optimization approach is proposed to avoid frequent changes in user association.With user association executed on a large timescale and the resource scheduling decided on the single time slot,the asymptotic optimality is preserved.Simulation results verify the effectiveness of the proposed online learning algorithms.展开更多
Goud computing is a new paradigm in which dynamic and virtualized computing resources are provided as services over the Internet. However, because cloud resource is open and dynamically configured, resource allocation...Goud computing is a new paradigm in which dynamic and virtualized computing resources are provided as services over the Internet. However, because cloud resource is open and dynamically configured, resource allocation and scheduling are extremely important challenges in cloud infrastructure. Based on distributed agents, this paper presents trusted data acquisition mechanism for efficient scheduling cloud resources to satisfy various user requests. Our mechanism defines, collects and analyzes multiple key trust targets of cloud service resources based on historical information of servers in a cloud data center. As a result, using our trust computing mechanism, cloud providers can utilize their resources efficiently and also provide highly trusted resources and services to many users.展开更多
An improved delay priority resource scheduling algorithm with low packet loss rate for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.Real-time services in LTE...An improved delay priority resource scheduling algorithm with low packet loss rate for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.Real-time services in LTE systems require lower delay and packet loss rate.However,it is difficult to meet the QoS requirements of real-time services using the current MBMS resource scheduling algorithm.The proposed algorithm in this paper jointly considers user delay information and real-time channel conditions.By introducing the user delay information,the lower delay and fairness of users are guaranteed.Meanwhile,by considering the channel conditions of users,the packet loss rate can be effectively reduced,improving the system throughput.Simulation results show that under the premise of ensuring the delay requirements of real-time services,the proposed algorithm achieves a lower packet loss rate compared to other existing algorithms.Furthermore,it can achieve a good balance between system throughput and user fairness.展开更多
Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,...Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,scheduling and executing large-scale computing tasks efficiently and allocating resources to tasks reasonably are becoming a quite challenging problem.To improve both task execution and resource utilization efficiency,we present a task scheduling algorithm with resource attribute selection,which can select the optimal node to execute a task according to its resource requirements and the fitness between the resource node and the task.Experiment results show that there is significant improvement in execution throughput and resource utilization compared with the other three algorithms and four scheduling frameworks.In the scheduling algorithm comparison,the throughput is 77%higher than Min-Min algorithm and the resource utilization can reach 91%.In the scheduling framework comparison,the throughput(with work-stealing)is at least 30%higher than the other frameworks and the resource utilization reaches 94%.The scheduling algorithm can make a good model for practical MTC applications.展开更多
In spectrum aggregation(SA), two or more component carriers(CCs) of different bandwidths in different bands can be aggregated to support wider transmission bandwidth. The current resource scheduling schemes for spectr...In spectrum aggregation(SA), two or more component carriers(CCs) of different bandwidths in different bands can be aggregated to support wider transmission bandwidth. The current resource scheduling schemes for spectrum aggregation are not optimal or suitable for CR based heterogeneous networks(Het Nets). Consequently, the authors propose a novel resource scheduling scheme for spectrum aggregation in CR based Het Nets, termed as cognitive radio based resource scheduling(CR-RS) scheme. CR-RS has a three-level structure. Under a dynamic traffic model, an equivalent throughput of the CCs based on the knowledge of primary users(PUs) is given. On this basis, the CR users data transmission time of each CC is equal in CR-RS. The simulation results show that CR-RS has the better performance than the current resource scheduling schemes in the CR based Het Nets. Meanwhile, CR-RS is also effective in other spectrum aggregation systems which are not CR based HetNets.展开更多
Resource scheduling algorithm for ForCES(Forwarding and Control Element Separation) networks need to meet the flexibility,programmability and scalability of node resources.DBC(Deadline Budget Constrain) algorithm reli...Resource scheduling algorithm for ForCES(Forwarding and Control Element Separation) networks need to meet the flexibility,programmability and scalability of node resources.DBC(Deadline Budget Constrain) algorithm relies on users select cost or time priority,then scheduling to meet the requirements of users.However,this priority strategy of users is relatively simple,and cannot adapt to dynamic change of resources,it is inevitable to reduce the QoS.In order to improve QoS,we refer to the economic model and resource scheduling model of cloud computing,use SAL(Service Level Agreement) as pricing strategy,on the basis of DBC algorithm,propose an DABP(Deadline And Budget Priority based on DBC) algorithm for ForCES networks,DABP combines both budget and time priority to scheduling.In simulation and test,we compare the task finish time and cost of DABP algorithm with DP(Deadline Priority) algorithm and BP(Budget Priority) algorithm,the analysis results show that DABP algorithm make the task complete with less cost within deadline,benifical to load balancing of ForCES networks.展开更多
An improved spectrum-efficient and fair resource scheduling algorithm for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.By jointly considering the channel con...An improved spectrum-efficient and fair resource scheduling algorithm for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.By jointly considering the channel conditions of all the users,the average packet loss rate,and the fairness of users in the MBMS group,the transmission data rate of the MBMS group is first selected according to the link adaptation and the average packet loss rate of users.Then,the resource blocks are allocated to MBMS groups according to the scheduling priority.Such a resource scheduling algorithm further balances the system throughput and user fairness.Theoretical analysis and simulation results show that the proposed algorithm can achieve a good tradeoff between system throughput and user fairness in comparison with traditional scheduling algorithms.展开更多
Recently, several novel computing paradigms are proposed, e.g., fog computing and edge computing. In such more decentralized computing paradigms, the location and resource for code execution and data storage of end ap...Recently, several novel computing paradigms are proposed, e.g., fog computing and edge computing. In such more decentralized computing paradigms, the location and resource for code execution and data storage of end applications could also be optionally distributed among different places or machines. In this paper, we position that this situation requires a new transparent and usercentric approach to unify the resource management and code scheduling from the perspective of end users. We elaborate our vision and propose a software-defined code scheduling framework. The proposed framework allows the code execution or data storage of end applications to be adaptively done at appropriate machines under the help of a performance and capacity monitoring facility, intelligently improving application performance for end users. A pilot system and preliminary results show the advantage of the framework and thus the advocated vision for end users.展开更多
One of the challenging scheduling problems in Cloud data centers is to take the allocation and migration of reconfigurable virtual machines as well as the integrated features of hosting physical machines into consider...One of the challenging scheduling problems in Cloud data centers is to take the allocation and migration of reconfigurable virtual machines as well as the integrated features of hosting physical machines into consideration. We introduce a Dynamic and Integrated Resource Scheduling algorithm (DAIRS) for Cloud data centers. Unlike traditional load-balance scheduling algorithms which often consider only one factor such as the CPU load in physical servers, DAIRS treats CPU, memory and network bandwidth integrated for both physical machines and virtual machines. We develop integrated measurement for the total imbalance level of a Cloud datacenter as well as the average imbalance level of each server. Simulation results show that DAIRS has good performance with regard to total imbalance level, average imbalance level of each server, as well as overall running time.展开更多
Resource Scheduling is crucial to data centers. However, most previous works focus only on one-dimensional resource models which ignoring the fact that multiple resources simultaneously utilized, including CPU, memory...Resource Scheduling is crucial to data centers. However, most previous works focus only on one-dimensional resource models which ignoring the fact that multiple resources simultaneously utilized, including CPU, memory and network bandwidth. As cloud computing allows uncoordinated and heterogeneous users to share a data center, competition for multiple resources has become increasingly severe. Motivated by the differences on integrated utilization obtained from different packing schemes, in this paper we take the scheduling problem as a multi-dimensional combinatorial optimization problem with constraint satisfaction. With NP hardness, we present Multiple attribute decision based Integrated Resource Scheduling (MIRS), and a novel heuristic algorithm to gain the approximate optimal solution. Refers to simulation results, in face of various workload sets, our algorithm has significant superiorities in terms of efficiency and performance compared with previous methods.展开更多
Aiming at the problem of resource allocation for digital array radar（ DAR）,a dwell scheduling algorithm is proposed in this paper. Firstly,the integrated priority of different radar tasks is designed,which ensures t...Aiming at the problem of resource allocation for digital array radar（ DAR）,a dwell scheduling algorithm is proposed in this paper. Firstly,the integrated priority of different radar tasks is designed,which ensures that the imaging tasks are scheduled without affecting the search and tracking tasks; Then,the optimal scheduling model of radar resource is established according to the constraints of pulse interleaving; Finally,a heuristic algorithm is used to solve the problem and a sparse-aperture cognitive ISAR imaging method is used to achieve partial precision tracking target imaging. Simulation results demonstrate that the proposed algorithm can both improve the performance of the radar system,and generate satisfactory imaging results.展开更多
文摘A new modern resource management method based on economic model is proposed. Giving mathematic description about economic model; analysis different resource scheduling methods based on deadline and budget constrained which present by Buyya, point out shortcoming of Buyya's schedule method. Considerate integrate factor of time and budget, by import a weight coefficient named a , puts forward a new resource schedule method named STPP based on economic models of Buyya. Contrast to old schedule strategy of Buyya through analysis and experiments, STPP policy is more flexible, and is easy to import other new QoS parameters.
基金supported by the Science and Technology Project of the State Grid Corporation of China(5400-202255158A-1-1-ZN).
文摘Frequent extreme disasters have led to frequent large-scale power outages in recent years.To quickly restore power,it is necessary to understand the damage information of the distribution network accurately.However,the public network communication system is easily damaged after disasters,causing the operation center to lose control of the distribution network.In this paper,we considered using satellites to transmit the distribution network data and focus on the resource scheduling problem of the satellite emergency communication system for the distribution network.Specifically,this paper first formulates the satellite beam-pointing problem and the accesschannel joint resource allocation problem.Then,this paper proposes the Priority-based Beam-pointing and Access-Channel joint optimization algorithm(PBAC),which uses convex optimization theory to solve the satellite beam pointing problem,and adopts the block coordinate descent method,Lagrangian dual method,and a greedy algorithm to solve the access-channel joint resource allocation problem,thereby obtaining the optimal resource scheduling scheme for the satellite network.Finally,this paper conducts comparative experiments with existing methods to verify the effec-tiveness of the proposed methods.The results show that the total weighted transmitted data of the proposed algorithm is increased by about 19.29∼26.29%compared with other algorithms.
基金funded by State Key Laboratory of Micro-Spacecraft Rapid Design and Intelligent Cluster under Grant MS01240103the National Natural Science Foundation of China under Grant 62071146National 2011 Collaborative Innovation Center of Wireless Communication Technologies under Grant 2242022k60006.
文摘In this paper,we propose a joint power and frequency allocation algorithm considering interference protection in the integrated satellite and terrestrial network(ISTN).We efficiently utilize spectrum resources by allowing user equipment(UE)of terrestrial networks to share frequencies with satellite networks.In order to protect the satellite terminal(ST),the base station(BS)needs to control the transmit power and frequency resources of the UE.The optimization problem involves maximizing the achievable throughput while satisfying the interference protection constraints of the ST and the quality of service(QoS)of the UE.However,this problem is highly nonconvex,and we decompose it into power allocation and frequency resource scheduling subproblems.In the power allocation subproblem,we propose a power allocation algorithm based on interference probability(PAIP)to address channel uncertainty.We obtain the suboptimal power allocation solution through iterative optimization.In the frequency resource scheduling subproblem,we develop a heuristic algorithm to handle the non-convexity of the problem.The simulation results show that the combination of power allocation and frequency resource scheduling algorithms can improve spectrum utilization.
基金the National Natural Science Foundation of China(61971066,61941114)the Beijing Natural Science Foundation(No.L182038)National Youth Top-notch Talent Support Program.
文摘For the mobile edge computing network consisting of multiple base stations and resourceconstrained user devices,network cost in terms of energy and delay will incur during task offloading from the user to the edge server.With the limitations imposed on transmission capacity,computing resource,and connection capacity,the per-slot online learning algorithm is first proposed to minimize the time-averaged network cost.In particular,by leveraging the theories of stochastic gradient descent and minimum cost maximum flow,the user association is jointly optimized with resource scheduling in each time slot.The theoretical analysis proves that the proposed approach can achieve asymptotic optimality without any prior knowledge of the network environment.Moreover,to alleviate the high network overhead incurred during user handover and task migration,a two-timescale optimization approach is proposed to avoid frequent changes in user association.With user association executed on a large timescale and the resource scheduling decided on the single time slot,the asymptotic optimality is preserved.Simulation results verify the effectiveness of the proposed online learning algorithms.
基金supported by the National Basic Research Program of China (973 Program) (No. 2012CB821200 (2012CB821206))the National Nature Science Foundation of China (No.61003281, No.91024001 and No.61070142)+1 种基金Beijing Natural Science Foundation (Study on Internet Multi-mode Area Information Accurate Searching and Mining Based on Agent, No.4111002)the Chinese Universities Scientific Fund under Grant No.BUPT 2009RC0201
文摘Goud computing is a new paradigm in which dynamic and virtualized computing resources are provided as services over the Internet. However, because cloud resource is open and dynamically configured, resource allocation and scheduling are extremely important challenges in cloud infrastructure. Based on distributed agents, this paper presents trusted data acquisition mechanism for efficient scheduling cloud resources to satisfy various user requests. Our mechanism defines, collects and analyzes multiple key trust targets of cloud service resources based on historical information of servers in a cloud data center. As a result, using our trust computing mechanism, cloud providers can utilize their resources efficiently and also provide highly trusted resources and services to many users.
基金Supported by the National Natural Science Foundation of China(61901027)。
文摘An improved delay priority resource scheduling algorithm with low packet loss rate for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.Real-time services in LTE systems require lower delay and packet loss rate.However,it is difficult to meet the QoS requirements of real-time services using the current MBMS resource scheduling algorithm.The proposed algorithm in this paper jointly considers user delay information and real-time channel conditions.By introducing the user delay information,the lower delay and fairness of users are guaranteed.Meanwhile,by considering the channel conditions of users,the packet loss rate can be effectively reduced,improving the system throughput.Simulation results show that under the premise of ensuring the delay requirements of real-time services,the proposed algorithm achieves a lower packet loss rate compared to other existing algorithms.Furthermore,it can achieve a good balance between system throughput and user fairness.
基金ACKNOWLEDGEMENTS The authors would like to thank the reviewers for their detailed reviews and constructive comments, which have helped improve the quality of this paper. The research has been partly supported by National Natural Science Foundation of China No. 61272528 and No. 61034005, and the Central University Fund （ID-ZYGX2013J073）.
文摘Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,scheduling and executing large-scale computing tasks efficiently and allocating resources to tasks reasonably are becoming a quite challenging problem.To improve both task execution and resource utilization efficiency,we present a task scheduling algorithm with resource attribute selection,which can select the optimal node to execute a task according to its resource requirements and the fitness between the resource node and the task.Experiment results show that there is significant improvement in execution throughput and resource utilization compared with the other three algorithms and four scheduling frameworks.In the scheduling algorithm comparison,the throughput is 77%higher than Min-Min algorithm and the resource utilization can reach 91%.In the scheduling framework comparison,the throughput(with work-stealing)is at least 30%higher than the other frameworks and the resource utilization reaches 94%.The scheduling algorithm can make a good model for practical MTC applications.
基金supported by Major National Science and Technology Project(2014ZX03004003-005)Municipal Exceptional Academic Leaders Foundation (2014RFXXJ002)China Postdoctoral Science Foundation (2014M561347)
文摘In spectrum aggregation(SA), two or more component carriers(CCs) of different bandwidths in different bands can be aggregated to support wider transmission bandwidth. The current resource scheduling schemes for spectrum aggregation are not optimal or suitable for CR based heterogeneous networks(Het Nets). Consequently, the authors propose a novel resource scheduling scheme for spectrum aggregation in CR based Het Nets, termed as cognitive radio based resource scheduling(CR-RS) scheme. CR-RS has a three-level structure. Under a dynamic traffic model, an equivalent throughput of the CCs based on the knowledge of primary users(PUs) is given. On this basis, the CR users data transmission time of each CC is equal in CR-RS. The simulation results show that CR-RS has the better performance than the current resource scheduling schemes in the CR based Het Nets. Meanwhile, CR-RS is also effective in other spectrum aggregation systems which are not CR based HetNets.
基金This work was supported in part by a grant from the National Basic Research Program of China(973 Program) under Grant No.2012CB315902,the National Natural Science Foundation of China under Grant No.61379120,61170215,the Program for Zhejiang Leading Team of Science and Technology Innovation under Grant No.2011R50010-12,2011R50010-18.Zhejiang Provincial Key Laboratory of New Network Standards and Technologies (NNST)
文摘Resource scheduling algorithm for ForCES(Forwarding and Control Element Separation) networks need to meet the flexibility,programmability and scalability of node resources.DBC(Deadline Budget Constrain) algorithm relies on users select cost or time priority,then scheduling to meet the requirements of users.However,this priority strategy of users is relatively simple,and cannot adapt to dynamic change of resources,it is inevitable to reduce the QoS.In order to improve QoS,we refer to the economic model and resource scheduling model of cloud computing,use SAL(Service Level Agreement) as pricing strategy,on the basis of DBC algorithm,propose an DABP(Deadline And Budget Priority based on DBC) algorithm for ForCES networks,DABP combines both budget and time priority to scheduling.In simulation and test,we compare the task finish time and cost of DABP algorithm with DP(Deadline Priority) algorithm and BP(Budget Priority) algorithm,the analysis results show that DABP algorithm make the task complete with less cost within deadline,benifical to load balancing of ForCES networks.
文摘An improved spectrum-efficient and fair resource scheduling algorithm for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.By jointly considering the channel conditions of all the users,the average packet loss rate,and the fairness of users in the MBMS group,the transmission data rate of the MBMS group is first selected according to the link adaptation and the average packet loss rate of users.Then,the resource blocks are allocated to MBMS groups according to the scheduling priority.Such a resource scheduling algorithm further balances the system throughput and user fairness.Theoretical analysis and simulation results show that the proposed algorithm can achieve a good tradeoff between system throughput and user fairness in comparison with traditional scheduling algorithms.
基金supported in part by Initiative Scientific Research Program in Tsinghua University under Grant No.20161080066in part by International Science&Technology Cooperation Program of China under Grant No.2013DFB10070
文摘Recently, several novel computing paradigms are proposed, e.g., fog computing and edge computing. In such more decentralized computing paradigms, the location and resource for code execution and data storage of end applications could also be optionally distributed among different places or machines. In this paper, we position that this situation requires a new transparent and usercentric approach to unify the resource management and code scheduling from the perspective of end users. We elaborate our vision and propose a software-defined code scheduling framework. The proposed framework allows the code execution or data storage of end applications to be adaptively done at appropriate machines under the help of a performance and capacity monitoring facility, intelligently improving application performance for end users. A pilot system and preliminary results show the advantage of the framework and thus the advocated vision for end users.
基金supported by Scientific Research Foundation for the Returned Overseas Chinese ScholarsState Education Ministry under Grant No.2010-2011 and Chinese Post-doctoral Research Foundation
文摘One of the challenging scheduling problems in Cloud data centers is to take the allocation and migration of reconfigurable virtual machines as well as the integrated features of hosting physical machines into consideration. We introduce a Dynamic and Integrated Resource Scheduling algorithm (DAIRS) for Cloud data centers. Unlike traditional load-balance scheduling algorithms which often consider only one factor such as the CPU load in physical servers, DAIRS treats CPU, memory and network bandwidth integrated for both physical machines and virtual machines. We develop integrated measurement for the total imbalance level of a Cloud datacenter as well as the average imbalance level of each server. Simulation results show that DAIRS has good performance with regard to total imbalance level, average imbalance level of each server, as well as overall running time.
基金supported in part by National Key Basic Research Program of China (973 program) under Grant No.2011CB302506Important National Science & Technology Specific Projects: Next-Generation Broadband Wireless Mobile Communications Network under Grant No.2011ZX03002-001-01Innovative Research Groups of the National Natural Science Foundation of China under Grant No.60821001
文摘Resource Scheduling is crucial to data centers. However, most previous works focus only on one-dimensional resource models which ignoring the fact that multiple resources simultaneously utilized, including CPU, memory and network bandwidth. As cloud computing allows uncoordinated and heterogeneous users to share a data center, competition for multiple resources has become increasingly severe. Motivated by the differences on integrated utilization obtained from different packing schemes, in this paper we take the scheduling problem as a multi-dimensional combinatorial optimization problem with constraint satisfaction. With NP hardness, we present Multiple attribute decision based Integrated Resource Scheduling (MIRS), and a novel heuristic algorithm to gain the approximate optimal solution. Refers to simulation results, in face of various workload sets, our algorithm has significant superiorities in terms of efficiency and performance compared with previous methods.
基金Supported by the National Natural Science Foundation of China(61471386)
文摘Aiming at the problem of resource allocation for digital array radar（ DAR）,a dwell scheduling algorithm is proposed in this paper. Firstly,the integrated priority of different radar tasks is designed,which ensures that the imaging tasks are scheduled without affecting the search and tracking tasks; Then,the optimal scheduling model of radar resource is established according to the constraints of pulse interleaving; Finally,a heuristic algorithm is used to solve the problem and a sparse-aperture cognitive ISAR imaging method is used to achieve partial precision tracking target imaging. Simulation results demonstrate that the proposed algorithm can both improve the performance of the radar system,and generate satisfactory imaging results.
