In winter in China, thermal power units bear both the power supply load and the heat supply load. The coupling of the two greatly reduces the output adjustment range of the thermal power unit. Affected by holidays, et...
详细信息
ISBN:
(纸本)9781665489577
In winter in China, thermal power units bear both the power supply load and the heat supply load. The coupling of the two greatly reduces the output adjustment range of the thermal power unit. Affected by holidays, etc., the load may suddenly decrease, but the thermal power unit may be forced to start up, and even if it is calculated by the lower output limit, the power load balance cannot be achieved. The production simulation program cannot find any feasible solution and will stop, requiring people to manually modify the working state of the thermal power unit. This paper proposes an algorithm to demarcate the priority of each thermal power unit when inputting data. Among the equal priorities, they are sorted according to the capacity from low to high. When the solution fails, a thermal power unit will be automatically selected for downgrading. The algorithm in this paper replaces manual operation steps in production simulation, and expands the solution space at the expense of part of the heating load.
Hardware tasks scheduling is the effect of reconfigurable system performance of important factor. This paper presents a VLSCA algorithm which considers the placement according to the vertex position of hardware task a...
详细信息
ISBN:
(纸本)9781424462520
Hardware tasks scheduling is the effect of reconfigurable system performance of important factor. This paper presents a VLSCA algorithm which considers the placement according to the vertex position of hardware task and the adjacent units numbers of temporal dimension. At the same time, this algorithm introduces the compactness of task in three-space as an important index of choosing reasonable placement, which make the task more compacter, reduce the waste of system resources and promote management efficiency. Simulation results show that, with other existent scheduling algorithms, this algorithm has higher chip utilization and task accept ratio.
Data aggregation from a set of sensors to a common sink over a tree-based routing topology is a fundamental traffic pattern in wireless sensor networks (WSNs). The time division multiple access (TDMA)-based scheduling...
详细信息
ISBN:
(纸本)9781467345101;9781467345118
Data aggregation from a set of sensors to a common sink over a tree-based routing topology is a fundamental traffic pattern in wireless sensor networks (WSNs). The time division multiple access (TDMA)-based scheduling protocols are suitable for such data aggregation applications. Most of the previously proposed TDMA schemes focus on a particular objective, such as minimizing schedule delay, latency, and energy consumption etc. In this paper, we investigate another important aspect of aggregation, i.e., weighted fairness, and propose a novel weighted fairness guaranteed aggregation scheduling algorithm (WAS) under the protocol interference model. We use node weight to reflect the importance of each node, and introduce the weighted delay as the weighted fairness guaranteed metric. Then the problem of weighted fairness guaranteed can be translated into minimizing the weighted delay. In order to achieve this purpose, WAS utilizes the approximate maximum weighted set to allocate time slots for each node according to different accumulative weight. The results of simulation demonstrate that the weighted fairness of WAS is much better than the existing TDMA scheduling algorithm. In particular, the proposed scheduling scheme can achieve a good trade-off between weighted fairness guarantee and aggregation delay.
Traditional way of time-sharing scheduling can not satisfy the real-time demand of multimedia application, the real-time scheduling algorithm for multimedia stream was paid special attention. Rate Monotonic algorithm,...
详细信息
ISBN:
(纸本)9780769536149
Traditional way of time-sharing scheduling can not satisfy the real-time demand of multimedia application, the real-time scheduling algorithm for multimedia stream was paid special attention. Rate Monotonic algorithm, which is a classic real-time scheduling algorithm is researched in the paper. In order to make the algorithm more suitable for streaming media applications an improved way based on the elastic priority to decrease the number of starved tasks is presented.
There is growing interest in wireless personal area networks built from portable devices equipped with short-range radio interfaces such as Bluetooth. These small networks (called piconets) can be internetworked to fo...
详细信息
ISBN:
(纸本)0769515916
There is growing interest in wireless personal area networks built from portable devices equipped with short-range radio interfaces such as Bluetooth. These small networks (called piconets) can be internetworked to form larger scatternets by means of bridge nodes that participate in more than one piconet on a time division basis. How well this works depends to a large part on the mechanism used to schedule communication across piconets. In this paper we present a novel online scatternet scheduling algorithm, LCS, that effectively coordinates one-hop neighbors to converge to an efficient scatternet-wide communication schedule. Unlike previous work, LCS is robust and responsive to network conditions, dynamically adjusting the schedule based on varying workload conditions. We demonstrate that LCS has good performance on throughput, end-to-end packet latency and energy usage under various traffic loads.
In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications including wireless internets and traffic information systems are pull-based, that is, they respond t...
详细信息
In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications including wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this paper, we study the scheduling problems of on-demand broadcast environments. Traditionally, the response time of the requests has been used as a performance measure. In this paper we consider the performance as the average cost of request composed of three kinds of costs - access time cost, tuning time cost, and cost of handling failure request. Our main contribution is a self-adaptive scheduling algorithm named LDFC, which computes the delay cost of data item as the priority of broadcast. It costs less compared with some previous algorithms in this context, and shows good adaptability as well even in pure push-based broadcasts.
An operating system has some rules that control the execution of processes. These rules are called the scheduling algorithms. scheduling algorithms make the organization and management of resources in a hardware. Two ...
详细信息
ISBN:
(纸本)9781479988280
An operating system has some rules that control the execution of processes. These rules are called the scheduling algorithms. scheduling algorithms make the organization and management of resources in a hardware. Two of these algorithms are round robin and priority scheduling. In this paper we will stimulate the logic of these algorithms with two simple programs written in c language.
In hybrid cloud model, organizations can keep their sensitive information and critical applications in the private cloud and move other data and applications to a public cloud, if necessary. To maintain data privacy i...
详细信息
ISBN:
(纸本)9781509019618
In hybrid cloud model, organizations can keep their sensitive information and critical applications in the private cloud and move other data and applications to a public cloud, if necessary. To maintain data privacy in workflow applications, we present a budget constrained hybrid cloud scheduler (BCHCS) which is a static heuristic scheduling algorithm. It is able to make decisions about scheduling sensitive tasks on private cloud and uses public cloud's resources for non-sensitive tasks, such that the makespan is minimized, while the budget limitation imposed by the user is satisfied. Experimental results show that the proposed method guarantees the execution of sensitive tasks on private cloud while achieving at least 7 percent lower makespan and higher success rate in comparison to similar existing techniques.
The rapid evolution of the wireless communication technologies along with the growing number of connected vehicles and the limitation of available radio resources make scheduling tasks very important for the fifth gen...
详细信息
ISBN:
(纸本)9781728150529
The rapid evolution of the wireless communication technologies along with the growing number of connected vehicles and the limitation of available radio resources make scheduling tasks very important for the fifth generation (5G) mobile communication system Thus, to handle the challenges of access collisions, the scarcity of spectral efficiency due to the limited bandwidth and massive connectivity, non-orthogonal multiple access (NOMA) schemes have been introduced as a potential solution for 5G wireless networks. Accordingly, this paper presents a new optimal scheduling algorithm for V2X connections called Dynamic scheduling algorithm based on NOMA with Priority Assignment for vehicular Networks (DSA-PA-NOMA), which improves performances in terms of Quality of Service (QoS), throughput and bit error rate (BER). The proposed algorithm consider the traffic classification imposed by V2X exigency and aims to maximize the system throughput by taking into account the channel conditions of Vehicular User Equipment (VUE) expressed by the Signal-to-Interference-plus-Noise Ratio (SINR) value. The optimal distribution of the available Resources Blocks (RBs) is based on a dynamic reallocation process depending in the average blocking rate value (ABR) especially for vehicular Safety Traffic (ST).
The increasing scale of multi-core processors are likely to be randomly heterogeneous by design or because of diversity and flaws. The latter type of heterogeneity introduced by some unforeseen variable factors such a...
详细信息
ISBN:
(纸本)9781509040933
The increasing scale of multi-core processors are likely to be randomly heterogeneous by design or because of diversity and flaws. The latter type of heterogeneity introduced by some unforeseen variable factors such as the manufacturing process variation is especially challenging because of its unpredictability. In this environment, thread scheduler and global power manager must handle such randomly heterogeneous. Furthermore, these algorithms must supply high efficiency, scalability and low overhead because future multi-core processors may have a number of cores on a single die. This paper presents a variationaware scheduling algorithm for application scheduling and power management. Thread switching and sampling among different cores in the multi-core processor introduce obvious overhead than previous many-core scheduling algorithms. Proposed scheme records the information of swapped thread of preferential core and uses tabu search-based randomly heterogeneous scheduling algorithm(TSR) to avoid the occurrence of repeated sampling and reduce the migration frequency and sampling frequency of a thread. The experimental results show that TSR algorithm has decreased 45.7% of thread migration and 42.2% of the sampling time as compared with local search algorithm. This paper regards the transcendental Hungarian offline scheduling algorithm as the baseline. ED2 of TSR only decrease by 8.58% as compared with that of Hungarian offline scheduling algorithm, but compared with the random search scheduling algorithm, ED2 of TSR decreased by 39.4%.
暂无评论