CFP last date
20 May 2024
Reseach Article

Lean and Efficient Business Tier for Performance Scaling

by Muralidaran Natarajan, Nandlal L. Sarda, Sharad C. Srivastava
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 118 - Number 7
Year of Publication: 2015
Authors: Muralidaran Natarajan, Nandlal L. Sarda, Sharad C. Srivastava
10.5120/20760-3182

Muralidaran Natarajan, Nandlal L. Sarda, Sharad C. Srivastava . Lean and Efficient Business Tier for Performance Scaling. International Journal of Computer Applications. 118, 7 ( May 2015), 31-40. DOI=10.5120/20760-3182

@article{ 10.5120/20760-3182,
author = { Muralidaran Natarajan, Nandlal L. Sarda, Sharad C. Srivastava },
title = { Lean and Efficient Business Tier for Performance Scaling },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 118 },
number = { 7 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 31-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume118/number7/20760-3182/ },
doi = { 10.5120/20760-3182 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:01:04.804016+05:30
%A Muralidaran Natarajan
%A Nandlal L. Sarda
%A Sharad C. Srivastava
%T Lean and Efficient Business Tier for Performance Scaling
%J International Journal of Computer Applications
%@ 0975-8887
%V 118
%N 7
%P 31-40
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Large mission critical real-time legacy OLTP systems supporting the service sectors like banking, telecom, and financial services are monolithic in nature and thereby not flexible to enable business transformation which is the need of the hour due to emerging dynamic changes to business ecosystem. Broadly speaking, these large mission critical applications can be classified into three stages of activities: pre-processing, core business processing and post processing activities. This paper focuses on making the Business processing activities tier lean and efficient. By leveraging recent advances in technologies, a methodology is described by which the OLTP applications can be successfully transformed into agile systems. The methodology enables a view of the Business Tier in five dimensions. The first dimension is identifying the business's core critical path and how to make it lean. The second dimension is how to enhance concurrency of the activities in the critical path. The third dimension is to improve the parallelism in execution of concurrency. The fourth is to separate I/O operations off the critical path. The fifth being how to minimize contentions for shared resources to ensure higher efficiencies. The paper also presents, the results of the experiments carried out by applying the above recommendation and the performance improvements to decide the optimal setup for an environment for given workload. Addressing the five dimensions of Business Tier, this paper demonstrates the transformation that can be achieved which will enable the business to be agile and respond to market ecosystem demands in a very efficient and effective manner.

References
  1. EDS, "Financial services legacy modernization," tech. rep. , EDS, 2007.
  2. L. Wu, H. Sahraoui, and P. Valtchev, "Coping with legacy system migration complexity," in Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems (ICECCSŠ05), June. 2005, pp. 600-609.
  3. IBM, Building Multi-Tier Scenarios for Web Sphere Enterprise Applications, I. Redbook, Ed. IBM Redbooks, 2003.
  4. C. Michiels, M. Snoeck, W. Lemahieu, F. Goethals, and G. Dedene, A Layered Architecture Sustaining Model Driven and even driven software development, Springer, Ed. 5th International Andrei Ershov Memorial Conference, PSI 2003, July. 2003, pp. 58-65, vol. 34, no. 4.
  5. H. R. Simpson, "Layered architecture(s): Principles and practice in concurrent and distributed systems," in Engineering of Computer-Based Systems, 1997. Proceedings, International Conference and Workshop, March. 1997, pp. 339–350.
  6. R. Peacock, "Distributed architecture technologies," IT PRO, June. 2000.
  7. R. Choy and A. Edelman, "Parallel mat lab: Doing it right," in Proceedings of the IEEE (Volume: 93, Issue: 2), 2005.
  8. IBM, "Building multi-tier scenarios for web sphere enterprise applications," IBM Redbook, Tech. Rep. , 2003.
  9. Tune, E. , La Jolla, Dongning L, Tullsen, D. M. and Calder, B. , 2001, "Dynamic prediction of critical path instructions", High-Performance Computer Architecture, 2001. HPCA. The Seventh International Symposium, Jan. 2001, pp. 185-195.
  10. Shripad Agashe, "Predictive analysis using critical path method & Amdahl's law," cmg. org, 2010.
  11. S. Kleiman, D. Shah, and B. Smaalders, Programming with threads. Prentice Hall, 1996.
  12. S. Akhter and J. Roberts, Multi-Core Programming, I. Press, Ed. Intel, 2006.
  13. F. R. Johnson, R. Stoica, A. Allamakee, and T. C. Mowry, "Decoupling contention management from scheduling," in ASPLOS XV Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems, ACM, New york, March. 2010, pp. 117–128.
  14. D. Kimpe, D. Carns, P. H, Harms, K, Wozniak, J. M, Lang, S, and R. B. Ross, "AESOP: expressing concurrency in high-performance system software," in Networking, Architecture and Storage (NAS), June. 2012, pp. 303-312.
  15. Black, D. L, "Scheduling support for concurrency and parallelism in the Mach operating system," IEEE Computer, 2002.
  16. M. Rajagopalan, B. T. Lewis, and T. A. Anderson, "Thread scheduling for multi-core platforms," Article 2. Usenix, 2007.
  17. G. K. Lockwood, "Processor affinity," tech. rep. , glennklockwood. com, 2014.
  18. R. Johnson, I Pandis, and A Ailamaki, "Critical sections: re-emerging scalability concerns for database storage engines," in DaMoN '08 Proceedings of the 4th international workshop on Data management on new hardware, June. 2008, pp. 35-40.
  19. M. A. Suleman, O. Mutlu,, and M. K. Qureshi, "Accelerating critical section execution with asymmetric multi-core architectures," in ACM SIGARCH Computer, March. 2009, pp. 253-264.
  20. F. R. Johnson, "Scalable storage managers for the multicore era," Ph. D. dissertation, Carnegie Mellon University, 2010.
  21. T. J. LeBlanc and E. P. Markatos, "Shared memory vs. message passing in shared-memory multiprocessors," in Fourth IEEE Symposium, December. 1992, pp. 254-263.
  22. D. Kranz, K. Johnson, A. Agarwal, J. Kubiatowicz, and B. -H. Lim, "Integrating message-passing and shared-memory: Early experience," in PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, July. 1993, pp. 54-63.
  23. Maged M. Michael and Michael L. Scott, "Non-blocking algorithms and pre-emption-safe locking on multiprogrammed shared memory multiprocessors," Journal of Parallel and Distributed Computing, Volume 51, Issue 1, May. 1998, pp. 1-26.
  24. L. Boguslavsky, K. Harzallah, A. Kreinen, K. Sevcik, and A. Vainshtein, "Optimal strategies for spinning and blocking," Journal of Parallel and Distributed Computing Volume 21, Issue 2, May. 1994, pp. 246-254.
  25. R. Johnson, M. R. Stoica, and A. natassa@epfl. ch, "A new look at the roles of spinning and blocking," in DaMoN '09 Proceedings of the Fifth International Workshop on Data Management on New Hardware, 2009, pp. 21-26.
  26. Times Ten Team, "High-performance and scalability through application tier, in-memory data management," in VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases, 2000, pp. 677-680.
  27. R. Johnson, I. Pandis, R. Stoica, M. Athanassoulis, and A. Ailamaki, "Aether: A scalable approach to logging," VLDB Endowment, Volume 3, Issue 1-2, September. 2010, pp. 681-692.
  28. M. Gillespie, "Amdahl's law, Gustafson's trend, and the performance limits of parallel applications," tech. rep. , Intel, 2008.
Index Terms

Computer Science
Information Sciences

Keywords

layering concurrency parallelism OLTP CPU affinity speedup lean critical path Architecture Performance gain