The week's pick
Reseach Article
The Scalability Metric based on Cost-Effectiveness in Distributed Systems
| International Journal of Applied Information Systems |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 12 - Number 15 |
| Year of Publication: 2018 |
| Authors: Emmanuel Kwabena Gyasi, Dominic Asamoah, Emmanuel Ofori Oppong, Stephen Opoku Oppong |
10.5120/ijais2018451773
|
Emmanuel Kwabena Gyasi, Dominic Asamoah, Emmanuel Ofori Oppong, Stephen Opoku Oppong . The Scalability Metric based on Cost-Effectiveness in Distributed Systems. International Journal of Applied Information Systems. 12, 15 ( September 2018), 1-10. DOI=10.5120/ijais2018451773
Abstract
Today’s computer systems are more complex, more rapidly evolving, and more essential to the conduct of business than those of recent past. The complexity becomes more rigid in the case of distributed systems. As businesses grow, the systems that support their functions also need to grow to support more users, process more data, or both. As they grow, it is important to maintain their performance in terms of responsiveness or throughput. Despite its importance, scalability is poorly understood and few organizations understand how to quantitatively evaluate an application’s scalability. The derived scalability metric of this paper is based on cost effectiveness, in which the effectiveness is a function of the system's throughput and its QoS. It is a strategy based scalability metric that generalizes the well-known metrics for scalability of parallel computations to describe heterogeneous distributed systems. Scalability is measured by the range of scale factors that gives a satisfactory value of the metric, since a good scalability is a joint property of the initial design and the scaling strategy. What makes this derived metric unique is the fact that, it separates the impact of throughput and response time on the metric, formalizing the notation of a scaling strategy, introducing QoS evaluation and more also, introducing formal scalability enablers which are optimized at each scale factor.
References
- Amdahl G. M., Validity of the Single Processor Approach to achieving Large Scale Computing Capabilityties. In Proceedings of the AFIPS Spring Joint Computer Conference, pages 483–485, April1967
- Gustafson J. L., Montry G. R., and Benner R. E. Development of Parallel Methods for a 1024-node Hypercube. SIAM Journal on Scientific and Statistical Computing, 9(4):609–638, 1988
- Sun X-H. and Gustafson J. L. Towards a better Parallel Performance Metric. ParallelComputing, 17:1093–1109,1991
- Karp A. H. and Flatt H. P. Measuring Parallel processor Performance. Communications of the ACM, 33(5):539–543, May 1990.
- Kumar V. and Rao V. N. Parallel Depth-First Search. International Journalof Parallel Programming, 16(6):501–519, 1987
- Kung H. T. The Structure of Parallel Algorithms. Advances in Computers, 19:65–112, 1980. Edited by Marshall C. Yovits and Published by Academic Press, New York.
- Jamieson L. H, Gannon D. B., and Douglas R. J., The Characteristics of Parallel Algorithms, pages 65–100. MIT Press, 1987.
- Agarwal A. Limits on Interconnection Network Performance. IEEE Transactions on Parallel and Distributed Systems, 2(4):398–412, October 1991.
- Pfister G. F. and Norton V. A. Hot Spot Contention and Combining in Multistage Interconnection Networks. IEEE Transactions on Computer Systems, C-34(10):943–948, October 1985.
- Anderson T. E. The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors. IEEE Transactions on Paralleland Distributed Systems, 1(1):6–16, January 1990.
- Mellor-Crummey J. M. and Scott M. L. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACM Transactions on Computer Systems, 9(1):21–65, February 1991
- Eggers S. J. and Katz R. H. The Effect of Sharing on the Cache and Bus Performance of Parallel Programs. In Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems, pages 257–270, Boston, Massachusetts, April 1989.
- Chen D, Su H, and Yew P. The Impact of Synchronization and Granularity on Parallel Systems. In Proceedings of the 17th AnnualInternational Symposium on Computer Architecture, pages 239–248, 1990.
- Cypher R., Ho A., Konstantinidou S., and Messina P. Architectural requirements of parallel scientific applications with explicit communication. In Proceedings of the 20th AnnualInternational Symposium on Computer Architecture, pages 2–13, May 1993
- Rothberg E, J. Singh P, and Gupta A. Working sets, cache sizes and node granularity issues for large-scale multiprocessors. In Proceedings of the 20th AnnualInternational Symposium on Computer Architecture, pages 14–25, May 1993."Generic Functional Architectures for Transport Networks," Int'l Telecommunications Union Recommendation no. G. 805, Nov.1995
- Crovella M. E. and LeBlanc T. J. Parallel Performance Prediction Using Lost Cycles Analysis. In Proceedings of Supercomputing ’94, November 1994.
- Sivasubramaniam A, Singla A, Ramachandran U, and Venkateswaran H. An Approach to Scalability Study of Shared Memory Parallel Systems. In Proceedings of the ACM SIGMETRICS 1994 Conference on Measurement and Modeling of Computer Systems, pages 171–180, May 1994.
- Jogalekar P.P. and Woodside C.M., "A Scalability Metric for Distributed Computing Applications in Telecommunications," Proc. 15th Int'l Teletraffic Congress Teletraffic Contributions to the Information Age, pp. 101-110, 1997.
- Trantafiliou P. and Taylor D. J, "The Location-Based Paradigm for Replication: Achieving Efficiency and Availability in Distributed Systems, " IEEE Trans. Software Eng., vol. 21, pp. 1-18, Jan. 1995.
- Pan A. M, "Solving Stochastic Rendezvous Networks of Large Client-Server Systems with Symmetric Replication, " master’s paper, Dept. of Systems and Computer Eng., Carleton Univ, Ottawa, Sept. 1996.
Index Terms
Keywords