The large amount of data processing is growing fast. In many scenarios, both in industry and academia, high-performance computing (HPC) is a needed to process Big Data in short time. An important topic in HPC is task ...
详细信息
The large amount of data processing is growing fast. In many scenarios, both in industry and academia, high-performance computing (HPC) is a needed to process Big Data in short time. An important topic in HPC is task scheduling. In this context, several scheduling algorithms for grid computing have been proposed, but these algorithms have not been yet fully tested by taking into account different types of applications and platforms. This paper presents a comparative study designed to discover the behavior of scheduling algorithms exhibit under different settings. This was done through a methodology with four criteria: performance, scalability, workload distribution and adaptability. The scheduling algorithms compared in this paper are HEFT, CPOP and PCH. Our results show that the HEFT algorithm performs well in almost all cases, despite its simplicity. The PCH and CPOP algorithms perform well only in very specific cases, this is mainly due to the high dependence on the critical path for both algorithms.
LTE is an all IP network. The scheduling in its downlink channels is a key problem. Although many algorithms have been designed and analyzed, the QoS for the users in poor channel conditions are not enough to be ensur...
详细信息
ISBN:
(纸本)9781467380812
LTE is an all IP network. The scheduling in its downlink channels is a key problem. Although many algorithms have been designed and analyzed, the QoS for the users in poor channel conditions are not enough to be ensured sometimes. We design a method to enhance the capacity of the system, which is a modifying strategy available for most existing algorithms. Our intuition is to allocate more resources to the users in poorer channel conditions without declining the QoS of the users in better channel. Simulations show that our strategy can satisfy the QoS for more users.
Resource scheduling has always been a hot and difficult problem in systems engineering and management at home and abroad, and it is also very important in the research of satellite earth station system. Due to the lim...
详细信息
ISBN:
(数字)9781728180281
ISBN:
(纸本)9781728180298
Resource scheduling has always been a hot and difficult problem in systems engineering and management at home and abroad, and it is also very important in the research of satellite earth station system. Due to the limited resources in the satellite earth station system, the rationality of resource allocation directly affects the overall performance of the multi-satellite system. The resource scheduling problem of satellite earth station is a combinatorial optimization problem based on *** paper summarizes the existing resource scheduling model and scheduling algorithm of satellite earth station system, and provides reference for the further research and development of this field.
Cloud computing is a dynamic, scalable and payper-use distributed computing model empowering designers to convey applications amid job designation and storage distribution. Cloud computing encourages to impart a pool ...
详细信息
ISBN:
(纸本)9781467368100
Cloud computing is a dynamic, scalable and payper-use distributed computing model empowering designers to convey applications amid job designation and storage distribution. Cloud computing encourages to impart a pool of virtualized computer resource empowering designers to convey applications amid job designation and storage distribution. The cloud computing mainly aims to give proficient access to remote and geographically distributed resources. As cloud technology is evolving day by day and confronts numerous challenges, one of them being uncovered is scheduling. scheduling is basically a set of constructs constructed to have a controlling hand over the order of work to be performed by a computer system. algorithms are vital to schedule the jobs for execution. Job scheduling algorithms is one of the most challenging hypothetical problems in the cloud computing domain area. Numerous deep investigations have been carried out in the domain of job scheduling of cloud computing. This paper intends to present the performance comparison analysis of various pre-existing job scheduling algorithms considering various parameters. This paper discusses about cloud computing and its constructs in section (i). In section (ii) job scheduling concept in cloud computing has been elaborated. In section (iii) existing algorithms for job scheduling are discussed, and are compared in a tabulated form with respect to various parameters and lastly section (iv) concludes the paper giving brief summary of the work.
Cloud computing environments mainly focus on the delivery of resources, platforms, and applications as services to users over the Internet. Cloud promises users access to as many resources as they need, making use of ...
详细信息
ISBN:
(纸本)9781509036837
Cloud computing environments mainly focus on the delivery of resources, platforms, and applications as services to users over the Internet. Cloud promises users access to as many resources as they need, making use of an elastic provisioning of resources. The cloud technology has gained popularity in recent years as the new paradigm in the IT industry. The number of users of Cloud services has been increasing steadily, so the need for efficient task scheduling is crucial for maintaining performance. In this particular case, a scheduler is responsible for assigning tasks to virtual machines efficiently, it is expected to adapt to changes along with defined demand. In this paper, we present a comparative performance study on bio-inspired scheduling algorithms: Ant Colony Optimization (ACO) and Honey Bee Optimization (HBO). A networking scheduling algorithm, Random Biased Sampling, is also evaluated. Those algorithms show the ability of self-managing and adapting to changes in the environment. The experimental results have shown that ACO performs better when computation power is set as the objective, and HBO shows better scheduling when the objective mainly relies on costs.
A Wireless Sensor Network (WSN) is a network system consisting of wireless sensor nodes that collect and transmit data. One crucial factor that affects WSN performance is latency, which is the time required to send da...
详细信息
ISBN:
(数字)9798331536206
ISBN:
(纸本)9798331536213
A Wireless Sensor Network (WSN) is a network system consisting of wireless sensor nodes that collect and transmit data. One crucial factor that affects WSN performance is latency, which is the time required to send data to the gateway. High latency can cause data delivery delays, resulting in data becoming irrelevant. At the same time, receiving real-time data quickly is the primary monitoring method. In addition, high latency can cause greater energy consumption because the sensor node device must be active longer. One way to overcome latency is to implement traffic management techniques such as scheduling data delivery or using priority delivery methods, which can reduce congestion and latency. This paper discusses the effect of latency on WSN using scheduling algorithms, namely Round-Robin and Random scheduling. The results were then taken 30 times to obtain a statistical comparison. The results obtained in the experiment received a Round-Robin scheduling algorithm that was superior to the random scheduling algorithm with a mean and standard deviation value of 12.68 and 2.33, respectively.
This paper presents a detailed analysis of computational complexity, RF and operational energy consumption of a number of radio resource management strategies. Those scheduling algorithms are evaluated within a LTE do...
详细信息
ISBN:
(纸本)9781467309899
This paper presents a detailed analysis of computational complexity, RF and operational energy consumption of a number of radio resource management strategies. Those scheduling algorithms are evaluated within a LTE downlink simulator and the results show that the adaptive scheduling algorithm is able to achieve a significant energy saving-up to average operational energy reduction gain of 71.75% and 47.86% over a conventional nonenergy aware resource allocation scheme in the pessimistic and optimistic case, respectively. In addition, the computational complexity of the algorithm is estimated, and the trade-off between RF and DSP processing for power efficiency is evaluated.
Task scheduler plays a significant role in cloud computing, since it has a direct effect on cloud performance. As cloud scheduling is known to be an NP-hard problem, swarm intelligence-based techniques are widely used...
详细信息
ISBN:
(纸本)9781467397636
Task scheduler plays a significant role in cloud computing, since it has a direct effect on cloud performance. As cloud scheduling is known to be an NP-hard problem, swarm intelligence-based techniques are widely used in this paradigm, due to their ability of searching for large scale problem solutions in an efficient manner. This paper, discusses some scheduling algorithms based on artificial bee colony. These algorithms exploit the smartness of bees' behavior to reach an optimal assignment of tasks to resources. An analytical comparison has also been done to briefly show the characteristics and applications of bee colony technique for scheduling in distributed computing area.
The latest 4G wireless technology, Long Term Evolution (LTE), is expected to be a promising wireless network for smart grid communications due to its high data rate and low delay. The needs of real time communications...
详细信息
The latest 4G wireless technology, Long Term Evolution (LTE), is expected to be a promising wireless network for smart grid communications due to its high data rate and low delay. The needs of real time communications in the smart grid require reliable, confident and well tested wireless networks. scheduling is one of the mechanisms which has a crucial role on the smart grid performance since it is in charge of the bandwidth resource allocation process. However, due to the fact that LTE has not been intended for smart grid communications, the performance of the scheduling algorithms must be optimized and properly tested. This paper aims at evaluating the performance of three scheduling algorithms, namely Frame Level Scheduler, Exponential Rule and Logarithmic Rule algorithms, in the smart grid communications. The evaluation process is based on their performance in the smart grid for three applications (VoIP, video surveillance and metering data) with specific data rate and delay requirements for each application. The results are evaluated in terms of throughput, delay and packet loss ratio.
Parallel computing is the fundamental base for MapReduce framework in Hadoop. A big data is split into small data chunks, where Map task is referred to processing a data chunk. Each data chunk is replicated over three...
详细信息
暂无评论