CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

What is a minimum of Unpredictable Workload Pattern over all Elastic Scaling in Cloud Computing?

by Ravi (Ravinder) Prakash G., Kiran M.
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 140 - Number 4
Year of Publication: 2016
Authors: Ravi (Ravinder) Prakash G., Kiran M.
10.5120/ijca2016909294

Ravi (Ravinder) Prakash G., Kiran M. . What is a minimum of Unpredictable Workload Pattern over all Elastic Scaling in Cloud Computing?. International Journal of Computer Applications. 140, 4 ( April 2016), 44-53. DOI=10.5120/ijca2016909294

@article{ 10.5120/ijca2016909294,
author = { Ravi (Ravinder) Prakash G., Kiran M. },
title = { What is a minimum of Unpredictable Workload Pattern over all Elastic Scaling in Cloud Computing? },
journal = { International Journal of Computer Applications },
issue_date = { April 2016 },
volume = { 140 },
number = { 4 },
month = { April },
year = { 2016 },
issn = { 0975-8887 },
pages = { 44-53 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume140/number4/24586-2016909294/ },
doi = { 10.5120/ijca2016909294 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:41:25.981655+05:30
%A Ravi (Ravinder) Prakash G.
%A Kiran M.
%T What is a minimum of Unpredictable Workload Pattern over all Elastic Scaling in Cloud Computing?
%J International Journal of Computer Applications
%@ 0975-8887
%V 140
%N 4
%P 44-53
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Measurability is a concept in elastic scaling that is based on two assumptions: (1) every cloud service provider is cautious, i.e., does not exclude any cloud consumer’s Unpredictable Workload resource pooling pattern choice from consideration, and (2) every cloud service provider respects the cloud consumer’s Unpredictable Workload resource pooling pattern preferences, i.e., deems one cloud consumer’s Unpredictable Workload resource pooling pattern choice to be infinitely more likely than another whenever it premises the cloud consumer to prefer the one to the other. In this paper we provide a new approach for measurability, by assuming that cloud service providers have asymmetric Unpredictable Workload resource pooling pattern about the cloud consumer’s Unpredictable Workload utilities. We show that, if the uncertainty of each cloud service provider about the cloud consumer’s Unpredictable Workload utilities vanishes gradually in some regular manner, then the Unpredictable Workload resource pooling pattern choices it can measurably make under common conjecture in measurability are all actually measureable in the original elastic scaling with no uncertainty about the cloud consumer’s utilities.

References
  1. Kiran M., Saikat Mukherjee, Ravi Prakash G., Characterization of Randomized Shuffle and Sort Quantifiability in MapReduce Model, International Journal of Computer Applications, 51-58, Volume 79, No. 5, October 2013.
  2. Amresh Kumar, Kiran M., Saikat Mukherjee, Ravi Prakash G., Verification and Validation of MapReduce Program model for Parallel K-Means algorithm on Hadoop Cluster, International Journal of Computer Applications, 48-55, Volume 72, No. 8, June 2013.
  3. Barroso, L.A., Ho¨lzle, U.: The datacenter as a computer: an introduction to the design of warehouse-scale machines. Synth. Lect. Comput. Architect. 4, 1–45 (2009).
  4. Kiran M., Amresh Kumar, Saikat Mukherjee, Ravi Prakash G., Verification and Validation of MapReduce Program Model for Parallel Support Vector Machine Algorithm on Hadoop Cluster, International Journal of Computer Science Issues, 317-325, Vol. 10, Issue 3, No. 1, May 2013.
  5. Ravi Prakash G, Kiran M. Saikat Mukherjee, On Randomized Preference Limitation Protocol for Quantifiable Shuffle and Sort Behavioral Implications in MapReduce Programming Model, Parallel & Cloud Computing, Vol. 3, Issue 1, 1-14, January 2014.
  6. Fehling, C., Leymann, F., Mietzner, R., Schupeck, W.: A collection of patterns for cloud types, cloud service models, and cloud-based application architectures. Technical report, University of Stuttgart (2011)
  7. Ravi Prakash G, Kiran M, On The Least Economical MapReduce Sets for Summarization Expressions, International Journal of Computer Applications, 13-20, Volume 94, No.7, May 2014.
  8. Ravi (Ravinder) Prakash G, Kiran M., On Randomized Minimal MapReduce Sets for Filtering Expressions, International Journal of Computer Applications, Volume 98, No. 3, Pages 1-8, July 2014.
  9. Fehling, C., Leymann, F., Retter, R., Schumm, D., Schupeck, W.: An architectural pattern language of cloud-based applications. In: Proceedings of the 18th Conference on Pattern Languages of Programs (PLoP), Portland, (2011).
  10. Fehling, C., Leymann, F., Rutschlin, J., Schumm, D.: Pattern-based development and management of cloud applications. Future Internet 4, 110–141 (2012). (doi:10.3390/fi4010110)
  11. Ravi (Ravinder) Prakash G, Kiran M., How Minimal are MapReduce Arrangements for Binning Expressions. International Journal of Computer Applications Volume 99 (11): 7-14, August 2014.
  12. Ravi (Ravinder) Prakash G, Kiran M., Shuffling Expressions with MapReduce Arrangements and the Role of Binary Path Symmetry. International Journal of Computer Applications 102(16): 19-24, September 2014.
  13. Ravi (Ravinder) Prakash G, Kiran M; How Replicated Join Expressions Equal Map Phase or Reduce Phase in a MapReduce Structure? International Journal of Computer Applications, Volume 107 (12): 43-50, December 2014.
  14. Fehling, C., Ewald, T., Leymann, F., Pauly, M., Ru¨tschlin, J., Schumm, D.: Capturing cloud computing knowledge and experience in patterns. In: Proceedings of the 5th IEEE International Conference on Cloud Computing (CLOUD), Honolulu, (2012).
  15. Ravi (Ravinder) Prakash G, Kiran M., On Composite Join Expressions of Map-side with many Reduce Phase. International Journal of Computer Applications Volume 110(9): 37-44, January 2015.
  16. Dimitri P. Bertsekas, Convex Optimization Algorithms, Athena Scientific, Hardcover Edition ISBN: 1-886529-28-0, 978-1-886529-28-1, Publication: February, 2015, 576 pages.
  17. Ravi (Ravinder) Prakash G, Kiran M; How Reduce Side Join Part File Expressions Equal MapReduce Structure into Task Consequences, Performance? International Journal of Computer Applications, Volume 105(2):8-15, November 2014
  18. Ravi (Ravinder) Prakash G, Kiran M. "On the MapReduce Arrangements of Cartesian product Specific Expressions". International Journal of Computer Applications 112(9):34-41, February 2015.
  19. Ravi (Ravinder) Prakash G, Kiran M., On Job Chaining MapReduce Meta Expressions of Mapping and Reducing Entropy Densities. International Journal of Computer Applications 113(15): 20-27, March 2015.
  20. Ravi (Ravinder) Prakash G, Kiran M. "On Chain Folding Problems of Chain Mapper and Chain Reducer Meta Expressions". International Journal of Computer Applications 116(16): 35-42, April 2015.
  21. Ravi (Ravinder) Prakash G, Kiran M."On Job Merging MapReduce Meta Expressions for Multiple Decomposition Mapping and Reducing". International Journal of Computer Applications 118 (13):14-21, May 2015.
  22. Ravi (Ravinder) Prakash G, Kiran M." Characterization of Randomized External Source Output Map Reduce Expressions". International Journal of Computer Applications 123(14):9-16, August 2015.
  23. Ravi (Ravinder) Prakash G, Kiran M., Does there Exist Pruning Decomposition for MapReduce Expressions Arrangements?. International Journal of Computer Applications 125(12): 41-48, September 2015.
  24. Ravi (Ravinder) Prakash G, Kiran M: Can one find External Source Input Expressions for which there exist Map Reduce Configurations? International Journal of Computer Applications 128(12): 14-21, October 2015.
  25. Ravi (Ravinder) Prakash G. and Kiran M., Is It True for Static Scaling Cloud Model there Exists a Centrally Asymmetric Static Workload Pattern? Communications on Applied Electronics 3(4): 39-48, November 2015.
  26. Ravi (Ravinder) Prakash. G and Kiran M., Given a Static Workload Cloud Computing Patterns does it have an Elastic Scaling? Communications on Applied Electronics 4(2): 17-26, January 2016.
  27. Ravi (Ravinder) Prakash G. and Kiran M., How can Periodic Workload Cloud Pattern benefit from Periodically Peaking Utilization?. International Journal of Applied Information Systems 10(5):27-36, February 2016.
  28. Ravi (Ravinder) Prakash G. and Kiran M., On Characterized Once-in-a-Lifetime Workload patterns for Periodic Static Scaling. International Journal of Applied Information Systems 10(6):33-43, March 2016.
Index Terms

Computer Science
Information Sciences

Keywords

Cloud service provider cloud consumer Unpredictable Workload asymmetric resource pooling pattern utilities elastic scaling behavioral measurably

Powered by PhDFocusTM