ls ( –sort option)

UNIX Command

$pwd
/home/jeffrin/shelter/symmel
$ls
beautifulwork  bugs-general  debian-howtos  firewall  language	ovlfose
books	       config-files  Docs	    https:    linux	README
$ls --sort=none
Docs   https:	      language	ovlfose       firewall	    README
books  debian-howtos  linux	bugs-general  config-files  beautifulwork
$ls --sort=time
firewall  Docs	  config-files	 beautifulwork	bugs-general  ovlfose
language  https:  debian-howtos  books		linux	      README
$ls --sort=size
beautifulwork  bugs-general  debian-howtos  firewall  language	ovlfose
books	       config-files  Docs	    https:    linux	README
$ls --sort=extension
beautifulwork  bugs-general  debian-howtos  firewall  language	ovlfose
books	       config-files  Docs	    https:    linux	README
$ls --sort=version
Docs	beautifulwork  bugs-general  debian-howtos  https:    linux
README	books	       config-files  firewall	    language  ovlfose
$


UNIX Explanation

--sort=WORD            sort by WORD instead of name: none -U,
                             extension -X, size -S, time -t, version -v


Theory Drop Related

Names of some sorting algorithms :

Bubble sort
Selection sort
Insertion sort
Shell sort
Comb sort
Merge sort
Heapsort
Quicksort
Counting sort
Bucket sort
Radix sort
Distribution sort
Timsort

CONNECTION

name of sorting algorithms which is knowledge related to sorting

Learning Models

Learning Model I
1. A UNIX Command
2. UNIX explanation
3. Related Source Code Exposition
4. Source Code Highlight
5. Featured Image.
6. Related Knowledge.

Learning Model II

1. A UNIX Command
2. UNIX Explanation
3. Theory Drop
4. Connection

Learning Model III

1. A UNIX Command
2. Explanation from Multiple Unices.

Learning Model IV

1. A UNIX Program
2. Tinkering With The Program
3. Develop/Learn Theories From It.

Learning Model Nine

1. Code Segment
2. Code Dissection
3. theory drop
4. Connection
Learning Model V

1. A UNIX Parameter.
2. Parameter Definition.
3. Parameter Code Internals.
4. Related From Research Paper.

Learning Model VI

1. Find/Encounter a UNIX Problem
2. A Software Hack.

Learning Model VII

1. Topic
2. Explanation
3. Get The Hang.

Learning Model VIII

1. File
2. Explanation
3. Get The Hang.

Theory Building

Theory Building I

1. Look for Command ,API or Parameter.
2. Do theory categorization.

Theory Building II

1. Look for Command ,API or Parameter.
2. Do Theory Categorization
3. Abstract Creation.

Theory Building III

1. Look for Command ,API or Parameter.
2. Theory Categorization
3. Abstract Creation
4. Theory Explanation .

Theory Building IV

1. Look for Command ,API or Parameter.
2. Theory Categorization
3. Abstract Creation
4. Theory Explanation .
5. Mathematical Modelling.

Theory Building V

1. Mathematical Modelling
2. New Theory Development.

A look into ls ( –block-size option ) in GNU

ABOUT ls –block-size

with -l, scale sizes by SIZE when printing them; e.g., '--block-size=M'

[bash light=”true”]
$ls
info man
$ls -l
total 8
drwxr-xr-x 2 jeffrin jeffrin 4096 Nov 22 20:39 info
drwxr-xr-x 3 jeffrin jeffrin 4096 Nov 22 18:51 man
$ls -l –block-size=B
ls: invalid –block-size argument `B’
$ls -l –block-size=KB
total 9kB
drwxr-xr-x 2 jeffrin jeffrin 5kB Nov 22 20:39 info
drwxr-xr-x 3 jeffrin jeffrin 5kB Nov 22 18:51 man
$ls -l –block-size=M
total 1M
drwxr-xr-x 2 jeffrin jeffrin 1M Nov 22 20:39 info
drwxr-xr-x 3 jeffrin jeffrin 1M Nov 22 18:51 man
$ls -l –block-size=MB
total 1MB
drwxr-xr-x 2 jeffrin jeffrin 1MB Nov 22 20:39 info
drwxr-xr-x 3 jeffrin jeffrin 1MB Nov 22 18:51 man
$ls -l –block-size=T
total 1T
drwxr-xr-x 2 jeffrin jeffrin 1T Nov 22 20:39 info
drwxr-xr-x 3 jeffrin jeffrin 1T Nov 22 18:51 man
$ls -l –block-size=K
total 8K
drwxr-xr-x 2 jeffrin jeffrin 4K Nov 22 20:39 info
drwxr-xr-x 3 jeffrin jeffrin 4K Nov 22 18:51 man
$ls
info man
$ls -l
total 8
drwxr-xr-x 2 jeffrin jeffrin 4096 Nov 22 20:39 info
drwxr-xr-x 3 jeffrin jeffrin 4096 Nov 22 18:51 man
$ls -l –block-size=10MB
total 1
drwxr-xr-x 2 jeffrin jeffrin 1 Nov 22 20:39 info
drwxr-xr-x 3 jeffrin jeffrin 1 Nov 22 18:51 man
$ls -l –block-size=5MB
total 1
drwxr-xr-x 2 jeffrin jeffrin 1 Nov 22 20:39 info
drwxr-xr-x 3 jeffrin jeffrin 1 Nov 22 18:51 man
$ls -l –block-size=5 MB
ls: cannot access MB: No such file or directory
$ls -l –block-size=MB 5
ls: cannot access 5: No such file or directory
$
[/bash]

KNOWLEDGE

In computing (specifically data transmission and data storage), a block, sometimes called a physical record, is a sequence of bytes or bits, usually containing some whole number of records, having a maximum length, a block size.[1] Data thus structured are said to be blocked. The process of putting data into blocks is called blocking, while deblocking is the process of extracting data from blocks. Blocked data is normally stored in a data buffer and read or written a whole block at a time. Blocking reduces the overhead and speeds up the handling of the data-stream.[2] For some devices, such as magnetic tape and CKD disk devices, blocking reduces the amount of external storage required for the data. Blocking is almost universally employed when storing data to 9-track magnetic tape, NAND flash memory, and rotating media such as floppy disks, hard disks, and optical discs.

LINK
http://man7.org/linux/man-pages/man1/ls.1.html
https://en.wikipedia.org/wiki/Block_(data_storage)
https://www.gnu.org/software/coreutils/manual/html_node/Block-size.html

tcp_sack – BOOLEAN

A UNIX Parameter

$cat tcp_sack
1
$

Parameter Definition

tcp_sack - BOOLEAN
 Enable select acknowledgments (SACKS).

SACK is  defined by  RFCs 2018, 2883,  and 3517 (see  Resources for
links  to  these  RFCs).  Plain  TCP  (in  other  words,  non-SACK)
acknowledgments  are  strictly  cumulative-an acknowledgment  of  N
means that  byte N and all  previous bytes have  been received. The
problem SACK is meant to address is this "all or nothing" nature of
the plain cumulative acknowledgment.   For instance, even if packet
2 (in  a sequence 0  to 9,  say) is the  only packet lost  during a
transfer, the  receiver can  issue a plain  ACK only for  packet 1,
because that  is the  highest packet it  received without a  gap. A
SACK receiver,  on the other  hand, can issue  an ACK for 1  plus a
SACK option for  packets 3 through 9. This  extra information helps
the sender determine that the losses are fairly minimal and that it
only needs to  retransmit a little bit of  data. Without this extra
information, it  would need to  retransmit much more data  and slow
down its  sending rate to  accommodate what looks like  a high-loss
network.

source: http://www.ibm.com/developerworks/linux/library/l-tcp-sack/index.html

Parameter Code Internals

/* If data was SACKed, tag it and see if we should send more data.
         * If data was DSACKed, see if we can undo a cwnd reduction.
         */
        if (TCP_SKB_CB(skb)->sacked) {
                flag |= tcp_sacktag_write_queue(sk, skb, prior_snd_una);
                newly_acked_sacked = tp->sacked_out - prior_sacked;
                tcp_fastretrans_alert(sk, pkts_acked, newly_acked_sacked,
                                      is_dupack, flag);
        }

Related From Research Paper

Abstract—The standard transmission control protocol(TCP)
can not distinguish between the random packet losses due to
high bit error rate(BER) and the packet losses due to network
congestion. TCP responds to all losses by invoking congestion
control and avoidance algorithms, resulting in degraded
end-to-end performance in wireless and lossy systems.
Meanwhile, the performance of TCP would be deteriorated
very much when it suffered from multi-packets losses in a
single transmission window. This paper propose a
modification over TCP_SACK version,we called it MSACK.
When MSACK cooperates with the router configured with
explicit congestion notification(ECN), it is capable of
distinguishing the wireless packet losses from the congestion
packet losses, and reacting accordingly. At the same time,
MSACK adopts available bandwidth algorithm at data sender
to optimize cwnd and ssthresh in order to avoiding lower slow
start threshold when packet losses occured. On the other hand,
the performance of MSACK in wireless environment can be
improved by taking  advantage of retransmission and
restoration in SACK version when TCP encountered
multi-packets losses in a single transmission window. The
simulations in this paper show that the modification of TCP is
feasible, and the performance of TCP is improved actually.

source :
Performance Research and Improvement of TCP_SACK in Wireless Environment
Hu Han
Physics & Electronics Information Technology Department
Xiangfan University
Xiangfan?China
xfhuhan@163.com