Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response
|
|
- Cornelius Woods
- 8 years ago
- Views:
Transcription
1 Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response Youshi Wang 1,4, Fa Zhang 2, and Zhiyong Liu 1,3(B) 1 Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China {wangyoushi,zyliu}@ict.ac.cn 2 Key Laboratory of Intelligent Information Processing, ICT, CAS, Beijing, China zhangfa@ict.ac.cn 3 State Key Laboratory for Computer Architecture, ICT, CAS, Beijing, China 4 University of Chinese Academy of Sciences, Beijing, China Abstract. Data centers demand response (DR) program has been paid more and more attention recently. As an important component of data centers, multi-tenant data centers (also called colocation ) play a significant role in the demand response, especially in the emergency demand response (EDR). In this paper, we focus on how the colocation can perform better in the EDR program. We formulate the uncoordinated relationship in the colocation which is the key problem affecting energy efficiency, and propose a reward system to motivate tenants to join the EDR program, and a truthful strategy is developed to ensure the authenticity of tenants information. For achieving the overall coordination, we integrate tenants resources to increase the colocation s resource utilization and optimize the whole colocation s energy efficiency, then devise two algorithms to solve the actual resource migration and integration problem. We analyze the complexity of allocation model and two algorithms. Experimental results show that our solution is practical and efficient. Keywords: Colocation Emergency demand response Uncoordinated relationship Truthful strategy design Algorithm analysis 1 Introduction Data center has become an integral part of our everyday lives. As the scale of the network is continuously extending, more and more data centers have been established, and consume huge amount of energy. The latest data suggests that only in 2013 the power consumption of data centers in the United States has increased to 91 billion kilowatt-hour and the prospective consumption in 2020 will reach 138 billion kilowatt-hour [1]. Because of the huge energy consumption, the demand response program becomes more important in date centers. Especially, the emergency demand response, in some extreme cases such as extreme weather or natural disaster, is for protecting the secure of State Grid by reducing c Springer International Publishing Switzerland 2015 J. Wang and C. Yap (Eds.): FAW 2015, LNCS 9130, pp , DOI: /
2 260 Y. Wang et al. the energy consumption. As one of the major sources of energy consumption, the control of data centers energy consumption plays an extremely important role in the emergency demand response. Generally, the data center can be classified into three types: private data center, colocation data center and public cloud computing data center. By the data from National Resource Defense Council (NRDC), the private data center is still the major part, accounting for 53 % of the total, although, the colocation has developed rapidly in recent years and has occupied for about 40 % of the total. NRDC estimates that in many small office-based organizations with on-premise server rooms, as much as 30 % of their total electricity use may be directed toward powering and cooling servers running 24 h a day, even when performing little or no work. The energy wasted by colocation annually is equivalent to the output of seven medium-sized coal-fired power plants [2]. However, the colocation s business model is different from other data centers: the colocation operator is responsible for energy supply and cooling, and all servers are controlled by tenants. Due to losing the direct control of servers, colocation becomes very weak for the energy consumption management. We call the dispersion of management as uncoordinated relationship and it has become a serious problem for colocation s energy-saving. In the colocation, because tenants pay the bill based on their peak energy, they don t care the energy consumption and always keep servers working on high performance. Moreover, due to tenants independence and the obstacles of communication between the operator and tenants, even if each tenant wants to optimize his own energy consumption independently, it is very difficult to get the global energy consumption optimization by each tenant s independent optimization. Statistic results from large private data centers such as Google and Amazon [3], show that rack units spend about 80 % of their time using less than 65 % of their peak power, and for the whole cluster, it never runs above 72 % of its aggregate peak power. Data analysis from Hotmail, MSR and Wikipedia shows that the average utilization of tenant s server is only 15 % [4]. So low resource utilization has become a critical problem need to be addressed in the colocation. The energy-saving problem of the data center has been researched widely, such as Dynamic Voltage and Frequency Scaling (DVFS) [5], energy-efficient topologies ([6 8]), virtualization of computer resources ([9 12]), and traffic engineering ([13 17]). However, almost all of these techniques work on a hypothesis that data centers are collaborative, that is, under the uncoordinated situation like the colocation, they can t be used directly to solve the energy consumption problem. Facing the problem of the uncoordinated relationship and low resource utilization in the colocation, we propose a framework by combining resource integration technology and economic incentives. Firstly, we design the reward system to encourage tenants to join the EDR program actively. We evaluate each tenant s resource migration cost and then return the benefits of energy-saving based on each tenant s cost. Secondly, for bids of tenants who join the EDR,
3 Truthful Strategy and Resource Integration for Multi-tenant Data Center 261 we propose a truthful strategy to ensure the authenticity of tenants information. Then we develop two algorithms to integrate tenants resources, and reduce the whole colocation s energy consumption by increasing resource utilization. Using the integration of tenants resources, we achieve the unified dispatch management in the colocation, and strengthen the cooperation of the whole colocation. To summarize, our contributions in this paper are three-fold: We formulate the uncoordinated relationship problem in the colocation which is the main reason for the colocation s energy inefficiency problem. To solve the colocation s uncoordinated relationship, we propose the reward system by combining the economic incentive and the resource migration method, then design a truthful strategy to ensure the authenticity of information from tenants. We prove the resource integration model is an NP-complete problem. For solve it, we develop Priority-based Resource Allocation Algorithm (P-RAA) and Dynamic Resource Allocation Algorithm (D-RAA), and give the time complexity of two algorithms. The rest of paper is organized as follows. We first propose the reward system and the truthful strategy in Sect. 2. In Sect. 3, we analyze the complexity of the resource integration model, then propose P-RAA and D-RAA to solve it and analyze their time complexity. In Sect. 4, we show and analyze our simulation experimental results. Finally, we summarize and conclude in Sect Reward System and Truthful Strategy Design In this section, we first study how to encourage tenants to join the EDR program actively, and propose a reward system to solve the amotivational problem. Then, we design a truthful strategy to ensure the authenticity of tenants information including the resource requests and energy-saving targets. 2.1 Rewards System Firstly, the cost of tenants can be divided into two parts, the switch loss and the performance degradation. The main source of switch loss is turning servers into sleep/off mode and bringing them back to normal operation [18]. Because the switch loss is independent of other external factors, we can use a fixed value η to denote it in one server. Then, we will focus on how to measure the degradation of performance. When allocating resources based on tenants requests, a bad situation is that real-time resource demand is beyond the actual load. From the view of the computer system, when actual load is beyond capacity limitation, redundant traffic will queue and wait. We use λ i and μ i to denote the arrive rate and processing rate of tenant i s traffic and use λ t and μ t to denote the actual arrive rate and actual processing rate. The theory rate is equivalent to each tenant s resource request, meanwhile, every tenant would get resources based on
4 262 Y. Wang et al. his request regardless of the actual traffic arrive rate, so the processing rate can be fixed, expressed as μ i = μ t. Under the actual situation, λ t is fluctuating so we use λ i as standard to estimate λ t. An M/M/1 queue model is used to calculate the theory delay: d i = 1 μ i λ i into two parts by the actual traffic arrive rate: { d1 = 1 for tenant i. Tenants actual delay could be divided μ i λ i t t T (λ t λ i ) d 2 = 1 μ i λ t t t T (λ t >λ i ) We set d 1 as benchmark. Because μ i has been fixed by each tenant s request, the main influence on delay d 1 is traffic arrive rate λ i. So delay d 1 canbeexpressed as a function only about λ i : 1 d 1 = λ i =1 d base (2) μ i λ i where d base denotes the unit delay benchmark. For d 2,wehave: (1) d 2 =(λ t /λ i )d base (3) Delay d 1 is determined by tenants resource requests, so it is set as a part of performance degeneration. The total performance degeneration cost can be expressed: d λ i = t1 d 2 = t t1 λ i d base (4) t 1 T (λ t >λ i ) For λ t, we adopt the gaussian distribution (limiting the data within a certain range) to simulate its fluctuating. In the actual simulation, we restrict interval length within 2σ (σ denotes the standard deviation). This can ensure that the simulation data is closer to the truth. Synthesizing the switch loss and the performance degradation, we can get a total delay expression: d i cost = m i η + t1 λ t λ i d base t 1 T (λ t >λ i ) (5) where m i is the number of tenant i s servers. The reward function, which is used to motivate tenants to join the EDR program, is based on tenant cost and energy-saving revenue. We can express the reward function as: Rd i = d i cost (γ pr M i ) (6) d i=1 i cost i=1 where γ is determined by operators to measure the tenant s energy-saving revenue based on the actual energy consumption target pr i and M denotes the set of tenants selected. M
5 Truthful Strategy and Resource Integration for Multi-tenant Data Center Truthful Strategy Since tenants lack of enough economic incentives to save energy, and they seldom or never cooperate with each other, operators need to exploit a pattern to enhance the synergy between tenants. Therefore, we encourage tenants to submit their resource demands in the form of bids and integrate tenants requests by the operator. The bid includes two aspects: resource request r i j,k (j (1,R),k (1,m i )) (R denotes the kinds of resource) and energy-saving target pr i. Here r i j,k means the jth resource demand of tenant i s kth server. We get an equivalent relation between the resource request r i j,k and the arrive rate λ i and the processing rate μ i : { μi = f 1 (r i j,k ) (7) λ i = f 2 (r i j,k ) f 1 and f 2 are both proportional functions. Next, we talk about how to ensure the authenticity of tenants bids. We assume that each tenant is rational-economic man, which means that the tenant always maximizes his own benefit. At the same time, this assumption also ensures that tenants wouldn t lie purposely without any benefit. In order to maximize interests, tenants trend to get more resources and more earnings. So we need not only to avoid lying about the resource demand, but also to get a truthful energy-saving target as a constraint for resource integration. Migrating fewer resources to save more energy is an optimal solution for decreasing the overall energy consumption. We use a weight function to express this relationship: pr i ω i = mi R k=1 j=1 r (8) i j,k From the view of operators, they would like to accept bids whose weight ω i is higher, and from the view of tenants, they want to get higher priority by submitting higher energy conservation goals or requesting less resource. We use an optimal model, showed in next section, to calculate tenants priorities, and apply the weight coefficient to adjust the objective function of the model. Less resource demand, more cost reduction. But the resource demand should have a lower bound to maintain the system stability and quality of service. So for every tenant, submitting his real demand is more conducive to get higher priority. However, if tenants set an excessive energy-saving goal than the actual energysaving for getting higher priority, it may cause resource integration scheme inefficiency even losing efficacy. For avoiding this situation, we firstly define a penalty function to increase the cost of lying, and then we propose an offline algorithm P-RAA to allocate the resource based on tenants priorities, and an on-line algorithm to allocate the resource when some tenants lie about their demands. When finishing tenant i s resource migration, the operator can get his actual energy-saving pr i true. By it, we can get the penalty function: f(β) = β(pr i (1 + p c1 )pr i true ), 0 max pri (1+pc1)pri true (9) β pr i true
6 264 Y. Wang et al. where p c1 is the percentage of maximum permissible error which is used to judge whether the error is factitious between the actual and the expected energysaving, and β is the punishment coefficient which is used to decide gradations of punishment when tenants submitted inveracious energy-saving targets. 3 Model Analysis and Algorithm Design Using prr to denote the whole energy-saving demand, we can get the energysaving constrain: M i=1 x ipr i prr (10) x i (0, 1) where x i denotes whether tenant i is selected. Combined with the capacity constrain, we propose the selection model to determine whose bids can be accepted to join the EDR program: (P 1 ) min M i=1 x i(m i η + t 1 λ t λ i d base ) 1 ω i s.t. M i=1 x ipr i prr M i=1 (x i mi k=1 R j=1 r i j,k) C x i (0, 1) t 1 T (λ t >λ i ) (11) where C is the operator s capacity, M is the number of tenants. This is a mixed integer linear problem. By (P 1 ), we can get a selection result vector X = (x 1,x 2,..., x M ). For ensuring that (P 1 ) has a solution, we need to make a hypothesis: we can find the solution based on two constraints including the energy-saving constraint and the resource capacity constraint in (P 1 ). This hypothesis is critical to our objective of designing the resource integration algorithm. After getting X, the next objective is to design algorithms for optimizing the resources allocation which will be discussed in Subsect Complexity Analysis We now analyze the computational complexity of the optimizing resource allocation problem. Here, this problem is taken analogous to 0 1 multi-knapsack problem. A recognized result is that this model is also NP-complete, and based on this result, we propose the following Lemma multi-knapsack problem is an extension of 0 1 knapsack problem that considers multi-knapsacks rather than one knapsack, which is known to be NP-complete. Lemma 1. Finding the optimal solution of allocation problem based on the selection model is an NP-complete problem. Proof. We assume that existing a polynomial time algorithm can solve the optimality of allocation problem. The optimizing model can be seen as a process
7 Truthful Strategy and Resource Integration for Multi-tenant Data Center 265 of finding minimum n, and this process includes limited attempts to find the optimal result. For every attempt, we set a value for n and then judge n severs whether can hold all requests, and we call it a subproblem. In this subproblem, there are N =(M m i ) resource requests, and for each request, the resource demand is r i k = j (1,R) r i j,k, which is indivisible. The resource integration model is to find an optimal solution which can use minimum servers to hold all selected tenants requests. It can be divided into multiple subproblems, and each of them is to judge whether all requests can be holden when the number of servers is fixed. We see every request as an item and the resource demand just is the item s weight. Meanwhile, operator s servers are seen as n knapsacks whose capacity are (k 1,k 2,...,k n ). When each request s value is 1, the resource integration model can be expressed as: (P 2 ) max n m z ij v j s.t. i=1 j=1 m z ij w j k i 1 i n j=1 n z ij 11 j m i=1 z ij (0, 1) where z ij denotes whether item j is put into knapsack i, andv j is the value of item j. This is a 0 1 multi-knapsack problem. According to the assumption, the resource integration problem can be solved within polynomial time, the subproblem should also be solved within polynomial time. We get the contradictory result P = NP, so the original assumption is false. Therefore, Lemma 1 is true. 3.2 The Off-line and On-line Algorithms For solving the resource allocation problem, we adopt the greedy algorithm to develop an offline algorithm (Priority-based Resource Allocation Algorithm (P-RAA), see Algorithm 1 and an online algorithm (Dynamic Resource Allocation Algorithm (D-RAA), see Algorithm 2. When all tenants provide their truthful demands, P-RAA can solve the resource allocation problem offline. We divide this algorithm into three parts. Firstly, we initialize the tab of each resource request and its time complexity is O(N). Then in (P 1 ), we calculate each tenant s value based on the objective function and sort all tenants value, and the corresponding time complexity is O(N + Mlog 2 M). Finally, we use the greedy algorithm to allocate resources and its time complexity is O(M 2 ). So the total time complexity of P-RAA is within O(M 2 +2N + Mlog 2 M), and this shows that P-RAA is a polynomial time algorithm. A specific situation must be considered when the actual energy-saving is below the energy-saving demand prr. Under this situation, we need to accept more bids from remaining tenants. For these tenants, we adopt the sequence
8 266 Y. Wang et al. Algorithm 1. Priority-based Resource Allocation Algorithm (P-RAA) 1: for all i M and j m i do 2: Initialize parameter flag ij =0;asthetabofeachresourcerequest 3: end for 4: By (P 1), choose s set of tenants who can join in the resource migration process and get the vector X =(x 1,..., x M ) 5: Using the greedy algorithm with suitable greed factor 6: for all i X do 7: Allocate tenant i s resources to the servers based on the greedy algorithm 8: flag ij =1;settenanti s resource request j as unavailable 9: end for 10: Output: The solution of all resource requests allocation from Algorithm 1 and then use the greedy algorithm to choose bids. Based on the rank, D-RAA is designed as an online algorithm for accepting bids dynamically. Because accepting more bids may need more operator s servers, so our greed aim is to use fewer servers to satisfy energy-saving constrain. Firstly, we consider to fill in the servers which has been used in the offline algorithm, and then we would use more severs to handle remaining resources. We assume that n tenants are selected. We don t consider the time complexity of sorting, because it has been consisted in Algorithm 1. So the time complexity of D-RAA can be expressed as O(n n). Algorithm 2. Dynamic Resource Allocation Algorithm (D-RAA) 1: Input: The resources allocation information from P-RAA and the servers used is K =(k 1,k 2,...,k n) 2: Sort tenant i( i M ) based on Algorithm 1; M represents a set of tenants whose bids aren t accepted 3: Check K and get each server s resource information 4: while Energy conservation constraints are not satisfied do 5: if i s bid can be put into K then 6: Using Greedy strategy to fill K 7: else 8: Put i s bid into a new server in order 9: end if 10: end while 11: Output: x i( i M ) Using algorithms P-RAA and D-RAA, we achieve a robust model for resource integration. Combined with the truthful strategy, operators can use the information to achieve the overall coordination.
9 Truthful Strategy and Resource Integration for Multi-tenant Data Center Experimental Results We evaluate the performance of our strategy and algorithms using the simulation data. In this work, we generate the resource demand of each tenant following Gaussian distribution under three different resource utilizations (15 %, 20 % and 30 %), and implement two strategies with different greed factors. From the experiments, we want to obtain two objectives: (1) looking for the better greed factor (Line 5 in Algorithm 1) to solve the multi-knapsack problem, (2) evaluating the performance of our algorithms in energy-saving, and showing the percentage of energy-saving of our solution in different conditions. Firstly, Based on three different resource utilizations, we use the Gaussian distribution to simulate the actual total resource demand of each tenant. The main reason why choose the Gaussian distribution is that we need the characteristic of fluctuating around the mean. Since the Gaussian distribution is unbounded, we limit the value interval for avoiding negative number. Then we adopt the uniform distribution to divide each tenant s total resource demand for getting the CPU and memory demands. Figure 1(a) shows the characters of the data distribution under the resource utilization of 15 %. Then we express the feasibility of our solution. Figure 1(b) shows the running time of our solution in cases of 30, 60, 200 tenants. As shown in Fig. 1(b), the running time will be increased with the growth of tenants, but even when tenants reach to 200, the running time of our solution is only 0.2 second. For the EDR program, the response time is requested to be smallest possible, so our solution is fast enough for responding the EDR program. Run Time (s) (a) The number of tenants (b) Fig. 1. (a) is the data distribution graph for the resource utilization of 15 %, (b) is the actual running time of the whole solution Next, we verify the effect of different greed factors on performance of energysaving. We use two strategies with different greed factors, one is to consider the size of resource requirements as the major factor, as shown with the strategy 1 in Fig. 2, the other tends to make resource requests to meet the resource
10 268 Y. Wang et al. supply structure of operators, as shown in strategy 2 in Fig. 2. Assuming that the resource is continuous and separable, the optimal solution can be got based on traditional linear programming with an absolute lower bound. Figure 2 shows that strategy 1 is better than strategy 2, and always under different resource utilizations, and very close to the optimal result. (a) (b) (c) Fig. 2. Comparison of two kinds of greedy algorithms and the optimal solution based on three factors. (a), (b) and (c) signify the different resource utilization 15 %, 20 % and 30 %. (a) (b) Fig. 3. Energy-saving figure: (a) is the comparison of energy-saving effect in three conditions; (b) shows the relationship between energy-saving and bids accepted To further analyze the performance of our solution, we compare the energy consumption of our algorithm with the optimal solution, as shown in Fig. 3. In the Fig. 3(a), the actual energy consumption is very close to the optimal energy consumption, under different resource utilizations. However, how much the energy is saved depends on the accepted number of tenants bids. Figure 3(b) describes the relationship between the accepted number of bids and the percent of energy-saving. We can find that, with the resource utilization increasing from 40 % to 100 %, our solution can get about 78 % average energy-saving. Also with the increasing of resources migrated, the energy-saving ratio takes on a growth
11 Truthful Strategy and Resource Integration for Multi-tenant Data Center 269 trend but is not obvious, the reason is that more resources migrated need to take up more servers from operators. In this work, 78 % average energy-saving is relatively stable, which suggests that we can obtain an efficient energy-saving solution by our algorithms. 5 Conclusion Because of high energy consumption, the colocation plays an irreplaceable role in the EDR program. From its characteristics, we discover that the uncoordinated relationship and the low resource utilization problems are the keys for improving the colocation s energy efficiency. In this paper, we design a reward system to encourage tenants to submit their resource demands and energy-saving targets. The reward system firstly evaluate each tenant s migration cost and then return the benefits of energy-saving based on the cost. For ensure the authenticity of tenants bids, we propose a truthful strategy including the design of the weight parameter and the build of the penalty function. Then we integrate all tenants resource demands by two algorithms: an off-line algorithm P-RAA and an online algorithm D-RAA. By resource integration, we achieve the unified dispatch management in the colocation, and reduce the colocation s energy consumption by improving the overall resource utilization. Finally, we analyze the complexity of the resource integration model, and show the specific time complexity expression for P-RAA and D-RAA. Experimental results show that our solution is effective on energy-saving in the colocation and fast enough for responding the EDR program. Acknowledgement. This research was supported in part by the National Natural Science Foundation of China (Grant No and ). References 1. Multi-tenant data centers need to play bigger energy efficiency role (2014) Is cloud computing always greener? (2012). cloud-computing-efficiency-ib.pdf 3. Barroso, L.A., Hölzle, U.: The datacenter as a computer: an introduction to the design of warehouse-scale machines. Synth. Lect. Comput. Archit. 4(1), (2009) 4. Ren, S., Islam, M.: Colocation demand response: why do i turn off my servers. In: ICAC (2014) 5. Semeraro, G., Magklis, G., Balasubramonian, R., Albonesi, D.H., Dwarkadas, S., Scott, M.L.: Energy-efficient processor design using multiple clock domains with dynamic voltage and frequency scaling. In: Proceedings of the Eighth International Symposium on High-Performance Computer Architecture, pp IEEE (2002) 6. Hou, C., Zhang, F., Anta, A.F., Wang, L., Liu, Z.: A hop-by-hop energy efficient distributed routing scheme. ACM SIGMETRICS Perform. Eval. Rev. 41(3), (2014)
12 270 Y. Wang et al. 7. Abts, D., Marty, M.R., Wells, P.M., Klausler, P., Liu, H.: Energy proportional datacenter networks. ACM SIGARCH Comput. Architect. News 38(3), (2010). ACM 8. Huang, L., Jia, Q., Wang, X., Yang, S., Li, B.: Pcube: improving power efficiency in data center networks. In: 2011 IEEE International Conference on Cloud Computing (CLOUD), pp IEEE (2011) 9. Jin, X., Zhang, F., Hu, S., Liu, Z.: Risk management for virtual machines consolidation in data centers. In: 2013 IEEE Global Communications Conference (GLOBE- COM), pp IEEE (2013) 10. Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., Neugebauer, R., Pratt, I., Warfield, A.: Xen and the art of virtualization. ACM SIGOPS Oper. Syst. Rev. 37(5), (2003) 11. Beloglazov, A., Buyya, R.; Energy efficient resource management in virtualized cloud data centers. In: Proceedings of the th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing, pp IEEE Computer Society (2010) 12. Mukherjee, T., Banerjee, A., Varsamopoulos, G., Gupta, S.K., Rungta, S.: Spatiotemporal thermal-aware job scheduling to minimize energy consumption in virtualized heterogeneous data centers. Comput. Netw. 53(17), (2009) 13. Wang, L., Zhang, F., Arjona Aroca, J., Vasilakos, A.V., Zheng, K., Hou, C., Li, D., Liu, Z.: Greendcn: a general framework for achieving energy efficiency in data center networks. IEEE J. Sel. Areas Commun. 32(1), 4 15 (2014) 14. Wang, X., Yao, Y., Wang, X., Lu, K., Cao, Q.: Carpo: correlation-aware power optimization in data center networks. In: INFOCOM: 2012 Proceedings IEEE, pp IEEE (2012) 15. Heller, B., Seetharaman, S., Mahadevan, P., Yiakoumis, Y., Sharma, P., Banerjee, S., McKeown, N.: Elastictree: saving energy in data center networks. In: NSDI, vol. 10, pp (2010) 16. Shang, Y., Li, D., Xu, M.: Energy-aware routing in data center network. In: Proceedings of the First ACM SIGCOMM Workshop on Green Networking, pp ACM (2010) 17. Zhang, Y., Ansari, N.: Hero: hierarchical energy optimization for data center networks. In: 2012 IEEE International Conference on Communications (ICC), pp IEEE (2012) 18. Lin, M., Wierman, A., Andrew, L.L., Thereska, E.: Dynamic right-sizing for powerproportional data centers. IEEE/ACM Trans. Network. (TON) 21(5), (2013)
Dynamic resource management for energy saving in the cloud computing environment
Dynamic resource management for energy saving in the cloud computing environment Liang-Teh Lee, Kang-Yuan Liu, and Hui-Yang Huang Department of Computer Science and Engineering, Tatung University, Taiwan
More informationA Dynamic Resource Management with Energy Saving Mechanism for Supporting Cloud Computing
A Dynamic Resource Management with Energy Saving Mechanism for Supporting Cloud Computing Liang-Teh Lee, Kang-Yuan Liu, Hui-Yang Huang and Chia-Ying Tseng Department of Computer Science and Engineering,
More informationENERGY-EFFICIENT TASK SCHEDULING ALGORITHMS FOR CLOUD DATA CENTERS
ENERGY-EFFICIENT TASK SCHEDULING ALGORITHMS FOR CLOUD DATA CENTERS T. Jenifer Nirubah 1, Rose Rani John 2 1 Post-Graduate Student, Department of Computer Science and Engineering, Karunya University, Tamil
More informationData Center Smart Grid Integration Considering Renewable Energies and Waste Heat Usage
Data Center Smart Grid Integration Considering Renewable Energies and Waste Heat Usage Stefan Janacek 1, Gunnar Schomaker 1, and Wolfgang Nebel 2 1 R&D Division Energy, OFFIS, Oldenburg, Germany {janacek,
More informationTasks Scheduling Game Algorithm Based on Cost Optimization in Cloud Computing
Journal of Computational Information Systems 11: 16 (2015) 6037 6045 Available at http://www.jofcis.com Tasks Scheduling Game Algorithm Based on Cost Optimization in Cloud Computing Renfeng LIU 1, Lijun
More informationInternational Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 3, May-June 2015
RESEARCH ARTICLE OPEN ACCESS Ensuring Reliability and High Availability in Cloud by Employing a Fault Tolerance Enabled Load Balancing Algorithm G.Gayathri [1], N.Prabakaran [2] Department of Computer
More informationDynamic Virtual Machine Allocation in Cloud Server Facility Systems with Renewable Energy Sources
Dynamic Virtual Machine Allocation in Cloud Server Facility Systems with Renewable Energy Sources Dimitris Hatzopoulos University of Thessaly, Greece Iordanis Koutsopoulos Athens University of Economics
More informationProfit Maximization and Power Management of Green Data Centers Supporting Multiple SLAs
Profit Maximization and Power Management of Green Data Centers Supporting Multiple SLAs Mahdi Ghamkhari and Hamed Mohsenian-Rad Department of Electrical Engineering University of California at Riverside,
More informationDynamic Scheduling and Pricing in Wireless Cloud Computing
Dynamic Scheduling and Pricing in Wireless Cloud Computing R.Saranya 1, G.Indra 2, Kalaivani.A 3 Assistant Professor, Dept. of CSE., R.M.K.College of Engineering and Technology, Puduvoyal, Chennai, India.
More informationResource-Diversity Tolerant: Resource Allocation in the Cloud Infrastructure Services
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 5, Ver. III (Sep. Oct. 2015), PP 19-25 www.iosrjournals.org Resource-Diversity Tolerant: Resource Allocation
More informationEnergy Optimizations for Data Center Network: Formulation and its Solution
Energy Optimizations for Data Center Network: Formulation and its Solution Shuo Fang, Hui Li, Chuan Heng Foh, Yonggang Wen School of Computer Engineering Nanyang Technological University Singapore Khin
More informationEfficient and Enhanced Load Balancing Algorithms in Cloud Computing
, pp.9-14 http://dx.doi.org/10.14257/ijgdc.2015.8.2.02 Efficient and Enhanced Load Balancing Algorithms in Cloud Computing Prabhjot Kaur and Dr. Pankaj Deep Kaur M. Tech, CSE P.H.D prabhjotbhullar22@gmail.com,
More informationCURTAIL THE EXPENDITURE OF BIG DATA PROCESSING USING MIXED INTEGER NON-LINEAR PROGRAMMING
Journal homepage: http://www.journalijar.com INTERNATIONAL JOURNAL OF ADVANCED RESEARCH RESEARCH ARTICLE CURTAIL THE EXPENDITURE OF BIG DATA PROCESSING USING MIXED INTEGER NON-LINEAR PROGRAMMING R.Kohila
More informationENERGY EFFICIENT AND REDUCTION OF POWER COST IN GEOGRAPHICALLY DISTRIBUTED DATA CARDS
ENERGY EFFICIENT AND REDUCTION OF POWER COST IN GEOGRAPHICALLY DISTRIBUTED DATA CARDS M Vishnu Kumar 1, E Vanitha 2 1 PG Student, 2 Assistant Professor, Department of Computer Science and Engineering,
More informationA Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster
, pp.11-20 http://dx.doi.org/10.14257/ ijgdc.2014.7.2.02 A Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster Kehe Wu 1, Long Chen 2, Shichao Ye 2 and Yi Li 2 1 Beijing
More informationEnergy Saving Virtual Machine Allocation in Cloud Computing
13 IEEE 33rd International Conference on Distributed Computing Systems Workshops Energy Saving Virtual Machine Allocation in Cloud Computing Ruitao Xie, Xiaohua Jia, Kan Yang, Bo Zhang Department of Computer
More informationInternational Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 6, June 2015 ISSN: 2321 7782 (Online) International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online
More informationHeterogeneous Workload Consolidation for Efficient Management of Data Centers in Cloud Computing
Heterogeneous Workload Consolidation for Efficient Management of Data Centers in Cloud Computing Deep Mann ME (Software Engineering) Computer Science and Engineering Department Thapar University Patiala-147004
More informationA Heuristic Location Selection Strategy of Virtual Machine Based on the Residual Load Factor
Journal of Computational Information Systems 9: 18 (2013) 7389 7396 Available at http://www.jofcis.com A Heuristic Location Selection Strategy of Virtual Machine Based on the Residual Load Factor Gaochao
More informationExperimental Evaluation of Energy Savings of Virtual Machines in the Implementation of Cloud Computing
1 Experimental Evaluation of Energy Savings of Virtual Machines in the Implementation of Cloud Computing Roberto Rojas-Cessa, Sarh Pessima, and Tingting Tian Abstract Host virtualization has become of
More informationThis is an author-deposited version published in : http://oatao.univ-toulouse.fr/ Eprints ID : 12902
Open Archive TOULOUSE Archive Ouverte (OATAO) OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. This is an author-deposited
More informationCONCEPTUAL MODEL OF MULTI-AGENT BUSINESS COLLABORATION BASED ON CLOUD WORKFLOW
CONCEPTUAL MODEL OF MULTI-AGENT BUSINESS COLLABORATION BASED ON CLOUD WORKFLOW 1 XINQIN GAO, 2 MINGSHUN YANG, 3 YONG LIU, 4 XIAOLI HOU School of Mechanical and Precision Instrument Engineering, Xi'an University
More informationExpansion of Data Center s Energetic Degrees of Freedom to Employ Green Energy Sources
Proceedings of the 28th EnviroInfo 2014 Conference, Oldenburg, Germany September 10-12, 2014 Expansion of Data Center s Energetic Degrees of Freedom to Employ Green Energy Sources Stefan Janacek 1, Wolfgang
More informationSetting deadlines and priorities to the tasks to improve energy efficiency in cloud computing
Setting deadlines and priorities to the tasks to improve energy efficiency in cloud computing Problem description Cloud computing is a technology used more and more every day, requiring an important amount
More informationScheduling using Optimization Decomposition in Wireless Network with Time Performance Analysis
Scheduling using Optimization Decomposition in Wireless Network with Time Performance Analysis Aparna.C 1, Kavitha.V.kakade 2 M.E Student, Department of Computer Science and Engineering, Sri Shakthi Institute
More informationJoint Virtual Machine Assignment and Traffic Engineering for Green Data Center Networks
Joint Virtual Machine Assignment and Traffic Engineering for Green Data Center Networks Lin Wang, Fa Zhang, Athanasios V. Vasilakos, Chenying Hou, Zhiyong Liu Institute of Computing Technology, Chinese
More informationSuper-Agent Based Reputation Management with a Practical Reward Mechanism in Decentralized Systems
Super-Agent Based Reputation Management with a Practical Reward Mechanism in Decentralized Systems Yao Wang, Jie Zhang, and Julita Vassileva Department of Computer Science, University of Saskatchewan,
More informationEnergy Constrained Resource Scheduling for Cloud Environment
Energy Constrained Resource Scheduling for Cloud Environment 1 R.Selvi, 2 S.Russia, 3 V.K.Anitha 1 2 nd Year M.E.(Software Engineering), 2 Assistant Professor Department of IT KSR Institute for Engineering
More informationData centers & energy: Did we get it backwards? Adam Wierman, Caltech
Data centers & energy: Did we get it backwards? Adam Wierman, Caltech The typical story about energy & data centers: The typical story about energy & data centers: Sustainable data centers Remember: The
More informationJoint Power Optimization of Data Center Network and Servers with Correlation Analysis
Joint Power Optimization of Data Center Network and Servers with Correlation Analysis Kuangyu Zheng, Xiaodong Wang, Li Li, and Xiaorui Wang The Ohio State University, USA {zheng.722, wang.357, li.2251,
More informationPaying to Save: Reducing Cost of Colocation Data Center via Rewards
Paying to Save: Reducing Cost of Colocation Data Center via Rewards Mohammad A. Islam, Hasan Mahmud, Shaolei Ren, Xiaorui Wang* Florida International University *The Ohio State University Supported in
More informationPredict the Popularity of YouTube Videos Using Early View Data
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
More informationVirtual Machine Placement in Cloud systems using Learning Automata
2013 13th Iranian Conference on Fuzzy Systems (IFSC) Virtual Machine Placement in Cloud systems using Learning Automata N. Rasouli 1 Department of Electronic, Computer and Electrical Engineering, Qazvin
More informationThe Probabilistic Model of Cloud Computing
A probabilistic multi-tenant model for virtual machine mapping in cloud systems Zhuoyao Wang, Majeed M. Hayat, Nasir Ghani, and Khaled B. Shaban Department of Electrical and Computer Engineering, University
More informationInternational Journal of Emerging Technology in Computer Science & Electronics (IJETCSE) ISSN: 0976-1353 Volume 8 Issue 1 APRIL 2014.
IMPROVING LINK UTILIZATION IN DATA CENTER NETWORK USING NEAR OPTIMAL TRAFFIC ENGINEERING TECHNIQUES L. Priyadharshini 1, S. Rajanarayanan, M.E (Ph.D) 2 1 Final Year M.E-CSE, 2 Assistant Professor 1&2 Selvam
More informationPrivacy Preserving Distributed Cloud Storage
Privacy Preserving Distributed Cloud Storage Praveenkumar Khethavath 1 *, Doyel Pal 2 1 Department of Mathematics, Engineering and Computer Science, LaGuardia Community College, Long Island City, NY 11101.
More informationMulti-service Load Balancing in a Heterogeneous Network with Vertical Handover
1 Multi-service Load Balancing in a Heterogeneous Network with Vertical Handover Jie Xu, Member, IEEE, Yuming Jiang, Member, IEEE, and Andrew Perkis, Member, IEEE Abstract In this paper we investigate
More informationADAPTIVE LOAD BALANCING ALGORITHM USING MODIFIED RESOURCE ALLOCATION STRATEGIES ON INFRASTRUCTURE AS A SERVICE CLOUD SYSTEMS
ADAPTIVE LOAD BALANCING ALGORITHM USING MODIFIED RESOURCE ALLOCATION STRATEGIES ON INFRASTRUCTURE AS A SERVICE CLOUD SYSTEMS Lavanya M., Sahana V., Swathi Rekha K. and Vaithiyanathan V. School of Computing,
More informationDesign and Implementation of IaaS platform based on tool migration Wei Ding
4th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering (ICMMCCE 2015) Design and Implementation of IaaS platform based on tool migration Wei Ding State Key Laboratory
More informationThe Answer Is Blowing in the Wind: Analysis of Powering Internet Data Centers with Wind Energy
The Answer Is Blowing in the Wind: Analysis of Powering Internet Data Centers with Wind Energy Yan Gao Accenture Technology Labs Zheng Zeng Apple Inc. Xue Liu McGill University P. R. Kumar Texas A&M University
More informationEnergy Efficient Geographical Load Balancing via Dynamic Deferral of Workload
2012 IEEE Fifth International Conference on Cloud Computing Energy Efficient Geographical Load Balancing via Dynamic Deferral of Workload Muhammad Abdullah Adnan, Ryo Sugihara and Rajesh K. Gupta University
More informationAn Energy Aware Cloud Load Balancing Technique using Dynamic Placement of Virtualized Resources
pp 81 86 Krishi Sanskriti Publications http://www.krishisanskriti.org/acsit.html An Energy Aware Cloud Load Balancing Technique using Dynamic Placement of Virtualized Resources Sumita Bose 1, Jitender
More informationKeywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age.
Volume 3, Issue 10, October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Load Measurement
More informationAvoiding Overload Using Virtual Machine in Cloud Data Centre
Avoiding Overload Using Virtual Machine in Cloud Data Centre Ms.S.Indumathi 1, Mr. P. Ranjithkumar 2 M.E II year, Department of CSE, Sri Subramanya College of Engineering and Technology, Palani, Dindigul,
More informationLoad Balancing Algorithm Based on Services
Journal of Information & Computational Science 10:11 (2013) 3305 3312 July 20, 2013 Available at http://www.joics.com Load Balancing Algorithm Based on Services Yufang Zhang a, Qinlei Wei a,, Ying Zhao
More informationMigration of Virtual Machines for Better Performance in Cloud Computing Environment
Migration of Virtual Machines for Better Performance in Cloud Computing Environment J.Sreekanth 1, B.Santhosh Kumar 2 PG Scholar, Dept. of CSE, G Pulla Reddy Engineering College, Kurnool, Andhra Pradesh,
More informationCutting Down the Energy Cost of Geographically Distributed Cloud Data Centers
Cutting Down the Energy Cost of Geographically Distributed Cloud Data Centers Huseyin Guler 1, B. Barla Cambazoglu 2 and Oznur Ozkasap 1 1 Koc University, Istanbul, Turkey 2 Yahoo! Research, Barcelona,
More informationA Sequential Game Perspective and Optimization of the Smart Grid with Distributed Data Centers
A Sequential Game Perspective and Optimization of the Smart Grid with Distributed Data Centers Yanzhi Wang, Xue Lin, and Massoud Pedram Department of Electrical Engineering University of Southern California
More informationMILP Model And Models For Cloud Network Backup
Minimizing Disaster Backup Window for Geo-Distributed Multi-Datacenter Cloud Systems Jingjing Yao, Ping Lu, Zuqing Zhu School of Information Science and Technology University of Science and Technology
More informationA few algorithmic issues in data centers Adam Wierman Caltech
A few algorithmic issues in data centers Adam Wierman Caltech A significant theory literature on green computing has emerged over the last decade BUT theory has yet to have significant impact in practice.
More informationKeywords Distributed Computing, On Demand Resources, Cloud Computing, Virtualization, Server Consolidation, Load Balancing
Volume 5, Issue 1, January 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Survey on Load
More informationOnline Resource Management for Data Center with Energy Capping
Online Resource Management for Data Center with Energy Capping A. S. M. Hasan Mahmud Florida International University Shaolei Ren Florida International University Abstract The past few years have been
More informationCHAPTER 1 INTRODUCTION
CHAPTER 1 INTRODUCTION 1.1 Background The command over cloud computing infrastructure is increasing with the growing demands of IT infrastructure during the changed business scenario of the 21 st Century.
More informationPrecise VM Placement Algorithm Supported by Data Analytic Service
Precise VM Placement Algorithm Supported by Data Analytic Service Dapeng Dong and John Herbert Mobile and Internet Systems Laboratory Department of Computer Science, University College Cork, Ireland {d.dong,
More informationA Taxonomy and Survey of Energy-Efficient Data Centers and Cloud Computing Systems
A Taxonomy and Survey of Energy-Efficient Data Centers and Cloud Computing Systems Anton Beloglazov, Rajkumar Buyya, Young Choon Lee, and Albert Zomaya Present by Leping Wang 1/25/2012 Outline Background
More informationVirtual Machine Allocation in Cloud Computing for Minimizing Total Execution Time on Each Machine
Virtual Machine Allocation in Cloud Computing for Minimizing Total Execution Time on Each Machine Quyet Thang NGUYEN Nguyen QUANG-HUNG Nguyen HUYNH TUONG Van Hoai TRAN Nam THOAI Faculty of Computer Science
More informationA Network Simulation Experiment of WAN Based on OPNET
A Network Simulation Experiment of WAN Based on OPNET 1 Yao Lin, 2 Zhang Bo, 3 Liu Puyu 1, Modern Education Technology Center, Liaoning Medical University, Jinzhou, Liaoning, China,yaolin111@sina.com *2
More informationAn Energy-aware Multi-start Local Search Metaheuristic for Scheduling VMs within the OpenNebula Cloud Distribution
An Energy-aware Multi-start Local Search Metaheuristic for Scheduling VMs within the OpenNebula Cloud Distribution Y. Kessaci, N. Melab et E-G. Talbi Dolphin Project Team, Université Lille 1, LIFL-CNRS,
More informationService Level Agreement-Based Joint Application Environment Assignment and Resource Allocation in Cloud Computing Systems
2013 IEEE Green Technologies Conference Service Level Agreement-Based Joint Application Environment Assignment and Resource Allocation in Cloud Computing Systems Yanzhi Wang, Shuang Chen and Massoud Pedram
More informationGame Theory Based Iaas Services Composition in Cloud Computing
Game Theory Based Iaas Services Composition in Cloud Computing Environment 1 Yang Yang, *2 Zhenqiang Mi, 3 Jiajia Sun 1, First Author School of Computer and Communication Engineering, University of Science
More informationINCREASING SERVER UTILIZATION AND ACHIEVING GREEN COMPUTING IN CLOUD
INCREASING SERVER UTILIZATION AND ACHIEVING GREEN COMPUTING IN CLOUD M.Rajeswari 1, M.Savuri Raja 2, M.Suganthy 3 1 Master of Technology, Department of Computer Science & Engineering, Dr. S.J.S Paul Memorial
More informationFair Scheduling Algorithm with Dynamic Load Balancing Using In Grid Computing
Research Inventy: International Journal Of Engineering And Science Vol.2, Issue 10 (April 2013), Pp 53-57 Issn(e): 2278-4721, Issn(p):2319-6483, Www.Researchinventy.Com Fair Scheduling Algorithm with Dynamic
More informationAnalysis of an Artificial Hormone System (Extended abstract)
c 2013. This is the author s version of the work. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purpose or for creating
More informationData Center Energy Cost Minimization: a Spatio-Temporal Scheduling Approach
23 Proceedings IEEE INFOCOM Data Center Energy Cost Minimization: a Spatio-Temporal Scheduling Approach Jianying Luo Dept. of Electrical Engineering Stanford University jyluo@stanford.edu Lei Rao, Xue
More informationInternational Journal of Scientific & Engineering Research, Volume 6, Issue 4, April-2015 36 ISSN 2229-5518
International Journal of Scientific & Engineering Research, Volume 6, Issue 4, April-2015 36 An Efficient Approach for Load Balancing in Cloud Environment Balasundaram Ananthakrishnan Abstract Cloud computing
More informationA STUDY OF TASK SCHEDULING IN MULTIPROCESSOR ENVIROMENT Ranjit Rajak 1, C.P.Katti 2, Nidhi Rajak 3
A STUDY OF TASK SCHEDULING IN MULTIPROCESSOR ENVIROMENT Ranjit Rajak 1, C.P.Katti, Nidhi Rajak 1 Department of Computer Science & Applications, Dr.H.S.Gour Central University, Sagar, India, ranjit.jnu@gmail.com
More informationData Center Network Structure using Hybrid Optoelectronic Routers
Data Center Network Structure using Hybrid Optoelectronic Routers Yuichi Ohsita, and Masayuki Murata Graduate School of Information Science and Technology, Osaka University Osaka, Japan {y-ohsita, murata}@ist.osaka-u.ac.jp
More informationWireless Data Center Network. Reporter: Green
Wireless Data Center Network Reporter: Green Outline What is DCN? Challenges in current DCN Cable Topology Traffic load Heterogeneous DCN Optical DCN Wireless DCN Challenges in WCDN The researches in WDCN
More informationCost-aware Workload Dispatching and Server Provisioning for Distributed Cloud Data Centers
, pp.51-60 http://dx.doi.org/10.14257/ijgdc.2013.6.5.05 Cost-aware Workload Dispatching and Server Provisioning for Distributed Cloud Data Centers Weiwei Fang 1, Quan Zhou 1, Yuan An 2, Yangchun Li 3 and
More informationA Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
Journal of Information & Computational Science 9: 16 (2012) 4801 4809 Available at http://www.joics.com A Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
More information@IJMTER-2015, All rights Reserved 355
e-issn: 2349-9745 p-issn: 2393-8161 Scientific Journal Impact Factor (SJIF): 1.711 International Journal of Modern Trends in Engineering and Research www.ijmter.com A Model for load balancing for the Public
More informationA Proposed Framework for Ranking and Reservation of Cloud Services Based on Quality of Service
II,III A Proposed Framework for Ranking and Reservation of Cloud Services Based on Quality of Service I Samir.m.zaid, II Hazem.m.elbakry, III Islam.m.abdelhady I Dept. of Geology, Faculty of Sciences,
More informationStudy on Redundant Strategies in Peer to Peer Cloud Storage Systems
Applied Mathematics & Information Sciences An International Journal 2011 NSP 5 (2) (2011), 235S-242S Study on Redundant Strategies in Peer to Peer Cloud Storage Systems Wu Ji-yi 1, Zhang Jian-lin 1, Wang
More informationA Load Balancing Method in SiCo Hierarchical DHT-based P2P Network
1 Shuang Kai, 2 Qu Zheng *1, Shuang Kai Beijing University of Posts and Telecommunications, shuangk@bupt.edu.cn 2, Qu Zheng Beijing University of Posts and Telecommunications, buptquzheng@gmail.com Abstract
More informationEPOBF: ENERGY EFFICIENT ALLOCATION OF VIRTUAL MACHINES IN HIGH PERFORMANCE COMPUTING CLOUD
Journal of Science and Technology 51 (4B) (2013) 173-182 EPOBF: ENERGY EFFICIENT ALLOCATION OF VIRTUAL MACHINES IN HIGH PERFORMANCE COMPUTING CLOUD Nguyen Quang-Hung, Nam Thoai, Nguyen Thanh Son Faculty
More informationEfficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration
Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration 1 Harish H G, 2 Dr. R Girisha 1 PG Student, 2 Professor, Department of CSE, PESCE Mandya (An Autonomous Institution under
More informationEnergy Efficient Resource Management in Virtualized Cloud Data Centers
2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Energy Efficient Resource Management in Virtualized Cloud Data Centers Anton Beloglazov* and Rajkumar Buyya Cloud Computing
More informationGreen Cloud Computing 班 級 : 資 管 碩 一 組 員 :710029011 黃 宗 緯 710029021 朱 雅 甜
Green Cloud Computing 班 級 : 資 管 碩 一 組 員 :710029011 黃 宗 緯 710029021 朱 雅 甜 Outline Introduction Proposed Schemes VM configuration VM Live Migration Comparison 2 Introduction (1/2) In 2006, the power consumption
More informationCloud Management: Knowing is Half The Battle
Cloud Management: Knowing is Half The Battle Raouf BOUTABA David R. Cheriton School of Computer Science University of Waterloo Joint work with Qi Zhang, Faten Zhani (University of Waterloo) and Joseph
More informationDECENTRALIZED LOAD BALANCING IN HETEROGENEOUS SYSTEMS USING DIFFUSION APPROACH
DECENTRALIZED LOAD BALANCING IN HETEROGENEOUS SYSTEMS USING DIFFUSION APPROACH P.Neelakantan Department of Computer Science & Engineering, SVCET, Chittoor pneelakantan@rediffmail.com ABSTRACT The grid
More informationUnderstanding the Impact of Weights Constraints in Portfolio Theory
Understanding the Impact of Weights Constraints in Portfolio Theory Thierry Roncalli Research & Development Lyxor Asset Management, Paris thierry.roncalli@lyxor.com January 2010 Abstract In this article,
More informationPhoenix Cloud: Consolidating Different Computing Loads on Shared Cluster System for Large Organization
Phoenix Cloud: Consolidating Different Computing Loads on Shared Cluster System for Large Organization Jianfeng Zhan, Lei Wang, Bibo Tu, Yong Li, Peng Wang, Wei Zhou, Dan Meng Institute of Computing Technology
More informationLean Six Sigma Analyze Phase Introduction. TECH 50800 QUALITY and PRODUCTIVITY in INDUSTRY and TECHNOLOGY
TECH 50800 QUALITY and PRODUCTIVITY in INDUSTRY and TECHNOLOGY Before we begin: Turn on the sound on your computer. There is audio to accompany this presentation. Audio will accompany most of the online
More informationJOB/scheduling system is one of the core and challenging. An Greedy-Based Job Scheduling Algorithm in Cloud Computing
JOURNAL OF SOFTWARE, VOL. 9, NO. 4, APRIL 2014 921 An Greedy-Based Job Scheduling Algorithm in Cloud Computing Ji Li a,b, Longhua Feng a,b, Shenglong Fang c a College of Computer Science, Chongqing University,
More informationUPS battery remote monitoring system in cloud computing
, pp.11-15 http://dx.doi.org/10.14257/astl.2014.53.03 UPS battery remote monitoring system in cloud computing Shiwei Li, Haiying Wang, Qi Fan School of Automation, Harbin University of Science and Technology
More informationThe Economics of the Cloud: Price Competition and Congestion
The Economics of the Cloud: Price Competition Congestion JONATHA ANSELMI Basque Center for Applied Mathematics BCAM DANILO ARDAGNA Dip. di Elettronica e Informazione, Politecnico di Milano JOHN C.S. LUI
More informationLoad Balanced Data Transmission within the Probabilistic Wireless Sensor Network
Load Balanced Data Transmission within the Probabilistic Wireless Sensor Network Jyoti P.Desai 1, Prof Abhijit Patil 2 1 Student, ME Computer Engineering, Yadavrao Tasgaonkar college of Engineering and
More informationT-110.5121 Mobile Cloud Computing (5 cr)
T-110.5121 Mobile Cloud Computing (5 cr) Assignment 1 details 18 th September 2013 M.Sc. Olli Mäkinen, course assistant Targets The main objective is to understand the cost differences between public,
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationThe Key Technology Research of Virtual Laboratory based On Cloud Computing Ling Zhang
International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2015) The Key Technology Research of Virtual Laboratory based On Cloud Computing Ling Zhang Nanjing Communications
More informationCombined Smart Sleeping and Power Scaling for Energy Efficiency in Green Data Center Networks
UNIFI@ECTI-CON 2013 (May 14 th 17 th 2013, Krabi, Thailand) Combined Smart Sleeping and Power Scaling for Energy Efficiency in Green Data Center Networks Nguyen Huu Thanh Department of Communications Engineering
More informationPower Consumption Based Cloud Scheduler
Power Consumption Based Cloud Scheduler Wu Li * School of Software, Shanghai Jiaotong University Shanghai, 200240, China. * Corresponding author. Tel.: 18621114210; email: defaultuser@sjtu.edu.cn Manuscript
More informationGreen Routing in Data Center Network: Modeling and Algorithm Design
Green Routing in Data Center Network: Modeling and Algorithm Design Yunfei Shang, Dan Li, Mingwei Xu Tsinghua University Beijing China, {shangyunfei, lidan, xmw}@csnet1.cs.tsinghua.edu.cn ABSTRACT The
More informationAn Optimization Model of Load Balancing in P2P SIP Architecture
An Optimization Model of Load Balancing in P2P SIP Architecture 1 Kai Shuang, 2 Liying Chen *1, First Author, Corresponding Author Beijing University of Posts and Telecommunications, shuangk@bupt.edu.cn
More informationEfficient and Robust Allocation Algorithms in Clouds under Memory Constraints
Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints Olivier Beaumont,, Paul Renaud-Goud Inria & University of Bordeaux Bordeaux, France 9th Scheduling for Large Scale Systems
More informationHigh-Mix Low-Volume Flow Shop Manufacturing System Scheduling
Proceedings of the 14th IAC Symposium on Information Control Problems in Manufacturing, May 23-25, 2012 High-Mix Low-Volume low Shop Manufacturing System Scheduling Juraj Svancara, Zdenka Kralova Institute
More informationModeling of Knowledge Transfer in logistics Supply Chain Based on System Dynamics
, pp.377-388 http://dx.doi.org/10.14257/ijunesst.2015.8.12.38 Modeling of Knowledge Transfer in logistics Supply Chain Based on System Dynamics Yang Bo School of Information Management Jiangxi University
More informationHow To Balance In Cloud Computing
A Review on Load Balancing Algorithms in Cloud Hareesh M J Dept. of CSE, RSET, Kochi hareeshmjoseph@ gmail.com John P Martin Dept. of CSE, RSET, Kochi johnpm12@gmail.com Yedhu Sastri Dept. of IT, RSET,
More informationCost-Efficient Job Scheduling Strategies
Cost-Efficient Job Scheduling Strategies Alexander Leib Arbeitsbereich Wissenschaftliches Rechnen Fachbereich Informatik Fakultät für Mathematik, Informatik und Naturwissenschaften Universität Hamburg
More informationGreening Backbone Networks: Reducing Energy Consumption by Shutting Off Cables in Bundled Links
Greening Backbone Networks: Reducing Energy Consumption by Shutting Off Cables in Bundled Links Will Fisher, Martin Suchara, and Jennifer Rexford Princeton University Princeton, NJ 08544, U.S.A. {wafisher,
More information