insta360 8k

= ${addnum}" mm=$ (Expr ${addnum}/1024)echo "MM = ${mm}" If [${mm}-le 5];thenEcho-e "\033[31;43m warning \033[0m" >/DEV/PTS/4//terminal, printing in different colors,ElseEcho-e "\033[31;43m ok\033[0m" >/DEV/PTS/4//InterruptFi Timed execution:Crontab–e */1 * * * */xxx/xxx/xx/1.sh The script file runs every minute, Because the printout is output through the console, so print the console:/DEV/PTS/4, if you do not know, can be determined by the TTY command, because different conso

Statement: The material used in this column is written by the VIP students of the Kay Academy, who has the right to be anonymous and has the final right to interpret the article; The Edith Academy is designed to promote students to learn from each other on the basis of public notes.Decorative Flow:Introduction: There are two kinds of flow, one is to handle the flow of transport speed, one is to deal with the flow of specific products, one read a slower, to read a batch, and this batch can not be

your own DD command, block size is 8k# time DD if=/dev/sda2 of=/dev/null bs=8k count=83886088388608+0 Records in8388608+0 Records out68719476736 bytes (GB) copied, 516.547 seconds, 133 MB/sReal 8m36.926sUser 0m0.117s Sys0m55.216s #因为/dev/sda2 is a physical partition, reading it will generate Io,/dev/null is pseudo device, equivalent to black hole, ofThe IO is not generated by the device, so the IO for this

. Note, however, that a collection like HashMap is implemented as an array + linked list, so do not set the initial size to the size you estimate because it is almost 0 more likely to connect an object on a table. The initial size proposal is set to the power of N of 2, which can be set to new HashMap (128), and new HashMap (256) if it can be estimated to have 2000 elements. When copying large amounts of data, it is best to use the System.arraycopy () method [when the content length is greater t

;Fastcgi_cache_path/usr/local/nginx/fastcgi_cache Levels=1:2keys_zone=test:10minactive=5m;Fastcgi_connect_timeout 300;Fastcgi_send_timeout 300;Fastcgi_read_timeout 300;Fastcgi_buffer_size 4k;Fastcgi_buffers 8 4k;Fastcgi_busy_buffers_size 8k;Fastcgi_temp_file_write_size 8k;Fastcgi_cache TEST;Fastcgi_cache_valid 302 1h;Fastcgi_cache_valid 301 1d;Fastcgi_cache_valid any 1m;Fastcgi_cache_min_uses 1;Fastcgi_cach

compression instructions. The relevant instructions for gzip compression output are located in http{...} Between the two curly braces:gzip on;Gzip_min_length 1k;Gzip_buffers 4 16k;Gzip_http_version 1.1;Gzip_comp_level 2;Gzip_types text/plain application/x-javascript text/css application/xml;directive meaning: GZIP Instructions:Syntax: gzip On|offDefault value: gzip offInstructions are used to turn the Gzip module on or off. Gzip_buffers directive:Syntax: gzip_buffers number SizeDefault va

Official: A Simple NimSg[0]=0When X=8k+7 is Sg[x]=8k+8,When X=8k+8 is Sg[x]=8k+7,The rest of the time sg[x]=x; (k>=0)It can be found by the rules of the table, the mathematical induction method can be proven.The specific table is placed in the code, see the INIT function/* by*/#include#include#include#includeusing name

Nginx is a powerful HTTP server, but in the process of using the discovery, when encountering an extra long post request or get request, Nginx will return 413, 400, 414 Status code, this is because the request string length exceeds the Nginx default cache size or request string size, then we need to how to solve these problems? for a POST request, we can adjust the following two configuration items to resolve:client_body_buffer_sizesyntax: client_body_buffer_size the_sizedefault value:

for X, then for the first operation, the SG of the sub-situation is obvious. For the second operation, X is divided into a,b,c. A+b+c=x, then this operation produces three piles, three sub-situation, then the sum of this sub-game is SG (a) ^SG (b) ^SG (c). For example, when X=7, the second operation can produce a sub-game 1,2,4. So the situation with this sub-game is SG (1) ^SG (2) SG (4) = 7.According to the above, through recursion can be known:Sg[0]=0When X=

The linux3.5 kernel allocates a 8k or 4k kernel stack for all processes (including kernel processes and user processes) (which can be selected at the time of kernel compilation), and the stack memory allocated in the module code is in the kernel stack, and if the module code is to allocate memory in the heap, it will be allocated using Kmalloc or Vmalloc, which is something.The stack bottom of the kernel stack holds this thread_info, by acquiring the

0 1|0 0 40.1g 80.6g 2.03g 900 syslog:0.7% 0 1|0 1|0 111 K 587k 42 16:39:44 *0 1881 *0 *0 0 3|0 0 40.1g 80.6g 2.04g 894 syslog:0.7% 0 0|0 0|0 111 K 583k 42 16:39:45 *0 1927 *0 *0 0 1|0 0 40.1g 80.6g 2.06g 902 syslog:0.8% 0 0|0 0|0 113 K 598k 42 16:39:46 Insert Query Update delete getmore command flushes mapped vsize res faults locked db idx Miss% QR|QW Netin Netout Conn Time *0 1950 *0 *0 0 3|0 0 40.1g 80.6g 2.07g 912 syslog:0.6% 0 37|0 1|0 115 K 605k 42 16:39:47 *0 2086 *0 *0 0 1|0 0 40.1g

files. We can use the reverse proxy function of Nginx to keep only gz files.# can Google "Nginx gzip_static" to learn more Gzip_comp_level 4# Default value: 1 (recommended option is 4)# gzip Compression ratio/compression level, compression level 1-9, the higher the level of compression, of course, the longer the compression time (faster transmission but more CPU consumption). Gzip_buffers 4 16k# Default value: Gzip_buffers 4 4k/8k# Set the system t

, and for a specific IO type, the result may be slightly skewed because the speed may be different. By adding ": This option controls the number Sequential produce order of offset Identical produces the same offset [Parameter notes] ' Sequential ' is for random io only. Typically, FIO will generate a new random io after each IO. E.g.rw=randread:8, the seek will be executed after every 8 Io, not after each IO. Sequential Io is already in order and then set to ' sequential ' will not produce any

platforms. Orion is free, and users can download their media to Otn downloads link: http://www.oracle.com/technetwork/topics/index-089595.html. I/O calibration with Orion is also simple, including the following steps: (for example, Linux x86_64) 1. Download the Orion media, upload it on a server that requires I/O calibration, and then unzip it to get a binary file; 2. Create a file called Orion.lun , which records the name of the device (LUN) that requires I/O calibration, for example; /dev/sdb

block. It is no exaggeration to say that this parameter is the most important parameter for large amount of data processing. The larger the value of the parameter is, the more advantageous it is for large data processing. Limited to the operating system, NT4 can only be set to 8k,win2k maximum can be set to 16K. The maximum allowable value for Oracle itself is 64K. Forgot to say that the db_block_size should be set to a power of 2. For analytical d

disk, is the data block. Third, the data block is the size, when a database is established, the parameters are set. Note that in Oracle database parameters, only the data block size parameters are not modified after the library is built. the size of the data block, in a database can support multiple, but generally not much significance, will give management and debugging a certain burden. the size of the data block is an integer multiple of the operating system's data block, and Oracle defaults

(sp_configure): ultimately determined by Windows, does not guarantee that SQL Server uses the minimum amount of physical memory. 2. Max Server Memory (sp_configure): The data is placed in physical or buffered files and is determined by Windows. 3, set working set Size (sp_configure): do not use. 4. AWE enalbed (sp_configure): Meaningful for 32-bit systems. 5. Lock Pages in Memory (Enterprise Edition will automatically open): There is a chance to ensure the number of physical memory for SQL Serv

per second)Ignored errors:0 (0.00 per sec)-Total ignored errors total (number of ignores per second)Reconnects:0 (0.00 per sec)--number of re-connected (re-connected per second)General Statistics:Total time:120.2098s-time-consumingTotal number of events:22392--How many transactions occurredLatency (ms):min:105.91-Minimum time-consumingavg:160.86-Average time-consumingmax:850.77-the longest time-consuming95th percentile:223.34-over 95% average time-consumingsum:3601892.56Threads Fairness:Events

pigsty, each pigsty as a page for storing data. As a breeder, I suppose I'm buying and selling pig pigs, and I'm doing the pig right, but actually we're buying and selling on a pigsty, first of all, I'll number the pigsty, and then I'll buy the pigs in different numbers. So it could be understood that I kept the pig (data) in a pigsty (page) with different numbers (logically divided into 0-to-n sequential numbers), and I traded (I/O operations) The pigs, all from each pigsty.The size of the pag

a poolsubpage) is 8K, then Order-1 block:16k, order-2 block : K, until order-11 block:16mIn Poolchunk, use a int[4096] memorymap to describe all blocks, which is actually a binary tree:01 23 4 5 607 08 09 10 11 12 13 14Here, Memorymap[1] represents the order-11 block, which can actually be cut into two blocks of order-10, which are represented by memorymap[2] and memorymap[3], each of which consists of 3 parts: 31 17 16 2 1 00-1 bits: Flag bit, 00 (u