parallel language and compiler
Download as PPTX, PDF12 likes7,873 views
This document discusses parallel language and compiler features. It describes the demanding programming environment for parallel computers compared to sequential ones. The document outlines six categories of parallel language features: optimization, availability, synchronization/communication, control of parallelism, data parallelism, and process management. It also discusses the three phases of compilers for parallel languages: flow analysis, optimization, and code generation. The goal is to automatically generate optimized parallel code from high-level languages to maximize hardware parallelism.
parallel language and compiler
- 2. INTRODUCTION The environment for parallel computers is much more demanding than that for sequential computers The programming environment is a collection of software tools and system software support To break this hardware/software barrier , we need a parallel software environment Which provide better tools for user to implement parallelism and to debug programs
- 3. LANGUAGE FEATURES Features are idealized for general purpose application. Some of the features are identified with existing language /compiler development. Language features are classified into six categories
- 4. CATEGORIES Optimization Availability features. features. Synchronization /communication Control of parallelism Data parallelism Process features management features features.
- 5. OPTIMIZATION FEATURES This features converting sequentially coded programs into parallel forms. The purpose is to match the software with the hardware Parallelism in the target machine. Automated parallelizer(alliant FX fortan) Semiautomed Interractive parallelizer(programers intrection) restructure support(static analyser , run time static , data flow graph,)
- 6. AVAILABILTY FEATURES Feature enhance user friendliness . Make the language portable to a larger class of parallel computer Expand the applicability of software libraries Scalabilty – scalable to the number of processors available and independent of hardware topology Compatibility-compatible with establishment sequential Portability –portable to shared memory multiprocessors , message passing multicomputers , or both
- 7. SYNC/COMMUN FEATURES Single assignment Remote languages producer call Data flow languages such as ID Send /receive for message passing Barriers ,mailbox , semaphores , monitors
- 8. CONTROL OF PARALLELISM Coarse ,medium, or fine grains Explicit Global Take versus implicit parallelism parallelism in the entire program spilt parallelism Shared task queue
- 9. DATA PARALLELISM FEATURES Used to specify how data are accessed and distributed in either SIMD and MIMD computers Run- time automatic decomposition Mapping specification Virtual Direct processor support access to shared data SPMD(single program multiple data)
- 10. PROCESS MANAG FEATURES Needed to support the efficient creation of parallel processes , implementation of multithreading or multitasking. Dynamic process creation at run time Light weight processes(threads)- compare to UNIX(heavyweight)processes Replicated work Partitioned networks Automatic load balancing
- 11. COMPILERS Using It’s high level language in source code become a necessity in modern computer ROLE OF COMPILER Remove the burden of program optimization and code generation from the programmer.
- 12. THREE PHASES OF COMPILER FLOW ANALYSIS OPTIMIZATION CODE GENERATION
- 13. FLOW ANALYSIS Program flow pattern in order to determine data and control dependence in the source code Flow analysis is conducted at different execution levels on different parallel computers Instruction level parallelism is exploited in super scalar or VLSI processors , loop level in SIMD , vector, Task level in multiprocessors , multicomputer , or a network workstation
- 14. OPTIMIZATION The transformation of user programs in order to explore the hardware capabilities as much as possible Transformation can be conducted at the loop level , locality level , or prefetching level The ultimate goal of PO is to maximize the speed of code execution It involves minimization of code length and of memory accesses and the exploitation Sometimes should be conducted at the algorithmic level and must involves the programmer
- 15. CODE GENERATION Code generation usually involves transformation from one representation to another ,called an intermediate form Even more demanding because parallel constructs must be included Code generation closely tied to instruction scheduling policies used Optimized to encourage a high degree of parallelism Parallel code generation is very different fo different computer classes they are software and hardware scheudled
- 16. THANK ‘S