Visit The New, Modern Unix Linux Community

Linux and UNIX Man Pages

Test Your Knowledge in Computers #71
Difficulty: Easy
Linux, macOS, Android, iOS, Chrome OS, Orbis OS used on the PlayStation 4, whatever firmware is running on your router, all of these operating systems are generally referred to as a Unix-like operating system.
True or False?
Linux & Unix Commands - Search Man Pages

mkulzma(8) [freebsd man page]

MKULZMA(8)						    BSD System Manager's Manual 						MKULZMA(8)

mkulzma -- compress disk image for use with geom_uncompress(4) class SYNOPSIS
mkulzma [-v] [-o outfile] [-s cluster_size] infile DESCRIPTION
The mkulzma utility compresses a disk image file so that the geom_uncompress(4) class will be able to decompress the resulting image at run- time. This allows for a significant reduction of size of disk image at the expense of some CPU time required to decompress the data each time it is read. The mkulzma utility works in two phases: 1. An infile image is split into clusters; each cluster is compressed using liblzma. 2. The resulting set of compressed clusters along with headers that allow locating each individual cluster is written to the output file. The options are: -o outfile Name of the output file outfile. The default is to use the input name with the suffix .ulzma. -s cluster_size Split the image into clusters of cluster_size bytes, 16384 bytes by default. The cluster_size should be a multiple of 512 bytes. -v Display verbose messages. NOTES
The compression ratio largely depends on the cluster size used. For large cluster sizes (16K and higher), typical compression ratios are only 1-2% less than those achieved with lzma(1). However, it should be kept in mind that larger cluster sizes lead to higher overhead in the geom_uncompress(4) class, as the class has to decompress the whole cluster even if only a few bytes from that cluster have to be read. The mkulzma utility inserts a short shell script at the beginning of the generated image, which makes it possible to ``run'' the image just like any other shell script. The script tries to load the geom_uncompress(4) class if it is not loaded, configure the image as an md(4) disk device using mdconfig(8), and automatically mount it using mount_cd9660(8) on the mount point provided as the first argument to the script. EXIT STATUS
The mkulzma utility exits 0 on success, and >0 if an error occurs. SEE ALSO
lzma(1), geom(4), geom_uncompress(4), md(4), mdconfig(8), mount_cd9660(8) AUTHORS
Maxim Sobolev <> Aleksandr Rybalko <> BSD
March 17, 2006 BSD

Check Out this Related Man Page

CLUSTER(1)						      General Commands Manual							CLUSTER(1)

cluster - find clusters in a graph and augment the graph with this information. SYNOPSIS
cluster [-v?] [ -Ck ] [ -ck ] [ -o outfile ] [ files ] DESCRIPTION
cluster takes as input a graph in DOT format, finds node clusters and augments the graph with this information. The clusters are specified by the "cluster" attribute attached to nodes; cluster values are non-negative integers. cluster attempts to maximize the modularity of the clustering. If the edge attribute "weight" is defined, this will be used in computing the clustering. OPTIONS
The following options are supported: -Ck specifies a targeted number of clusters that should be generated. The specified number k is only a suggestion and may not be real- isable. If k == 0, the default, the number of clusters that approximately optimizes the modularity is returned. -ck specifies clustering method. If k == 0, the default, the modularity will be used. If k == 1 modularity quality will be used. -ooutfile Specifies that output should go into the file outfile. By default, stdout is used. -v Verbose mode. EXAMPLES
Applying cluster to the following graph, graph { 1--2 [weight=10.] 2--3 [weight=1] 3--4 [weight=10.] 4--5 [weight=10] 5--6 [weight=10] 3--6 [weight=0.1] 4--6 [weight=10.] } gives graph { node [cluster="-1"]; 1 [cluster=1]; 2 [cluster=1]; 3 [cluster=2]; 4 [cluster=2]; 5 [cluster=2]; 6 [cluster=2]; 1 -- 2 [weight="10."]; 2 -- 3 [weight=1]; 3 -- 4 [weight="10."]; 4 -- 5 [weight=10]; 5 -- 6 [weight=10]; 3 -- 6 [weight="0.1"]; 4 -- 6 [weight="10."]; } AUTHOR
Yifan Hu <> SEE ALSO
gvmap(1) Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment (2008), P10008. 3 March 2011 CLUSTER(1)

Featured Tech Videos