|
|
C Compiler in Python
Fiedor, Tomáš ; Bidlo, Michal (referee) ; Vašíček, Zdeněk (advisor)
There is currently no big link between creation of compilers and processor design and their instruction sets in courses. The goal of this work is to create easily extensible and modular compiler, which will enable experiments with instruction sets of used target processor. Compiler implements several optimization techniques. Their impact is more closely discussed. One of the advanced used techniques is context generation of output code. This technique generates less code than common blind generation.
|
|
|
Minimal Representation of the Božetěchova Complex
Král, Tomáš ; Beran, Vítězslav (referee) ; Herout, Adam (advisor)
The document describes developing graphical application with limited size. It describes suitable techniques for a polygonal mesh's compression. The second part is focused on practical usage of this techniques for developing scene in 3D modeling environment and also describes how to transfer this model to the executable file. The work attends to optimalizations of source code compilation and executables compression at the final chapters.
|
|
|
Optimizing large applications
Liška, Martin ; Hubička, Jan (advisor) ; Mareš, Martin (referee)
Both uppermost open source compilers, GCC and LLVM, are mature enough to link-time optimize large applications. In case of large applications, we must take into account, except standard speed efficiency and memory consumption, different aspects. We focus on size of the code, cold start-up time, etc. Developers of applications often come up with ad-hoc solutions such as Elfhack utility, start-up of an application via a pre-loading utility and dlopen; prelinking and variety of different tools that reorder functions to fit the order of execution. The goal of the thesis is to analyse all existing techniques of optimization, evaluate their efficiency and design new solutions based on the link-time optimization platform. Powered by TCPDF (www.tcpdf.org)
|
|
|
Optimizing large applications
Liška, Martin ; Hubička, Jan (advisor) ; Mareš, Martin (referee)
Both uppermost open source compilers, GCC and LLVM, are mature enough to link-time optimize large applications. In case of large applications, we must take into account, except standard speed efficiency and memory consumption, different aspects. We focus on size of the code, cold start-up time, etc. Developers of applications often come up with ad-hoc solutions such as Elfhack utility, start-up of an application via a pre-loading utility and dlopen; prelinking and variety of different tools that reorder functions to fit the order of execution. The goal of the thesis is to analyse all existing techniques of optimization, evaluate their efficiency and design new solutions based on the link-time optimization platform. Powered by TCPDF (www.tcpdf.org)
|
|
|
C Compiler in Python
Fiedor, Tomáš ; Bidlo, Michal (referee) ; Vašíček, Zdeněk (advisor)
There is currently no big link between creation of compilers and processor design and their instruction sets in courses. The goal of this work is to create easily extensible and modular compiler, which will enable experiments with instruction sets of used target processor. Compiler implements several optimization techniques. Their impact is more closely discussed. One of the advanced used techniques is context generation of output code. This technique generates less code than common blind generation.
|
|
|
Minimal Representation of the Božetěchova Complex
Král, Tomáš ; Beran, Vítězslav (referee) ; Herout, Adam (advisor)
The document describes developing graphical application with limited size. It describes suitable techniques for a polygonal mesh's compression. The second part is focused on practical usage of this techniques for developing scene in 3D modeling environment and also describes how to transfer this model to the executable file. The work attends to optimalizations of source code compilation and executables compression at the final chapters.
|
guest ::
