TY - GEN
T1 - Does the Cloud need new algorithms? An introduction to elastic algorithms
AU - Guo, Yike
AU - Ghanem, Moustafa
AU - Han, Rui
PY - 2012
Y1 - 2012
N2 - Cloud computing has emerged as a cost-effective way to deliver metered computing resources. Within a Cloud, elasticity of resource usage is typically realized through the 'on-demand' provision principle supported by the 'Pay-as-You-Go' business model. However, little, or no work, has investigated elasticity of algorithms for Cloud computing. In this paper, we introduce novel research on elastic algorithms (EA) where the computation itself is organized in a 'Pay-as-You-Go' fashion. In contrast to conventional algorithms, where computation is a deterministic process that only produces an 'ali-or-nothing' result, an EA generates a sequence of approximate results corresponding to its resource consumption. As more resources are consumed, better results will be derived. In this sense, the quality of the algorithm is elastic to its resource consumption. In the paper, we formalize the proeprties of elasticity and also formalize desirable properties for elastic algorithms themselves. We illustrate the design of an EA for kNN classification in the context of machine learning and discuss its properties. Finally we provide an ambitious agenda for future research in this area.
AB - Cloud computing has emerged as a cost-effective way to deliver metered computing resources. Within a Cloud, elasticity of resource usage is typically realized through the 'on-demand' provision principle supported by the 'Pay-as-You-Go' business model. However, little, or no work, has investigated elasticity of algorithms for Cloud computing. In this paper, we introduce novel research on elastic algorithms (EA) where the computation itself is organized in a 'Pay-as-You-Go' fashion. In contrast to conventional algorithms, where computation is a deterministic process that only produces an 'ali-or-nothing' result, an EA generates a sequence of approximate results corresponding to its resource consumption. As more resources are consumed, better results will be derived. In this sense, the quality of the algorithm is elastic to its resource consumption. In the paper, we formalize the proeprties of elasticity and also formalize desirable properties for elastic algorithms themselves. We illustrate the design of an EA for kNN classification in the context of machine learning and discuss its properties. Finally we provide an ambitious agenda for future research in this area.
KW - Cloud computing
KW - Pay-as-You-Go
KW - elastic algorithms
UR - http://www.scopus.com/inward/record.url?scp=84874235756&partnerID=8YFLogxK
U2 - 10.1109/CloudCom.2012.6427500
DO - 10.1109/CloudCom.2012.6427500
M3 - Conference contribution
AN - SCOPUS:84874235756
SN - 9781467345095
T3 - CloudCom 2012 - Proceedings: 2012 4th IEEE International Conference on Cloud Computing Technology and Science
SP - 66
EP - 73
BT - CloudCom 2012 - Proceedings
T2 - 2012 4th IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2012
Y2 - 3 December 2012 through 6 December 2012
ER -