As a new model of data storage and computing, cloud data center attracts much attention. Task scheduling is always a hot topic in the research of cloud data center. At the same time, As the cost of cloud data center i...
详细信息
ISBN:
(纸本)9781538662434
As a new model of data storage and computing, cloud data center attracts much attention. Task scheduling is always a hot topic in the research of cloud data center. At the same time, As the cost of cloud data center increases, the cost for users to use cloud data center becomes higher and higher. Less execution time means lower cost. Based on the above reasons, a short average execution time task scheduling algorithm is proposed in this paper, which can reduce the average execution time of the cloud data center according to the difference of the execution time of cloud tasks in the data center, and the effect of this method is more obvious with the increase of cluster size and the increase of the number of tasks. Finally, the algorithm is simulated in cloudsim to verify the effectiveness of the algorithm.
This paper considers the off-line roadside unit (RSU) ON/OFF scheduling problem in a sparse vehicular ad hoc network (VANET). We formulate the problem as a mixed integer non-linear programming problem and propose a he...
详细信息
This paper considers the off-line roadside unit (RSU) ON/OFF scheduling problem in a sparse vehicular ad hoc network (VANET). We formulate the problem as a mixed integer non-linear programming problem and propose a heuristic scheduling algorithm called Multi-Level Greedy (MLG) algorithm to find a suboptimal approximation. In the proposed MLG algorithm, we introduce the concepts of optimal service location and suboptimal service location. Then, we obtain the ON-OFF state matrix of RSUs. Simulation results show that the MLG algorithm can significantly reduce the energy consumption of RSUs deployed and can provide a reference basis for energy efficient scheduling in VANETs.
Concurrent workflow scheduling algorithm works in three phases, namely rank computation, tasks selection, and resource selection. In this paper, we introduce a new ranking algorithm that computes the rank of a task, b...
详细信息
Concurrent workflow scheduling algorithm works in three phases, namely rank computation, tasks selection, and resource selection. In this paper, we introduce a new ranking algorithm that computes the rank of a task, based on its successor rank and its predecessors average communication time, instead of its successors rank. The advantage of this ranking algorithm is that two dependent tasks are assigned to the same machine and as a result the scheduled length is reduced. The task selection phase selects a ready task from each workflow and creates a task pool. The resource selection phase initially assigns tasks using min-min heuristic, after initial assignment, tasks are moved from the highly loaded machines to the lightly loaded machines. Our resource selection algorithm increases the load balance among the resources due to tasks assignment heuristic and reassignment of tasks from the highly loaded machines. The simulation results show that our proposed scheduling algorithm performs better over existing approaches in terms of load balance, makespan and turnaround time.
This paper proposes a scheduling algorithm to solve the problem of task scheduling in a cloud computing system with time-varying communication conditions. This algorithm converts the scheduling problem with communicat...
详细信息
This paper proposes a scheduling algorithm to solve the problem of task scheduling in a cloud computing system with time-varying communication conditions. This algorithm converts the scheduling problem with communication changes into a directed acyclic graph (DAG) scheduling problem for existing fuzzy communication task nodes, that is, the scheduling problem for a communication-change DAG (CC-DAG). The CC-DAG contains both computation task nodes and communication task nodes. First, this paper proposes a weighted time-series network bandwidth model to solve the indefinite processing time (cost) problem for a fuzzy communication task node. This model can accurately predict the processing time of a fuzzy communication task node. Second, to address the scheduling order problem for the computation task nodes, a dynamic pre-scheduling search strategy (DPSS) is proposed. This strategy computes the essential paths for the pre-scheduling of the computation task nodes based on the actual computation costs (times) of the computation task nodes and the predicted processing costs (times) of the fuzzy communication task nodes during the scheduling process. The computation task node with the longest essential path is scheduled first because its completion time directly influences the completion time of the task graph. Finally, we demonstrate the proposed algorithm via simulation experiments. The experimental results show that the proposed DPSS produced remarkable performance improvement rate on the total execution time that ranges between 11.5% and 21.2%. In view of the experimental results, the proposed algorithm provides better quality scheduling solution that is suitable for scientific application task execution in the cloud computing environment than HEFT, PEFT, and CEFT algorithms.
The growing demand for multimedia communication has resulted in tougher requirements of quality of service (QoS). Today, QoS necessitates the deployment of powerful and efficient networks. Worldwide Interoperability f...
详细信息
The growing demand for multimedia communication has resulted in tougher requirements of quality of service (QoS). Today, QoS necessitates the deployment of powerful and efficient networks. Worldwide Interoperability for Microwave Access (WiMAX) is regarded as a promising technology in the field of wireless communication. In fact, WiMAX network is considered the best network to support real-time as well as non-real-time applications in varied conditions of a simulated environment. Wireless communication requires uplink and downlink scheduling for communication among base station subscribers. scheduling is still a challenging task for researchers. In this work, we propose an evolutionary computational scheme for downlink scheduling that brings in substantial improvisations in the QOS of a network system. The proposed approach simplifies the scheduling scheme for varied service schemes such as UGS, rtPS, nrtPS. We extend some improved computational strategies to our proposed approach in order to control data communication as well as route formation in signal information. We also use a computational approach, i.e., passage relocation admission control to perform automatic selection of base station with similar data operations. We further seek to analyze the role of data communication and packet dropping in wireless network communication. Our experimental study shows an improved performance of the proposed model in terms of slot/success ratio, throughput and energy consumption. As it happens, we succeed in recording 7% improvement in throughput performance, 10.34% improvement in slot/success ratio performance, and quite significantly, a 28% reduction in energy consumption based on the simulation time.
The Internet of Things (IoT) and Demand Response (DR) combined have transformed the way Information and Communication Technologies (ICT) contribute to saving energy and reducing costs, while also giving consumers more...
详细信息
The Internet of Things (IoT) and Demand Response (DR) combined have transformed the way Information and Communication Technologies (ICT) contribute to saving energy and reducing costs, while also giving consumers more control over their energy footprint. Unlike current price and incentive based DR strategies, we propose a DR model that promotes consumers reaching coordinated behaviour towards more sustainable (and green) communities. A cooperative DR system is designed not only to bolster energy efficiency management at both home and district levels, but also to integrate the renewable energy resource information into the community's energy management. Initially conceived in a centralised way, a data collector called the aggregator will handle the operation scheduling requirements given the consumers' time preferences and the available electricity supply from renewables. Evaluation on the algorithm implementation shows feasible computational cost (CC) in different scenarios of households, communities and consumer behaviour. Number of appliances and timeframe flexibility have the greatest impact on the reallocation cost. A discussion on the communication, security and hardware platforms is included prior to future pilot deployment.
Wireless broadband networks are emerging as reliable internet access alternatives for delivery of high speed multimedia services. WiMAX is one of such networks, designed to provide quality of service (QoS) support for...
详细信息
ISBN:
(纸本)9783319988276;9783319988269
Wireless broadband networks are emerging as reliable internet access alternatives for delivery of high speed multimedia services. WiMAX is one of such networks, designed to provide quality of service (QoS) support for different service classes with varying QoS requirements. scheduling algorithms are required to provide such support. The existing scheduling algorithm uses dynamic weight to allocate resources based on traffic loads. However, it increases delay of real time traffics due to failure of the weight to prioritize traffics. This paper proposes a priority load aware scheduling (PLAS) algorithm to reduce delay in real time traffics. The PLAS algorithm introduces a priority value to prioritize real time traffics over non-real time traffics. The algorithm was evaluated using extensive simulations. The results show that the PLAS outperforms the existing algorithm in terms of delay.
Due to the introduction of new M2M (Machine-to-Machine) functionalities and applications in the industry, new devices will need to be connected to existing communication networks, coexisting with current ones. The new...
详细信息
Due to the introduction of new M2M (Machine-to-Machine) functionalities and applications in the industry, new devices will need to be connected to existing communication networks, coexisting with current ones. The new mobile communication technologies, which are still in the standardization process, promise to comply with the communication requirements demanded by industrial automation systems. Therefore, this article has as main contribution to propose the development of a scheduling algorithm for devices (sensors and actuators) that use periodic network resources. This algorithm will aim to reduce network signaling, increase data transmission capacity, or increase the number of devices operating in the industrial network. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
In view of the delay problem in the multicast and broadcast services, a real-time scheduling algorithm is proposed. By constructing the simulation scene of the multicast and broadcast services transmission, the schedu...
详细信息
ISBN:
(纸本)9781538678619
In view of the delay problem in the multicast and broadcast services, a real-time scheduling algorithm is proposed. By constructing the simulation scene of the multicast and broadcast services transmission, the scheduling algorithm to guarantee the quality of service QoS (Quality of Service) for real-time multicast services is realized, and the performance is compared with the maximum throughput algorithm and the time delay algorithm. The priority function of the scheduling is defined by analyzing the multi effect factor to guarantee the performance. In the simulation, the performance of the scheduling algorithm is evaluated by analyzing the delay and throughput indicators. The simulation results show that the proposed real-time scheduling algorithm has good delay and throughput performance. It is suitable for the transmission of multimedia services, especially the multicast traffic with higher delay requirements.
Reconfigurable computing has been the promising processor architecture. This paper describes a hybrid scheduling algorithm for reconfigurable processor architecture. The processor consists of the general-purpose proce...
详细信息
ISBN:
(纸本)9781538637586
Reconfigurable computing has been the promising processor architecture. This paper describes a hybrid scheduling algorithm for reconfigurable processor architecture. The processor consists of the general-purpose processor core and reconfigurable devices. And then general tasks and reconfigurable tasks are distinguished according to their features by the scheduler. The general tasks are scheduled to general processor core, and the reconfigurable tasks are scheduled to the reconfigurable devices. This algorithm implements the cooperative processing between the reconfigurable device and the general processor core. The experimental results show that this algorithm can achieve high efficiency and flexibility for such reconfigurable processor architecture.
暂无评论