Cost and space constraints typically limit the provision of many educational resources, with laboratory apparatus being a common example. This limitation is often ameliorated by utilizing scheduling techniques to mana...
详细信息
Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies like denial of service attacks. For this...
详细信息
We presented a novel platform dedicated to stream processing that improved resource efficiency by sharing resources among applications. The platform utilized latency-aware schedulers to handle stream applications with...
详细信息
scheduling is one of the research issue in cloud computing. It affects the performance of the cloud. To provision cloud resources to the users or to run cloud applications efficiently underlying infrastructure of the ...
详细信息
This research presents the performance of Round Robin, Proportional Fair and Maximum Throughput scheduling techniques for 5G NSA mobile networks. The tests run considering a variable and increasing number of users usi...
详细信息
Desktop grids as opposed to service grids are the cost-effective way to gather large amount of volunteer computing resources for solving scientific problems. It is possible to create desktop grids with the help of onl...
详细信息
A generalized model of photo-polymerization in free radical chainforming polymers has been developed. Applying this model to data storage, optimized scheduling algorithms are developed for the multiplexing of multiple...
详细信息
This paper discusses three candidate metroplex-wide arrival scheduling algorithms that are aimed at improving the efficiency of and the coordination between arrival operations in a metroplex environment. We present an...
详细信息
Single-carrier frequency division multiple access (SCFDMA) has been selected as the uplink access scheme in the UTRA Long Term Evolution (LTE) due to its low peak-toaverage power ratio properties. Nevertheless, in ord...
详细信息
In this paper, two novel scheduling algorithms with low implementation complexity are investigated. Most scheduling algorithms proposed so far usually involve a sorting operation with the complexity of O(logN) per pac...
详细信息
暂无评论