Due to the development of the times, people are getting more and more dependent on the Internet, so that there is a large amount of information and data;the arrival of the era of big data makes the processing of infor...
详细信息
Due to the development of the times, people are getting more and more dependent on the Internet, so that there is a large amount of information and data;the arrival of the era of big data makes the processing of information data become a very important issue. Whether it is a wide area network or LAN, a large amount of data and information is produced, which makes the network configuration can't carry such a large amount of data, therefore, it is necessary to do some research on the allocation of data processing in network equipment, so as to avoid the phenomenon of network paralysis caused by unreasonable task assignment. Therefore, load balancing technology arises at the historic moment. In this paper, a detailed discussion of the technology was made, which has very important practical significance for the development of the computer.
scheduling algorithm is crucial to the performance of the Network- on-chip router. Different from traditional scheduling algorithms that concentrate on local fairness, we propose a congestion-aware scheduling algorith...
详细信息
scheduling algorithm is crucial to the performance of the Network- on-chip router. Different from traditional scheduling algorithms that concentrate on local fairness, we propose a congestion-aware scheduling algorithm based on input buffer of downstream router. The scheduling algorithm keeps a match dynamically between input and output by detecting the flits number to be transferred in the same packet. It can reduce network congestion especially under heavy traffic loads. Compared to RRM and iSLIP algorithm, the new scheduling algorithm can increase the saturation throughput by 8.2% and reduce the average communication latency by 7.8% under non-uniform traffic.
A new scheduling method is presented, two-dimensional round-robin scheduling with multiple selections (2DRRMS), for an input and output buffered ATM switch. In the switch, both input and output purrs are divided into ...
详细信息
A new scheduling method is presented, two-dimensional round-robin scheduling with multiple selections (2DRRMS), for an input and output buffered ATM switch. In the switch, both input and output purrs are divided into several groups and multiple switching planes an used. in the 2DRRMS method the multiple cells for transfer to an input buffer module are selected and the switching planes which the selected cells are to use in the transmission are concurrently determined.
Random distribution of sensor nodes in large scale network leads redundant nodes in the application field. Sensor nodes are with irreplaceable battery in nature, which drains the energy due to repeated collection...
详细信息
Random distribution of sensor nodes in large scale network leads redundant nodes in the application field. Sensor nodes are with irreplaceable battery in nature, which drains the energy due to repeated collection of data and decreases network lifetime. scheduling algorithms are the one way of addressing this issue. In proposed method, an optimized sleep scheduling used to enhance the network lifetime. While using the scheduling algorithm, the target coverage and data collection must be maintained throughout the network. In-network, aggregation method also used to remove the unwanted information in the collected data in level. Modified clustering algorithm highlights three cluster heads in each cluster which are separated by minimum distance between them. The simulation results show the 20% improvement in network lifetime, 25% improvement in throughput and 30% improvement in end to end delay.
Nowadays, heterogeneous and stringent requirements for the fifth generation (5G) mobile communication system are imposed to adapt with the fast growing usage of the mobile equipment including connected vehicles and ra...
详细信息
Nowadays, heterogeneous and stringent requirements for the fifth generation (5G) mobile communication system are imposed to adapt with the fast growing usage of the mobile equipment including connected vehicles and rapid development of IoT. As a consequence, the limitation and inefficient using of the spectrum becomes a major problem to meet the demand of mobile broadband, extreme capacity and high throughput. 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 and 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 taking into account the channel conditions of Vehicular User Equipment (VUE) expressed by the Signal-to-Interference-plus-Noise Ratio (SINR) value.
A distributed dynamic dual round robin scheduling algorithm (DSDRR) that can support differential services is presented. For each scheduler, the strategy of double pointer and round robin is adopted and scheduling com...
详细信息
A distributed dynamic dual round robin scheduling algorithm (DSDRR) that can support differential services is presented. For each scheduler, the strategy of double pointer and round robin is adopted and scheduling complexity is substantially reduced. Its quantum function, related to the status of input queue and priority, is a traffic-adaptive dynamic scheduling mechanism and is rather sensitive to the changing network; therefore, it has the traits of dynamics and fairness. It can better support differential services and guarantee the realization of QoS.
This paper shows that, for single-hop wavelength division multiplexing (WDM) networks, a multicast scheduling algorithm which always tries to partition a multicast transmission into multiple unicast or multicast trans...
详细信息
This paper shows that, for single-hop wavelength division multiplexing (WDM) networks, a multicast scheduling algorithm which always tries to partition a multicast transmission into multiple unicast or multicast transmissions may not always produce lower mean packet delay than a multicast scheduling algorithm that does not partition multicast transmissions. The performance of a multicast scheduling algorithm may depend on the traffic conditions and the availability of the channel resource in the network. A hybrid multicast scheduling algorithm that can be used in single-hop WDM networks.
Currently, we are developing a scheduler for hard real-time computer systems. The system of interest is a uniprocessor machine that supports the operating system and the application software composed of tasks that may...
详细信息
Currently, we are developing a scheduler for hard real-time computer systems. The system of interest is a uniprocessor machine that supports the operating system and the application software composed of tasks that may be periodic or non-periodic (sporadic). All the tasks are said to be hard because they have strict timing requirements that must not be violated under any circumstances. Tasks may interact with each other by sharing critical resources. The problem is to sequence the tasks such that in all cases it is guaranteed that each task completes execution before its deadline and each resource is never accessed by more than one task simultaneously. We present a scheduling scheme that permits to solve this problem by using the Dynamic Priority Ceiling Protocol.
Motif Finding Problem (MFP) is the problem of finding patterns in sequences of DNA. This paper discusses and presents an enhanced scheduling approach to solve the motif problem on the Heterogeneous Cluster by making a...
详细信息
Motif Finding Problem (MFP) is the problem of finding patterns in sequences of DNA. This paper discusses and presents an enhanced scheduling approach to solve the motif problem on the Heterogeneous Cluster by making a comparison between exact algorithms. The method that was followed is to analyze several exact algorithms, compare them within specific points to measure, and improve performance by comparing the number of devices and peripheral units used in every situation and running time in every method. Our experimental results show that the use of the scheduling approach that use different algorithms on Heterogeneous Cluster make a significant difference in the speed of completing the problem and in a shorter record time with less resources, and that this proposed approach is more effective than the traditional method of distributing tasks to solve the motif problem.
This paper proposes a new scheduling algorithm for shipping operations in steel works. In the shipping operation, steel products are handled by various kinds of machines, for example, overhead cranes in warehouses, sp...
详细信息
This paper proposes a new scheduling algorithm for shipping operations in steel works. In the shipping operation, steel products are handled by various kinds of machines, for example, overhead cranes in warehouses, special vehicles, forklifts and quay cranes. The operations of these machines affect each other and the situation makes the scheduling problem quite complicated. The proposed algorithm deals with shipping facilities which include warehouse buildings with plural cranes. Because some areas are accessible by plural cranes in the buildings, the movement of each crane is strictly restricted by others to prevent the collisions of cranes. The new algorithm is composed of two main steps to obtain efficient schedules and achieve short computation time. The first step assigns shipping jobs to time windows which are created by dividing the scheduling horizon, and then levels the workload of machines. The next step determines the order and operating time of jobs and develops a feasible schedule. The scheduling algorithm was applied to practical data and compared with real operations in this paper. The result shows the high performance of the new algorithm.
暂无评论