Skip site navigation (1)Skip section navigation (2)
Date:      Mon, 5 Nov 2007 22:58:09 GMT
From:      Gabor Pali <pgj@FreeBSD.org>
To:        Perforce Change Reviews <perforce@FreeBSD.org>
Subject:   PERFORCE change 128708 for review
Message-ID:  <200711052258.lA5Mw9Rx037433@repoman.freebsd.org>

next in thread | raw e-mail | index | archive | help
http://perforce.freebsd.org/chv.cgi?CH=128708

Change 128708 by pgj@disznohal on 2007/11/05 22:57:57

	Add initial Hungarian translation of Chapter 20: The Vinum Volume
	Manager.

Affected files ...

.. //depot/projects/docproj_hu/books/handbook/vinum/chapter.sgml#2 edit

Differences ...

==== //depot/projects/docproj_hu/books/handbook/vinum/chapter.sgml#2 (text+ko) ====

@@ -1,488 +1,664 @@
 <!--
-	The Vinum Volume Manager
-	By Greg Lehey (grog at lemis dot com)
+     The Vinum Volume Manager
+     By Greg Lehey (grog at lemis dot com)
 
-	Added to the Handbook by Hiten Pandya <hmp@FreeBSD.org>
-	and Tom Rhodes <trhodes@FreeBSD.org>
+     Added to the Handbook by Hiten Pandya <hmp@FreeBSD.org>
+     and Tom Rhodes <trhodes@FreeBSD.org>
 
-	For the FreeBSD Documentation Project
-	$FreeBSD: doc/en_US.ISO8859-1/books/handbook/vinum/chapter.sgml,v 1.44 2007/03/06 22:47:35 keramida Exp $
+     For the FreeBSD Documentation Project
+     $FreeBSD: doc/en_US.ISO8859-1/books/handbook/vinum/chapter.sgml,v 1.44 2007/03/06 22:47:35 keramida Exp $
 -->
+<!-- The FreeBSD Hungarian Documentation Project
+     Translated by: PALI, Gabor <pgj@FreeBSD.org>
+     Original Revision: 1.44                      -->
 
-<chapter id="vinum-vinum">
+<chapter id="vinum-vinum" lang="hu">
   <chapterinfo>
     <authorgroup>
       <author>
 	<firstname>Greg</firstname>
 	<surname>Lehey</surname>
-	<contrib>Originally written by </contrib>
+	<contrib>Eredetileg &iacute;rta:</contrib>
       </author>
     </authorgroup>
   </chapterinfo>
 
-  <title>The Vinum Volume Manager</title>
+  <title>A Vinum k&ouml;tetkezel&#245;</title>
 
   <sect1 id="vinum-synopsis">
-    <title>Synopsis</title>
+    <title>&Aacute;ttekint&eacute;s</title>
 
-    <para>No matter what disks you have, there are always potential
-      problems:</para>
+    <para>Nem sz&aacute;m&iacute;t, milyen lemezeink is vannak, ugyanis
+      mindig ad&oacute;dnak vel&uuml;k kapcsolatban gondjaink:</para>
 
     <itemizedlist>
       <listitem>
-        <para>They can be too small.</para>
+	<para>Kicsik.</para>
       </listitem>
 
       <listitem>
-        <para>They can be too slow.</para>
+	<para>Lass&uacute;k.</para>
       </listitem>
 
       <listitem>
-        <para>They can be too unreliable.</para>
+	<para>Nem el&eacute;g megb&iacute;zhat&oacute;ak.</para>
       </listitem>
     </itemizedlist>
 
-    <para>Various solutions to these problems have been proposed and
-      implemented.  One way some users safeguard themselves against such
-      issues is through the use of multiple, and sometimes redundant,
-      disks.  In addition to supporting various cards and controllers
-      for hardware RAID systems, the base FreeBSD system includes the
-      Vinum Volume Manager, a block device driver that implements
-      virtual disk drives.  <emphasis>Vinum</emphasis> is a
-      so-called <emphasis>Volume Manager</emphasis>, a virtual disk
-      driver that addresses these three problems.  Vinum provides more
-      flexibility, performance, and reliability than traditional disk
-      storage, and implements RAID-0, RAID-1, and RAID-5 models both
-      individually and in combination.</para>
+    <para>Ezekre a probl&eacute;m&aacute;kra javasoltak &eacute;s meg is
+      val&oacute;s&iacute;tottak sz&aacute;mos megold&aacute;st.  A
+      felhaszn&aacute;l&oacute;k egy r&eacute;sze
+      &aacute;ltal&aacute;ban &uacute;gy v&eacute;dekezik ellen&uuml;k,
+      hogy t&ouml;bb, gyakran redund&aacute;nsan t&aacute;rol&oacute;
+      lemezt haszn&aacute;l.  A k&uuml;l&ouml;nf&eacute;le
+      k&aacute;rty&aacute;k &eacute;s hardveres
+      RAID-vez&eacute;rl&#245;k t&aacute;mogat&aacute;sa mellett a &os;
+      alaprendszer&eacute;ben megtal&aacute;lhat&oacute; egy blokkos
+      eszk&ouml;zmeghajt&oacute;k&eacute;nt a Vinum
+      k&ouml;tetkezel&#245; is, amellyel virtu&aacute;lis
+      lemezmeghajt&oacute;kat lehet k&eacute;pezni.  A teh&aacute;t
+      <emphasis>Vinum</emphasis> egy olyan &uacute;n.
+      <emphasis>k&ouml;tetkezel&#245;</emphasis>, vagyis
+      virtu&aacute;lis lemezkezel&#245;, ami az eml&iacute;tett
+      h&aacute;rom probl&eacute;m&aacute;ra pr&oacute;b&aacute;l
+      megold&aacute;st adni.  A Vinum a hagyom&aacute;nyos lemezes
+      t&aacute;rol&aacute;sn&aacute;l j&oacute;val nagyobb
+      rugalmass&aacute;got, teljes&iacute;tm&eacute;nyt &eacute;s
+      megb&iacute;zhat&oacute;s&aacute;got biztos&iacute;t, valamint
+      ismeri a RAID-0, RAID-1 &eacute;s RAID-5 modelleket
+      k&uuml;l&ouml;n-k&uuml;l&ouml;n &eacute;s kombin&aacute;lva
+      is.</para>
 
-    <para>This chapter provides an overview of potential problems with
-      traditional disk storage, and an introduction to the Vinum Volume
-      Manager.</para>
+    <para>Ebben a fejezetben &ouml;sszefoglaljuk a hagyom&aacute;nyos
+      lemezes t&aacute;rol&aacute;s jellegzetes
+      h&aacute;tul&uuml;t&#245;it &eacute;s bemutatjuk a Vinum
+      k&ouml;tetkezel&#245;t.</para>
 
     <note>
-      <para>Starting with FreeBSD 5, Vinum has been rewritten in order
-	to fit into the GEOM architecture (<xref linkend="GEOM">),
-	retaining the original ideas, terminology, and on-disk
-	metadata.  This rewrite is called <emphasis>gvinum</emphasis>
-	(for <emphasis> GEOM vinum</emphasis>).  The following text
-	usually refers to <emphasis>Vinum</emphasis> as an abstract
-	name, regardless of the implementation variant.  Any command
-	invocations should now be done using
-	the <command>gvinum</command> command, and the name of the
-	kernel module has been changed
-	from <filename>vinum.ko</filename>
-	to <filename>geom_vinum.ko</filename>, and all device nodes
-	reside under <filename>/dev/gvinum</filename> instead
-	of <filename>/dev/vinum</filename>.  As of FreeBSD 6, the old
-	Vinum implementation is no longer available in the code
-	base.</para>
+      <para>A &os; 5-&ouml;s verzi&oacute;j&aacute;t&oacute;l kezdve a
+	Vinumot &uacute;jra&iacute;rt&aacute;k a GEOM-nak megfelel&#245;en
+	(<xref linkend="GEOM">), megtartva az eredeti
+	elgondol&aacute;sokat, elnevez&eacute;seket &eacute;s a lemezen
+	t&aacute;rolt metaadatok form&aacute;tum&aacute;t.  Ezt az
+	&uacute;jra&iacute;rt v&aacute;ltozatot nevezik
+	<emphasis>gvinum</emphasis>nak (<emphasis>GEOM
+	vinum</emphasis>).  A sz&ouml;vegben a
+	<emphasis>Vinum</emphasis>ra kiz&aacute;r&oacute;lag csak
+	&aacute;ltal&aacute;noss&aacute;gban hivatkozunk,
+	f&uuml;ggetlen&uuml;l az
+	implement&aacute;ci&oacute;j&aacute;t&oacute;l.  Most m&aacute;r
+	az &ouml;sszes parancsot a <command>gvinum</command>
+	haszn&aacute;lat&aacute;val kell kiadni, illetve a
+	hozz&aacute;tartoz&oacute; modul neve
+	<filename>vinum.ko</filename>-r&oacute;l
+	<filename>geom_vinum.ko</filename>-ra v&aacute;ltozott &eacute;s
+	a megfelel&#245; eszk&ouml;zle&iacute;r&oacute;k a
+	<filename>/dev/vinum</filename> k&ouml;nyvt&aacute;r helyett a
+	<filename>/dev/gvinum</filename> k&ouml;nyvt&aacute;rban
+	tal&aacute;lhat&oacute;ak.  A &os; 6.
+	verzi&oacute;j&aacute;t&oacute;l pedig a r&eacute;gi Vinum
+	implement&aacute;ci&oacute; t&ouml;bb&eacute; m&aacute;r nem is
+	r&eacute;sze az alaprendszernek.</para>
     </note>
-
   </sect1>
 
   <sect1 id="vinum-intro">
-    <title>Disks Are Too Small</title>
+    <title>Kicsik a lemezeink</title>
 
     <indexterm><primary>Vinum</primary></indexterm>
-    <indexterm><primary>RAID</primary>
-    <secondary>software</secondary></indexterm>
+    <indexterm>
+      <primary>RAID</primary>
+      <secondary>szoftver</secondary>
+    </indexterm>
 
-    <para>Disks are getting bigger, but so are data storage
-      requirements.  Often you will find you want a file system that
-      is bigger than the disks you have available.  Admittedly, this
-      problem is not as acute as it was ten years ago, but it still
-      exists.  Some systems have solved this by creating an abstract
-      device which stores its data on a number of disks.</para>
+    <para>A lemezek kapacit&aacute;sa ugyan n&ouml;vekszik, de
+      vel&uuml;k egy&uuml;tt a t&aacute;rig&eacute;nyek is.  Gyakran
+      &eacute;rezz&uuml;k emiatt &uacute;gy, hogy a
+      rendelkez&eacute;s&uuml;nkre &aacute;ll&oacute; lemezek
+      t&aacute;rkapacit&aacute;s&aacute;t meghalad&oacute;
+      &aacute;llom&aacute;nyrendszerre lenne
+      sz&uuml;ks&eacute;g&uuml;nk.  K&eacute;ts&eacute;gtelen, hogy ez a
+      probl&eacute;ma messze nem akkora jelent&#245;s&eacute;g&#251;,
+      mint mondjuk t&iacute;z &eacute;vvel ezel&#245;tt, de m&eacute;g
+      mindig fenn&aacute;ll.  Egyes rendszerek ezt &uacute;gy
+      hidalt&aacute;k &aacute;t, hogy l&eacute;trehoztak egy olyan
+      absztrakt eszk&ouml;zt, amely az adatokat t&ouml;bb lemezen
+      t&aacute;rolja el.</para>
   </sect1>
 
   <sect1 id="vinum-access-bottlenecks">
-    <title>Access Bottlenecks</title>
+    <title>Sz&#251;k keresztmetszetek a
+      lemezhozz&aacute;f&eacute;r&eacute;sben</title>
 
-    <para>Modern systems frequently need to access data in a highly
-      concurrent manner.  For example, large FTP or HTTP servers can
-      maintain thousands of concurrent sessions and have multiple
-      100&nbsp;Mbit/s connections to the outside world, well beyond
-      the sustained transfer rate of most disks.</para>
+    <para>Napjaink rendszerei szinte &aacute;lland&oacute;an egyszerre
+      t&ouml;bb adathoz is hozz&aacute; akarnak f&eacute;rni.
+      P&eacute;ld&aacute;ul egy nagy forgalm&uacute; FTP vagy HTTP
+      szerver t&ouml;bb 100&nbsp;Mbit/s sebess&eacute;g&#251;
+      kapcsolattal is csatlakozhat a vil&aacute;gh&aacute;l&oacute;hoz,
+      amelyeken kereszt&uuml;l p&aacute;rhuzamosan t&ouml;bbezernyi
+      adatforgalmat is folytathat, ami jelent&#245;sen meghaladja a
+      legt&ouml;bb lemez &aacute;tlagos &aacute;tviteli
+      sebess&eacute;g&eacute;t.</para>
 
-    <para>Current disk drives can transfer data sequentially at up to
-      70&nbsp;MB/s, but this value is of little importance in an
-      environment where many independent processes access a drive,
-      where they may achieve only a fraction of these values.  In such
-      cases it is more interesting to view the problem from the
-      viewpoint of the disk subsystem: the important parameter is the
-      load that a transfer places on the subsystem, in other words the
-      time for which a transfer occupies the drives involved in the
-      transfer.</para>
+    <para>A jelenleg kaphat&oacute; lemezek soros adat&aacute;tviteli
+      sebess&eacute;ge eg&eacute;szen 70&nbsp;MB/s-ig is terjedhet, de
+      ennek az &eacute;rt&eacute;knek kev&eacute;s a
+      jelent&#245;s&eacute;ge olyan k&ouml;rnyezetekben, ahol t&ouml;bb,
+      egym&aacute;st&oacute;l f&uuml;ggetlen&uuml;l fut&oacute; program
+      pr&oacute;b&aacute;l egyszerre hozz&aacute;f&eacute;rni, hiszen
+      ilyen esetekben csak a t&ouml;red&eacute;k&eacute;t k&eacute;pesek
+      el&eacute;rni.  Ilyenkor sokkal &eacute;rdekesebb a lemezt
+      kezel&#245; alrendszer szempontj&aacute;b&oacute;l n&eacute;zni a
+      probl&eacute;m&aacute;t: &iacute;gy az egyes adat&aacute;tviteli
+      k&eacute;r&eacute;sek terhel&eacute;se lesz a
+      meghat&aacute;roz&oacute; param&eacute;ter, vagyis az az id&#245;,
+      amit a k&eacute;r&eacute;s teljes&iacute;t&eacute;s&eacute;ben
+      &eacute;rintett meghajt&oacute;k elt&ouml;ltenek a
+      feldolgoz&aacute;ssal.</para>
 
-    <para>In any disk transfer, the drive must first position the
-      heads, wait for the first sector to pass under the read head,
-      and then perform the transfer.  These actions can be considered
-      to be atomic: it does not make any sense to interrupt
-      them.</para>
+    <para>B&aacute;rmelyik k&eacute;r&eacute;st is vessz&uuml;k, a
+      kiszolg&aacute;l&aacute;shoz a meghajt&oacute;nak el&#245;sz&ouml;r
+      a megfelel&#245; helyre kell t&aacute;jolnia az
+      &iacute;r&oacute;/olvas&oacute; fejeket, meg kell v&aacute;rni a
+      fej alatt elhalad&oacute; els&#245; szektort, majd
+      v&eacute;grehajtani a megfelel&#245; m&#251;veletet.  Ezek a
+      m&#251;veletek sz&eacute;tv&aacute;laszthatatlanok: semmi
+      &eacute;rtelme nincs megszak&iacute;tani &#245;ket.</para>
 
-    <para><anchor id="vinum-latency"> Consider a typical transfer of
-      about 10&nbsp;kB: the current generation of high-performance
-      disks can position the heads in an average of 3.5&nbsp;ms.  The
-      fastest drives spin at 15,000&nbsp;rpm, so the average
-      rotational latency (half a revolution) is 2&nbsp;ms.  At
-      70&nbsp;MB/s, the transfer itself takes about 150&nbsp;&mu;s,
-      almost nothing compared to the positioning time.  In such a
-      case, the effective transfer rate drops to a little over
-      1&nbsp;MB/s and is clearly highly dependent on the transfer
-      size.</para>
+    <para><anchor id="vinum-latency">Tekints&uuml;nk egy
+      &aacute;tlagosnak mondhat&oacute;, nagyj&aacute;b&oacute;l
+      10&nbsp;kB m&eacute;ret&#251; adat&aacute;tvitelt: a
+      leg&uacute;jabb nagyteljes&iacute;tm&eacute;ny&#251; lemezek
+      &aacute;tlagosan 3,5&nbsp;ms alatt k&eacute;pesek
+      pozicion&aacute;lni a fejeket.  A leggyorsabb lemezek
+      15&nbsp;000&nbsp; fordulatot tesznek meg percenk&eacute;nt (RPM),
+      &iacute;gy az &aacute;tlagos forg&aacute;si
+      k&eacute;sleltet&eacute;s (egy f&eacute;l fordulat ideje)
+      2&nbsp;ms.  70&nbsp;MB/s-os sebess&eacute;g mellett az
+      &aacute;tvitel maga megk&ouml;zel&iacute;t&#245;leg
+      150&nbsp;&mu;s, ami szinte elhanyagolhat&oacute; a
+      pozicion&aacute;l&aacute;s idej&eacute;hez k&eacute;pest.  Ilyen
+      esetekben a t&eacute;nyleges adat&aacute;tviteli sebess&eacute;g
+      1&nbsp;MB/s-n&eacute;l alig valamivel t&ouml;bbre esik vissza,
+      &eacute;s tiszt&aacute;n l&aacute;tszik, hogy er&#245;sen
+      f&uuml;gg az &aacute;tvitt adat
+      mennyis&eacute;g&eacute;t&#245;l.</para>
 
-    <para>The traditional and obvious solution to this bottleneck is
-      <quote>more spindles</quote>: rather than using one large disk,
-      it uses several smaller disks with the same aggregate storage
-      space.  Each disk is capable of positioning and transferring
-      independently, so the effective throughput increases by a factor
-      close to the number of disks used.
-    </para>
+    <para>A hagyom&aacute;nyos &eacute;s k&eacute;zenfekv&#245;
+      megold&aacute;sa ennek a probl&eacute;m&aacute;nak <quote>m&eacute;g
+      t&ouml;bb cs&eacute;ve</quote> haszn&aacute;lata: egyetlen nagy
+      lemez helyett alkalmazzunk t&ouml;bb kisebb, de azonos
+      t&aacute;rkapacit&aacute;s&uacute; lemezt.  Mindegyik lemez
+      k&eacute;pes egym&aacute;st&oacute;l f&uuml;ggetlen&uuml;l
+      mozgatni a fejeiket &eacute;s az adatokat, aminek
+      k&ouml;sz&ouml;nhet&#245;en a t&eacute;nyleges adat&aacute;tvitel
+      m&eacute;rt&eacute;ke nagyj&aacute;b&oacute;l a lemezek
+      sz&aacute;m&aacute;val ar&aacute;nyosan n&ouml;vekszik.</para>
 
-    <para>The exact throughput improvement is, of course, smaller than
-      the number of disks involved: although each drive is capable of
-      transferring in parallel, there is no way to ensure that the
-      requests are evenly distributed across the drives.  Inevitably
-      the load on one drive will be higher than on another.</para>
+    <para>Az adat&aacute;tvitelben bek&ouml;vetkez&#245; javul&aacute;s
+      pontos ar&aacute;nya term&eacute;szetesen kisebb, mint a lemezek
+      sz&aacute;ma: hab&aacute;r az egyes meghajt&oacute;k
+      k&eacute;pesek p&aacute;rhuzamosan mozgatni az adatokat, semmilyen
+      m&oacute;don garant&aacute;lhatjuk, hogy a k&eacute;r&eacute;sek
+      egyenletesen oszlanak el k&ouml;zt&uuml;k.  Emiatt szinte
+      elker&uuml;lhetetlen, hogy az egyik meghajt&oacute;t nagyobb
+      terhel&eacute;s &eacute;rje, mint a m&aacute;sikat.</para>
 
     <indexterm>
-      <primary>disk concatenation</primary>
+      <primary>lemezek &ouml;sszef&#251;z&eacute;se</primary>
     </indexterm>
     <indexterm>
       <primary>Vinum</primary>
-      <secondary>concatenation</secondary>
+      <secondary>&ouml;sszef&#251;z&eacute;s</secondary>
     </indexterm>
 
-    <para>The evenness of the load on the disks is strongly dependent
-      on the way the data is shared across the drives.  In the
-      following discussion, it is convenient to think of the disk
-      storage as a large number of data sectors which are addressable
-      by number, rather like the pages in a book.  The most obvious
-      method is to divide the virtual disk into groups of consecutive
-      sectors the size of the individual physical disks and store them
-      in this manner, rather like taking a large book and tearing it
-      into smaller sections.  This method is called
-      <emphasis>concatenation</emphasis> and has the advantage that
-      the disks are not required to have any specific size
-      relationships.  It works well when the access to the virtual
-      disk is spread evenly about its address space.  When access is
-      concentrated on a smaller area, the improvement is less marked.
-      <xref linkend="vinum-concat"> illustrates the sequence in which
-      storage units are allocated in a concatenated
-      organization.</para>
+    <para>A lemezekre es&#245; terhel&eacute;s egyenletess&eacute;ge
+      er&#245;sen f&uuml;gg att&oacute;l, hogyan osztjuk el az adatokat a
+      meghajt&oacute;k k&ouml;z&ouml;tt.  Az itt haszn&aacute;lt
+      t&aacute;rgyal&aacute;sm&oacute;dban a lemezen t&aacute;rolt
+      adatokat egy k&ouml;nyv oldalaik&eacute;nt &eacute;rdemes
+      elk&eacute;pzelni, vagyis rengeteg sz&aacute;m szerint
+      c&iacute;mezhet&#245; adatszektork&eacute;nt.  A virtu&aacute;lis
+      lemezt ennek megfelel&#245;en a legegyszer&#251;bben &uacute;gy
+      tudjuk felosztani az egym&aacute;s ut&aacute;n k&ouml;vetkez&#245;
+      f&uuml;ggetlen fizikai lemezek m&eacute;rete szerint &eacute;s
+      &iacute;gy haszn&aacute;lni, mintha egy nagy k&ouml;nyvet kisebb
+      r&eacute;szekre t&eacute;pt&uuml;nk volna.  Ezt a m&oacute;dszert
+      nevezik <emphasis>&ouml;sszef&#251;z&eacute;snek</emphasis>,
+      &eacute;s el&#245;nye, hogy a r&eacute;sztvev&#245; lemezeknek nem
+      kell azonos m&eacute;ret&#251;eknek lenni&uuml;k.  Ez a
+      megold&aacute;s remek&uuml;l m&#251;k&ouml;dik abban az esetben,
+      amikor a virtu&aacute;lis lemez hozz&aacute;f&eacute;r&eacute;sei
+      egyenletesen oszlanak el annak teljes ter&uuml;let&eacute;n.
+      Amikor viszont az el&eacute;r&eacute;s csak egy kisebb
+      ter&uuml;letre korl&aacute;toz&oacute;dik, kevesebb javul&aacute;s
+      tapasztalhat&oacute;.  A <xref linkend="vinum-concat"> mutatja be
+      lemezek egy ilyen &ouml;sszef&#251;z&ouml;tt
+      konfigur&aacute;ci&oacute;j&aacute;t.</para>
 
     <para>
       <figure id="vinum-concat">
-	<title>Concatenated Organization</title>
+	<title>Az &ouml;sszef&#251;z&ouml;tt szervez&eacute;si
+	  m&oacute;d</title>
 	<graphic fileref="vinum/vinum-concat">
       </figure>
     </para>
 
-    <indexterm>
-      <primary>disk striping</primary>
-    </indexterm>
-    <indexterm>
-      <primary>Vinum</primary>
-      <secondary>striping</secondary>
-    </indexterm>
-    <indexterm>
-      <primary>RAID</primary>
-    </indexterm>
+  <indexterm>
+    <primary>lemezcs&iacute;koz&aacute;s</primary>
+  </indexterm>
+  <indexterm>
+    <primary>Vinum</primary>
+    <secondary>cs&iacute;koz&aacute;s</secondary>
+  </indexterm>
+  <indexterm>
+    <primary>RAID</primary>
+  </indexterm>
 
-    <para>An alternative mapping is to divide the address space into
-      smaller, equal-sized components and store them sequentially on
-      different devices.  For example, the first 256 sectors may be
-      stored on the first disk, the next 256 sectors on the next disk
-      and so on.  After filling the last disk, the process repeats
-      until the disks are full.  This mapping is called
-      <emphasis>striping</emphasis> or <acronym>RAID-0</acronym>
+  <para>Feloszthatjuk a virtu&aacute;lis lemez&uuml;nket kisebb azonos
+    m&eacute;ret&#251; darabokra is, melyeket
+    k&uuml;l&ouml;nb&ouml;z&#245; eszk&ouml;z&ouml;k&ouml;n sorosan
+    t&aacute;rolunk el.  P&eacute;ld&aacute;ul az els&#245; 256 szektort
+    elt&aacute;roljuk az els&#245; lemezen, majd a k&ouml;vetkez&#245;
+    256 szektort a k&ouml;vetkez&#245; lemezen &eacute;s &iacute;gy
+    tov&aacute;bb.  Az utols&oacute; lemez kit&ouml;lt&eacute;se
+    ut&aacute;n az eg&eacute;sz folyamat ism&eacute;tl&#245;dik,
+    eg&eacute;szen az &ouml;sszes lemez megt&ouml;lt&eacute;s&eacute;ig.
+    Ezt a lek&eacute;pez&eacute;st
+    <emphasis>cs&iacute;koz&aacute;s</emphasis>nak vagy
+    <acronym>RAID-0</acronym>-nak nevezz&uuml;k.
 
-    <footnote>
-      <para><acronym>RAID</acronym> stands for <emphasis>Redundant
-      Array of Inexpensive Disks</emphasis> and offers various forms
-      of fault tolerance, though the latter term is somewhat
-      misleading: it provides no redundancy.</para> </footnote>.
+  <footnote>
+    <para>A <acronym>RAID</acronym> jelent&eacute;se: Olcs&oacute;
+      lemezek hibat&#251;r&#245; t&ouml;mbje (Redundant Array of
+      Inexpensive Disks).  K&uuml;l&ouml;nf&eacute;le
+      t&iacute;pus&uacute; hibat&#251;r&eacute;si megold&aacute;sokat
+      vonultat fel, hab&aacute;r az eredeti elnevez&eacute;s
+      f&eacute;lrevezet&#245; lehet, mivel redundanci&aacute;t nem
+      tartalmaz.</para>
+  </footnote>
 
-    Striping requires somewhat more effort to locate the data, and it
-    can cause additional I/O load where a transfer is spread over
-    multiple disks, but it can also provide a more constant load
-    across the disks.  <xref linkend="vinum-striped"> illustrates the
-    sequence in which storage units are allocated in a striped
-    organization.</para>
+    A cs&iacute;koz&aacute;s haszn&aacute;lata sor&aacute;n valamivel
+    bonyolultabb&aacute; v&aacute;lik az adatok
+    megtal&aacute;l&aacute;sa &eacute;s t&ouml;bbletmunk&aacute;t is
+    jelenthet olyan esetekben, amikor az adat&aacute;tvitel t&ouml;bb
+    lemezt is &eacute;rint, de ezzel egyid&#245;ben sokkal jobban
+    sz&eacute;tosztja a terhel&eacute;st a lemezek k&ouml;z&ouml;tt.  A
+    <xref linkend="vinum-striped"> mutatja be a lemezek cs&iacute;kozott
+    szervez&eacute;s&eacute;t.</para>
 
     <para>
       <figure id="vinum-striped">
-        <title>Striped Organization</title>
+	<title>A cs&iacute;kozott szervez&eacute;si m&oacute;d</title>
 	<graphic fileref="vinum/vinum-striped">
       </figure>
     </para>
   </sect1>
 
   <sect1 id="vinum-data-integrity">
-    <title>Data Integrity</title>
+    <title>Adatintegrit&aacute;s</title>
+
+    <para>A modern lemezhajt&oacute;k utols&oacute; fontos
+      probl&eacute;m&aacute;ja, hogy nem el&eacute;gg&eacute;
+      megb&iacute;zhat&oacute;ak.  Annak ellen&eacute;re, hogy a lemezek
+      ezen a t&eacute;ren rettenetesen sokat fejl&#245;dtek az
+      ut&oacute;bbi p&aacute;r &eacute;vben, egy szervernek m&eacute;g
+      mindig azon k&ouml;zponti r&eacute;szei, melyek a legink&aacute;bb
+      hajlamosak a meghib&aacute;sod&aacute;sra.  Amikor ez
+      bek&ouml;vetkezik, a hat&aacute;sa ak&aacute;r egy
+      katasztr&oacute;f&aacute;val is fel&eacute;rhet: a
+      s&eacute;r&uuml;lt lemezmeghajt&oacute;k cser&eacute;je &eacute;s
+      az adatok vissza&aacute;ll&iacute;t&aacute;sa napokat is
+      ig&eacute;nybe vehet.</para>
+
+    <indexterm>
+      <primary>lemezt&uuml;kr&ouml;z&eacute;s</primary>
+    </indexterm>
+    <indexterm>
+      <primary>Vinum</primary>
+      <secondary>t&uuml;kr&ouml;z&eacute;s</secondary>
+    </indexterm>
+    <indexterm>
+      <primary>RAID-1</primary>
+    </indexterm>
+
+    <para>Ennek a probl&eacute;m&aacute;nak a hagyom&aacute;nyos
+      megk&ouml;zel&iacute;t&eacute;se lenne a
+      <emphasis>t&uuml;kr&ouml;z&eacute;s</emphasis>, vagyis amikor
+      ugyanarr&oacute;l az adatr&oacute;l tartunk k&eacute;t
+      p&eacute;ld&aacute;nyt k&eacute;t elt&eacute;r&#245; fizikai
+      hardveren.  A <acronym>RAID</acronym>-szintek
+      bek&ouml;sz&ouml;nt&eacute;vel ezt a technik&aacute;t
+      <acronym>RAID level 1</acronym>-nak vagy
+      <acronym>RAID-1</acronym>-nek is nevezik.  Amikor &iacute;runk a
+      k&ouml;tetre, mindenhova &iacute;runk, az olvas&aacute;s pedig
+      b&aacute;rmelyik eszk&ouml;zr&#245;l elv&eacute;gezhet&#245;.
+      &Iacute;gy ha az egyik meghajt&oacute; t&ouml;nkremenne, egy
+      m&aacute;sikon m&eacute;g mindig megtal&aacute;lhat&oacute; az
+      &ouml;sszes adat.</para>
+
+    <para>A t&uuml;kr&ouml;z&eacute;s k&eacute;t probl&eacute;m&aacute;t
+      vet fel:</para>
 
-      <para>The final problem with current disks is that they are
-	unreliable.  Although disk drive reliability has increased
-	tremendously over the last few years, they are still the most
-	likely core component of a server to fail.  When they do, the
-	results can be catastrophic: replacing a failed disk drive and
-	restoring data to it can take days.</para>
+      <itemizedlist>
+	<listitem>
+	  <para>&Aacute;r.  Legal&aacute;bb k&eacute;tszer annyiba
+	    ker&uuml;l, mint a nem redund&aacute;nsan t&aacute;rol&oacute;
+	    megold&aacute;sok.</para>
+	</listitem>
 
-      <indexterm>
-	<primary>disk mirroring</primary>
-      </indexterm>
-      <indexterm>
-	<primary>Vinum</primary>
-	<secondary>mirroring</secondary>
-      </indexterm>
-      <indexterm>
-	<primary>RAID-1</primary>
-      </indexterm>
-      
-      <para>The traditional way to approach this problem has been
-	<emphasis>mirroring</emphasis>, keeping two copies of the data
-	on different physical hardware.  Since the advent of the
-	<acronym>RAID</acronym> levels, this technique has also been
-	called <acronym>RAID level 1</acronym> or
-	<acronym>RAID-1</acronym>.  Any write to the volume writes to
-	both locations; a read can be satisfied from either, so if one
-	drive fails, the data is still available on the other
-	drive.</para>
-    
-      <para>Mirroring has two problems:</para>
-    
-	<itemizedlist>
-	  <listitem>
-	    <para>The price.  It requires twice as much disk storage as
-	      a non-redundant solution.</para>
-	  </listitem>
+	<listitem>
+	  <para>Teljes&iacute;tm&eacute;nycs&ouml;kken&eacute;s.  Mivel
+	    az &iacute;r&aacute;st minden meghajt&oacute;n v&eacute;gre
+	    kell hajtani, legal&aacute;bb k&eacute;tszer annyi
+	    s&aacute;vsz&eacute;less&eacute;get is fel&eacute;meszt,
+	    mint a nem t&uuml;kr&ouml;z&ouml;tt k&ouml;tetek
+	    eset&eacute;n.  Az olvas&aacute;s viszont nem vesz&iacute;t
+	    a sebess&eacute;g&eacute;b&#245;l: s&#245;t, m&eacute;g
+	    gyorsabbnak is t&#251;nhet.</para>
+	</listitem>
+      </itemizedlist>
 
-	  <listitem>
-	    <para>The performance impact.  Writes must be performed to
-	      both drives, so they take up twice the bandwidth of a
-	      non-mirrored volume.  Reads do not suffer from a
-	      performance penalty: it even looks as if they are
-	      faster.</para>
-	  </listitem>
-	</itemizedlist>
+    <indexterm>
+      <primary>lemezparit&aacute;s</primary>
+    </indexterm>
+    <indexterm>
+      <primary>Vinum</primary>
+      <secondary>parit&aacute;s</secondary>
+    </indexterm>
+    <indexterm>
+      <primary>RAID-5</primary>
+    </indexterm>
 
-      <para><indexterm><primary>RAID-5</primary></indexterm>An
-	alternative solution is <emphasis>parity</emphasis>,
-	implemented in the <acronym>RAID</acronym> levels 2, 3, 4 and
-	5.  Of these, <acronym>RAID-5</acronym> is the most
-	interesting. As implemented in Vinum, it is a variant on a
-	striped organization which dedicates one block of each stripe
-	to parity of the other blocks. As implemented by Vinum, a
-	<acronym>RAID-5</acronym> plex is similar to a striped plex,
-	except that it implements <acronym>RAID-5</acronym> by
-	including a parity block in each stripe.  As required by
-	<acronym>RAID-5</acronym>, the location of this parity block
-	changes from one stripe to the next.  The numbers in the data
-	blocks indicate the relative block numbers.</para>
+    <para>Az adatintegrit&aacute;s meg&#245;rz&eacute;s&eacute;re egy
+      m&aacute;sik megold&aacute;s a <emphasis>parit&aacute;s</emphasis>
+      haszn&aacute;lata, melyet a 2, 3, 4 &eacute;s 5
+      <acronym>RAID</acronym>-szintek val&oacute;s&iacute;tanak meg.
+      Ezek k&ouml;z&uuml;l tal&aacute;n a <acronym>RAID-5</acronym> a
+      leg&eacute;rdekesebb.  A Vinumban egy olyan cs&iacute;kozott
+      szervez&eacute;si m&oacute;dk&eacute;nt
+      val&oacute;s&iacute;tott&aacute;k meg, ahol minden
+      cs&iacute;kb&oacute;l egy blokk az &ouml;sszes t&ouml;bbi
+      parit&aacute;si inform&aacute;ci&oacute;j&aacute;t tartalmazza.  A
+      <acronym>RAID-5</acronym> &aacute;ltal megval&oacute;s&iacute;tott
+      szervez&eacute;s hasonl&iacute;t a cs&iacute;koz&aacute;shoz,
+      azonban a <acronym>RAID-5</acronym>-ben mindegyik cs&iacute;k
+      tartalmaz egy parit&aacute;si inform&aacute;ci&oacute;t is.
+      Teh&aacute;t a Vinumban, ahogy azt <acronym>RAID-5</acronym> a
+      megk&ouml;veteli, a parit&aacute;st t&aacute;rol&oacute; blokkok
+      helye az egyik cs&iacute;kr&oacute;l a m&aacute;sikra
+      v&aacute;ltozik.  Az adatblokkokban tal&aacute;lhat&oacute;
+      sz&aacute;mok relat&iacute;v blokksz&aacute;mokat
+      jel&ouml;lnek.</para>
 
-      <para>
-	<figure id="vinum-raid5-org">
-	  <title>RAID-5 Organization</title>
-	  <graphic fileref="vinum/vinum-raid5-org">
-	</figure>
-      </para>
+    <para>
+      <figure id="vinum-raid5-org">
+	<title>A RAID-5 szervez&eacute;si m&oacute;d</title>
+	<graphic fileref="vinum/vinum-raid5-org">
+      </figure>
+    </para>
 
-      <para>Compared to mirroring, <acronym>RAID-5</acronym> has the
-	advantage of requiring significantly less storage space.  Read
-	access is similar to that of striped organizations, but write
-	access is significantly slower, approximately 25% of the read
-	performance.  If one drive fails, the array can continue to
-	operate in degraded mode: a read from one of the remaining
-	accessible drives continues normally, but a read from the
-	failed drive is recalculated from the corresponding block from
-	all the remaining drives.
-      </para>
+    <para>A <acronym>RAID-5</acronym>-nek a t&uuml;kr&ouml;z&eacute;shez
+      k&eacute;pest megvan az el&#245;nye, hogy jelent&#245;sen kevesebb
+      t&aacute;rhelyet ig&eacute;nyel.  Az olvas&aacute;s hasonl&oacute;
+      a cs&iacute;kozott szervez&eacute;sek&eacute;hez, azonban az
+      &iacute;r&aacute;s j&oacute;val lassabb, k&ouml;zel 25%-a az
+      olvas&aacute;s sebess&eacute;g&eacute;nek.  Az egyik
+      meghajt&oacute; meghib&aacute;sod&aacute;sa eset&eacute;n a
+      t&ouml;mb cs&ouml;kkentett m&oacute;dban m&eacute;g k&eacute;pes
+      folytatni a m&#251;k&ouml;d&eacute;st: a fennmarad&oacute;
+      meghajt&oacute;kr&oacute;l tov&aacute;bbra is a megszokott
+      m&oacute;don lehet olvasni, viszont a s&eacute;r&uuml;lt
+      meghajt&oacute;r&oacute;l olvasott adatokat folyamatosan
+      jav&iacute;tani kell a t&ouml;bbir&#245;l sz&aacute;rmaz&oacute;
+      seg&eacute;dinform&aacute;ci&oacute;k szerint.</para>
   </sect1>
 
   <sect1 id="vinum-objects">
-    <title>Vinum Objects</title>
-      <para>In order to address these problems, Vinum implements a four-level
-	hierarchy of objects:</para>
+    <title>A Vinum objektumai</title>
+
+    <para>A t&aacute;rgyalt probl&eacute;m&aacute;k
+      orvosl&aacute;s&aacute;ra a Vinumban egy n&eacute;gyszint&#251;
+      objektumhierarchi&aacute;t alak&iacute;tottak ki:</para>
+
+    <itemizedlist>
+      <listitem>
+	<para>A legjobban &eacute;szlelhet&#245; objektum a
+	  virtu&aacute;lis lemez, amelyet
+	  <emphasis>k&ouml;tet</emphasis>nek (volume) nevez&uuml;nk.  Ez
+	  a k&ouml;tet l&eacute;nyeg&eacute;ben ugyanazokkal a
+	  tulajdons&aacute;gokkal rendelkezik, mint egy &unix;-os
+	  lemezmeghajt&oacute;, hab&aacute;r akadnak finomabb
+	  k&uuml;l&ouml;nbs&eacute;gek.  M&eacute;rete korl&aacute;tlan
+	  lehet.</para>
+      </listitem>
 
-      <itemizedlist>
-	<listitem>
-	  <para>The most visible object is the virtual disk, called a
-	    <emphasis>volume</emphasis>.  Volumes have essentially the same
-	    properties as a &unix; disk drive, though there are some minor
-	    differences.  They have no size limitations.</para>
-	</listitem>
+      <listitem>
+	<para>A k&ouml;tetek <emphasis>erek</emphasis>b&#245;l (plex)
+	  &aacute;llnak, melyek a k&ouml;tet teljes ter&uuml;let&eacute;t
+	  k&eacute;pviselik.  Enn&eacute;lfogva a hierarchia ezen
+	  szintje ny&uacute;jtja a redundanci&aacute;t.  Az ereket
+	  legegyszer&#251;bben a t&uuml;kr&ouml;z&ouml;tt t&ouml;mbben
+	  helyet foglal&oacute; lemezekk&eacute;nt tudjuk
+	  elk&eacute;pzelni, melyek ugyanazt az adatot
+	  tartalmazz&aacute;k.</para>
+      </listitem>
 
-	<listitem>
-	  <para>Volumes are composed of <emphasis>plexes</emphasis>,
-	    each of which represent the total address space of a
-	    volume.  This level in the hierarchy thus provides
-	    redundancy.  Think of plexes as individual disks in a
-	    mirrored array, each containing the same data.</para>
-	</listitem>
+      <listitem>
+	<para>Mivel a Vinum a &unix; lemezes t&aacute;rol&aacute;st
+	  megval&oacute;s&iacute;t&oacute; alrendszer&eacute;ben
+	  helyezkedik el, a t&ouml;bblemezes erek
+	  fel&eacute;p&iacute;t&eacute;s&eacute;hez
+	  haszn&aacute;lhatn&aacute;nk a &unix;-os
+	  part&iacute;ci&oacute;kat, azonban ehhez a feladathoz nem
+	  el&eacute;gg&eacute; rugalmasak, mivel a &unix;-os lemezek
+	  csak korl&aacute;tozott sz&aacute;m&uacute;
+	  part&iacute;ci&oacute;t tartalmazhatnak.  A Vinum ehelyett
+	  <emphasis>allemez</emphasis>nek (subdisk) nevezett folytonos
+	  ter&uuml;letekre osztja fel az egyes &unix;-os
+	  part&iacute;ci&oacute;kat (a
+	  <emphasis>meghajt&oacute;</emphasis>kat), melyeket
+	  azt&aacute;n az erek l&eacute;trehoz&aacute;s&aacute;ra
+	  haszn&aacute;l fel.</para>
+      </listitem>
 
-	<listitem>
-	  <para>Since Vinum exists within the &unix; disk storage
-	    framework, it would be possible to use &unix;
-	    partitions as the building block for multi-disk plexes,
-	    but in fact this turns out to be too inflexible:
-	    &unix; disks can have only a limited number of
-	    partitions.  Instead, Vinum subdivides a single
-	    &unix; partition (the <emphasis>drive</emphasis>)
-	    into contiguous areas called
-	    <emphasis>subdisks</emphasis>, which it uses as building
-	    blocks for plexes.</para>
-	</listitem>
-      
-	<listitem>
-	  <para>Subdisks reside on Vinum <emphasis>drives</emphasis>,
-	    currently &unix; partitions.  Vinum drives can
-	    contain any number of subdisks.  With the exception of a
-	    small area at the beginning of the drive, which is used
-	    for storing configuration and state information, the
-	    entire drive is available for data storage.</para>
-	</listitem>
-      </itemizedlist>
+      <listitem>
+	<para>A Vinum &aacute;ltal l&eacute;trehozott
+	  <emphasis>meghajt&oacute;</emphasis>kon (drive) lev&#245;
+	  allemezek lesznek val&oacute;di &unix;-os
+	  part&iacute;ci&oacute;k.  A Vinum-meghajt&oacute;k
+	  tetsz&#245;leges sz&aacute;m&uacute; allemezt tartalmazhatnak.
+	  Eltekintve a meghajt&oacute; elej&eacute;n
+	  tal&aacute;lhat&oacute; apr&oacute; ter&uuml;lett&#245;l,
+	  melyen a be&aacute;ll&iacute;t&aacute;sokra &eacute;s az
+	  &aacute;llapotra vonatkoz&oacute; inform&aacute;ci&oacute;k
+	  t&aacute;rol&oacute;dnak, az eg&eacute;sz meghajt&oacute;
+	  felhaszn&aacute;lhat&oacute; adatok
+	  t&aacute;rol&aacute;s&aacute;ra.</para>
+      </listitem>
+    </itemizedlist>
 
-      <para>The following sections describe the way these objects provide the
-	functionality required of Vinum.</para>
+    <para>A most k&ouml;vetkez&#245; szakaszokban ismertetj&uuml;k, hogy
+      ezek az objektumok milyen m&oacute;don szolg&aacute;ltatj&aacute;k a
+      Vinum r&eacute;sz&eacute;r&#245;l elv&aacute;rt
+      funkci&oacute;kat.</para>
 
     <sect2>
-      <title>Volume Size Considerations</title>
+      <title>A k&ouml;tetek m&eacute;rete</title>
+      <para>Az erek k&eacute;pesek a Vinum
+	konfigur&aacute;ci&oacute;j&aacute;ban tal&aacute;lhat&oacute;
+	t&ouml;bb k&uuml;l&ouml;nb&ouml;z&#245; meghajt&oacute;n
+	elhelyezked&#245; allemezt is nyal&aacute;bolni.  Ennek
+	k&ouml;vetkezm&eacute;nyek&eacute;ppen az egyes meghajt&oacute;k
+	m&eacute;rete nem korl&aacute;tozza az erek
+	m&eacute;ret&eacute;t, emiatt a k&ouml;tet&eacute;t sem.</para>
+    </sect2>
 
-      <para>Plexes can include multiple subdisks spread over all
-	drives in the Vinum configuration.  As a result, the size of
-	an individual drive does not limit the size of a plex, and
-	thus of a volume.</para>
-    </sect2>
-    
     <sect2>
-      <title>Redundant Data Storage</title>
-      <para>Vinum implements mirroring by attaching multiple plexes to
-	a volume.  Each plex is a representation of the data in a
-	volume.  A volume may contain between one and eight
-	plexes.</para>
+      <title>Redund&aacute;ns adatt&aacute;rol&aacute;s</title>
+
+      <para>A Vinum a t&uuml;kr&ouml;z&eacute;st t&ouml;bb &eacute;r
+	egyetlen k&ouml;tett&eacute; olvaszt&aacute;s&aacute;val hozza
+	l&eacute;tre.  Az erek mindegyike a k&ouml;teten
+	tal&aacute;lhat&oacute; adatokat k&eacute;pviseli.  Egy
+	k&ouml;tet legal&aacute;bb egy, legfeljebb nyolc eret
+	tartalmazhat.</para>
 
-      <para>Although a plex represents the complete data of a volume,
-	it is possible for parts of the representation to be
-	physically missing, either by design (by not defining a
-	subdisk for parts of the plex) or by accident (as a result of
-	the failure of a drive).  As long as at least one plex can
-	provide the data for the complete address range of the volume,
-	the volume is fully functional.</para>
+      <para>Hab&aacute;r egy &eacute;r egy k&ouml;tet teljes
+	adat&aacute;t &aacute;br&aacute;zolja, el&#245;fordulhat olyan
+	eset, hogy bizonyos r&eacute;szei hi&aacute;nyoznak fizikai,
+	kialak&iacute;t&aacute;si (nem t&aacute;rs&iacute;tottunk
+	allemezeket hozz&aacute;juk) okokb&oacute;l ad&oacute;doan vagy
+	v&eacute;letlen&uuml;l (a hozz&aacute;tartoz&oacute;
+	lemezter&uuml;letek s&eacute;r&uuml;ltek).  Am&iacute;g
+	legal&aacute;bb egy &eacute;r k&eacute;pes a k&ouml;tet teljes
+	tartalm&aacute;t szolg&aacute;ltatni, addig a k&ouml;tet
+	teljesen &eacute;pnek tekinthet&#245;.</para>
     </sect2>
-    
+
     <sect2>
-      <title>Performance Issues</title>
+      <title>Teljes&iacute;tm&eacute;ny</title>
 
-      <para>Vinum implements both concatenation and striping at the
-	plex level:</para>
+      <para>A Vinum az &ouml;sszef&#251;z&eacute;st &eacute;s a
+	cs&iacute;koz&aacute;st is egyar&aacute;nt
+	megval&oacute;s&iacute;tja az erek szintj&eacute;n:</para>
 
       <itemizedlist>
 	<listitem>
-	  <para>A <emphasis>concatenated plex</emphasis> uses the
-	    address space of each subdisk in turn.</para>
+	  <para>Az <emphasis>&ouml;sszef&#251;z&ouml;tt
+	    &eacute;r</emphasis> allemezek ter&uuml;leteib&#245;l
+	    &eacute;p&iacute;tkezik.</para>
 	</listitem>
 
 	<listitem>
-	  <para>A <emphasis>striped plex</emphasis> stripes the data
-	    across each subdisk.  The subdisks must all have the same
-	    size, and there must be at least two subdisks in order to
-	    distinguish it from a concatenated plex.</para>
+	  <para>A <emphasis>cs&iacute;kozott &eacute;r</emphasis>
+	    felosztja az adatokat az allemezek k&ouml;z&ouml;tt.  Az
+	    allemezek mindegyik&eacute;nek ugyanakkor&aacute;nak kell
+	    lennie, &eacute;s legal&aacute;bb k&eacute;t allemeznek
+	    lennie kell, hogy elt&eacute;rjen az
+	    &ouml;sszef&#251;z&ouml;tt &eacute;rt&#245;l.</para>
 	</listitem>
       </itemizedlist>
     </sect2>
 
     <sect2>
-      <title>Which Plex Organization?</title>
-      <para>The version of Vinum supplied with FreeBSD &rel.current; implements
-	two kinds of plex:</para>
-    
+      <title>Hogyan szervezz&uuml;k az ereket?</title>
+      <para>A &os; &rel.current; verzi&oacute;j&aacute;ban k&eacute;t
+	fajta erez&eacute;si megold&aacute;st tal&aacute;lhatunk:</para>
+
       <itemizedlist>
 	<listitem>
-	  <para>Concatenated plexes are the most flexible: they can
-	    contain any number of subdisks, and the subdisks may be of
-	    different length.  The plex may be extended by adding
-	    additional subdisks.  They require less
-	    <acronym>CPU</acronym> time than striped plexes, though
-	    the difference in <acronym>CPU</acronym> overhead is not
-	    measurable.  On the other hand, they are most susceptible
-	    to hot spots, where one disk is very active and others are
-	    idle.</para>
-        </listitem>
+	  <para>Az &ouml;sszef&#251;z&ouml;tt erek a legrugalmasabbak:
+	    tetsz&#245;leges sz&aacute;m&uacute; allemezt tartalmazhatnak,
+	    az allemezek m&eacute;rete pedig elt&eacute;rhet.  Az
+	    &eacute;r &uacute;jabb allemezek
+	    hozz&aacute;ad&aacute;s&aacute;val tov&aacute;bb
+	    b&#245;v&iacute;thet&#245;.  Kevesebb processzorid&#245;t
+	    ig&eacute;nyel, mint egy cs&iacute;kozott &eacute;r,
+	    hab&aacute;r a kett&#245; t&ouml;bbletk&ouml;lts&eacute;ge
+	    k&ouml;zti elt&eacute;r&eacute;s nem m&eacute;rhet&#245;.
+	    M&aacute;sr&eacute;szr&#245;l azonban nagyon
+	    &eacute;rz&eacute;kenyek a forgalmasabb pontokra, vagyis
+	    amikor az egyik lemez folyamatosan haszn&aacute;latban van,
+	    mik&ouml;zben a t&ouml;bbi &uuml;resen j&aacute;r.</para>
+	</listitem>
 
 	<listitem>
-	  <para>The greatest advantage of striped
-	    (<acronym>RAID-0</acronym>) plexes is that they reduce hot
-	    spots: by choosing an optimum sized stripe (about
-	    256&nbsp;kB), you can even out the load on the component
-	    drives.  The disadvantages of this approach are
-	    (fractionally) more complex code and restrictions on
-	    subdisks: they must be all the same size, and extending a
-	    plex by adding new subdisks is so complicated that Vinum
-	    currently does not implement it.  Vinum imposes an
-	    additional, trivial restriction: a striped plex must have
-	    at least two subdisks, since otherwise it is
-	    indistinguishable from a concatenated plex.</para>
+	  <para>A cs&iacute;kozott (<acronym>RAID-0</acronym>) erek
+	    legnagyobb el&#245;nye, hogy cs&ouml;kkentik a forgalmasabb
+	    pontok kialakul&aacute;s&aacute;t: a megfelel&#245;
+	    m&eacute;ret&#251; cs&iacute;ksz&eacute;less&eacute;g (ami
+	    kb.  256&nbsp;kB) v&aacute;laszt&aacute;s&aacute;val el
+	    tudjuk egyengetni a t&ouml;mbben dolgoz&oacute;
+	    meghajt&oacute;k terhel&eacute;s&eacute;t.  Ennek a
+	    megk&ouml;zel&iacute;t&eacute;snek a h&aacute;tr&aacute;nya
+	    (r&eacute;szben) a sokkal &ouml;sszetettebb k&oacute;d,
+	    valamint az allemezekre vonatkoz&oacute;
+	    megszor&iacute;t&aacute;s, amely szerint meg kell
+	    egyezni&uuml;k a m&eacute;ret&uuml;knek, illetve az
+	    &eacute;rhez annyira bonyolult &uacute;jabb allemezeket
+	    kapcsolni, hogy a Vinum jelenleg nem is k&eacute;pes
+	    r&aacute;.  Ezeken fel&uuml;l a Vinum m&eacute;g
+	    t&aacute;maszt egy trivi&aacute;lis ig&eacute;nyt is: a
+	    cs&iacute;kozott &eacute;rben legal&aacute;bb k&eacute;t
+	    allemeznek lennie kell, mivel m&aacute;sk&eacute;pp nem
+	    t&eacute;r el egy &ouml;sszef&#251;z&ouml;tt
+	    &eacute;rt&#245;l.</para>
 	</listitem>
       </itemizedlist>
-    
-      <para><xref linkend="vinum-comparison"> summarizes the advantages
-	and disadvantages of each plex organization.</para>
-    
+
+      <para>A <xref linkend="vinum-comparison"> foglalja &ouml;ssze az
+	egyes erez&eacute;sek el&#245;nyeit &eacute;s
+	h&aacute;tr&aacute;nyait.</para>
+
       <table id="vinum-comparison" frame="none">
-	<title>Vinum Plex Organizations</title>
+	<title>Vinum erez&eacute;sek</title>
 	<tgroup cols="5">
 	  <thead>
 	    <row>
-	      <entry>Plex type</entry>
-	  	<entry>Minimum subdisks</entry>
-	  	<entry>Can add subdisks</entry>
-	  	<entry>Must be equal size</entry>
-	  	<entry>Application</entry>
+	      <entry>Erez&eacute;s t&iacute;pusa</entry>
+	      <entry>Legkevesebb allemez</entry>
+	      <entry>B&#245;v&iacute;thet&#245;</entry>
+	      <entry>Megegyez&#245; m&eacute;ret</entry>
+	      <entry>Alkalmaz&aacute;s</entry>
 	    </row>
 	  </thead>
 
 	  <tbody>
 	    <row>
-	      <entry>concatenated</entry>
+	      <entry>&ouml;sszef&#251;z&ouml;tt</entry>
 	      <entry>1</entry>
-	      <entry>yes</entry>
-	      <entry>no</entry>
-	      <entry>Large data storage with maximum placement flexibility
-	        and moderate performance</entry>
+	      <entry>igen</entry>
+	      <entry>nem</entry>
+	      <entry>Sok adat t&aacute;rol&aacute;sa, ahol a
+		hangs&uacute;ly a rugalmass&aacute;gon &eacute;s a
+		m&eacute;rs&eacute;kelt teljes&iacute;tm&eacute;nyen
+		van.</entry>
 	    </row>
-	    
+
 	    <row>
-	      <entry>striped</entry>
+	      <entry>cs&iacute;kozott</entry>
 	      <entry>2</entry>
-	      <entry>no</entry>
-	      <entry>yes</entry>
-	      <entry>High performance in combination with highly concurrent
-		access</entry>
+	      <entry>nem</entry>
+	      <entry>igen</entry>
+	      <entry>Nagy teljes&iacute;tm&eacute;ny, nagy
+		mennyis&eacute;g&#251; egyidej&#251;
+		hozz&aacute;f&eacute;r&eacute;s mellett</entry>
 	    </row>
 	  </tbody>
 	</tgroup>
       </table>
     </sect2>
   </sect1>
-  
+
   <sect1 id="vinum-examples">
-    <title>Some Examples</title>
+    <title>P&eacute;ld&aacute;k</title>
+
+    <para>A Vinum a rendszerben ismert objektumokkal kapcsolatos
+      inform&aacute;ci&oacute;kat egy
+      <emphasis>konfigur&aacute;ci&oacute;s
+      adatb&aacute;zis</emphasis>ban tartja fenn.  Kezdetben a
+      felhaszn&aacute;l&oacute; egy vagy t&ouml;bb
+      konfigur&aacute;ci&oacute;s &aacute;llom&aacute;ny
+      seg&iacute;ts&eacute;g&eacute;vel hozza l&eacute;tre ezt az
+      adatb&aacute;zist a &man.gvinum.8; seg&eacute;dprogrammal.  A
+      Vinum ezt a konfigur&aacute;ci&oacute;s adatb&aacute;zist
+      bem&aacute;solja mindegyik ir&aacute;ny&iacute;t&aacute;sa alatt
+      &aacute;ll&oacute; slice-ba (melyek a Vinum
+      <emphasis>eszk&ouml;z</emphasis>nek h&iacute;v).  Az

>>> TRUNCATED FOR MAIL (1000 lines) <<<



Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?200711052258.lA5Mw9Rx037433>