The week's pick
Reseach Article
Is it Possible to Sequence Continuously Changing Workload Patterns for Periodic Elastic Scaling?
| International Journal of Applied Information Systems |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 10 - Number 10 |
| Year of Publication: 2016 |
| Authors: Ravi (Ravinder) Prakash G., Akshay Reddy |
10.5120/ijais2016451555
|
Ravi (Ravinder) Prakash G., Akshay Reddy . Is it Possible to Sequence Continuously Changing Workload Patterns for Periodic Elastic Scaling?. International Journal of Applied Information Systems. 10, 10 ( May 2016), 12-22. DOI=10.5120/ijais2016451555
Abstract
Measurability is a concept in periodic Elastic scaling based on the following two conditions: (a) a cloud service provider should be cautious, that is, should not exclude any cloud consumer’s resource pooling pattern strategy from consideration; and (b) a cloud service provider should consider the cloud consumers’ resource pooling pattern preferences, that is, should deem a cloud consumer’s resource pooling pattern strategy ki infinitely more likely than k'i if it premises the cloud consumer to prefer ki to k'i. A resource pooling pattern strategy is measurable if it can optimally be chosen under common resource pooling pattern conjecture in the events (a) and (b). In this paper we present an algorithm that for every finite periodic Elastic Scaling operation computes the set of all measurable resource pooling pattern strategies. The algorithm is based on the new idea of an Continuously Changing Workload preference limitation, which is a pair (ki, Vi) consisting of a resource pooling pattern strategy ki, and a subset of resource pooling pattern strategies Vi, for cloud service provider i. The interpretation is that cloud service provider i prefers some resource pooling pattern strategy in Vi to ki. The algorithm proceeds by successively adding Continuously Changing Workload preference limitations to the periodic Elastic Scaling.
References
- 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.
- 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.
- 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).
- 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.
- 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.
- 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)
- 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.
- 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.
- 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).
- 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)
- 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.
- 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.
- Dimitri P. Bertsekas and John N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Athena Scientific, Hardcover Edition (appeared in 2015), ISBN: 1-886529-15-9 Publication: 2015, 735 pages.
- 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.
- 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).
- Bauer, E., Adams, R.: Reliability and Availability of Cloud Computing. Wiley-IEEE Press, Hoboken (2012).
- 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.
- 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.
- 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
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
Index Terms
Keywords