|
|
Analysing and Optimizing GPU Kernels with Machine Learning
Šťavík, Petr ; Kruliš, Martin (advisor) ; Straka, Milan (referee)
Graphics processing units (GPUs) were originally used solely for the purpose of graph- ics rendering. This changed with the introduction of technologies like CUDA that enabled to use graphics processors as any other computing device. However, writing an efficient program for GPUs, also called GPU kernel, is one of the most difficult programming disciplines. The latest research in the field suggests that these difficulties could be po- tentially mitigated with machine learning methods. One especially successful approach is based on the utilization of recurrent neural networks (RNNs) over different representa- tions of source code. In this work, we present two RNN-based solutions that are able to derive performance characteristics of a CUDA GPU kernel directly from its intermediate representation called PTX. We assess the applicability of our two methods in two GPU op- timization tasks. In heterogeneous device mapping task, our methods are able to achieve accuracies of around 82%, results that are slightly worse than the current state of the art. In a more challenging achieved occupancy task, where the goal is to correctly predict one out of ten classes, our two methods achieve accuracies above 50%. These promising results indicate great potential in additional research focused in a similar direction. 1
|
|
|
Load Balancing in Evaluation Systems for Programming Assignments
Buchar, Jan ; Kruliš, Martin (advisor) ; Tůma, Petr (referee)
Systems for automated evaluation of assignments are a valuable aid for both teachers of programming courses and their students. The objective of this thesis is to examine the possibilities of deploying such systems in a large-scale distributed environment and the challenges of such endeavors. A sizable part of the requirements comes from experience with ReCodEx - an assignment evaluation system developed at the department of the supervisor. Modern server multi-core processors provide considerable computing power that can be used for assignment evaluation. However, parallel measurements can interfere with each other. This causes unstable results, which detriments the fairness of grading. Isolation (sandboxing) technologies can cause similar effects. We measure both of these influences and use the results to determine to what degree can multi-core processors be exploited. The problem of efficient distribution of work between multiple evaluation workers is complementary to that of utilizing multi-core machines. We survey scheduling algorithms and design an experiment to compare their performance. Additionally, we examine the possibility of leveraging container technologies to simplify the deployment of software required for evaluation. This leads to both a smaller administration overhead and a less complex...
|
|
|
Board Games Tracking Using Camera and Depth Sensor
Staněk, Roman ; Kruliš, Martin (advisor) ; Musil, Tomáš (referee)
Board games have been the everlasting amusement of mankind. During the last few decades, there were many attempts to recognize the state of the games or even track the whole matches using an RGB camera. In this thesis, we use low-cost sensor containing both RGB camera and depth sensor, namely Kinect v2 from Microsoft Corporation, to do such a task. The goal is to analyze properties of depth sensor on small scenes and propose ways in which can depth data improve results of existing solutions used to locate game board and chess pieces. To demonstrate those techniques, we developed a program able to track the chess match. It can locate the chessboard, detect the presence of black and white chess pieces on individual squares, validate movements, and record game so that it can be saved and loaded later. 1
|
|
|
Web Editor and Simulator of Logic Gate Networks
Horák, Jan ; Kruliš, Martin (advisor) ; Bulej, Lubomír (referee)
One of the topics taught in computer science is the principles of logic gates. An application that allows students to experiment with logic gates and gate networks can be used as a tool to provide better understanding of the topic. However, in order for the application to be usable, it should be available inde- pendently of the software on the user's computer. As a part of this thesis, we were able to implement such application. It provides users with the function- ality of constructing circuits from logic gates interconnected with wires. The application is able to simulate the network and display logic values on each of the wire. Additional functionality has been provided to make the application more enjoyable - unlimited canvas for circuit construction, a simple tutorial introducing new users to the basics of the application, import and export func- tionality and a library of logic circuits that can be imported onto the editing canvas in the form of gate networks or as single components. The application is easily expandable and the source code is available under an open-source license. 1
|
|
|
Zlepšení metod rozpoznávání obličejů s pomocí senzoru pro sledování pohybu těla
Belák, Michal ; Kruliš, Martin (advisor) ; Lokoč, Jakub (referee)
Kinect is a motion tracking input device developed by Microsoft. It uses a variety of on-board sensors to efficiently find and track human bodies represented in skeletal models. It was developed primarily to facilitate controlling of the Xbox 360 gaming console using body movement. Microsoft also released a software development kit for Kinect, giving programmers access to both raw data streams and computed tracking data from a connected Kinect. A second version of Kinect was released for Xbox One, bringing various hardware improvements as well as a new and incompatible version of the SDK. The main objective of this thesis is to determine, whether Kinect may be a better platform for real-time face recognition than regular cameras. We developed software compatible with both versions of Kinect, combining Kinect tracking data with existing face recognition libraries. We used this software to assess the benefits of tracking data by empirical evaluation on collected data.
|
|
|
Web Platform for Parallel Programming Tutorials
Buzek, Emanuel ; Kruliš, Martin (advisor) ; Yaghob, Jakub (referee)
This thesis presents a novel approach to introducing programmers into parallel and distributed computing. The main objective of this work is to develop an online coding environment which contains tutorials in form of simple parallel programming tasks. The online application simulates and visualizes multiple agents which cooperate on a task in virtual environment. These agents are programmed in a custom procedural language similar to JavaScript. A significant part of this thesis focuses on the design of this language. The client-side compiler is built using tools similar to Bison and Flex. The parallel simulator supports different scheduling algorithms including lock- step mode simulating computation on a GPU. An important aspect of the platform is extensibility; therefore, the tutorials and the packages for the programming language can be added as plug-ins. The final part of this thesis is dedicated to the implementation of sample packages and tutorials which demonstrate that the key goals of this thesis have been accomplished.
|
|
|
Streaming system scheduling for Xeon Phi
Faltín, Tomáš ; Yaghob, Jakub (advisor) ; Kruliš, Martin (referee)
Task scheduling in operating system area is a well-known problem on traditional system architectures (NUMA, SMP). Unfortunately, it does not perform well on emerging many-core architectures, especially on Intel Xeon Phi. We collected all publicly available information about the architecture of Xeon Phi. After that, we benchmarked the Xeon Phi in order to find the missing information about its architecture. We focused especially on the information about cores and memory controllers. These are the most important parts when designing a scheduler. Based on the results, we proposed improvements for scheduling algorithm in the Bobox (an experimental streaming system). However, we found that the biggest problem is not in the scheduling algorithm, but in the design of operators' parallelization. Therefore, we proposed improvements to the parallelization and tested one of the proposals.
|
|
|
Battlefield for Virtual Autonomous Robots
Sejkora, Vojtěch ; Ježek, Pavel (advisor) ; Kruliš, Martin (referee)
In most cases, programming is taught using mathematically motivated exam- ples, which are not attractive for all students. As a result, there have been many projects in the past that aimed to teach programming through games. A goal of this Bachelor's thesis was to develop a game in which students can compete with each other in programming virtual robots, and thus gain basic programming skills. This Bachelor's thesis contains several types of games, a visualization of the game and a mechanism for adding obstacles to the map. Futhermore, it contains a manual describing how to use this project and develop new virtual robots. 1
|
|
|
Framework for Customizable Autopilot Solutions
Raška, Michal ; Zavoral, Filip (advisor) ; Kruliš, Martin (referee)
The thesis analyses, designs and implements the framework for creation of customizable autopilot solutions for radio controlled airplanes. As a proof of concept of this framework a set of applications, which use this framework, is cre- ated. The result of this thesis is the extensible modular system, capable of airplane's attitude control, telemetry transmission and wireless communication with the ground station. There is great diversity in the components used by the system, which must be hidden by the framework. The differences must be encased in order to deliver required user experience for the programmers using the frame- work and the end users of the resulting applications as well. The tests, which validate the goals of the thesis indicate, that the resulting system is capable of all required tasks and ready to implement additional features which the end users might require in the future. 1
|
|
|
Streaming system scheduling for Xeon Phi
Faltín, Tomáš ; Yaghob, Jakub (advisor) ; Kruliš, Martin (referee)
Task scheduling in operating system area is well known problem on traditional system architectures (NUMA, SMP). However, it does not perform well on emerging many-core architectures, especially on Intel Xeon Phi. We have collected all publicly available information about the Xeon Phi's architecture. After that we have benchmarked the Xeon Phi to find missing information about its architecture. We were especially curious in architecture of cores and memory controllers. These parts are most important while designing scheduler. Based on the measured results we have proposed improvements to scheduling algorithm in the Bobox - experimental streaming system. Powered by TCPDF (www.tcpdf.org)
|
guest ::
