5G promises very high throughput and low latency. It will be able to support the exchange of large amounts of data with a wide variety of communications, including Vehicle-to-Everything (V2X) services. Conventional re...
详细信息
5G promises very high throughput and low latency. It will be able to support the exchange of large amounts of data with a wide variety of communications, including Vehicle-to-Everything (V2X) services. Conventional resource allocation techniques based on orthogonal multiple access (OMA) appear to be unsuitable for a dense network due to limited resources available. This work presents a new planning algorithm called SAVCN (scheduling algorithm for V2X Communication based on NOMA), for the 5G network. The main feature of NOMA is the same resource can be shared by multiple users. The purpose of our algorithm is to improve network performance in terms of throughput, equity, the number of V2X users served and error rates. In fact, SAVCN efficiently allocates available resource blocks (Rbs) to maximize system throughput by taking into account a well-defined criterion on the minimum distance between transmitters and receivers. The simulation results indicate promising performance for SAVCN. Copyright (C) 2020 The Authors.
The current works about MapReduce task scheduling with deadline constraints neither take the differences of Map and Reduce task, nor the cluster's heterogeneity into account. This paper proposes an extensional Map...
详细信息
The current works about MapReduce task scheduling with deadline constraints neither take the differences of Map and Reduce task, nor the cluster's heterogeneity into account. This paper proposes an extensional MapReduce Task scheduling algorithm for Deadline constraints in Hadoop platform: MTSD. It allows user specify a job's deadline and tries to make the job be finished before the deadline. Through measuring the node's computing capacity, a node classification algorithm is proposed in MTSD. This algorithm classifies the nodes into several levels in heterogeneous clusters. Under this algorithm, we firstly illuminate a novel data distribution model which distributes data according to the node's capacity level respectively. The experiments show that the node classification algorithm can improved data locality observably to compare with default scheduler and it also can improve other scheduler's locality. Secondly, we calculate the task's average completion time which is based on the node level. It improves the precision of task's remaining time evaluation. Finally, MTSD provides a mechanism to decide which job's task should be scheduled by calculating the Map and Reduce task slot requirements.
On-demand data broadcasting scheduling is an effective wireless data dissemination technique. Existing scheduling algorithms usually have two problems: (1) with the explosive growth of mobile users and real-time indiv...
详细信息
On-demand data broadcasting scheduling is an effective wireless data dissemination technique. Existing scheduling algorithms usually have two problems: (1) with the explosive growth of mobile users and real-time individual requirements, broadcasting systems present a shortage of scalability, dynamics and timeliness (request drop ratio);(2) with the growth of intelligent and entertained application, energy consumption of mobile client cannot be persistent (tuning time). This paper proposes an effective scheduling algorithm LxRxW. It takes into account the number of lost requests during next item broadcasting time, the number of requests and the waiting time. LxRxW can reduce the request drop ratio. At the same time, the algorithm employs a dynamic index strategy to put forward a dynamic adjusting method on the index cycle length (DAIL) to determine the proper index cycle. Extensive experimental results show that the LxRxW algorithm has better performance than other state-of-the-art scheduling algorithms and can significantly reduce the drop ratio of user requests by 40%-50%. The request drop ratio and accessing time of LxRxW with index increase by 1%-2% than LxRxW algorithm without index, but the tuning time decreases by 70%. The index strategy shows that when the index cycle length is less than 20units, it can significantly reduce the average tuning time but when the index cycle length continues increasing, the average tuning time will increase contrarily. DAIL can dynamically determine the length of index cycle. Moreover, it can reach optimal integrated performance of the request drop ratio, the average accessing time and the average tuning time. Copyright (c) 2013 John Wiley & Sons, Ltd.
One of the major challenges in the design of future-generation high-speed networks is the provision of quality-of-service (QoS) to real-time traffic. In this paper, we propose a novel scheduling scheme, namely differe...
详细信息
One of the major challenges in the design of future-generation high-speed networks is the provision of quality-of-service (QoS) to real-time traffic. In this paper, we propose a novel scheduling scheme, namely differentiated dropping scheduling (DDS), which is designed to handle real-time traffic in passive star-coupled wavelength division multiplexing (WDM) optical networks. By taking channel and destination availability into account, DDS can dramatically improve network performance in terms of message loss rate. Moreover, this scheme has the capacity of preventing channel collision and destination conflict. In order to evaluate the proposed DDS algorithm, extensive discrete-event simulations and mathematical performance comparison are conducted by comparing its performance with Moore and Hodgson's algorithm and the earliest-due-date (EDD) algorithm. The results show that DDS can achieve the best performance among the three algorithms.
Because of the unreliable and dynamic characteristics, cloud service failures are inevitable. It has an adverse effect on task execution and scheduling. To improve cloud service reliability, we first analyze the fault...
详细信息
Because of the unreliable and dynamic characteristics, cloud service failures are inevitable. It has an adverse effect on task execution and scheduling. To improve cloud service reliability, we first analyze the fault recovery mechanism, and then, cloud service failures considered in this paper are classified into unrecoverable failures and recoverable failures. By extending the traditional dynamic level scheduling (DLS) algorithm, a novel scheduling algorithm based on fault recovery mechanism named fault recovery-based DLS algorithm is proposed to reduce the failure probability of task scheduling. The experimental results confirm that fault recovery mechanism can meet the reliability requirements of cloud computing infrastructures and the proposed algorithm can effectively ensure trustworthy execution of tasks. Copyright (c) 2014 John Wiley & Sons, Ltd.
The problem of scheduling household appliances with the availability of renewable energy is the biggest challenge in the smart home energy management system. The components such as renewable energy resources, househol...
详细信息
The problem of scheduling household appliances with the availability of renewable energy is the biggest challenge in the smart home energy management system. The components such as renewable energy resources, household appliances, utility grid, storage batteries are pooled into a nonlinear, time-varying, indefinite, and dynamic structure that is impossible to control and refine. For this, real-time pricing is applied in most nations to withstand the burden on the grid. This requires attention to utilize renewable energy effectively. In this paper, a load scheduling method to schedule the loads based on the availability of solar energy and customer preferences is presented. First, the availability of solar energy is forecasted ahead one day using Regression Analysis. Second, the finite state machine approach-based load scheduling algorithm is implemented and tested using MATLAB Simulink and Lab VIEW. LabVIEW-based GUI is developed to visualize the MATLAB schedule for loads. The problem is divided into several states with the availability of solar power, and if solar power is unavailable, grid power is utilized. The loads preferred by the consumers are scheduled in alignment with the production of solar power with the finite state machine scheduling algorithm. Also, the loads considered are able to consume instantaneous energy with the instantaneous production of energy, thereby reducing CO2 emission by not consuming power from the grid. Finally, the loads are scheduled accordingly, and it is concluded that coordination can be established between energy providers, and the system proposed can flatten out the load profile.
Multiple tasks arrive in the distributed systems that can be executed in either parallel or sequential manner. Before the execution, tasks are scheduled prioritywise with the help of scheduling algorithms to their res...
详细信息
Multiple tasks arrive in the distributed systems that can be executed in either parallel or sequential manner. Before the execution, tasks are scheduled prioritywise with the help of scheduling algorithms to their respective processors. For task assignment, every scheduling algorithm follows different protocols like upper bound of CPU utilization, assigning priorities, etc. In this paper, author has worked on such scheduling algorithms. Previously, the author evaluated the performance of algorithms on the basis of transactions (group of tasks). In this paper, the author re-evaluates joint EDF-RM scheduling algorithm, where its performance is calculated on the execution of individual task basis. For comparative analysis, similar algorithms are considered, i.e., joint EDF-RMS, earliest deadline first (EDF) and rate monotonic scheduling (RMS). These mentioned algorithms are simulated and analyzed with the help of statistical analysis, and turnaround time of periodic tasks is evaluated. Additionally, migration distribution and CPU utilization on the basis of scheduling algorithms' upper bounds are also calculated.
In this paper, we address the problem of uplink multi-traffic sources scheduling in heterogeneous wireless networks (HWNs) under real time traffics that requires fairness constraint and strict per-packet delay bounds ...
详细信息
In this paper, we address the problem of uplink multi-traffic sources scheduling in heterogeneous wireless networks (HWNs) under real time traffics that requires fairness constraint and strict per-packet delay bounds and under non-real time traffics as well. The wide spread of HWNs, such as integrated of WiMax-WiFi-Relay wireless networks, enforces networks operators to design an efficient radio resource management (RRM) in order to tradeoff between network resource utilizations and user satisfactions. RRM concerns with traffic scheduling and admission control amongst different traffic sources to guarantee the Quality of Service. This paper participates to RRM developments by proposing and analyzing an efficient packet scheduling scheme with two modes of operations for the uplink channel of WiMax-WiFi-Relay station HWNs. These two modes of operations are known as Fixed Shared Flow and Adaptive Sharing Flow (ASF). The main aim of this scheduling is to allocate shared WiMax resources in a fair manner and to balance between maximizing the bandwidth utilization and users satisfactions. The performance bounds in terms of delay and throughout are presented. Then, the performance figures of the two modes of operations of the proposed scheduling scheme are compared. The results show that bounded delay can be provisioned for direct WiMax users, users via WiF and users via Relay Stations sharing the same WiMax bandwidth using both operations. Moreover, the simulation results show that the ASF scheduling scheme improves both system utilization and average delays.
Stream processing is a new memory computing paradigm that deals with dynamic data streams efficiently. Storm is one of the stream processing frameworks, but the default stream processing scheduler of storm also has so...
详细信息
Stream processing is a new memory computing paradigm that deals with dynamic data streams efficiently. Storm is one of the stream processing frameworks, but the default stream processing scheduler of storm also has some problems. For example, it does not consider reducing the cost in the cloud environment while ensuring the performance requirements. In this paper, a cost-efficient scheduling algorithm for Storm framework (CE-Storm) is proposed to reduce cost while satisfying deadline constrain. First, a new cost-efficient model (including resources usage cost, energy cost and communication cost) based on Storm framework is built. Then, based on the cost model, a cost-efficient scheduling algorithm which integrated resource monitoring module and communication detection module is designed. The nodes in the cluster are prioritized according to the cost-efficient information, and the nodes with higher priority are assigned tasks first to minimize the total cost of the cluster. Furthermore, this algorithm also reduces the communication cost between nodes and improves the cost effectiveness of the Storm cluster. We have performed extensive experiments on Storm clusters using Hibench's workloads in cloud environment. The result shows that the cost consumption of Storm clusters in cloud environment is reduced by 19.25% on average compared with the traditional scheduling algorithm. In others words, the proposed algorithms effectively improve the cost efficiency of Storm cluster in the cloud environment while satisfying the performance constrains.
Discrete event simulation is the most important and essential part in network simulation. The node-oriented model of discrete event scheduling is a model that allocates computing resources as nodes and makes the discr...
详细信息
Discrete event simulation is the most important and essential part in network simulation. The node-oriented model of discrete event scheduling is a model that allocates computing resources as nodes and makes the discrete event simulation as a simulation task on nodes. In this article the reason of low performance in large-scale network simulation is analyzed, and an ideal node-oriented model of discrete event scheduling is presented and a resource-limited node-oriented model of discrete event scheduling by adding some restrictions on network resources is proposed. Then, the authors complete contrast experiments of the resource-limited node-oriented model of discrete event scheduling and NS2. Finally, packet loss in resource-limited node-oriented model of discrete event scheduling is examined Also, NS2 is discussed in this article and the authors have proposed an improved method for the packet loss algorithm in a resource-limited node-oriented model of discrete event scheduling.
暂无评论