public
/
presentation-dateisysteme
6
0
Fork 0
Code Issues Pull Requests Releases Activity

Initial commit

This commit is contained in:
Peter Ludikovsky 2019-03-25 16:52:24 +01:00
commit 688552eb8e
Signed by: pludi
GPG Key ID: CFBA360E696EDC99
14 changed files with 1316 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
.gitignore vendored Normal file
View File

@ -0,0 +1,2 @@
.*swp
*.svg

3
.gitmodules vendored Normal file
View File

@ -0,0 +1,3 @@
[submodule "reveal.js"]
path = reveal.js
url = https://github.com/hakimel/reveal.js.git

428
LICENSE Normal file
View File

@ -0,0 +1,428 @@
Attribution-ShareAlike 4.0 International
=======================================================================
Creative Commons Corporation ("Creative Commons") is not a law firm and
does not provide legal services or legal advice. Distribution of
Creative Commons public licenses does not create a lawyer-client or
other relationship. Creative Commons makes its licenses and related
information available on an "as-is" basis. Creative Commons gives no
warranties regarding its licenses, any material licensed under their
terms and conditions, or any related information. Creative Commons
disclaims all liability for damages resulting from their use to the
fullest extent possible.
Using Creative Commons Public Licenses
Creative Commons public licenses provide a standard set of terms and
conditions that creators and other rights holders may use to share
original works of authorship and other material subject to copyright
and certain other rights specified in the public license below. The
following considerations are for informational purposes only, are not
exhaustive, and do not form part of our licenses.
Considerations for licensors: Our public licenses are
intended for use by those authorized to give the public
permission to use material in ways otherwise restricted by
copyright and certain other rights. Our licenses are
irrevocable. Licensors should read and understand the terms
and conditions of the license they choose before applying it.
Licensors should also secure all rights necessary before
applying our licenses so that the public can reuse the
material as expected. Licensors should clearly mark any
material not subject to the license. This includes other CC-
licensed material, or material used under an exception or
limitation to copyright. More considerations for licensors:
wiki.creativecommons.org/Considerations_for_licensors
Considerations for the public: By using one of our public
licenses, a licensor grants the public permission to use the
licensed material under specified terms and conditions. If
the licensor's permission is not necessary for any reason--for
example, because of any applicable exception or limitation to
copyright--then that use is not regulated by the license. Our
licenses grant only permissions under copyright and certain
other rights that a licensor has authority to grant. Use of
the licensed material may still be restricted for other
reasons, including because others have copyright or other
rights in the material. A licensor may make special requests,
such as asking that all changes be marked or described.
Although not required by our licenses, you are encouraged to
respect those requests where reasonable. More considerations
for the public:
wiki.creativecommons.org/Considerations_for_licensees
=======================================================================
Creative Commons Attribution-ShareAlike 4.0 International Public
License
By exercising the Licensed Rights (defined below), You accept and agree
to be bound by the terms and conditions of this Creative Commons
Attribution-ShareAlike 4.0 International Public License ("Public
License"). To the extent this Public License may be interpreted as a
contract, You are granted the Licensed Rights in consideration of Your
acceptance of these terms and conditions, and the Licensor grants You
such rights in consideration of benefits the Licensor receives from
making the Licensed Material available under these terms and
conditions.
Section 1 -- Definitions.
a. Adapted Material means material subject to Copyright and Similar
Rights that is derived from or based upon the Licensed Material
and in which the Licensed Material is translated, altered,
arranged, transformed, or otherwise modified in a manner requiring
permission under the Copyright and Similar Rights held by the
Licensor. For purposes of this Public License, where the Licensed
Material is a musical work, performance, or sound recording,
Adapted Material is always produced where the Licensed Material is
synched in timed relation with a moving image.
b. Adapter's License means the license You apply to Your Copyright
and Similar Rights in Your contributions to Adapted Material in
accordance with the terms and conditions of this Public License.
c. BY-SA Compatible License means a license listed at
creativecommons.org/compatiblelicenses, approved by Creative
Commons as essentially the equivalent of this Public License.
d. Copyright and Similar Rights means copyright and/or similar rights
closely related to copyright including, without limitation,
performance, broadcast, sound recording, and Sui Generis Database
Rights, without regard to how the rights are labeled or
categorized. For purposes of this Public License, the rights
specified in Section 2(b)(1)-(2) are not Copyright and Similar
Rights.
e. Effective Technological Measures means those measures that, in the
absence of proper authority, may not be circumvented under laws
fulfilling obligations under Article 11 of the WIPO Copyright
Treaty adopted on December 20, 1996, and/or similar international
agreements.
f. Exceptions and Limitations means fair use, fair dealing, and/or
any other exception or limitation to Copyright and Similar Rights
that applies to Your use of the Licensed Material.
g. License Elements means the license attributes listed in the name
of a Creative Commons Public License. The License Elements of this
Public License are Attribution and ShareAlike.
h. Licensed Material means the artistic or literary work, database,
or other material to which the Licensor applied this Public
License.
i. Licensed Rights means the rights granted to You subject to the
terms and conditions of this Public License, which are limited to
all Copyright and Similar Rights that apply to Your use of the
Licensed Material and that the Licensor has authority to license.
j. Licensor means the individual(s) or entity(ies) granting rights
under this Public License.
k. Share means to provide material to the public by any means or
process that requires permission under the Licensed Rights, such
as reproduction, public display, public performance, distribution,
dissemination, communication, or importation, and to make material
available to the public including in ways that members of the
public may access the material from a place and at a time
individually chosen by them.
l. Sui Generis Database Rights means rights other than copyright
resulting from Directive 96/9/EC of the European Parliament and of
the Council of 11 March 1996 on the legal protection of databases,
as amended and/or succeeded, as well as other essentially
equivalent rights anywhere in the world.
m. You means the individual or entity exercising the Licensed Rights
under this Public License. Your has a corresponding meaning.
Section 2 -- Scope.
a. License grant.
1. Subject to the terms and conditions of this Public License,
the Licensor hereby grants You a worldwide, royalty-free,
non-sublicensable, non-exclusive, irrevocable license to
exercise the Licensed Rights in the Licensed Material to:
a. reproduce and Share the Licensed Material, in whole or
in part; and
b. produce, reproduce, and Share Adapted Material.
2. Exceptions and Limitations. For the avoidance of doubt, where
Exceptions and Limitations apply to Your use, this Public
License does not apply, and You do not need to comply with
its terms and conditions.
3. Term. The term of this Public License is specified in Section
6(a).
4. Media and formats; technical modifications allowed. The
Licensor authorizes You to exercise the Licensed Rights in
all media and formats whether now known or hereafter created,
and to make technical modifications necessary to do so. The
Licensor waives and/or agrees not to assert any right or
authority to forbid You from making technical modifications
necessary to exercise the Licensed Rights, including
technical modifications necessary to circumvent Effective
Technological Measures. For purposes of this Public License,
simply making modifications authorized by this Section 2(a)
(4) never produces Adapted Material.
5. Downstream recipients.
a. Offer from the Licensor -- Licensed Material. Every
recipient of the Licensed Material automatically
receives an offer from the Licensor to exercise the
Licensed Rights under the terms and conditions of this
Public License.
b. Additional offer from the Licensor -- Adapted Material.
Every recipient of Adapted Material from You
automatically receives an offer from the Licensor to
exercise the Licensed Rights in the Adapted Material
under the conditions of the Adapter's License You apply.
c. No downstream restrictions. You may not offer or impose
any additional or different terms or conditions on, or
apply any Effective Technological Measures to, the
Licensed Material if doing so restricts exercise of the
Licensed Rights by any recipient of the Licensed
Material.
6. No endorsement. Nothing in this Public License constitutes or
may be construed as permission to assert or imply that You
are, or that Your use of the Licensed Material is, connected
with, or sponsored, endorsed, or granted official status by,
the Licensor or others designated to receive attribution as
provided in Section 3(a)(1)(A)(i).
b. Other rights.
1. Moral rights, such as the right of integrity, are not
licensed under this Public License, nor are publicity,
privacy, and/or other similar personality rights; however, to
the extent possible, the Licensor waives and/or agrees not to
assert any such rights held by the Licensor to the limited
extent necessary to allow You to exercise the Licensed
Rights, but not otherwise.
2. Patent and trademark rights are not licensed under this
Public License.
3. To the extent possible, the Licensor waives any right to
collect royalties from You for the exercise of the Licensed
Rights, whether directly or through a collecting society
under any voluntary or waivable statutory or compulsory
licensing scheme. In all other cases the Licensor expressly
reserves any right to collect such royalties.
Section 3 -- License Conditions.
Your exercise of the Licensed Rights is expressly made subject to the
following conditions.
a. Attribution.
1. If You Share the Licensed Material (including in modified
form), You must:
a. retain the following if it is supplied by the Licensor
with the Licensed Material:
i. identification of the creator(s) of the Licensed
Material and any others designated to receive
attribution, in any reasonable manner requested by
the Licensor (including by pseudonym if
designated);
ii. a copyright notice;
iii. a notice that refers to this Public License;
iv. a notice that refers to the disclaimer of
warranties;
v. a URI or hyperlink to the Licensed Material to the
extent reasonably practicable;
b. indicate if You modified the Licensed Material and
retain an indication of any previous modifications; and
c. indicate the Licensed Material is licensed under this
Public License, and include the text of, or the URI or
hyperlink to, this Public License.
2. You may satisfy the conditions in Section 3(a)(1) in any
reasonable manner based on the medium, means, and context in
which You Share the Licensed Material. For example, it may be
reasonable to satisfy the conditions by providing a URI or
hyperlink to a resource that includes the required
information.
3. If requested by the Licensor, You must remove any of the
information required by Section 3(a)(1)(A) to the extent
reasonably practicable.
b. ShareAlike.
In addition to the conditions in Section 3(a), if You Share
Adapted Material You produce, the following conditions also apply.
1. The Adapter's License You apply must be a Creative Commons
license with the same License Elements, this version or
later, or a BY-SA Compatible License.
2. You must include the text of, or the URI or hyperlink to, the
Adapter's License You apply. You may satisfy this condition
in any reasonable manner based on the medium, means, and
context in which You Share Adapted Material.
3. You may not offer or impose any additional or different terms
or conditions on, or apply any Effective Technological
Measures to, Adapted Material that restrict exercise of the
rights granted under the Adapter's License You apply.
Section 4 -- Sui Generis Database Rights.
Where the Licensed Rights include Sui Generis Database Rights that
apply to Your use of the Licensed Material:
a. for the avoidance of doubt, Section 2(a)(1) grants You the right
to extract, reuse, reproduce, and Share all or a substantial
portion of the contents of the database;
b. if You include all or a substantial portion of the database
contents in a database in which You have Sui Generis Database
Rights, then the database in which You have Sui Generis Database
Rights (but not its individual contents) is Adapted Material,
including for purposes of Section 3(b); and
c. You must comply with the conditions in Section 3(a) if You Share
all or a substantial portion of the contents of the database.
For the avoidance of doubt, this Section 4 supplements and does not
replace Your obligations under this Public License where the Licensed
Rights include other Copyright and Similar Rights.
Section 5 -- Disclaimer of Warranties and Limitation of Liability.
a. UNLESS OTHERWISE SEPARATELY UNDERTAKEN BY THE LICENSOR, TO THE
EXTENT POSSIBLE, THE LICENSOR OFFERS THE LICENSED MATERIAL AS-IS
AND AS-AVAILABLE, AND MAKES NO REPRESENTATIONS OR WARRANTIES OF
ANY KIND CONCERNING THE LICENSED MATERIAL, WHETHER EXPRESS,
IMPLIED, STATUTORY, OR OTHER. THIS INCLUDES, WITHOUT LIMITATION,
WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR
PURPOSE, NON-INFRINGEMENT, ABSENCE OF LATENT OR OTHER DEFECTS,
ACCURACY, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT
KNOWN OR DISCOVERABLE. WHERE DISCLAIMERS OF WARRANTIES ARE NOT
ALLOWED IN FULL OR IN PART, THIS DISCLAIMER MAY NOT APPLY TO YOU.
b. TO THE EXTENT POSSIBLE, IN NO EVENT WILL THE LICENSOR BE LIABLE
TO YOU ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION,
NEGLIGENCE) OR OTHERWISE FOR ANY DIRECT, SPECIAL, INDIRECT,
INCIDENTAL, CONSEQUENTIAL, PUNITIVE, EXEMPLARY, OR OTHER LOSSES,
COSTS, EXPENSES, OR DAMAGES ARISING OUT OF THIS PUBLIC LICENSE OR
USE OF THE LICENSED MATERIAL, EVEN IF THE LICENSOR HAS BEEN
ADVISED OF THE POSSIBILITY OF SUCH LOSSES, COSTS, EXPENSES, OR
DAMAGES. WHERE A LIMITATION OF LIABILITY IS NOT ALLOWED IN FULL OR
IN PART, THIS LIMITATION MAY NOT APPLY TO YOU.
c. The disclaimer of warranties and limitation of liability provided
above shall be interpreted in a manner that, to the extent
possible, most closely approximates an absolute disclaimer and
waiver of all liability.
Section 6 -- Term and Termination.
a. This Public License applies for the term of the Copyright and
Similar Rights licensed here. However, if You fail to comply with
this Public License, then Your rights under this Public License
terminate automatically.
b. Where Your right to use the Licensed Material has terminated under
Section 6(a), it reinstates:
1. automatically as of the date the violation is cured, provided
it is cured within 30 days of Your discovery of the
violation; or
2. upon express reinstatement by the Licensor.
For the avoidance of doubt, this Section 6(b) does not affect any
right the Licensor may have to seek remedies for Your violations
of this Public License.
c. For the avoidance of doubt, the Licensor may also offer the
Licensed Material under separate terms or conditions or stop
distributing the Licensed Material at any time; however, doing so
will not terminate this Public License.
d. Sections 1, 5, 6, 7, and 8 survive termination of this Public
License.
Section 7 -- Other Terms and Conditions.
a. The Licensor shall not be bound by any additional or different
terms or conditions communicated by You unless expressly agreed.
b. Any arrangements, understandings, or agreements regarding the
Licensed Material not stated herein are separate from and
independent of the terms and conditions of this Public License.
Section 8 -- Interpretation.
a. For the avoidance of doubt, this Public License does not, and
shall not be interpreted to, reduce, limit, restrict, or impose
conditions on any use of the Licensed Material that could lawfully
be made without permission under this Public License.
b. To the extent possible, if any provision of this Public License is
deemed unenforceable, it shall be automatically reformed to the
minimum extent necessary to make it enforceable. If the provision
cannot be reformed, it shall be severed from this Public License
without affecting the enforceability of the remaining terms and
conditions.
c. No term or condition of this Public License will be waived and no
failure to comply consented to unless expressly agreed to by the
Licensor.
d. Nothing in this Public License constitutes or may be interpreted
as a limitation upon, or waiver of, any privileges and immunities
that apply to the Licensor or You, including from the legal
processes of any jurisdiction or authority.
=======================================================================
Creative Commons is not a party to its public
licenses. Notwithstanding, Creative Commons may elect to apply one of
its public licenses to material it publishes and in those instances
will be considered the “Licensor.” The text of the Creative Commons
public licenses is dedicated to the public domain under the CC0 Public
Domain Dedication. Except for the limited purpose of indicating that
material is shared under a Creative Commons public license or as
otherwise permitted by the Creative Commons policies published at
creativecommons.org/policies, Creative Commons does not authorize the
use of the trademark "Creative Commons" or any other trademark or logo
of Creative Commons without its prior written consent including,
without limitation, in connection with any unauthorized modifications
to any of its public licenses or any other arrangements,
understandings, or agreements concerning use of licensed material. For
the avoidance of doubt, this paragraph does not form part of the
public licenses.
Creative Commons may be contacted at creativecommons.org.

30
Makefile Normal file
View File

@ -0,0 +1,30 @@
all: html dateisysteme.pdf dateisysteme-notes.pdf
html: dateisysteme.html linked-list-fs.svg indexed-fs.svg b-tree-fs.svg
linked-list-fs.svg: linked-list-fs.dot
dot -Tsvg -o linked-list-fs.svg linked-list-fs.dot
indexed-fs.svg: indexed-fs.dot
dot -Tsvg -o indexed-fs.svg indexed-fs.dot
b-tree-fs.svg: b-tree-fs.dot
dot -Tsvg -o b-tree-fs.svg b-tree-fs.dot
dateisysteme.html: dateisysteme.md
pandoc -f markdown+inline_notes \
-t revealjs --standalone --smart --slide-level=2 \
--css=usrspace.css \
-V 'revealjs-url:reveal.js/' \
-o dateisysteme.html dateisysteme.md
dateisysteme.pdf: dateisysteme.html
@echo "Bitte das HTML mit dem Paramenter ?print-pdf öffnen, und mit einem"
@echo "PDF-Drucker speichern"
dateisysteme-notes.pdf: dateisysteme.html
@echo "Bitte das HTML mit dem Paramenter ?print-pdf&showNotes=true öffnen,"
@echo "und mit einem PDF-Drucker speichern"
clean:
rm -rf dateisysteme.html dateisysteme.pdf dateisysteme-notes.pdf *.svg

13
README.md Normal file
View File

@ -0,0 +1,13 @@
Dateisystem - Warum, wozu, welche?
==================================
Dieser Vortrag wurde erstellt von Peter Ludikovsky, und soll zeigen das
Dateisysteme sind, wie sie funktionieren, und die Vor- und Nachteile
einiger Beispiele zeigen.
Lizenz
------
Dieser Vortrag wurde unter als [CC-BY-SA
4.0](https://creativecommons.org/licenses/by-sa/4.0/legalcode.de)
veröffentlicht.

28
b-tree-fs.dot Normal file
View File

@ -0,0 +1,28 @@
digraph "b-tree" {
node [shape=record]
subgraph cluster_file1 {
graph [label="file1.txt", fontname="monospace"]
f1b1 [label="<f1b1l> nil | Block 1 | <f1b1r> nil"]
f1b2 [label="<f1b2l> • | Block 2 | <f1b2r> •"]
f1b3 [label="<f1b3l> nil | Block 3 | <f1b3r> nil"]
f1b2:f1b2l:c -> f1b1:n
f1b2:f1b2r:c -> f1b3:n
}
subgraph cluster_file2 {
graph [label="file2.exe", fontname="monospace"]
f2b1 [label="<f2b1l> nil | Block 1 | <f2b1r> nil"]
f2b2 [label="<f2b2l> • | Block 2 | <f2b2r> •"]
f2b3 [label="<f2b3l> nil | Block 3 | <f2b3r> nil"]
f2b4 [label="<f2b4l> • | Block 4 | <f2b4r> •"]
f2b5 [label="<f2b5l> nil | Block 5 | <f2b5r> nil"]
f2b6 [label="<f2b6l> • | Block 6 | <f2b6r> •"]
f2b7 [label="<f2b7l> nil | Block 7 | <f2b7r> nil"]
f2b4:f2b4l:c -> f2b2:n
f2b4:f2b4r:c -> f2b6:n
f2b2:f2b2l:c -> f2b1:n
f2b2:f2b2r:c -> f2b3:n
f2b6:f2b6l:c -> f2b5:n
f2b6:f2b6r:c -> f2b7:n
}
}

BIN
dateisysteme-notes.pdf Normal file
View File

Binary file not shown.

367
dateisysteme.html Normal file
View File

@ -0,0 +1,367 @@
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<meta name="generator" content="pandoc">
<title></title>
<meta name="apple-mobile-web-app-capable" content="yes">
<meta name="apple-mobile-web-app-status-bar-style" content="black-translucent">
<meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no, minimal-ui">
<link rel="stylesheet" href="reveal.js//css/reveal.css">
<style type="text/css">code{white-space: pre;}</style>
<link rel="stylesheet" href="reveal.js//css/theme/black.css" id="theme">
<link rel="stylesheet" href="usrspace.css"/>
<!-- Printing and PDF exports -->
<script>
var link = document.createElement( 'link' );
link.rel = 'stylesheet';
link.type = 'text/css';
link.href = window.location.search.match( /print-pdf/gi ) ? 'reveal.js//css/print/pdf.css' : 'reveal.js//css/print/paper.css';
document.getElementsByTagName( 'head' )[0].appendChild( link );
</script>
<!--[if lt IE 9]>
<script src="reveal.js//lib/js/html5shiv.js"></script>
<![endif]-->
</head>
<body>
<div class="reveal">
<div class="slides">
<section><section id="dateisysteme" class="titleslide slide level1"><h1>Dateisysteme</h1></section><section id="inhalt" class="slide level2">
<h2>Inhalt</h2>
<ul>
<li>Was sind Dateisysteme</li>
<li>Grundbegriffe</li>
<li>Arten von Dateisystemen</li>
<li>Beispiele</li>
<li>Fragen?</li>
</ul>
</section></section>
<section><section id="was-sind-dateisysteme" class="titleslide slide level1"><h1>Was sind Dateisysteme</h1></section><section id="was-sind-dateisysteme-1" class="slide level2">
<h2>Was sind Dateisysteme</h2>
<ul>
<li>Abstraktionsebene zwischen unstrukturiertem Speicher und Anwender / Applikation</li>
<li>angereichert um Verwaltungsdaten
<ul>
<li>Dateiname</li>
<li>Zugriffsrechte</li>
<li>Interaktions-Zeiten</li>
</ul></li>
<li>Index der belegten / freien Speicherbereiche</li>
</ul>
</section></section>
<section><section id="grundbegriffe" class="titleslide slide level1"><h1>Grundbegriffe</h1></section><section id="grundbegriffe-1" class="slide level2">
<h2>Grundbegriffe</h2>
<dl>
<dt>
Blöcke
</dt>
<dd>
Zusammenfassung von Bytes im Speicher, die zusammen gelesen/geschrieben werden
</dd>
<dt>
Speicher
</dt>
<dd>
Addressierbare Ablage für Daten
</dd>
<dt>
IOPS
</dt>
<dd>
I/O Operations Per Second, also Lese-/Schreiboperationen Pro Sekunde
</dd>
</dl>
<aside class="notes">
<ul>
<li>Blöcke: Typischerweise 512 oder 4096 Bytes</li>
<li>IOPS: Gezählt wird üblicherweise die Anzahl der Anweisungen an den Controller, einen bestimmten Datenbereich zu schreiben.</li>
</ul>
</aside>
</section><section id="grundbegriffe-2" class="slide level2">
<h2>Grundbegriffe</h2>
<dl>
<dt>
Datei
</dt>
<dd>
Logische Gruppe von zusammengehörigen Daten
</dd>
<dt>
Verzeichnis
</dt>
<dd>
Logische Gruppe von Dateien
</dd>
</dl>
</section></section>
<section><section id="arten-von-dateisystemen" class="titleslide slide level1"><h1>Arten von Dateisystemen</h1></section><section id="lineare-dateisysteme" class="slide level2">
<h2>Lineare Dateisysteme</h2>
<ul>
<li>Älteste Form</li>
<li>Typischer Einsatz: Lochkarten und Bandspeicher</li>
<li>Kein zentraler Index der freien Blöcke, sondern verteilt</li>
</ul>
</section><section id="flache-dateisystem" class="slide level2">
<h2>Flache Dateisystem</h2>
<ul>
<li>Die frühesten Platten-Dateisysteme</li>
<li>Keine Verzeichnisse</li>
<li>Frei/Belegt-Index eine einfache Bitmap</li>
<li>Alle Dateinamen + Metainformationen in der Master File Table</li>
</ul>
</section><section id="hierarchische-dateisysteme" class="slide level2">
<h2>Hierarchische Dateisysteme</h2>
<ul>
<li>Erweiterung der flachen Dateisysteme</li>
<li>Bereits relativ früh</li>
<li>Verezichnisse zur logischen Strukturierung
<ul>
<li>Unter *NIX oft nur eine spezielle Art Datei</li>
</ul></li>
</ul>
</section><section id="netzwerk-dateisysteme" class="slide level2">
<h2>Netzwerk Dateisysteme</h2>
<ul>
<li>„Speicher“ muss nicht lokal sein</li>
<li>Zusätzliche Abstraktion von Netzwerk-Zugriffen</li>
<li>Bekannteste Vertreter: NFS und CIFS („Windows Dateifreigabe“)</li>
</ul>
</section><section id="verteile-dateisysteme" class="slide level2">
<h2>Verteile Dateisysteme</h2>
<ul>
<li>Speicher muss nicht lokal und nicht auf nur einem Host sein</li>
<li>Verteilung meist Redundant und für den Client unsichtbar</li>
<li>Beispiele: CephFS oder GlusterFS</li>
<li>Vorteil oft erhebliches Durchsatzplus bei Leseoperationen</li>
<li>Skalierung in die Breite leicht</li>
</ul>
</section></section>
<section><section id="begriffe-teil-2" class="titleslide slide level1"><h1>Begriffe Teil 2</h1></section><section id="begriffe-teil-2-1" class="slide level2">
<h2>Begriffe Teil 2</h2>
<dl>
<dt>
Cluster / Inode / Record
</dt>
<dd>
Zusammenfassung von Blöcken unabhängig von der Hardware
</dd>
<dt>
Bitmap
</dt>
<dd>
Teil innerhalb des Superblocks in dem über einzelne Bits markiert wird welche Inodes frei/belegt sind
</dd>
<dt>
Master File Table / Superblock
</dt>
<dd>
Informationen zum Dateisystem: Größe, Größe der Inodes, Ort der Backup-Superblöcke, …
</dd>
</dl>
</section><section id="begriffe-teil-2-2" class="slide level2">
<h2>Begriffe Teil 2</h2>
<figure>
<img src="linked-list-fs.svg">
<figcaption>
Beispiel des Aufbaus eines Linked List FS
</figcaption>
</figure>
</section><section id="begriffe-teil-2-3" class="slide level2">
<h2>Begriffe Teil 2</h2>
<figure>
<img src="indexed-fs.svg">
<figcaption>
Beispiel des Aufbaus eines Indexed FS
</figcaption>
</figure>
</section><section id="begriffe-teil-2-4" class="slide level2">
<h2>Begriffe Teil 2</h2>
<figure>
<img src="b-tree-fs.svg">
<figcaption>
Beispiel des Aufbaus eines B-Tree FS
</figcaption>
</figure>
</section></section>
<section><section id="beispiele" class="titleslide slide level1"><h1>Beispiele</h1></section><section id="alt-fat12" class="slide level2">
<h2>Alt: FAT12</h2>
<ul>
<li>Das erste Dateisystem von MS-DOS</li>
<li>8.3 Dateinamen</li>
<li>2 MFTs mit Bitmaps</li>
<li>Linked List System, jeder Datenblock verweist auf den nächsten</li>
<li>Maximale Volume-Größe: 32 MiB</li>
</ul>
</section><section id="neuer-ntfs" class="slide level2">
<h2>Neuer: NTFS</h2>
<ul>
<li>„New Technology File System“, Standard der NT-Familie seit Windows NT 3.1</li>
<li>255 Zeichen Dateinamen</li>
<li>Bitmap</li>
<li>B-Tree</li>
</ul>
</section><section id="linux-ext4" class="slide level2">
<h2>Linux: ext4</h2>
<ul>
<li>Quasi-Nachfolger von ext2 und ext3</li>
<li>Journalling</li>
<li>B-Tree statt Indexed wie die Vorgänger</li>
<li>Quasi-Default auf Linux</li>
</ul>
</section><section id="ohne-inodes-reiserfs" class="slide level2">
<h2>Ohne Inodes: ReiserFS</h2>
<ul>
<li>Ganzes FS großer B+-Tree</li>
<li>Hohe Geschwindigkeit bei zufälligen Zugriffen</li>
<li>Sehr schnell bei Verzeichnissen mit vielen Dateien</li>
<li>Reiser3 leider veraltet, Reiser4 nicht fertig</li>
</ul>
</section><section id="integrierter-volume-manager-zfs" class="slide level2">
<h2>Integrierter Volume Manager: ZFS</h2>
<ul>
<li>Ursprünglich auf Solaris, inzwischen auf fast jedem unixoiden OS</li>
<li>Maximale Größe
<ul>
<li>Volume: 2<sup>128</sup> Bytes</li>
<li>Datei: 2<sup>64</sup> Bytes</li>
</ul></li>
<li>Eingebaut: Kompression, Deduplikation, RAID, Snapshots, …</li>
<li>CDDL nicht mit GPLv3 kompatibel, darf deshalb nicht als Binary und/oder teil des Linux-Kernels ausgeliefert werden</li>
</ul>
<aside class="notes">
ZFS komplett wäre noch mal eigener Vortrag
</aside>
</section><section id="verteilter-speicher-cephfs" class="slide level2">
<h2>Verteilter Speicher: CephFS</h2>
<ul>
<li>CERN mit CephFS: 65 PB, 10.800 Disken</li>
<li>Daten u.a. aus den LHC Experimenten</li>
<li>~ 300Gbps Schreibgeschwindigkeit</li>
<li>Nutzt Ceph im Hintergrund
<ul>
<li>Ceph: objekt-basierter, verteilter, redundanter Netzwerkspeicher</li>
</ul></li>
</ul>
<aside class="notes">
Ceph: wäre noch mal eigener Vortrag
</aside>
</section><section id="pseudo-procfs" class="slide level2">
<h2>Pseudo: procfs</h2>
<ul>
<li>Dateispeicher dahinter ist der (Linux-)Kernel</li>
<li>Interface zu <code>Proc</code>ess Informationen</li>
<li>Jeder Prozess in der Form <code>/proc/&lt;pid&gt;</code> abgebildet, inkl. offene Dateien, Kommandozeile, Umgebung, …</li>
<li>Begrenzt können auch System-Settings bearbeitet werden</li>
<li>Treiber-Zugriff inzwischen nach <code>/sys</code> per <code>sysfs</code> ausgelagert</li>
</ul>
<aside class="notes">
<ul>
<li>Auch für FreeBSD verfügbar</li>
</ul>
</aside>
</section></section>
<section><section id="links" class="titleslide slide level1"><h1>Links</h1></section><section id="links-1" class="slide level2">
<h2>Links</h2>
<dl>
<dt>
NTFS
</dt>
<dd>
https://de.wikipedia.org/wiki/NTFS
</dd>
<dt>
ext4
</dt>
<dd>
https://de.wikipedia.org/wiki/Ext4
</dd>
<dt>
Ceph
</dt>
<dd>
https://de.wikipedia.org/wiki/Ceph
</dd>
<dt>
Präsentation “Storage at CERN”
</dt>
<dd>
https://indico.cern.ch/event/649159/contributions/2761965/attachments/1544385/2423339/hroussea-storage-at-CERN.pdf
</dd>
</dl>
</section><section id="links-2" class="slide level2">
<h2>Links</h2>
<dl>
<dt>
ZFS on Linux
</dt>
<dd>
https://zfsonlinux.org/
</dd>
<dt>
CDDL and GPL
</dt>
<dd>
https://en.wikipedia.org/wiki/License_compatibility#CDDL_and_GPL
</dd>
<dt>
Synthetic file system
</dt>
<dd>
https://en.wikipedia.org/wiki/Synthetic_file_system
</dd>
<dt>
exFAT
</dt>
<dd>
https://de.wikipedia.org/wiki/exFAT
</dd>
<dt>
Apple File System
</dt>
<dd>
https://de.wikipedia.org/wiki/Apple_File_System
</dd>
</dl>
</section><section id="links-3" class="slide level2">
<h2>Links</h2>
<dl>
<dt>
Präsentation
</dt>
<dd>
https://gitlab.usrspace.at/everyone/presentation-dateisysteme
</dd>
<dt>
Verein <code>/usr/space</code>
</dt>
<dd>
https://usrspace.at
</dd>
</dl>
<p>Präsentation ist <a href="https://creativecommons.org/licenses/by-sa/4.0/legalcode.de">CC-BY-SA 4.0</a></p>
</section></section>
<section><section id="fragen" class="titleslide slide level1"><h1>Fragen?</h1></section></section>
</div>
</div>
<script src="reveal.js//lib/js/head.min.js"></script>
<script src="reveal.js//js/reveal.js"></script>
<script>
// Full list of configuration options available at:
// https://github.com/hakimel/reveal.js#configuration
Reveal.initialize({
// Optional reveal.js plugins
dependencies: [
{ src: 'reveal.js//lib/js/classList.js', condition: function() { return !document.body.classList; } },
{ src: 'reveal.js//plugin/zoom-js/zoom.js', async: true },
{ src: 'reveal.js//plugin/notes/notes.js', async: true }
]
});
</script>
</body>
</html>

341
dateisysteme.md Normal file
View File

@ -0,0 +1,341 @@
Dateisysteme
============
Inhalt
------
- Was sind Dateisysteme
- Grundbegriffe
- Arten von Dateisystemen
- Beispiele
- Fragen?
Was sind Dateisysteme
=====================
Was sind Dateisysteme
---------------------
- Abstraktionsebene zwischen unstrukturiertem Speicher und Anwender /
Applikation
- angereichert um Verwaltungsdaten
- Dateiname
- Zugriffsrechte
- Interaktions-Zeiten
- Index der belegten / freien Speicherbereiche
Grundbegriffe
=============
Grundbegriffe
-------------
<dl>
<dt>
Blöcke
</dt>
<dd>
Zusammenfassung von Bytes im Speicher, die zusammen gelesen/geschrieben
werden
</dd>
<dt>
Speicher
</dt>
<dd>
Addressierbare Ablage für Daten
</dd>
<dt>
IOPS
</dt>
<dd>
I/O Operations Per Second, also Lese-/Schreiboperationen Pro Sekunde
</dd>
</dl>
<aside class="notes">
- Blöcke: Typischerweise 512 oder 4096 Bytes
- IOPS: Gezählt wird üblicherweise die Anzahl der Anweisungen an den
Controller, einen bestimmten Datenbereich zu schreiben.
</aside>
Grundbegriffe
-------------
<dl>
<dt>
Datei
</dt>
<dd>
Logische Gruppe von zusammengehörigen Daten
</dd>
<dt>
Verzeichnis
</dt>
<dd>
Logische Gruppe von Dateien
</dd>
</dl>
Arten von Dateisystemen
=======================
Lineare Dateisysteme
--------------------
- Älteste Form
- Typischer Einsatz: Lochkarten und Bandspeicher
- Kein zentraler Index der freien Blöcke, sondern verteilt
Flache Dateisystem
------------------
- Die frühesten Platten-Dateisysteme
- Keine Verzeichnisse
- Frei/Belegt-Index eine einfache Bitmap
- Alle Dateinamen + Metainformationen in der Master File Table
Hierarchische Dateisysteme
--------------------------
- Erweiterung der flachen Dateisysteme
- Bereits relativ früh
- Verezichnisse zur logischen Strukturierung
- Unter \*NIX oft nur eine spezielle Art Datei
Netzwerk Dateisysteme
---------------------
- „Speicher“ muss nicht lokal sein
- Zusätzliche Abstraktion von Netzwerk-Zugriffen
- Bekannteste Vertreter: NFS und CIFS („Windows Dateifreigabe“)
Verteile Dateisysteme
---------------------
- Speicher muss nicht lokal und nicht auf nur einem Host sein
- Verteilung meist Redundant und für den Client unsichtbar
- Beispiele: CephFS oder GlusterFS
- Vorteil oft erhebliches Durchsatzplus bei Leseoperationen
- Skalierung in die Breite leicht
Begriffe Teil 2
===============
Begriffe Teil 2
---------------
<dl>
<dt>
Cluster / Inode / Record
</dt>
<dd>
Zusammenfassung von Blöcken unabhängig von der Hardware
</dd>
<dt>
Bitmap
</dt>
<dd>
Teil innerhalb des Superblocks in dem über einzelne Bits markiert wird
welche Inodes frei/belegt sind
</dd>
<dt>
Master File Table / Superblock
</dt>
<dd>
Informationen zum Dateisystem: Größe, Größe der Inodes, Ort der
Backup-Superblöcke, …
</dd>
</dl>
Begriffe Teil 2
---------------
<figure>
<img src="linked-list-fs.svg">
<figcaption>
Beispiel des Aufbaus eines Linked List FS
</figcaption>
</figure>
Begriffe Teil 2
---------------
<figure>
<img src="indexed-fs.svg">
<figcaption>
Beispiel des Aufbaus eines Indexed FS
</figcaption>
</figure>
Begriffe Teil 2
---------------
<figure>
<img src="b-tree-fs.svg">
<figcaption>
Beispiel des Aufbaus eines B-Tree FS
</figcaption>
</figure>
Beispiele
=========
Alt: FAT12
----------
- Das erste Dateisystem von MS-DOS
- 8.3 Dateinamen
- 2 MFTs mit Bitmaps
- Linked List System, jeder Datenblock verweist auf den nächsten
- Maximale Volume-Größe: 32 MiB
Neuer: NTFS
-----------
- „New Technology File System“, Standard der NT-Familie seit Windows
NT 3.1
- 255 Zeichen Dateinamen
- Bitmap
- B-Tree
Linux: ext4
-----------
- Quasi-Nachfolger von ext2 und ext3
- Journalling
- B-Tree statt Indexed wie die Vorgänger
- Quasi-Default auf Linux
Ohne Inodes: ReiserFS
---------------------
- Ganzes FS großer B+-Tree
- Hohe Geschwindigkeit bei zufälligen Zugriffen
- Sehr schnell bei Verzeichnissen mit vielen Dateien
- Reiser3 leider veraltet, Reiser4 nicht fertig
Integrierter Volume Manager: ZFS
--------------------------------
- Ursprünglich auf Solaris, inzwischen auf fast jedem unixoiden OS
- Maximale Größe
- Volume: 2<sup>128</sup> Bytes
- Datei: 2<sup>64</sup> Bytes
- Eingebaut: Kompression, Deduplikation, RAID, Snapshots, …
- CDDL nicht mit GPLv3 kompatibel, darf deshalb nicht als Binary
und/oder teil des Linux-Kernels ausgeliefert werden
<aside class="notes">
ZFS komplett wäre noch mal eigener Vortrag
</aside>
Verteilter Speicher: CephFS
---------------------------
- CERN mit CephFS: 65 PB, 10.800 Disken
- Daten u.a. aus den LHC Experimenten
- ~ 300Gbps Schreibgeschwindigkeit
- Nutzt Ceph im Hintergrund
- Ceph: objekt-basierter, verteilter, redundanter Netzwerkspeicher
<aside class="notes">
Ceph: wäre noch mal eigener Vortrag
</aside>
Pseudo: procfs
--------------
- Dateispeicher dahinter ist der (Linux-)Kernel
- Interface zu `Proc`ess Informationen
- Jeder Prozess in der Form `/proc/<pid>` abgebildet, inkl. offene
Dateien, Kommandozeile, Umgebung, …
- Begrenzt können auch System-Settings bearbeitet werden
- Treiber-Zugriff inzwischen nach `/sys` per `sysfs` ausgelagert
<aside class="notes">
- Auch für FreeBSD verfügbar
</aside>
Links
=====
Links
-----
<dl>
<dt>
NTFS
</dt>
<dd>
https://de.wikipedia.org/wiki/NTFS
</dd>
<dt>
ext4
</dt>
<dd>
https://de.wikipedia.org/wiki/Ext4
</dd>
<dt>
Ceph
</dt>
<dd>
https://de.wikipedia.org/wiki/Ceph
</dd>
<dt>
Präsentation "Storage at CERN"
</dt>
<dd>
https://indico.cern.ch/event/649159/contributions/2761965/attachments/1544385/2423339/hroussea-storage-at-CERN.pdf
</dd>
</dl>
Links
-----
<dl>
<dt>
ZFS on Linux
</dt>
<dd>
https://zfsonlinux.org/
</dd>
<dt>
CDDL and GPL
</dt>
<dd>
https://en.wikipedia.org/wiki/License\_compatibility\#CDDL\_and\_GPL
</dd>
<dt>
Synthetic file system
</dt>
<dd>
https://en.wikipedia.org/wiki/Synthetic\_file\_system
</dd>
<dt>
exFAT
</dt>
<dd>
https://de.wikipedia.org/wiki/exFAT
</dd>
<dt>
Apple File System
</dt>
<dd>
https://de.wikipedia.org/wiki/Apple\_File\_System
</dd>
</dl>
Links
-----
<dl>
<dt>
Präsentation
</dt>
<dd>
https://gitlab.usrspace.at/everyone/presentation-dateisysteme
</dd>
<dt>
Verein `/usr/space`
</dt>
<dd>
https://usrspace.at
</dd>
</dl>
Präsentation ist [CC-BY-SA
4.0](https://creativecommons.org/licenses/by-sa/4.0/legalcode.de)
Fragen?
=======

BIN
dateisysteme.pdf Normal file
View File

Binary file not shown.

56
indexed-fs.dot Normal file
View File

@ -0,0 +1,56 @@
digraph "indexed-fs" {
node [shape=record];
subgraph cluster_file1 {
graph [label="file1.txt", fontname="monospace"]
file1 [label="<ind1> Index | { <f1i1> Block 1 | <f1i2> Block 2 | <f1i3> Block 3 }"];
f1block3 [label="data"];
f1block2 [label="data"];
f1block1 [label="data"];
file1:f1i3 -> f1block3
file1:f1i2 -> f1block2
file1:f1i1 -> f1block1
}
subgraph cluster_file2 {
graph [label="file2.exe", fontname="monospace", rankdir=LR]
file2 [label="<ind1> Index | {<f2i1> Indirect 1 | <f2i2> Indirect 2 | <f2i3> Indirect 3}"];
file2:f2i3:e -> ind3:f2i3:n
file2:f2i2:e -> ind2:f2i2:n
file2:f2i1:e -> ind1:f2i1:n
subgraph indirect3 {
ind3 [label="<f2i3> Indirect 3 | {<f2i3b1> Block 1 }"];
f2block7 [label="data"];
ind3:f2i3b1:e -> f2block7:n;
}
subgraph indirect2 {
ind2 [label="<f2i2> Indirect 2 | {<f2i2b1> Block 1 | <f2i2b2> Block 2 | <f2i2b3> Block 3}"];
f2block6 [label="data"];
f2block5 [label="data"];
f2block4 [label="data"];
ind2:f2i2b1:e -> f2block4:n;
ind2:f2i2b2:e -> f2block5:n;
ind2:f2i2b3:e -> f2block6:n;
}
subgraph indirect1 {
ind1 [label="<f2i1> Indirect 1 | {<f2i1b1> Block 1 | <f2i1b2> Block 2 | <f2i1b3> Block 3}"];
f2block3 [label="data"];
f2block2 [label="data"];
f2block1 [label="data"];
ind1:f2i1b1:e -> f2block1:n;
ind1:f2i1b2:e -> f2block2:n;
ind1:f2i1b3:e -> f2block3:n;
}
}
subgraph cluster_dir {
label="directory"
dfile1:ind:c -> file1:ind1
dfile2:ind:c -> file2:ind1
dfile1 [label="file1.txt | <ind> •", fontname="monospace"]
dfile2 [label="file2.exe | <ind> •", fontname="monospace"]
}
}

36
linked-list-fs.dot Normal file
View File

@ -0,0 +1,36 @@
digraph "linked-list-fs" {
node [shape=record];
rankdir=LR
subgraph file1 {
file1 [label="file1.txt | <f1start> Start | <f1end> End"];
block799 [label="<blst799> Block 799 | <blne799> • | data"];
block30990 [label="<blst30990> Block 30990 | <blne30990> • | data"];
block5110 [label="<blst5110> Block 5110 | <blne5110> nil | data"];
file1:f1start -> block799:blst799:w;
block799:blne799:c -> block30990:blst30990:w [tailclip=false];
block30990:blne30990:c -> block5110:blst5110:w [tailclip=false];
file1:f1end -> block5110:blst5110:w;
}
subgraph file2 {
file2 [label="file2.exe | <f2start> Start | <f2end> End"];
block13177 [label="<blst13177> Block 13177 | <blne13177> • | data"]
block20961 [label="<blst20961> Block 20961 | <blne20961> • | data"]
block19367 [label="<blst19367> Block 19367 | <blne19367> • | data"]
block27857 [label="<blst27857> Block 27857 | <blne27857> • | data"]
block4892 [label="<blst4892> Block 4892 | <blne4892> • | data"]
block11583 [label="<blst11583> Block 11583 | <blne11583> • | data"]
block8211 [label="<blst8211> Block 8211 | <blne8211> nil | data"]
file2:f2start -> block13177:blst13177:w;
block13177:blne13177:c -> block20961:blst20961:w [tailclip=false];
block20961:blne20961:c -> block19367:blst19367:w [tailclip=false];
block19367:blne19367:c -> block27857:blst27857:w [tailclip=false];
block27857:blne27857:c -> block4892:blst4892:w [tailclip=false];
block4892:blne4892:c -> block11583:blst11583:w [tailclip=false];
block11583:blne11583:c -> block8211:blst8211:w [tailclip=false];
file2:f2end -> block8211:blst8211:w;
}
}

1
reveal.js Submodule

@ -0,0 +1 @@
Subproject commit 2c5396b7d347f8ee1344016f15b93d4f78401569

11
usrspace.css Normal file
View File

@ -0,0 +1,11 @@
@import url('https://cdn.jsdelivr.net/npm/hack-font@3.3.0/build/web/hack.min.css');
html {
font-family: Helvetica, Arial, sans-serif;
}
.reveal code, .reveal pre {
font-family: Hack
}
.reveal section img {
background:none; border:none; box-shadow:none;
}