New pages

Jump to navigation Jump to search
New pages
Hide registered users | Show bots | Hide redirects
(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)
  • 01:54, 16 August 2023Write-back (hist | edit) ‎[2,012 bytes]Digimer (talk | contribs) (Created page with "{{header}} Write-back caching is a technology used in disk storage to improve performance. It works by providing an amount of high-speed, volatile memory used to store data destined for non-volatile storage on relatively slow hard drives or solid state drives. Write-back caching is particularly useful on traditional platter-based hard drives and RAID arrays where highly random write access is expected. It allows for writes to be buffered, masking the performance lo...")
  • 01:54, 16 August 2023IOPS (hist | edit) ‎[428 bytes]Digimer (talk | contribs) (Created page with "{{howto}} IOPS is an acronym for '''I'''nput/output '''O'''perations '''P'''er '''S'''econd. It is a measure of storage performance used to indicate how many read and how many write operations can be serviced, on average, per second. This measurement is particularly important for storage backing services with highly random reads and writes. To learn more: * [https://en.wikipedia.org/wiki/IOPS IOPS on Wikipedia] {{footer}}")
  • 01:50, 16 August 2023Split-brain (hist | edit) ‎[2,778 bytes]Digimer (talk | contribs) (Created page with "{{howto_header}} {{warning|1=A "split-brain" condition is a potentially catastrophic event in clustering.}} It is a particular risk in two-node clusters, but can occur in larger clusters if quorum is not honoured. This section uses language specific to two node split-brain conditions, but "node" could be replaced with "partition" to describe a subsection of a cluster and still be accurate. A split-brain is a state in which two nodes lose contact with one another a...")
  • 01:47, 16 August 2023Support (hist | edit) ‎[1,180 bytes]Digimer (talk | contribs) (Created page with "{{header}} = Community Support = If you need help with an Anvil! cluster, Striker, ScanCore or other AN!Tutorials please use one of the options below. == Mailing List == Support for the Anvil! platform can be found on the [http://clusterlabs.org/wiki/Mailing_lists Cluster Labs] mailing list. * [http://clusterlabs.org/mailman/listinfo/users Clusterlabs - Users] mailing list. == IRC Channel == Support can also be found on the [https://libera.chat/ Libera chat] [...")
  • 01:38, 16 August 2023Selecting Hardware For Your Anvil! (hist | edit) ‎[30,671 bytes]Digimer (talk | contribs) (Created page with "{{howto_header}} This guide's goal is to provide a high-level overview on how to match appropriate hardware for anticipated loads on your ''Anvil!'' platform. = System Requirements = To provide full stack redundancy, there are minimum system requirements. These are not performance requirements, but instead, minimum features and capabilities. = Foundation Pack = The foundation pack consists of redundant power...")
  • 01:24, 16 August 2023Gluster (hist | edit) ‎[161 bytes]Digimer (talk | contribs) (Created page with "{{header}} See: http://www.gluster.org/docs/index.php/GlusterFS<br /> See: http://www.gluster.org/<br /> See: http://en.wikipedia.org/wiki/GlusterFS {{footer}}")
  • 01:23, 16 August 2023DRBD (hist | edit) ‎[478 bytes]Digimer (talk | contribs) (Created page with "{{header}} '''D'''istributed '''R'''eplicated '''B'''lock '''D'''evice, [https://linbit.com/drbd/ DRBD], is a software product created by [LINBIT https://linbit.com/]. It is, at it's simplest description, a program that insures data on two storage devices, on different hosts, are identical. It differs from programs like gluster and ceph in that it's core focus is resiliency over scalability. In this way, it is a perfect fit for the Anvil! cluster. {{footer}}")
  • 23:54, 15 August 2023Generate 8bit dec to hex to bin chart.pl (hist | edit) ‎[1,380 bytes]Digimer (talk | contribs) (Created page with "{{howto_header}} A short script that generates a byte-length chart of decimal to hexadecimal to binary values. <source lang="perl"> #!/usr/bin/perl # Author: Madison Kelly; mkelly@alteeve.com # Date: Jun. 21, 2010 # License: GPLv2 # Be clean use strict; use warnings; # Headers print " Dec. | Hex. | Binary\n"; print "------+-------+-----------\n"; foreach my $dec (0..255) { # Convert the decimal to hexadecimal and pad the result with a lea...")
  • 23:52, 15 August 2023Base-10 (hist | edit) ‎[246 bytes]Digimer (talk | contribs) (Created page with "{{header}} Base-10 is a counting system made up of ten digits, '0' through '9'. This is in contrast with the binary 'Base-2' counting system that uses only two digits, 0 and 1. Base-10 is used to represent decimal values. {{footer}}")
  • 23:52, 15 August 2023Decimal (hist | edit) ‎[226 bytes]Digimer (talk | contribs) (Created page with "{{header}} In computing terms, 'decimal' refers to the Base-10 Roman counting system that uses ten base digits (0 through 9) to represent numerical values. It is the "normal" counting system in most societies. {{footer}}")
  • 23:51, 15 August 2023Hex (hist | edit) ‎[78 bytes]Digimer (talk | contribs) (Created page with "{{header}} The term '''Hex''' is a short form of Hexadecimal. {{footer}}")
  • 23:51, 15 August 2023ASCII (hist | edit) ‎[687 bytes]Digimer (talk | contribs) (Created page with "{{header}} ASCII is an acronym for 'American Standard Code for Information Interchange'. See: http://en.wikipedia.org/wiki/ASCII Operating systems that follow the ASCII standard will always interpret the lower 7 bits of a byte to represent the same value. These seven bits cover 128 possible combinations. Of those, the first 32 (0-31) and last entry (127) are not printable character, but instead are "control characters". These are codes used to control certain...")
  • 23:50, 15 August 2023Hexadecimal (hist | edit) ‎[8,623 bytes]Digimer (talk | contribs) (Created page with "{{header}} Hexadecimal is a method of representing 4 bits of data (known as a nibble) using a single ASCII character in the range from [0-9a-f]. = Use = Hexadecimal is very often used where a long binary string needs to presented to a human user. A good example would be the colour setting used on most modern graphics and web programs. Continuing this example, computer colours are often represented as six hexadecimal digits. Each pair, that is each byte, re...")
  • 23:50, 15 August 2023Nibble (hist | edit) ‎[102 bytes]Digimer (talk | contribs) (Created page with "{{header}} A nibble is 4 bits and can be represented as single hexadecimal value. {{footer}}")
  • 23:48, 15 August 2023Big Endian (hist | edit) ‎[534 bytes]Digimer (talk | contribs) (Created page with "{{header}} In a binary string, 'Big Endianess' indicated that the least significant bit is on the right side. A big-endian byte would thus be structured like this: 0 0 0 0 0 0 0 0 <- Binary string consisting of 8-bits. | | | | | | | \- 128 | | | | | | \--- 64 | | | | | \----- 32 | | | | \------- 16 | | | | | | | \----------- 8 | | \------------- 4 | \--------------- 2 \----------------- 1 ^...")
  • 23:47, 15 August 2023Endianess (hist | edit) ‎[336 bytes]Digimer (talk | contribs) (Created page with "{{header}} Endianess is the term used when describing the relative values of binary digits. There are two types; * Big Endian, where the least significant bit is the left-most value in the binary string. * Little Endian, where the least significant bit is the right-most value in the binary string. {{footer}}")
  • 23:47, 15 August 2023LSB (hist | edit) ‎[135 bytes]Digimer (talk | contribs) (Created page with "{{header}} 'LSB' is an acronym for 'Least Significant Bit' and is used to indicate 'Endianess' in a binary string. {{footer}}")
  • 23:45, 15 August 2023Little Endian (hist | edit) ‎[561 bytes]Digimer (talk | contribs) (Created page with "{{header}} In a binary string, 'Little Endianess' indicated that the least significant bit is on the left side of a binary string. A little-endian byte would thus be structured like this: 0 0 0 0 0 0 0 0 <- Binary string consisting of 8-bits. | | | | | | | \- 1 | | | | | | \--- 2 | | | | | \----- 4 | | | | \------- 8 | | | | | | | \----------- 16 | | \------------- 32 | \--------------- 64 \----------------- 128...")
  • 23:45, 15 August 2023Base-2 (hist | edit) ‎[226 bytes]Digimer (talk | contribs) (Created page with "{{header}} Base-2 is a counting system made up of only two digits, '0' and '1'. This is in contrast with the Roman 'Base-10' counting system that uses 10 digits, 0-9. Base-2 is used to represent binary values. {{footer}}")
  • 23:44, 15 August 2023Binary (hist | edit) ‎[2,662 bytes]Digimer (talk | contribs) (Created page with "{{header}} Binary is a form of counting that uses a base-2 system, a counting system with 2 digits. Binary uses only '0' and '1', which relates to an electrical 'low' (0) or 'high' (1) signal. This can conceptually be extended to 'false' (0) or 'true' (1). In computing, binary is used for all forms of calculations. Larger values are expressed as being 'X-bits', where 'X' is the number of 'BInary digiTs' used to create the value. Modern computers generally use multi...")
(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)