Load Balancing Cloud Computing by Khan Akram (7 results)
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 84.13
US$ 13.32 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 80 pages. 8.66x5.91x0.19 inches. In Stock.
- More images
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 38.96
US$ 79.63 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Load Balancing in Cloud Computing Environment Using Greedy Algorithms | Md Akram Khan (u. a.) | Taschenbuch | 80 S. | Englisch | 2017 | LAP LAMBERT Academic Publishing | EAN 9783330327696 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]prei…gu[dot]de | Anbieter: preigu.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: New
US$ 157.81
US$ 33.31 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- More images
Language: English
Published by LAP LAMBERT Academic Publishing Jul 2017, 2017
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 42.07
US$ 26.17 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Cloud computing is a novel technology leads several new challenges to all organizations. It has been adopted by worldwide scientifically and commercially. For optimal use of cloud's potential power, effective and efficient algorithm…s are required, which will select best resources from available cloud resources for different applications. Allocation of user requests (tasks) to the cloud resources can optimize various performance parameters like makespan, throughput, energy consumption, etc. The task allocation or mapping problem is a well-known NP-Complete problem. Novel load balancing algorithmic approach are presented to organizing the virtualized resources of the cloud data center efficiently. The load assigned to a VM scaling up and down according to the resource available with the VM. The application of greedy algorithms are presented that minimizes the average waiting of the system, and makespan, which results in optimal use of the resource utilization and overall energy consumption. A simulation study has been presented with CloudSim to compare the performance of Task-Based allocation, First Come First Serve, Split Based Allocation and random algorithm in the cloud. 80 pp. Englisch.
- More images
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 36.64
US$ 55.73 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Khan Md AkramMd. Akram Khan, Sambit Kumar Mishra and Bibhudatta Sahoo are the researchers in Cloud Computing Research Lab, National Institute of Technology Rourkela, India. Their research interests are:… Cloud Architecture, Resource M.
- More images
Language: English
Published by LAP LAMBERT Academic Publishing Jul 2017, 2017
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 42.07
US$ 68.26 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Cloud computing is a novel technology leads several new challenges to all organizations. It has been adopted by worldwide scientifically and commercially. For optimal use of cloud¿s potential power, effective and efficient algorithms ar…e required, which will select best resources from available cloud resources for different applications. Allocation of user requests (tasks) to the cloud resources can optimize various performance parameters like makespan, throughput, energy consumption, etc. The task allocation or mapping problem is a well-known NP-Complete problem. Novel load balancing algorithmic approach are presented to organizing the virtualized resources of the cloud data center efficiently. The load assigned to a VM scaling up and down according to the resource available with the VM. The application of greedy algorithms are presented that minimizes the average waiting of the system, and makespan, which results in optimal use of the resource utilization and overall energy consumption. A simulation study has been presented with CloudSim to compare the performance of Task-Based allocation, First Come First Serve, Split Based Allocation and random algorithm in the cloud.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 80 pp. Englisch.
- More images
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 42.07
US$ 69.04 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Cloud computing is a novel technology leads several new challenges to all organizations. It has been adopted by worldwide scientifically and commercially. For optimal use of cloud's potential power, effective and efficient algorithms are… required, which will select best resources from available cloud resources for different applications. Allocation of user requests (tasks) to the cloud resources can optimize various performance parameters like makespan, throughput, energy consumption, etc. The task allocation or mapping problem is a well-known NP-Complete problem. Novel load balancing algorithmic approach are presented to organizing the virtualized resources of the cloud data center efficiently. The load assigned to a VM scaling up and down according to the resource available with the VM. The application of greedy algorithms are presented that minimizes the average waiting of the system, and makespan, which results in optimal use of the resource utilization and overall energy consumption. A simulation study has been presented with CloudSim to compare the performance of Task-Based allocation, First Come First Serve, Split Based Allocation and random algorithm in the cloud.
