|
|
I/O Subsystem Optimalization Using SSD
Bělousov, Petr ; Chalupníček, Kamil (referee) ; Kašpárek, Tomáš (advisor)
The bachelor thesis examines IO subsystem optimization using SSD cache to speed up HDDs. I examined possible server loads and identified those that are suitable for caching. In the first part I introduce 2 caching solutions, LVM cache and B-cache with their management capabilities and 2 filesystems Ext4 and XFS. In the second part IO performance of LVM cache and B-cache with Ext4 and XFS filesystem is benchmarked and compared to an uncached HDD array.
|
|
|
Extending Java Performance Monitoring Framework with Support for Windows Performance Counters
Dráb, Martin ; Bulej, Lubomír (advisor) ; Kruliš, Martin (referee)
Java Performance Measurement Framework (JPMF) is a library that allows to collect performance data from underlying operating system. The main goal of the framework is to provide a way of performance data measurement regardless of the application under test. This goal sets the framework apart from many ad-hoc performance measurement solutions targeted at specific applications or middleware platforms. Such solutions collect certain performance data at fixed points of the execution of the application under test. The main goal of this thesis is to implement a library that allows to collect performance statistics of various kinds on machines running Microsoft Windows operating system. The library should be integrated into the framework, which extends its portability.
|
|
|
On the Hardness of General Caching
Folwarczný, Lukáš ; Sgall, Jiří (advisor) ; Koutecký, Martin (referee)
Caching (also known as paging) is a classical problem concerning page re- placement policies in two-level memory systems. General caching is its vari- ant with pages of different sizes and fault costs. We aim at a better charac- terization of the computational complexity of general caching in the offline version. General caching in the offline version was recently shown to be strongly NP- hard, but the proof needed instances of caching with pages larger than half of the cache size. The primary result of this work addresses this problem as we prove: General caching is strongly NP-hard even when page sizes are limited to {1, 2, 3}. In the structural part of this work, a new simpler proof for the full characterization of work functions by layers for classical caching is given and then extended to caching with variable cache size. We invent two algorithms for restricted instances of general caching building on results around caching with variable cache size.
|
|
|
An Author's Right in the Information Society and Across the Internal European Union Market
Mikita, Peter ; Kříž, Jan (advisor) ; Srstka, Jiří (referee) ; Hendrychová, Michaela (referee)
Copyright law is a special category of civil law which, with the upswing of the Internet, has become important for different types of stakeholders in the global information society. The 'participative web' operates with content generated by users. This user-generated content has often disputable origins in terms of copyright clearance. The Internet has opened the possibility for developing new forms of communication between anonymous or individual users who are not easily identifiable. Especially peer-to-peer file sharing and recently the information services offered and operated by the so-called 'cyberlockers' are the reason of questioning the role of copyright protection online which needs a beneficial solution. Copyright infringement in the era of information society is a complex phenomenon with a multiplicity of contributing factors like the importance of information data with big business potential, personal attitudes shown by internet users towards the value and scarcity of intellectual property, or legal responsibility of internet service providers (ISP) who paradoxically act from the safety of the so-called safe harbours as intermediaries of information exchange, representing a new element in the communication chain between rights holders and users. Commercial and business models operating...
|
|
|
I/O Subsystem Optimalization Using SSD
Bělousov, Petr ; Chalupníček, Kamil (referee) ; Kašpárek, Tomáš (advisor)
The bachelor thesis examines IO subsystem optimization using SSD cache to speed up HDDs. I examined possible server loads and identified those that are suitable for caching. In the first part I introduce 2 caching solutions, LVM cache and B-cache with their management capabilities and 2 filesystems Ext4 and XFS. In the second part IO performance of LVM cache and B-cache with Ext4 and XFS filesystem is benchmarked and compared to an uncached HDD array.
|
|
|
On the Hardness of General Caching
Folwarczný, Lukáš ; Sgall, Jiří (advisor) ; Koutecký, Martin (referee)
Caching (also known as paging) is a classical problem concerning page re- placement policies in two-level memory systems. General caching is its vari- ant with pages of different sizes and fault costs. We aim at a better charac- terization of the computational complexity of general caching in the offline version. General caching in the offline version was recently shown to be strongly NP- hard, but the proof needed instances of caching with pages larger than half of the cache size. The primary result of this work addresses this problem as we prove: General caching is strongly NP-hard even when page sizes are limited to {1, 2, 3}. In the structural part of this work, a new simpler proof for the full characterization of work functions by layers for classical caching is given and then extended to caching with variable cache size. We invent two algorithms for restricted instances of general caching building on results around caching with variable cache size.
|
|
|
Extending Java Performance Monitoring Framework with Support for Windows Performance Counters
Dráb, Martin ; Bulej, Lubomír (advisor) ; Kruliš, Martin (referee)
Java Performance Measurement Framework (JPMF) is a library that allows to collect performance data from underlying operating system. The main goal of the framework is to provide a way of performance data measurement regardless of the application under test. This goal sets the framework apart from many ad-hoc performance measurement solutions targeted at specific applications or middleware platforms. Such solutions collect certain performance data at fixed points of the execution of the application under test. The main goal of this thesis is to implement a library that allows to collect performance statistics of various kinds on machines running Microsoft Windows operating system. The library should be integrated into the framework, which extends its portability.
|
|
|
Acceleration of Modern Web Applications
Čepl, Radek ; Mlích, Jozef (referee) ; Zemčík, Pavel (advisor)
The thesis deals with function and structure of web applications, describes the individual technologies used in these applications. It also explains how to create for the purpose of high efficiency and easy development. The main part presents technologies to speed up the applications, explain their settings and properties. Finally, the technologies are thoroughly tested, evaluated benefits of use and recommended the application for future development.
|
guest ::
