Low-Overhead Development of Scalable Resource-Efficient Software Systems

Author:

Huang Wei-Chih1,Knottenbelt William J.1

Affiliation:

1. Imperial College London, UK

Abstract

As the variety of execution environments and application contexts increases exponentially, modern software is often repeatedly refactored to meet ever-changing non-functional requirements. Although programmer effort can be reduced through the use of standardised libraries, software adjustment for scalability, reliability, and performance remains a time-consuming and manual job that requires high levels of expertise. Previous research has proposed three broad classes of techniques to overcome these difficulties in specific application domains: probabilistic techniques, out of core storage, and parallelism. However, due to limited cross-pollination of knowledge between domains, the same or very similar techniques have been reinvented all over again, and the application of techniques still requires manual effort. This chapter introduces the vision of self-adaptive scalable resource-efficient software that is able to reconfigure itself with little other than programmer-specified Service-Level Objectives and a description of the resource constraints of the current execution environment. The approach is designed to be low-overhead from the programmer's perspective – indeed a naïve implementation should suffice. To illustrate the vision, the authors have implemented in C++ a prototype library of self-adaptive containers, which dynamically adjust themselves to meet non-functional requirements at run time and which automatically deploy mitigating techniques when resource limits are reached. The authors describe the architecture of the library and the functionality of each component, as well as the process of self-adaptation. They explore the potential of the library in the context of a case study, which shows that the library can allow a naïve program to accept large-scale input and become resource-aware with very little programmer overhead.

Publisher

IGI Global

Reference94 articles.

1. Abram, G., & Treinish, L. (1995). An extended data-flow architecture for data analysis and visualization. In Proceedings of the 6th Conference on Visualization (pp. 263-270). Atlanta, GA: IEEE Computer Society.

2. Alabduljalil, M. A., Tang, X., & Yang, T. (2013). Optimizing parallel algorithms for all pairs similarity search. In Proceedings of the sixth ACM International Conference on Web Search and Data Mmining (pp. 203-212). Rome, Italy: ACM.

3. Allmaier, S. C., & Horton, G. (1997). Parallel shared-memory state-space exploration in stochastic modeling. In Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel (pp. 207-218). Paderborn, Germany: Springer-Verlag.

4. Bawa, M., Condie, T., & Ganesan, P. (2005). LSH forest: Self-tuning indexes for similarity search. In Proceedings of the 14th International Conference on World Wide Web (pp. 651-660). Chiba, Japan: ACM.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3