Optimizing compilers through parallel processors and memory performance observing as combined approach
DOI:
https://doi.org/10.61841/xe2pba37Keywords:
Memory performance, Parallelism, Matrix, Permutation, Scope Management, UnifiedAbstract
Phases of compilers for tokenizing the input using lexical analysis and regular expression. Abstract syntax tree in the form of parsing. Abstract might go to error state if it has more than one input. Hence automata use the phases of compiler with the help of algorithms which is mathematical. Processing of source code which is human readable to machine readable code which is translated at the time of runtime. While translating code should be readable which is done with the help of compilers and interpreters. Therefore, it requires less memory because there is no specific code for platform. Taking string input as symbols changes state as per instructions is called finite automata. It uses regular expressions. It recognizes regular expressions. After processing all the state according to instruction, it reaches final state, and it is known as accepted state. If it is self-compiling kind of compiler in any programming language is known as bootstrapping. Using very little part of language we could generate bootstrap compiler is many programming languages. For example, languages like Pascal, Haskell, C, OCaml, Java etc uses bootstrap compiler. Features containing discrete properties in mathematics like calculus, algebra that includes set theory, matrix and so on. Before runtime occurs in programming language some interpretation happens in some languages, that is translation occurs. Interpreted code can be executed without the help of machine code. It can run in many operating systems. Optimization is good, because they are interpreted as soon as they are interpreted. To one of the problems is inefficiency of compiled programming language. Small talker is of the programming language it is known for most productive for many years. Language complexity is considered seriously. Now a days we are using Swift for reducing the complexity of the language.
Downloads
References
[1] M. O'Boyle and P. Knijnenburg, Non-singular data transformations: definition, validity, applications, in ``Proc. 6th Workshop on Compilers for Parallel Computers, ,''pp. 287_297 - 2003.
[2] D. Palermo and P. Banerjee, Automatic selection of dynamic data partitioning schemes for distributed memory multi computers, in ``Proc. 8th Workshop on Languages and Compilers for Parallel
Computing, Columbus, ,'' pp. 392_406 -2003.
[3] C. Polychronopoulos, M. B. Girkar, M. R. Haghighat, C. L. Lee, B. P Leung, and D. A. Schouten,
Parafrase-2: an environment for parallelizing, partitioning, synchronizing, and scheduling programs
on multiprocessors, in ``Proc. the International Conference on Parallel Processing, St. Charles, IL,,''
pp. 39_48 - 2000.
[4] J. Ramanujam, Non-unimodular transformations of nested loops, in ``Proc. Supercomputing 92,
Minneapolis, MN, ' pp. 214_223 - 2000.
[5] J. Ramanujam and A. Narayan, Integrating data distribution and loop transformations for dis- tributed memory machines, in ``Proc. 7th SIAM Conference on Parallel Processing for Scientific Computing -2015.
[6] J. Ramanujam and A. Narayan, Automatic data mapping and program transformations, in ``Proc.
Workshop on Automatic Data Layout and Performance Prediction, Houston, TX,. - 2018''
[7] V. Sarkar, G. R. Gao, and S. Han, Locality analysis for distributed shared-memory multiprocessors, in
``Proc. the Ninth International Workshop on Languages and Compilers for Parallel Computing, Santa
Clara, CA'' -2019.
Downloads
Published
Issue
Section
License
Copyright (c) 2020 AUTHOR
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
